./Ultimate.py --spec /mnt/goblint-svcomp/goblint-bench/bench/concrat/properties/no-data-race.prp --file /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-tid.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for data races
Using default analysis
Version 2329fc70
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-tid.i -s /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 69e05f886a34f8c66061ddfaaaf6f31f7046aa524559c342b84144c174891a52
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2024-03-09 03:45:28,727 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2024-03-09 03:45:28,729 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2024-03-09 03:45:28,757 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2024-03-09 03:45:28,757 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2024-03-09 03:45:28,758 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2024-03-09 03:45:28,759 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2024-03-09 03:45:28,760 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2024-03-09 03:45:28,762 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2024-03-09 03:45:28,762 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2024-03-09 03:45:28,763 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2024-03-09 03:45:28,764 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2024-03-09 03:45:28,764 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2024-03-09 03:45:28,765 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2024-03-09 03:45:28,766 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2024-03-09 03:45:28,767 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2024-03-09 03:45:28,767 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2024-03-09 03:45:28,768 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2024-03-09 03:45:28,769 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2024-03-09 03:45:28,771 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2024-03-09 03:45:28,772 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2024-03-09 03:45:28,773 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2024-03-09 03:45:28,773 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2024-03-09 03:45:28,774 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2024-03-09 03:45:28,776 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2024-03-09 03:45:28,777 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2024-03-09 03:45:28,777 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2024-03-09 03:45:28,778 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2024-03-09 03:45:28,778 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2024-03-09 03:45:28,779 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2024-03-09 03:45:28,779 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2024-03-09 03:45:28,780 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2024-03-09 03:45:28,780 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2024-03-09 03:45:28,781 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2024-03-09 03:45:28,782 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2024-03-09 03:45:28,782 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2024-03-09 03:45:28,782 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2024-03-09 03:45:28,783 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2024-03-09 03:45:28,783 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2024-03-09 03:45:28,783 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2024-03-09 03:45:28,784 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2024-03-09 03:45:28,785 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-03-09 03:45:28,803 INFO  L113        SettingsManager]: Loading preferences was successful
[2024-03-09 03:45:28,803 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-09 03:45:28,804 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-09 03:45:28,804 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-09 03:45:28,804 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-09 03:45:28,804 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-09 03:45:28,805 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-09 03:45:28,805 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-09 03:45:28,805 INFO  L138        SettingsManager]:  * Use SBE=true
[2024-03-09 03:45:28,806 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-09 03:45:28,806 INFO  L138        SettingsManager]:  * sizeof long=4
[2024-03-09 03:45:28,806 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2024-03-09 03:45:28,806 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-09 03:45:28,806 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2024-03-09 03:45:28,806 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-09 03:45:28,807 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-09 03:45:28,807 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-09 03:45:28,807 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-09 03:45:28,807 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-09 03:45:28,807 INFO  L138        SettingsManager]:  * sizeof long double=12
[2024-03-09 03:45:28,807 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-09 03:45:28,807 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2024-03-09 03:45:28,808 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-09 03:45:28,808 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-09 03:45:28,808 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-09 03:45:28,808 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-09 03:45:28,808 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-03-09 03:45:28,808 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-09 03:45:28,809 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-09 03:45:28,809 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2024-03-09 03:45:28,809 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-09 03:45:28,809 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-09 03:45:28,809 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-09 03:45:28,810 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-09 03:45:28,810 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-09 03:45:28,810 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-09 03:45:28,810 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2024-03-09 03:45:28,810 INFO  L138        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 69e05f886a34f8c66061ddfaaaf6f31f7046aa524559c342b84144c174891a52
[2024-03-09 03:45:28,972 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-09 03:45:28,991 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-09 03:45:28,993 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-09 03:45:28,994 INFO  L271        PluginConnector]: Initializing CDTParser...
[2024-03-09 03:45:28,995 INFO  L275        PluginConnector]: CDTParser initialized
[2024-03-09 03:45:28,995 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-tid.i
[2024-03-09 03:45:30,026 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2024-03-09 03:45:30,229 INFO  L351              CDTParser]: Found 1 translation units.
[2024-03-09 03:45:30,229 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-tid.i
[2024-03-09 03:45:30,240 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/5ab954b7a/424f0050f1334ca89b46a5fcf37aa7eb/FLAG4758ff8a9
[2024-03-09 03:45:30,259 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/5ab954b7a/424f0050f1334ca89b46a5fcf37aa7eb
[2024-03-09 03:45:30,261 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-09 03:45:30,262 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-09 03:45:30,263 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-09 03:45:30,263 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-09 03:45:30,266 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-09 03:45:30,266 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 03:45:30" (1/1) ...
[2024-03-09 03:45:30,267 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@356c4f8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:45:30, skipping insertion in model container
[2024-03-09 03:45:30,268 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 03:45:30" (1/1) ...
[2024-03-09 03:45:30,273 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2024-03-09 03:45:30,311 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2024-03-09 03:45:30,432 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-03-09 03:45:30,620 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-03-09 03:45:30,626 INFO  L203         MainTranslator]: Completed pre-run
[2024-03-09 03:45:30,636 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-03-09 03:45:30,659 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-03-09 03:45:30,696 INFO  L208         MainTranslator]: Completed translation
[2024-03-09 03:45:30,696 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:45:30 WrapperNode
[2024-03-09 03:45:30,696 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-09 03:45:30,697 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-09 03:45:30,697 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-09 03:45:30,698 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-09 03:45:30,703 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:45:30" (1/1) ...
[2024-03-09 03:45:30,717 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:45:30" (1/1) ...
[2024-03-09 03:45:30,735 INFO  L138                Inliner]: procedures = 264, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74
[2024-03-09 03:45:30,736 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-09 03:45:30,736 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-09 03:45:30,737 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-09 03:45:30,737 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2024-03-09 03:45:30,744 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:45:30" (1/1) ...
[2024-03-09 03:45:30,744 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:45:30" (1/1) ...
[2024-03-09 03:45:30,748 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:45:30" (1/1) ...
[2024-03-09 03:45:30,748 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:45:30" (1/1) ...
[2024-03-09 03:45:30,757 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:45:30" (1/1) ...
[2024-03-09 03:45:30,761 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:45:30" (1/1) ...
[2024-03-09 03:45:30,762 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:45:30" (1/1) ...
[2024-03-09 03:45:30,763 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:45:30" (1/1) ...
[2024-03-09 03:45:30,766 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-09 03:45:30,767 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-09 03:45:30,767 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2024-03-09 03:45:30,767 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2024-03-09 03:45:30,768 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:45:30" (1/1) ...
[2024-03-09 03:45:30,773 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-03-09 03:45:30,781 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 03:45:30,791 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2024-03-09 03:45:30,794 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2024-03-09 03:45:30,823 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-03-09 03:45:30,824 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-09 03:45:30,824 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-09 03:45:30,824 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-09 03:45:30,824 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-03-09 03:45:30,824 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2024-03-09 03:45:30,824 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-09 03:45:30,825 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-09 03:45:30,825 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-09 03:45:30,825 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-09 03:45:30,826 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2024-03-09 03:45:30,954 INFO  L235             CfgBuilder]: Building ICFG
[2024-03-09 03:45:30,956 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-09 03:45:31,129 INFO  L276             CfgBuilder]: Performing block encoding
[2024-03-09 03:45:31,135 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-09 03:45:31,135 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-09 03:45:31,137 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 03:45:31 BoogieIcfgContainer
[2024-03-09 03:45:31,137 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-09 03:45:31,139 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-09 03:45:31,139 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2024-03-09 03:45:31,141 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2024-03-09 03:45:31,141 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 03:45:30" (1/3) ...
[2024-03-09 03:45:31,142 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39e5d5f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 03:45:31, skipping insertion in model container
[2024-03-09 03:45:31,142 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:45:30" (2/3) ...
[2024-03-09 03:45:31,142 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39e5d5f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 03:45:31, skipping insertion in model container
[2024-03-09 03:45:31,143 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 03:45:31" (3/3) ...
[2024-03-09 03:45:31,144 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-struct-tid.i
[2024-03-09 03:45:31,149 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-09 03:45:31,157 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-09 03:45:31,157 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations.
[2024-03-09 03:45:31,158 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-09 03:45:31,210 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-09 03:45:31,236 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 100 places, 101 transitions, 210 flow
[2024-03-09 03:45:31,276 INFO  L130       PetriNetUnfolder]: 6/142 cut-off events.
[2024-03-09 03:45:31,276 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-09 03:45:31,280 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 148 conditions, 142 events. 6/142 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 195 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 64. Up to 4 conditions per place. 
[2024-03-09 03:45:31,280 INFO  L82        GeneralOperation]: Start removeDead. Operand has 100 places, 101 transitions, 210 flow
[2024-03-09 03:45:31,284 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 100 places, 101 transitions, 210 flow
[2024-03-09 03:45:31,286 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-09 03:45:31,293 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 101 transitions, 210 flow
[2024-03-09 03:45:31,295 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 101 transitions, 210 flow
[2024-03-09 03:45:31,296 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 100 places, 101 transitions, 210 flow
[2024-03-09 03:45:31,318 INFO  L130       PetriNetUnfolder]: 6/142 cut-off events.
[2024-03-09 03:45:31,319 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-09 03:45:31,319 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 148 conditions, 142 events. 6/142 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 195 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 64. Up to 4 conditions per place. 
[2024-03-09 03:45:31,320 INFO  L119        LiptonReduction]: Number of co-enabled transitions 1410
[2024-03-09 03:45:33,344 INFO  L134        LiptonReduction]: Checked pairs total: 5330
[2024-03-09 03:45:33,344 INFO  L136        LiptonReduction]: Total number of compositions: 73
[2024-03-09 03:45:33,358 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 03:45:33,364 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@75295a5e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-09 03:45:33,364 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2024-03-09 03:45:33,367 INFO  L130       PetriNetUnfolder]: 0/13 cut-off events.
[2024-03-09 03:45:33,367 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-09 03:45:33,367 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:45:33,368 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:45:33,368 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-09 03:45:33,377 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:45:33,377 INFO  L85        PathProgramCache]: Analyzing trace with hash 487835987, now seen corresponding path program 1 times
[2024-03-09 03:45:33,384 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:45:33,385 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62615723]
[2024-03-09 03:45:33,385 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:45:33,385 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:45:33,482 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:45:33,779 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:45:33,780 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:45:33,780 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62615723]
[2024-03-09 03:45:33,781 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62615723] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 03:45:33,781 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 03:45:33,781 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 03:45:33,782 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082604705]
[2024-03-09 03:45:33,783 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 03:45:33,788 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 03:45:33,788 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:45:33,802 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 03:45:33,804 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 03:45:33,992 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 68 out of 174
[2024-03-09 03:45:33,995 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 84 flow. Second operand  has 6 states, 6 states have (on average 69.16666666666667) internal successors, (415), 6 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:33,995 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:45:33,995 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 174
[2024-03-09 03:45:33,996 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:45:34,216 INFO  L130       PetriNetUnfolder]: 135/357 cut-off events.
[2024-03-09 03:45:34,217 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-09 03:45:34,218 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 684 conditions, 357 events. 135/357 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1537 event pairs, 91 based on Foata normal form. 0/328 useless extension candidates. Maximal degree in co-relation 627. Up to 281 conditions per place. 
[2024-03-09 03:45:34,222 INFO  L137   encePairwiseOnDemand]: 163/174 looper letters, 37 selfloop transitions, 21 changer transitions 0/65 dead transitions.
[2024-03-09 03:45:34,222 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 65 transitions, 254 flow
[2024-03-09 03:45:34,223 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 03:45:34,226 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 03:45:34,234 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 468 transitions.
[2024-03-09 03:45:34,236 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4482758620689655
[2024-03-09 03:45:34,237 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 468 transitions.
[2024-03-09 03:45:34,237 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 468 transitions.
[2024-03-09 03:45:34,238 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:45:34,240 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 468 transitions.
[2024-03-09 03:45:34,244 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 78.0) internal successors, (468), 6 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:34,248 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 174.0) internal successors, (1218), 7 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:34,249 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 174.0) internal successors, (1218), 7 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:34,250 INFO  L175             Difference]: Start difference. First operand has 40 places, 38 transitions, 84 flow. Second operand 6 states and 468 transitions.
[2024-03-09 03:45:34,251 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 65 transitions, 254 flow
[2024-03-09 03:45:34,253 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 65 transitions, 254 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 03:45:34,255 INFO  L231             Difference]: Finished difference. Result has 48 places, 57 transitions, 206 flow
[2024-03-09 03:45:34,256 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=206, PETRI_PLACES=48, PETRI_TRANSITIONS=57}
[2024-03-09 03:45:34,259 INFO  L288   CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places.
[2024-03-09 03:45:34,259 INFO  L495      AbstractCegarLoop]: Abstraction has has 48 places, 57 transitions, 206 flow
[2024-03-09 03:45:34,259 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 69.16666666666667) internal successors, (415), 6 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:34,260 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:45:34,260 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:45:34,260 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-09 03:45:34,260 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-09 03:45:34,260 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:45:34,261 INFO  L85        PathProgramCache]: Analyzing trace with hash -679564975, now seen corresponding path program 1 times
[2024-03-09 03:45:34,261 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:45:34,261 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559953836]
[2024-03-09 03:45:34,261 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:45:34,261 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:45:34,271 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:45:34,307 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:45:34,307 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:45:34,307 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559953836]
[2024-03-09 03:45:34,307 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559953836] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 03:45:34,307 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 03:45:34,307 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-09 03:45:34,308 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074872273]
[2024-03-09 03:45:34,308 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 03:45:34,308 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-09 03:45:34,309 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:45:34,309 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-09 03:45:34,309 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-03-09 03:45:34,386 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 89 out of 174
[2024-03-09 03:45:34,386 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 57 transitions, 206 flow. Second operand  has 4 states, 4 states have (on average 89.75) internal successors, (359), 4 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:34,387 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:45:34,387 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 174
[2024-03-09 03:45:34,387 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:45:34,465 INFO  L130       PetriNetUnfolder]: 47/206 cut-off events.
[2024-03-09 03:45:34,465 INFO  L131       PetriNetUnfolder]: For 16/16 co-relation queries the response was YES.
[2024-03-09 03:45:34,466 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 426 conditions, 206 events. 47/206 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 825 event pairs, 4 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 361. Up to 53 conditions per place. 
[2024-03-09 03:45:34,467 INFO  L137   encePairwiseOnDemand]: 170/174 looper letters, 17 selfloop transitions, 2 changer transitions 2/64 dead transitions.
[2024-03-09 03:45:34,467 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 64 transitions, 265 flow
[2024-03-09 03:45:34,467 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-09 03:45:34,468 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-09 03:45:34,469 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 377 transitions.
[2024-03-09 03:45:34,470 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5416666666666666
[2024-03-09 03:45:34,470 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 377 transitions.
[2024-03-09 03:45:34,470 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 377 transitions.
[2024-03-09 03:45:34,470 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:45:34,470 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 377 transitions.
[2024-03-09 03:45:34,472 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 94.25) internal successors, (377), 4 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:34,474 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:34,474 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:34,474 INFO  L175             Difference]: Start difference. First operand has 48 places, 57 transitions, 206 flow. Second operand 4 states and 377 transitions.
[2024-03-09 03:45:34,474 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 64 transitions, 265 flow
[2024-03-09 03:45:34,476 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 64 transitions, 265 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 03:45:34,478 INFO  L231             Difference]: Finished difference. Result has 53 places, 57 transitions, 216 flow
[2024-03-09 03:45:34,478 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=216, PETRI_PLACES=53, PETRI_TRANSITIONS=57}
[2024-03-09 03:45:34,478 INFO  L288   CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places.
[2024-03-09 03:45:34,478 INFO  L495      AbstractCegarLoop]: Abstraction has has 53 places, 57 transitions, 216 flow
[2024-03-09 03:45:34,479 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 89.75) internal successors, (359), 4 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:34,479 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:45:34,479 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:45:34,479 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-09 03:45:34,479 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-09 03:45:34,480 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:45:34,480 INFO  L85        PathProgramCache]: Analyzing trace with hash -466678458, now seen corresponding path program 1 times
[2024-03-09 03:45:34,480 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:45:34,480 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404600089]
[2024-03-09 03:45:34,480 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:45:34,480 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:45:34,499 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:45:34,708 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:45:34,708 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:45:34,708 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404600089]
[2024-03-09 03:45:34,708 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404600089] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 03:45:34,708 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 03:45:34,708 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 03:45:34,708 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478673830]
[2024-03-09 03:45:34,709 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 03:45:34,709 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 03:45:34,709 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:45:34,709 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 03:45:34,710 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 03:45:34,855 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 71 out of 174
[2024-03-09 03:45:34,855 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 57 transitions, 216 flow. Second operand  has 6 states, 6 states have (on average 73.5) internal successors, (441), 6 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:34,855 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:45:34,856 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 174
[2024-03-09 03:45:34,856 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:45:35,205 INFO  L130       PetriNetUnfolder]: 193/496 cut-off events.
[2024-03-09 03:45:35,208 INFO  L131       PetriNetUnfolder]: For 122/126 co-relation queries the response was YES.
[2024-03-09 03:45:35,215 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1264 conditions, 496 events. 193/496 cut-off events. For 122/126 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2276 event pairs, 39 based on Foata normal form. 0/461 useless extension candidates. Maximal degree in co-relation 1182. Up to 339 conditions per place. 
[2024-03-09 03:45:35,217 INFO  L137   encePairwiseOnDemand]: 156/174 looper letters, 68 selfloop transitions, 57 changer transitions 5/137 dead transitions.
[2024-03-09 03:45:35,217 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 137 transitions, 714 flow
[2024-03-09 03:45:35,218 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 03:45:35,218 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 03:45:35,219 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 537 transitions.
[2024-03-09 03:45:35,219 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.514367816091954
[2024-03-09 03:45:35,219 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 537 transitions.
[2024-03-09 03:45:35,220 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 537 transitions.
[2024-03-09 03:45:35,220 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:45:35,220 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 537 transitions.
[2024-03-09 03:45:35,222 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:35,225 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 174.0) internal successors, (1218), 7 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:35,226 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 174.0) internal successors, (1218), 7 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:35,226 INFO  L175             Difference]: Start difference. First operand has 53 places, 57 transitions, 216 flow. Second operand 6 states and 537 transitions.
[2024-03-09 03:45:35,226 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 137 transitions, 714 flow
[2024-03-09 03:45:35,232 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 137 transitions, 692 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-03-09 03:45:35,234 INFO  L231             Difference]: Finished difference. Result has 58 places, 108 transitions, 562 flow
[2024-03-09 03:45:35,235 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=562, PETRI_PLACES=58, PETRI_TRANSITIONS=108}
[2024-03-09 03:45:35,236 INFO  L288   CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places.
[2024-03-09 03:45:35,236 INFO  L495      AbstractCegarLoop]: Abstraction has has 58 places, 108 transitions, 562 flow
[2024-03-09 03:45:35,236 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 73.5) internal successors, (441), 6 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:35,237 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:45:35,237 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:45:35,237 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-09 03:45:35,240 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-09 03:45:35,241 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:45:35,241 INFO  L85        PathProgramCache]: Analyzing trace with hash -1359997872, now seen corresponding path program 1 times
[2024-03-09 03:45:35,241 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:45:35,241 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102323827]
[2024-03-09 03:45:35,242 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:45:35,242 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:45:35,269 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:45:35,483 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-09 03:45:35,484 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:45:35,484 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102323827]
[2024-03-09 03:45:35,484 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102323827] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 03:45:35,484 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 03:45:35,484 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 03:45:35,485 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797240993]
[2024-03-09 03:45:35,485 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 03:45:35,485 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 03:45:35,485 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:45:35,486 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 03:45:35,486 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 03:45:35,650 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 72 out of 174
[2024-03-09 03:45:35,651 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 108 transitions, 562 flow. Second operand  has 6 states, 6 states have (on average 74.83333333333333) internal successors, (449), 6 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:35,652 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:45:35,652 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 174
[2024-03-09 03:45:35,652 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:45:35,815 INFO  L130       PetriNetUnfolder]: 200/559 cut-off events.
[2024-03-09 03:45:35,815 INFO  L131       PetriNetUnfolder]: For 328/340 co-relation queries the response was YES.
[2024-03-09 03:45:35,817 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1819 conditions, 559 events. 200/559 cut-off events. For 328/340 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2813 event pairs, 43 based on Foata normal form. 1/538 useless extension candidates. Maximal degree in co-relation 1725. Up to 369 conditions per place. 
[2024-03-09 03:45:35,820 INFO  L137   encePairwiseOnDemand]: 163/174 looper letters, 87 selfloop transitions, 29 changer transitions 0/142 dead transitions.
[2024-03-09 03:45:35,821 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 142 transitions, 968 flow
[2024-03-09 03:45:35,826 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 03:45:35,826 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 03:45:35,828 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 489 transitions.
[2024-03-09 03:45:35,829 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.46839080459770116
[2024-03-09 03:45:35,829 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 489 transitions.
[2024-03-09 03:45:35,829 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 489 transitions.
[2024-03-09 03:45:35,830 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:45:35,830 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 489 transitions.
[2024-03-09 03:45:35,832 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 81.5) internal successors, (489), 6 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:35,835 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 174.0) internal successors, (1218), 7 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:35,835 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 174.0) internal successors, (1218), 7 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:35,835 INFO  L175             Difference]: Start difference. First operand has 58 places, 108 transitions, 562 flow. Second operand 6 states and 489 transitions.
[2024-03-09 03:45:35,836 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 142 transitions, 968 flow
[2024-03-09 03:45:35,840 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 142 transitions, 932 flow, removed 18 selfloop flow, removed 0 redundant places.
[2024-03-09 03:45:35,842 INFO  L231             Difference]: Finished difference. Result has 67 places, 132 transitions, 808 flow
[2024-03-09 03:45:35,843 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=808, PETRI_PLACES=67, PETRI_TRANSITIONS=132}
[2024-03-09 03:45:35,843 INFO  L288   CegarLoopForPetriNet]: 40 programPoint places, 27 predicate places.
[2024-03-09 03:45:35,843 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 132 transitions, 808 flow
[2024-03-09 03:45:35,844 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 74.83333333333333) internal successors, (449), 6 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:35,844 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:45:35,844 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2024-03-09 03:45:35,844 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-09 03:45:35,844 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-09 03:45:35,845 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:45:35,845 INFO  L85        PathProgramCache]: Analyzing trace with hash 1040487698, now seen corresponding path program 1 times
[2024-03-09 03:45:35,845 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:45:35,845 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618550335]
[2024-03-09 03:45:35,845 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:45:35,846 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:45:35,867 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 03:45:35,867 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-09 03:45:35,877 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 03:45:35,892 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-09 03:45:35,893 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-09 03:45:35,893 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining)
[2024-03-09 03:45:35,895 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining)
[2024-03-09 03:45:35,895 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining)
[2024-03-09 03:45:35,895 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining)
[2024-03-09 03:45:35,895 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining)
[2024-03-09 03:45:35,896 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining)
[2024-03-09 03:45:35,896 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining)
[2024-03-09 03:45:35,896 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-03-09 03:45:35,896 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2024-03-09 03:45:35,898 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-09 03:45:35,898 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-09 03:45:35,912 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-03-09 03:45:35,914 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 118 places, 118 transitions, 254 flow
[2024-03-09 03:45:35,930 INFO  L130       PetriNetUnfolder]: 11/257 cut-off events.
[2024-03-09 03:45:35,930 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2024-03-09 03:45:35,931 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 271 conditions, 257 events. 11/257 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 465 event pairs, 0 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 144. Up to 8 conditions per place. 
[2024-03-09 03:45:35,931 INFO  L82        GeneralOperation]: Start removeDead. Operand has 118 places, 118 transitions, 254 flow
[2024-03-09 03:45:35,932 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 118 places, 118 transitions, 254 flow
[2024-03-09 03:45:35,932 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-09 03:45:35,932 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 118 transitions, 254 flow
[2024-03-09 03:45:35,932 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 118 transitions, 254 flow
[2024-03-09 03:45:35,933 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 118 places, 118 transitions, 254 flow
[2024-03-09 03:45:35,947 INFO  L130       PetriNetUnfolder]: 11/257 cut-off events.
[2024-03-09 03:45:35,947 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2024-03-09 03:45:35,948 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 271 conditions, 257 events. 11/257 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 465 event pairs, 0 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 144. Up to 8 conditions per place. 
[2024-03-09 03:45:35,950 INFO  L119        LiptonReduction]: Number of co-enabled transitions 4200
[2024-03-09 03:45:37,160 INFO  L134        LiptonReduction]: Checked pairs total: 15360
[2024-03-09 03:45:37,160 INFO  L136        LiptonReduction]: Total number of compositions: 71
[2024-03-09 03:45:37,162 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 03:45:37,163 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@75295a5e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-09 03:45:37,163 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2024-03-09 03:45:37,164 INFO  L130       PetriNetUnfolder]: 0/13 cut-off events.
[2024-03-09 03:45:37,165 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-09 03:45:37,165 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:45:37,165 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:45:37,165 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 03:45:37,165 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:45:37,165 INFO  L85        PathProgramCache]: Analyzing trace with hash 1302414291, now seen corresponding path program 1 times
[2024-03-09 03:45:37,166 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:45:37,166 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076713918]
[2024-03-09 03:45:37,166 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:45:37,166 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:45:37,174 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:45:37,283 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:45:37,283 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:45:37,284 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076713918]
[2024-03-09 03:45:37,284 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076713918] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 03:45:37,284 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 03:45:37,284 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 03:45:37,284 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55303451]
[2024-03-09 03:45:37,285 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 03:45:37,285 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 03:45:37,285 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:45:37,285 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 03:45:37,285 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 03:45:37,405 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 79 out of 189
[2024-03-09 03:45:37,406 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 54 transitions, 126 flow. Second operand  has 6 states, 6 states have (on average 80.16666666666667) internal successors, (481), 6 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:37,406 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:45:37,406 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 189
[2024-03-09 03:45:37,407 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:45:37,876 INFO  L130       PetriNetUnfolder]: 2299/4148 cut-off events.
[2024-03-09 03:45:37,877 INFO  L131       PetriNetUnfolder]: For 58/58 co-relation queries the response was YES.
[2024-03-09 03:45:37,880 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8060 conditions, 4148 events. 2299/4148 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 23079 event pairs, 1715 based on Foata normal form. 0/3932 useless extension candidates. Maximal degree in co-relation 1116. Up to 3508 conditions per place. 
[2024-03-09 03:45:37,890 INFO  L137   encePairwiseOnDemand]: 175/189 looper letters, 58 selfloop transitions, 37 changer transitions 0/106 dead transitions.
[2024-03-09 03:45:37,891 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 106 transitions, 420 flow
[2024-03-09 03:45:37,891 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 03:45:37,891 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 03:45:37,893 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 570 transitions.
[2024-03-09 03:45:37,893 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5026455026455027
[2024-03-09 03:45:37,893 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 570 transitions.
[2024-03-09 03:45:37,893 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 570 transitions.
[2024-03-09 03:45:37,894 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:45:37,894 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 570 transitions.
[2024-03-09 03:45:37,895 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 95.0) internal successors, (570), 6 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:37,896 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:37,897 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:37,897 INFO  L175             Difference]: Start difference. First operand has 57 places, 54 transitions, 126 flow. Second operand 6 states and 570 transitions.
[2024-03-09 03:45:37,897 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 106 transitions, 420 flow
[2024-03-09 03:45:37,898 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 106 transitions, 420 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 03:45:37,899 INFO  L231             Difference]: Finished difference. Result has 66 places, 90 transitions, 338 flow
[2024-03-09 03:45:37,899 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=338, PETRI_PLACES=66, PETRI_TRANSITIONS=90}
[2024-03-09 03:45:37,900 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places.
[2024-03-09 03:45:37,900 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 90 transitions, 338 flow
[2024-03-09 03:45:37,900 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 80.16666666666667) internal successors, (481), 6 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:37,900 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:45:37,900 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:45:37,900 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-03-09 03:45:37,901 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 03:45:37,901 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:45:37,901 INFO  L85        PathProgramCache]: Analyzing trace with hash -625452762, now seen corresponding path program 1 times
[2024-03-09 03:45:37,901 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:45:37,901 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950633144]
[2024-03-09 03:45:37,902 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:45:37,902 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:45:37,908 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:45:37,930 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:45:37,930 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:45:37,930 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950633144]
[2024-03-09 03:45:37,931 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950633144] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 03:45:37,931 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 03:45:37,931 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-09 03:45:37,931 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106122786]
[2024-03-09 03:45:37,931 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 03:45:37,931 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-09 03:45:37,932 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:45:37,932 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-09 03:45:37,932 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-03-09 03:45:37,987 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 105 out of 189
[2024-03-09 03:45:37,988 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 90 transitions, 338 flow. Second operand  has 4 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:37,988 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:45:37,988 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 189
[2024-03-09 03:45:37,988 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:45:38,172 INFO  L130       PetriNetUnfolder]: 837/2035 cut-off events.
[2024-03-09 03:45:38,172 INFO  L131       PetriNetUnfolder]: For 291/380 co-relation queries the response was YES.
[2024-03-09 03:45:38,182 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4502 conditions, 2035 events. 837/2035 cut-off events. For 291/380 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 13116 event pairs, 364 based on Foata normal form. 0/1881 useless extension candidates. Maximal degree in co-relation 2172. Up to 893 conditions per place. 
[2024-03-09 03:45:38,188 INFO  L137   encePairwiseOnDemand]: 185/189 looper letters, 34 selfloop transitions, 2 changer transitions 2/99 dead transitions.
[2024-03-09 03:45:38,188 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 99 transitions, 437 flow
[2024-03-09 03:45:38,189 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-09 03:45:38,189 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-09 03:45:38,190 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 450 transitions.
[2024-03-09 03:45:38,190 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5952380952380952
[2024-03-09 03:45:38,190 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 450 transitions.
[2024-03-09 03:45:38,191 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 450 transitions.
[2024-03-09 03:45:38,191 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:45:38,191 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 450 transitions.
[2024-03-09 03:45:38,192 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:38,193 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:38,193 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:38,193 INFO  L175             Difference]: Start difference. First operand has 66 places, 90 transitions, 338 flow. Second operand 4 states and 450 transitions.
[2024-03-09 03:45:38,194 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 99 transitions, 437 flow
[2024-03-09 03:45:38,195 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 99 transitions, 437 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 03:45:38,196 INFO  L231             Difference]: Finished difference. Result has 71 places, 91 transitions, 352 flow
[2024-03-09 03:45:38,197 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=352, PETRI_PLACES=71, PETRI_TRANSITIONS=91}
[2024-03-09 03:45:38,197 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 14 predicate places.
[2024-03-09 03:45:38,197 INFO  L495      AbstractCegarLoop]: Abstraction has has 71 places, 91 transitions, 352 flow
[2024-03-09 03:45:38,198 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:38,198 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:45:38,198 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:45:38,198 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-03-09 03:45:38,198 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 03:45:38,198 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:45:38,199 INFO  L85        PathProgramCache]: Analyzing trace with hash 111764048, now seen corresponding path program 1 times
[2024-03-09 03:45:38,199 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:45:38,199 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066190242]
[2024-03-09 03:45:38,199 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:45:38,199 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:45:38,209 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:45:38,346 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:45:38,347 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:45:38,347 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066190242]
[2024-03-09 03:45:38,347 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066190242] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 03:45:38,347 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 03:45:38,347 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 03:45:38,347 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566287496]
[2024-03-09 03:45:38,347 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 03:45:38,348 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 03:45:38,348 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:45:38,348 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 03:45:38,349 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 03:45:38,467 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 82 out of 189
[2024-03-09 03:45:38,468 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 91 transitions, 352 flow. Second operand  has 6 states, 6 states have (on average 84.5) internal successors, (507), 6 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:38,468 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:45:38,468 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 189
[2024-03-09 03:45:38,468 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:45:39,258 INFO  L130       PetriNetUnfolder]: 3649/6392 cut-off events.
[2024-03-09 03:45:39,259 INFO  L131       PetriNetUnfolder]: For 1465/1507 co-relation queries the response was YES.
[2024-03-09 03:45:39,266 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16449 conditions, 6392 events. 3649/6392 cut-off events. For 1465/1507 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 38314 event pairs, 1337 based on Foata normal form. 0/6112 useless extension candidates. Maximal degree in co-relation 16362. Up to 4916 conditions per place. 
[2024-03-09 03:45:39,285 INFO  L137   encePairwiseOnDemand]: 163/189 looper letters, 131 selfloop transitions, 89 changer transitions 0/231 dead transitions.
[2024-03-09 03:45:39,285 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 231 transitions, 1222 flow
[2024-03-09 03:45:39,286 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 03:45:39,286 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 03:45:39,287 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 672 transitions.
[2024-03-09 03:45:39,288 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5925925925925926
[2024-03-09 03:45:39,288 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 672 transitions.
[2024-03-09 03:45:39,288 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 672 transitions.
[2024-03-09 03:45:39,289 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:45:39,289 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 672 transitions.
[2024-03-09 03:45:39,290 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:39,291 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:39,292 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:39,292 INFO  L175             Difference]: Start difference. First operand has 71 places, 91 transitions, 352 flow. Second operand 6 states and 672 transitions.
[2024-03-09 03:45:39,292 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 231 transitions, 1222 flow
[2024-03-09 03:45:39,296 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 231 transitions, 1206 flow, removed 5 selfloop flow, removed 2 redundant places.
[2024-03-09 03:45:39,298 INFO  L231             Difference]: Finished difference. Result has 77 places, 175 transitions, 910 flow
[2024-03-09 03:45:39,298 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=910, PETRI_PLACES=77, PETRI_TRANSITIONS=175}
[2024-03-09 03:45:39,299 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 20 predicate places.
[2024-03-09 03:45:39,299 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 175 transitions, 910 flow
[2024-03-09 03:45:39,299 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 84.5) internal successors, (507), 6 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:39,299 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:45:39,299 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:45:39,299 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-03-09 03:45:39,300 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 03:45:39,300 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:45:39,300 INFO  L85        PathProgramCache]: Analyzing trace with hash 429862598, now seen corresponding path program 1 times
[2024-03-09 03:45:39,300 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:45:39,300 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611616028]
[2024-03-09 03:45:39,300 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:45:39,301 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:45:39,317 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:45:39,496 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-09 03:45:39,496 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:45:39,496 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611616028]
[2024-03-09 03:45:39,497 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611616028] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 03:45:39,497 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 03:45:39,497 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 03:45:39,497 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639112373]
[2024-03-09 03:45:39,497 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 03:45:39,498 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 03:45:39,498 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:45:39,498 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 03:45:39,498 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 03:45:39,644 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 189
[2024-03-09 03:45:39,645 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 175 transitions, 910 flow. Second operand  has 6 states, 6 states have (on average 85.83333333333333) internal successors, (515), 6 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:39,645 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:45:39,645 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 189
[2024-03-09 03:45:39,646 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:45:40,479 INFO  L130       PetriNetUnfolder]: 4200/7813 cut-off events.
[2024-03-09 03:45:40,480 INFO  L131       PetriNetUnfolder]: For 6314/6605 co-relation queries the response was YES.
[2024-03-09 03:45:40,520 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25533 conditions, 7813 events. 4200/7813 cut-off events. For 6314/6605 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 51358 event pairs, 1254 based on Foata normal form. 11/7506 useless extension candidates. Maximal degree in co-relation 20119. Up to 5834 conditions per place. 
[2024-03-09 03:45:40,546 INFO  L137   encePairwiseOnDemand]: 169/189 looper letters, 160 selfloop transitions, 69 changer transitions 0/258 dead transitions.
[2024-03-09 03:45:40,547 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 258 transitions, 1801 flow
[2024-03-09 03:45:40,547 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 03:45:40,547 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 03:45:40,548 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 604 transitions.
[2024-03-09 03:45:40,549 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5326278659611993
[2024-03-09 03:45:40,549 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 604 transitions.
[2024-03-09 03:45:40,549 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 604 transitions.
[2024-03-09 03:45:40,549 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:45:40,549 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 604 transitions.
[2024-03-09 03:45:40,551 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:40,552 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:40,552 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:40,552 INFO  L175             Difference]: Start difference. First operand has 77 places, 175 transitions, 910 flow. Second operand 6 states and 604 transitions.
[2024-03-09 03:45:40,552 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 258 transitions, 1801 flow
[2024-03-09 03:45:40,582 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 258 transitions, 1701 flow, removed 50 selfloop flow, removed 0 redundant places.
[2024-03-09 03:45:40,585 INFO  L231             Difference]: Finished difference. Result has 87 places, 235 transitions, 1526 flow
[2024-03-09 03:45:40,585 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1526, PETRI_PLACES=87, PETRI_TRANSITIONS=235}
[2024-03-09 03:45:40,586 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 30 predicate places.
[2024-03-09 03:45:40,586 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 235 transitions, 1526 flow
[2024-03-09 03:45:40,586 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 85.83333333333333) internal successors, (515), 6 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:40,586 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:45:40,586 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:45:40,587 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-03-09 03:45:40,587 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 03:45:40,587 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:45:40,587 INFO  L85        PathProgramCache]: Analyzing trace with hash 139843627, now seen corresponding path program 1 times
[2024-03-09 03:45:40,587 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:45:40,587 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872204106]
[2024-03-09 03:45:40,587 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:45:40,587 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:45:40,604 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:45:40,869 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:45:40,870 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:45:40,870 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872204106]
[2024-03-09 03:45:40,870 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872204106] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 03:45:40,870 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690473127]
[2024-03-09 03:45:40,870 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:45:40,870 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 03:45:40,870 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 03:45:40,871 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 03:45:40,881 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-03-09 03:45:40,982 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:45:40,989 INFO  L263         TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 31 conjunts are in the unsatisfiable core
[2024-03-09 03:45:40,994 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 03:45:41,029 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 03:45:41,049 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-09 03:45:41,050 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-09 03:45:41,071 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-03-09 03:45:41,081 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-09 03:45:41,097 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:45:41,097 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-03-09 03:45:41,115 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:45:41,116 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-03-09 03:45:41,152 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-03-09 03:45:41,162 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:45:41,162 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 03:45:41,253 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:45:41,254 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [690473127] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 03:45:41,254 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 03:45:41,254 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 10
[2024-03-09 03:45:41,254 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62505427]
[2024-03-09 03:45:41,254 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 03:45:41,255 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-03-09 03:45:41,255 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:45:41,255 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-03-09 03:45:41,255 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132
[2024-03-09 03:45:41,778 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 75 out of 189
[2024-03-09 03:45:41,779 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 235 transitions, 1526 flow. Second operand  has 12 states, 12 states have (on average 76.66666666666667) internal successors, (920), 12 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:41,779 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:45:41,779 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 189
[2024-03-09 03:45:41,779 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:45:43,429 INFO  L130       PetriNetUnfolder]: 4656/8486 cut-off events.
[2024-03-09 03:45:43,429 INFO  L131       PetriNetUnfolder]: For 12858/13065 co-relation queries the response was YES.
[2024-03-09 03:45:43,459 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32385 conditions, 8486 events. 4656/8486 cut-off events. For 12858/13065 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 54369 event pairs, 1418 based on Foata normal form. 0/8155 useless extension candidates. Maximal degree in co-relation 22502. Up to 6478 conditions per place. 
[2024-03-09 03:45:43,487 INFO  L137   encePairwiseOnDemand]: 169/189 looper letters, 329 selfloop transitions, 74 changer transitions 0/415 dead transitions.
[2024-03-09 03:45:43,487 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 415 transitions, 3510 flow
[2024-03-09 03:45:43,488 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-03-09 03:45:43,488 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-03-09 03:45:43,489 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 970 transitions.
[2024-03-09 03:45:43,490 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4665704665704666
[2024-03-09 03:45:43,490 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 970 transitions.
[2024-03-09 03:45:43,490 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 970 transitions.
[2024-03-09 03:45:43,490 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:45:43,490 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 970 transitions.
[2024-03-09 03:45:43,492 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 88.18181818181819) internal successors, (970), 11 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:43,494 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 189.0) internal successors, (2268), 12 states have internal predecessors, (2268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:43,495 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 189.0) internal successors, (2268), 12 states have internal predecessors, (2268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:43,495 INFO  L175             Difference]: Start difference. First operand has 87 places, 235 transitions, 1526 flow. Second operand 11 states and 970 transitions.
[2024-03-09 03:45:43,495 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 415 transitions, 3510 flow
[2024-03-09 03:45:43,542 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 415 transitions, 3274 flow, removed 118 selfloop flow, removed 0 redundant places.
[2024-03-09 03:45:43,545 INFO  L231             Difference]: Finished difference. Result has 104 places, 271 transitions, 1985 flow
[2024-03-09 03:45:43,546 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=1408, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1985, PETRI_PLACES=104, PETRI_TRANSITIONS=271}
[2024-03-09 03:45:43,546 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 47 predicate places.
[2024-03-09 03:45:43,546 INFO  L495      AbstractCegarLoop]: Abstraction has has 104 places, 271 transitions, 1985 flow
[2024-03-09 03:45:43,547 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 76.66666666666667) internal successors, (920), 12 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:43,547 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:45:43,547 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:45:43,553 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-03-09 03:45:43,751 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2024-03-09 03:45:43,752 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 03:45:43,753 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:45:43,753 INFO  L85        PathProgramCache]: Analyzing trace with hash -1640930147, now seen corresponding path program 1 times
[2024-03-09 03:45:43,753 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:45:43,753 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435287169]
[2024-03-09 03:45:43,754 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:45:43,754 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:45:43,775 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:45:44,032 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:45:44,033 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:45:44,033 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435287169]
[2024-03-09 03:45:44,033 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435287169] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 03:45:44,033 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8623674]
[2024-03-09 03:45:44,033 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:45:44,033 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 03:45:44,033 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 03:45:44,034 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 03:45:44,036 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-03-09 03:45:44,144 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:45:44,145 INFO  L263         TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 31 conjunts are in the unsatisfiable core
[2024-03-09 03:45:44,147 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 03:45:44,153 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 03:45:44,165 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-09 03:45:44,165 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-09 03:45:44,185 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9
[2024-03-09 03:45:44,194 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22
[2024-03-09 03:45:44,208 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:45:44,209 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34
[2024-03-09 03:45:44,226 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:45:44,227 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46
[2024-03-09 03:45:44,245 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39
[2024-03-09 03:45:44,255 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:45:44,255 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 03:45:44,294 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset))))) is different from false
[2024-03-09 03:45:44,319 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 c_threadThread1of2ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_456 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4))))))) is different from false
[2024-03-09 03:45:44,352 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 6)) (.cse2 (+ 7 c_threadThread1of2ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_456 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) .cse2)))))) is different from false
[2024-03-09 03:45:44,448 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-03-09 03:45:44,449 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [8623674] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 03:45:44,449 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 03:45:44,449 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13
[2024-03-09 03:45:44,449 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398129190]
[2024-03-09 03:45:44,449 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 03:45:44,450 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-03-09 03:45:44,450 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:45:44,450 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-03-09 03:45:44,450 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=102, Unknown=3, NotChecked=66, Total=210
[2024-03-09 03:45:44,570 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 58 out of 189
[2024-03-09 03:45:44,571 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 271 transitions, 1985 flow. Second operand  has 15 states, 15 states have (on average 59.6) internal successors, (894), 15 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:44,572 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:45:44,572 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 189
[2024-03-09 03:45:44,572 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:45:48,076 INFO  L130       PetriNetUnfolder]: 9090/15227 cut-off events.
[2024-03-09 03:45:48,076 INFO  L131       PetriNetUnfolder]: For 27537/27537 co-relation queries the response was YES.
[2024-03-09 03:45:48,183 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 61254 conditions, 15227 events. 9090/15227 cut-off events. For 27537/27537 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 98774 event pairs, 646 based on Foata normal form. 0/13842 useless extension candidates. Maximal degree in co-relation 54543. Up to 7856 conditions per place. 
[2024-03-09 03:45:48,240 INFO  L137   encePairwiseOnDemand]: 140/189 looper letters, 577 selfloop transitions, 535 changer transitions 9/1125 dead transitions.
[2024-03-09 03:45:48,241 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 1125 transitions, 9586 flow
[2024-03-09 03:45:48,241 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2024-03-09 03:45:48,241 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2024-03-09 03:45:48,244 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1636 transitions.
[2024-03-09 03:45:48,245 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.455583402951824
[2024-03-09 03:45:48,245 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1636 transitions.
[2024-03-09 03:45:48,245 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1636 transitions.
[2024-03-09 03:45:48,246 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:45:48,246 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1636 transitions.
[2024-03-09 03:45:48,249 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 86.10526315789474) internal successors, (1636), 19 states have internal predecessors, (1636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:48,254 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 189.0) internal successors, (3780), 20 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:48,254 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 189.0) internal successors, (3780), 20 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:48,254 INFO  L175             Difference]: Start difference. First operand has 104 places, 271 transitions, 1985 flow. Second operand 19 states and 1636 transitions.
[2024-03-09 03:45:48,255 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 1125 transitions, 9586 flow
[2024-03-09 03:45:48,414 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 1125 transitions, 9574 flow, removed 4 selfloop flow, removed 2 redundant places.
[2024-03-09 03:45:48,424 INFO  L231             Difference]: Finished difference. Result has 131 places, 774 transitions, 7846 flow
[2024-03-09 03:45:48,425 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=1974, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=7846, PETRI_PLACES=131, PETRI_TRANSITIONS=774}
[2024-03-09 03:45:48,425 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 74 predicate places.
[2024-03-09 03:45:48,426 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 774 transitions, 7846 flow
[2024-03-09 03:45:48,426 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 59.6) internal successors, (894), 15 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:48,426 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:45:48,426 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:45:48,431 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-03-09 03:45:48,630 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 03:45:48,631 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 03:45:48,632 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:45:48,632 INFO  L85        PathProgramCache]: Analyzing trace with hash -1523059378, now seen corresponding path program 1 times
[2024-03-09 03:45:48,633 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:45:48,633 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94463924]
[2024-03-09 03:45:48,634 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:45:48,634 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:45:48,657 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:45:48,921 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:45:48,923 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:45:48,923 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94463924]
[2024-03-09 03:45:48,923 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94463924] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 03:45:48,923 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783905378]
[2024-03-09 03:45:48,924 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:45:48,924 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 03:45:48,924 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 03:45:48,927 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 03:45:48,928 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-03-09 03:45:49,057 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:45:49,058 INFO  L263         TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 31 conjunts are in the unsatisfiable core
[2024-03-09 03:45:49,063 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 03:45:49,070 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 03:45:49,080 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-09 03:45:49,081 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-09 03:45:49,110 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-03-09 03:45:49,120 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-09 03:45:49,136 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:45:49,137 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-03-09 03:45:49,155 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:45:49,156 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-03-09 03:45:49,177 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-03-09 03:45:49,188 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:45:49,188 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 03:45:49,220 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_567 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_567) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)))) (forall ((v_ArrVal_567 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_567) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)))) (forall ((v_ArrVal_567 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_567) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)))) (forall ((v_ArrVal_567 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_567) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset|)))))) is different from false
[2024-03-09 03:45:49,245 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_567) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_567 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_567) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2))) (forall ((v_ArrVal_567 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_567) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)))) (forall ((v_ArrVal_567 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_567) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)))))))) is different from false
[2024-03-09 03:45:49,281 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) (.cse2 (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_567) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_567) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_567 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_567) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3))) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_567) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false
[2024-03-09 03:45:49,368 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2024-03-09 03:45:49,369 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783905378] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 03:45:49,369 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 03:45:49,369 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13
[2024-03-09 03:45:49,369 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967132323]
[2024-03-09 03:45:49,370 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 03:45:49,373 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-03-09 03:45:49,373 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:45:49,373 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-03-09 03:45:49,374 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=102, Unknown=3, NotChecked=66, Total=210
[2024-03-09 03:45:49,416 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 53 out of 189
[2024-03-09 03:45:49,417 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 774 transitions, 7846 flow. Second operand  has 15 states, 15 states have (on average 54.666666666666664) internal successors, (820), 15 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:49,417 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:45:49,418 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 189
[2024-03-09 03:45:49,418 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:45:53,397 INFO  L130       PetriNetUnfolder]: 10264/17123 cut-off events.
[2024-03-09 03:45:53,397 INFO  L131       PetriNetUnfolder]: For 71925/71939 co-relation queries the response was YES.
[2024-03-09 03:45:53,448 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 101197 conditions, 17123 events. 10264/17123 cut-off events. For 71925/71939 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 113656 event pairs, 762 based on Foata normal form. 12/16046 useless extension candidates. Maximal degree in co-relation 98875. Up to 12888 conditions per place. 
[2024-03-09 03:45:53,511 INFO  L137   encePairwiseOnDemand]: 164/189 looper letters, 905 selfloop transitions, 442 changer transitions 2/1353 dead transitions.
[2024-03-09 03:45:53,511 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 1353 transitions, 16637 flow
[2024-03-09 03:45:53,512 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2024-03-09 03:45:53,512 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2024-03-09 03:45:53,514 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 980 transitions.
[2024-03-09 03:45:53,514 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.37037037037037035
[2024-03-09 03:45:53,514 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 980 transitions.
[2024-03-09 03:45:53,514 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 980 transitions.
[2024-03-09 03:45:53,515 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:45:53,515 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 980 transitions.
[2024-03-09 03:45:53,517 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 15 states, 14 states have (on average 70.0) internal successors, (980), 14 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:53,519 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 15 states, 15 states have (on average 189.0) internal successors, (2835), 15 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:53,520 INFO  L81            ComplementDD]: Finished complementDD. Result  has 15 states, 15 states have (on average 189.0) internal successors, (2835), 15 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:53,520 INFO  L175             Difference]: Start difference. First operand has 131 places, 774 transitions, 7846 flow. Second operand 14 states and 980 transitions.
[2024-03-09 03:45:53,520 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 1353 transitions, 16637 flow
[2024-03-09 03:45:54,746 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 1353 transitions, 15990 flow, removed 319 selfloop flow, removed 4 redundant places.
[2024-03-09 03:45:54,761 INFO  L231             Difference]: Finished difference. Result has 147 places, 1110 transitions, 13243 flow
[2024-03-09 03:45:54,762 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=7553, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=774, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=165, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=537, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=13243, PETRI_PLACES=147, PETRI_TRANSITIONS=1110}
[2024-03-09 03:45:54,762 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 90 predicate places.
[2024-03-09 03:45:54,762 INFO  L495      AbstractCegarLoop]: Abstraction has has 147 places, 1110 transitions, 13243 flow
[2024-03-09 03:45:54,763 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 54.666666666666664) internal successors, (820), 15 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:54,763 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:45:54,763 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:45:54,768 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-03-09 03:45:54,963 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11
[2024-03-09 03:45:54,964 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 03:45:54,965 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:45:54,965 INFO  L85        PathProgramCache]: Analyzing trace with hash 140054782, now seen corresponding path program 2 times
[2024-03-09 03:45:54,966 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:45:54,966 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396860986]
[2024-03-09 03:45:54,966 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:45:54,967 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:45:54,984 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:45:55,240 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:45:55,241 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:45:55,241 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396860986]
[2024-03-09 03:45:55,241 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396860986] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 03:45:55,241 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750986666]
[2024-03-09 03:45:55,242 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-09 03:45:55,242 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 03:45:55,242 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 03:45:55,243 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 03:45:55,245 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-03-09 03:45:55,395 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-09 03:45:55,396 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 03:45:55,397 INFO  L263         TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 45 conjunts are in the unsatisfiable core
[2024-03-09 03:45:55,401 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 03:45:55,408 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 03:45:55,432 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-09 03:45:55,432 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-09 03:45:55,544 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-03-09 03:45:55,573 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-09 03:45:55,641 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2024-03-09 03:45:55,752 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2024-03-09 03:45:55,792 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2024-03-09 03:45:55,855 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 67
[2024-03-09 03:45:55,900 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:45:55,901 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 03:45:56,208 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 5)) (.cse3 (+ .cse4 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (and (forall ((v_ArrVal_679 Int) (v_ArrVal_675 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse2 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_675))) (store .cse2 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|))))) (store .cse0 c_threadThread1of2ForFork0_~t~0.base (store (select .cse0 c_threadThread1of2ForFork0_~t~0.base) .cse1 v_ArrVal_679))) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_679 Int) (v_ArrVal_675 (Array Int Int))) (= (select (select (let ((.cse5 (let ((.cse6 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_675))) (store .cse6 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|))))) (store .cse5 c_threadThread1of2ForFork0_~t~0.base (store (select .cse5 c_threadThread1of2ForFork0_~t~0.base) .cse1 v_ArrVal_679))) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_679 Int) (v_ArrVal_675 (Array Int Int))) (= (select (select (let ((.cse7 (let ((.cse8 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_675))) (store .cse8 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|))))) (store .cse7 c_threadThread1of2ForFork0_~t~0.base (store (select .cse7 c_threadThread1of2ForFork0_~t~0.base) .cse1 v_ArrVal_679))) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_679 Int) (v_ArrVal_675 (Array Int Int))) (= (select (select (let ((.cse9 (let ((.cse10 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_675))) (store .cse10 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|))))) (store .cse9 c_threadThread1of2ForFork0_~t~0.base (store (select .cse9 c_threadThread1of2ForFork0_~t~0.base) .cse1 v_ArrVal_679))) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet9#1|))))) is different from false
[2024-03-09 03:45:56,250 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (+ 5 |c_threadThread1of2ForFork0_#in~arg.offset|)) (.cse3 (+ .cse4 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (and (forall ((v_ArrVal_679 Int) (v_ArrVal_675 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse2 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_675))) (store .cse2 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|))))) (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread1of2ForFork0_#in~arg.base|) .cse1 v_ArrVal_679))) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_679 Int) (v_ArrVal_675 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (let ((.cse5 (let ((.cse6 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_675))) (store .cse6 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|))))) (store .cse5 |c_threadThread1of2ForFork0_#in~arg.base| (store (select .cse5 |c_threadThread1of2ForFork0_#in~arg.base|) .cse1 v_ArrVal_679))) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)))) (forall ((v_ArrVal_679 Int) (v_ArrVal_675 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (let ((.cse7 (let ((.cse8 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_675))) (store .cse8 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|))))) (store .cse7 |c_threadThread1of2ForFork0_#in~arg.base| (store (select .cse7 |c_threadThread1of2ForFork0_#in~arg.base|) .cse1 v_ArrVal_679))) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)))) (forall ((v_ArrVal_679 Int) (v_ArrVal_675 (Array Int Int))) (= (select (select (let ((.cse9 (let ((.cse10 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_675))) (store .cse10 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|))))) (store .cse9 |c_threadThread1of2ForFork0_#in~arg.base| (store (select .cse9 |c_threadThread1of2ForFork0_#in~arg.base|) .cse1 v_ArrVal_679))) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet9#1|))))) is different from false
[2024-03-09 03:45:56,274 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse5 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse8 (+ .cse5 |c_ULTIMATE.start_main_~ts~0#1.offset| 2))) (let ((.cse1 (+ 5 |c_threadThread1of2ForFork0_#in~arg.offset|)) (.cse3 (+ .cse5 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)) (.cse4 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse8 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_679 Int) (v_ArrVal_675 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (let ((.cse0 (let ((.cse2 (store .cse4 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_675))) (store .cse2 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|))))) (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread1of2ForFork0_#in~arg.base|) .cse1 v_ArrVal_679))) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse5 |c_ULTIMATE.start_main_~ts~0#1.offset|)))) (forall ((v_ArrVal_679 Int) (v_ArrVal_675 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (let ((.cse6 (let ((.cse7 (store .cse4 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_675))) (store .cse7 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|))))) (store .cse6 |c_threadThread1of2ForFork0_#in~arg.base| (store (select .cse6 |c_threadThread1of2ForFork0_#in~arg.base|) .cse1 v_ArrVal_679))) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse8))) (forall ((v_ArrVal_679 Int) (v_ArrVal_675 (Array Int Int))) (= (select (select (let ((.cse9 (let ((.cse10 (store .cse4 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_675))) (store .cse10 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|))))) (store .cse9 |c_threadThread1of2ForFork0_#in~arg.base| (store (select .cse9 |c_threadThread1of2ForFork0_#in~arg.base|) .cse1 v_ArrVal_679))) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_679 Int) (v_ArrVal_675 (Array Int Int))) (= (select (select (let ((.cse11 (let ((.cse12 (store .cse4 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_675))) (store .cse12 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|))))) (store .cse11 |c_threadThread1of2ForFork0_#in~arg.base| (store (select .cse11 |c_threadThread1of2ForFork0_#in~arg.base|) .cse1 v_ArrVal_679))) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse5 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false
[2024-03-09 03:45:56,301 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse5 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse13 (+ .cse5 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) (.cse10 (+ .cse5 |c_ULTIMATE.start_main_~ts~0#1.offset| 2))) (let ((.cse1 (+ 5 |c_threadThread1of2ForFork0_#in~arg.offset|)) (.cse3 (+ .cse5 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)) (.cse4 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse13 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse10 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_679 Int) (v_ArrVal_675 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse2 (store .cse4 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_675))) (store .cse2 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|))))) (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread1of2ForFork0_#in~arg.base|) .cse1 v_ArrVal_679))) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse5 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_679 Int) (v_ArrVal_675 (Array Int Int))) (= (select (select (let ((.cse6 (let ((.cse7 (store .cse4 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_675))) (store .cse7 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|))))) (store .cse6 |c_threadThread1of2ForFork0_#in~arg.base| (store (select .cse6 |c_threadThread1of2ForFork0_#in~arg.base|) .cse1 v_ArrVal_679))) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_679 Int) (v_ArrVal_675 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (let ((.cse8 (let ((.cse9 (store .cse4 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_675))) (store .cse9 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|))))) (store .cse8 |c_threadThread1of2ForFork0_#in~arg.base| (store (select .cse8 |c_threadThread1of2ForFork0_#in~arg.base|) .cse1 v_ArrVal_679))) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse10))) (forall ((v_ArrVal_679 Int) (v_ArrVal_675 (Array Int Int))) (= (select (select (let ((.cse11 (let ((.cse12 (store .cse4 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_675))) (store .cse12 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|))))) (store .cse11 |c_threadThread1of2ForFork0_#in~arg.base| (store (select .cse11 |c_threadThread1of2ForFork0_#in~arg.base|) .cse1 v_ArrVal_679))) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse13) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false
[2024-03-09 03:45:56,320 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:45:56,320 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 171 treesize of output 98
[2024-03-09 03:45:56,327 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 266 treesize of output 240
[2024-03-09 03:45:56,359 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:45:56,359 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 148 treesize of output 92
[2024-03-09 03:45:56,372 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 92
[2024-03-09 03:45:56,405 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 03:45:56,406 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 172 treesize of output 1
[2024-03-09 03:45:56,411 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 03:45:56,411 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 172 treesize of output 1
[2024-03-09 03:45:56,417 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 03:45:56,417 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 172 treesize of output 1
[2024-03-09 03:45:56,446 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2024-03-09 03:45:56,446 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [750986666] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 03:45:56,447 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 03:45:56,447 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 26
[2024-03-09 03:45:56,447 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083793896]
[2024-03-09 03:45:56,447 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 03:45:56,447 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 28 states
[2024-03-09 03:45:56,448 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:45:56,448 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2024-03-09 03:45:56,448 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=467, Unknown=4, NotChecked=188, Total=756
[2024-03-09 03:45:56,608 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 53 out of 189
[2024-03-09 03:45:56,609 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 1110 transitions, 13243 flow. Second operand  has 28 states, 28 states have (on average 54.67857142857143) internal successors, (1531), 28 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:56,609 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:45:56,609 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 189
[2024-03-09 03:45:56,609 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:46:12,205 INFO  L130       PetriNetUnfolder]: 10577/17727 cut-off events.
[2024-03-09 03:46:12,205 INFO  L131       PetriNetUnfolder]: For 110674/110680 co-relation queries the response was YES.
[2024-03-09 03:46:12,284 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 116210 conditions, 17727 events. 10577/17727 cut-off events. For 110674/110680 co-relation queries the response was YES. Maximal size of possible extension queue 580. Compared 117225 event pairs, 675 based on Foata normal form. 1/16617 useless extension candidates. Maximal degree in co-relation 113903. Up to 13932 conditions per place. 
[2024-03-09 03:46:12,360 INFO  L137   encePairwiseOnDemand]: 164/189 looper letters, 1297 selfloop transitions, 423 changer transitions 17/1741 dead transitions.
[2024-03-09 03:46:12,360 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 1741 transitions, 23553 flow
[2024-03-09 03:46:12,361 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 
[2024-03-09 03:46:12,361 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 24 states.
[2024-03-09 03:46:12,364 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1575 transitions.
[2024-03-09 03:46:12,364 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3472222222222222
[2024-03-09 03:46:12,365 INFO  L72            ComplementDD]: Start complementDD. Operand 24 states and 1575 transitions.
[2024-03-09 03:46:12,365 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 24 states and 1575 transitions.
[2024-03-09 03:46:12,365 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:46:12,366 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 1575 transitions.
[2024-03-09 03:46:12,368 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 25 states, 24 states have (on average 65.625) internal successors, (1575), 24 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:46:12,372 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 25 states, 25 states have (on average 189.0) internal successors, (4725), 25 states have internal predecessors, (4725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:46:12,373 INFO  L81            ComplementDD]: Finished complementDD. Result  has 25 states, 25 states have (on average 189.0) internal successors, (4725), 25 states have internal predecessors, (4725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:46:12,373 INFO  L175             Difference]: Start difference. First operand has 147 places, 1110 transitions, 13243 flow. Second operand 24 states and 1575 transitions.
[2024-03-09 03:46:12,373 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 1741 transitions, 23553 flow
[2024-03-09 03:46:14,014 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 1741 transitions, 22686 flow, removed 421 selfloop flow, removed 5 redundant places.
[2024-03-09 03:46:14,033 INFO  L231             Difference]: Finished difference. Result has 175 places, 1276 transitions, 16069 flow
[2024-03-09 03:46:14,034 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=12500, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=258, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=783, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=16069, PETRI_PLACES=175, PETRI_TRANSITIONS=1276}
[2024-03-09 03:46:14,035 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 118 predicate places.
[2024-03-09 03:46:14,035 INFO  L495      AbstractCegarLoop]: Abstraction has has 175 places, 1276 transitions, 16069 flow
[2024-03-09 03:46:14,036 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 28 states, 28 states have (on average 54.67857142857143) internal successors, (1531), 28 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:46:14,036 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:46:14,036 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:46:14,041 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-03-09 03:46:14,236 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 03:46:14,237 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 03:46:14,238 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:46:14,238 INFO  L85        PathProgramCache]: Analyzing trace with hash -753126009, now seen corresponding path program 2 times
[2024-03-09 03:46:14,238 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:46:14,239 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545987967]
[2024-03-09 03:46:14,239 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:46:14,239 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:46:14,266 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:46:14,535 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:46:14,535 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:46:14,535 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545987967]
[2024-03-09 03:46:14,535 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545987967] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 03:46:14,535 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414654950]
[2024-03-09 03:46:14,535 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-09 03:46:14,536 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 03:46:14,536 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 03:46:14,537 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 03:46:14,544 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-03-09 03:46:14,687 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-09 03:46:14,687 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 03:46:14,689 INFO  L263         TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 44 conjunts are in the unsatisfiable core
[2024-03-09 03:46:14,692 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 03:46:14,699 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 03:46:14,725 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-09 03:46:14,726 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-09 03:46:14,870 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-03-09 03:46:14,944 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-09 03:46:14,992 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2024-03-09 03:46:15,056 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2024-03-09 03:46:15,119 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 67
[2024-03-09 03:46:15,165 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:46:15,166 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 03:46:16,442 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:46:16,442 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [414654950] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 03:46:16,442 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 03:46:16,442 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 28
[2024-03-09 03:46:16,443 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987981331]
[2024-03-09 03:46:16,443 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 03:46:16,443 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 30 states
[2024-03-09 03:46:16,443 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:46:16,444 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2024-03-09 03:46:16,445 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870
[2024-03-09 03:46:21,921 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 75 out of 189
[2024-03-09 03:46:21,924 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 1276 transitions, 16069 flow. Second operand  has 30 states, 30 states have (on average 76.76666666666667) internal successors, (2303), 30 states have internal predecessors, (2303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:46:21,925 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:46:21,925 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 189
[2024-03-09 03:46:21,925 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:46:29,515 INFO  L130       PetriNetUnfolder]: 10627/18290 cut-off events.
[2024-03-09 03:46:29,516 INFO  L131       PetriNetUnfolder]: For 144044/146073 co-relation queries the response was YES.
[2024-03-09 03:46:29,592 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 126589 conditions, 18290 events. 10627/18290 cut-off events. For 144044/146073 co-relation queries the response was YES. Maximal size of possible extension queue 681. Compared 128542 event pairs, 735 based on Foata normal form. 101/17797 useless extension candidates. Maximal degree in co-relation 124603. Up to 11804 conditions per place. 
[2024-03-09 03:46:29,675 INFO  L137   encePairwiseOnDemand]: 168/189 looper letters, 1347 selfloop transitions, 687 changer transitions 1/2070 dead transitions.
[2024-03-09 03:46:29,675 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 2070 transitions, 29919 flow
[2024-03-09 03:46:29,676 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2024-03-09 03:46:29,676 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2024-03-09 03:46:29,677 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1666 transitions.
[2024-03-09 03:46:29,678 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.46393762183235865
[2024-03-09 03:46:29,678 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1666 transitions.
[2024-03-09 03:46:29,678 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1666 transitions.
[2024-03-09 03:46:29,679 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:46:29,679 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1666 transitions.
[2024-03-09 03:46:29,681 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 87.6842105263158) internal successors, (1666), 19 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:46:29,684 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 189.0) internal successors, (3780), 20 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:46:29,685 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 189.0) internal successors, (3780), 20 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:46:29,685 INFO  L175             Difference]: Start difference. First operand has 175 places, 1276 transitions, 16069 flow. Second operand 19 states and 1666 transitions.
[2024-03-09 03:46:29,685 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 2070 transitions, 29919 flow
[2024-03-09 03:46:31,479 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 2070 transitions, 29116 flow, removed 163 selfloop flow, removed 7 redundant places.
[2024-03-09 03:46:31,503 INFO  L231             Difference]: Finished difference. Result has 196 places, 1616 transitions, 22865 flow
[2024-03-09 03:46:31,504 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=15311, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=440, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=792, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=22865, PETRI_PLACES=196, PETRI_TRANSITIONS=1616}
[2024-03-09 03:46:31,504 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 139 predicate places.
[2024-03-09 03:46:31,504 INFO  L495      AbstractCegarLoop]: Abstraction has has 196 places, 1616 transitions, 22865 flow
[2024-03-09 03:46:31,505 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 30 states, 30 states have (on average 76.76666666666667) internal successors, (2303), 30 states have internal predecessors, (2303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:46:31,505 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:46:31,505 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:46:31,510 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-03-09 03:46:31,710 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2024-03-09 03:46:31,710 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 03:46:31,711 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:46:31,711 INFO  L85        PathProgramCache]: Analyzing trace with hash -1855345224, now seen corresponding path program 3 times
[2024-03-09 03:46:31,712 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:46:31,712 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294690922]
[2024-03-09 03:46:31,712 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:46:31,713 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:46:31,731 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:46:31,982 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:46:31,983 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:46:31,983 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294690922]
[2024-03-09 03:46:31,983 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294690922] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 03:46:31,983 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700976698]
[2024-03-09 03:46:31,983 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-03-09 03:46:31,983 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 03:46:31,984 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 03:46:31,985 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 03:46:31,985 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-03-09 03:46:32,171 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-03-09 03:46:32,171 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 03:46:32,172 INFO  L263         TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 44 conjunts are in the unsatisfiable core
[2024-03-09 03:46:32,175 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 03:46:32,182 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 03:46:32,217 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-09 03:46:32,217 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-09 03:46:32,348 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-03-09 03:46:32,385 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-09 03:46:32,455 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2024-03-09 03:46:32,503 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2024-03-09 03:46:32,524 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2024-03-09 03:46:32,579 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-03-09 03:46:32,624 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:46:32,625 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 03:46:32,796 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:46:32,796 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700976698] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 03:46:32,797 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 03:46:32,797 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 20
[2024-03-09 03:46:32,797 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663908357]
[2024-03-09 03:46:32,797 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 03:46:32,798 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 22 states
[2024-03-09 03:46:32,798 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:46:32,799 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2024-03-09 03:46:32,799 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462
[2024-03-09 03:46:34,546 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 75 out of 189
[2024-03-09 03:46:34,547 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 1616 transitions, 22865 flow. Second operand  has 22 states, 22 states have (on average 76.81818181818181) internal successors, (1690), 22 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:46:34,547 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:46:34,548 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 189
[2024-03-09 03:46:34,548 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:46:41,164 INFO  L130       PetriNetUnfolder]: 10417/17945 cut-off events.
[2024-03-09 03:46:41,165 INFO  L131       PetriNetUnfolder]: For 178144/180251 co-relation queries the response was YES.
[2024-03-09 03:46:41,267 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 129500 conditions, 17945 events. 10417/17945 cut-off events. For 178144/180251 co-relation queries the response was YES. Maximal size of possible extension queue 665. Compared 125732 event pairs, 714 based on Foata normal form. 220/17801 useless extension candidates. Maximal degree in co-relation 127479. Up to 12449 conditions per place. 
[2024-03-09 03:46:41,349 INFO  L137   encePairwiseOnDemand]: 168/189 looper letters, 1501 selfloop transitions, 583 changer transitions 1/2120 dead transitions.
[2024-03-09 03:46:41,349 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 2120 transitions, 33097 flow
[2024-03-09 03:46:41,350 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2024-03-09 03:46:41,350 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2024-03-09 03:46:41,351 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1662 transitions.
[2024-03-09 03:46:41,352 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4628237259816207
[2024-03-09 03:46:41,352 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1662 transitions.
[2024-03-09 03:46:41,352 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1662 transitions.
[2024-03-09 03:46:41,353 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:46:41,353 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1662 transitions.
[2024-03-09 03:46:41,355 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 87.47368421052632) internal successors, (1662), 19 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:46:41,358 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 189.0) internal successors, (3780), 20 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:46:41,359 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 189.0) internal successors, (3780), 20 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:46:41,359 INFO  L175             Difference]: Start difference. First operand has 196 places, 1616 transitions, 22865 flow. Second operand 19 states and 1662 transitions.
[2024-03-09 03:46:41,359 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 2120 transitions, 33097 flow
[2024-03-09 03:46:43,715 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 2120 transitions, 30904 flow, removed 887 selfloop flow, removed 6 redundant places.
[2024-03-09 03:46:43,742 INFO  L231             Difference]: Finished difference. Result has 215 places, 1745 transitions, 24883 flow
[2024-03-09 03:46:43,743 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=20738, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=481, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=24883, PETRI_PLACES=215, PETRI_TRANSITIONS=1745}
[2024-03-09 03:46:43,743 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 158 predicate places.
[2024-03-09 03:46:43,744 INFO  L495      AbstractCegarLoop]: Abstraction has has 215 places, 1745 transitions, 24883 flow
[2024-03-09 03:46:43,744 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 22 states, 22 states have (on average 76.81818181818181) internal successors, (1690), 22 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:46:43,745 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:46:43,745 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:46:43,750 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2024-03-09 03:46:43,949 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14
[2024-03-09 03:46:43,950 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 03:46:43,950 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:46:43,951 INFO  L85        PathProgramCache]: Analyzing trace with hash -1039980298, now seen corresponding path program 1 times
[2024-03-09 03:46:43,951 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:46:43,951 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633146116]
[2024-03-09 03:46:43,952 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:46:43,952 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:46:43,968 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:46:44,191 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:46:44,192 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:46:44,192 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633146116]
[2024-03-09 03:46:44,192 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633146116] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 03:46:44,192 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207949361]
[2024-03-09 03:46:44,192 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:46:44,192 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 03:46:44,192 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 03:46:44,194 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 03:46:44,195 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-03-09 03:46:44,338 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:46:44,339 INFO  L263         TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 31 conjunts are in the unsatisfiable core
[2024-03-09 03:46:44,343 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 03:46:44,348 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 03:46:44,370 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-09 03:46:44,370 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-09 03:46:44,386 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9
[2024-03-09 03:46:44,409 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22
[2024-03-09 03:46:44,421 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:46:44,421 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34
[2024-03-09 03:46:44,439 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:46:44,440 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46
[2024-03-09 03:46:44,457 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39
[2024-03-09 03:46:44,466 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:46:44,466 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 03:46:44,646 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 6)) (.cse2 (+ 7 c_threadThread1of2ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_988 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_988) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_988 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_988) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_988 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_988) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_988 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_988) c_threadThread1of2ForFork0_~t~0.base) .cse2)))))) is different from false
[2024-03-09 03:46:44,666 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 5)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 6)) (.cse2 (+ 7 c_threadThread1of2ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_988 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_988) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_988 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_988) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_988 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_988) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_988 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_988) c_threadThread1of2ForFork0_~t~0.base) .cse3)))))) is different from false
[2024-03-09 03:46:44,747 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:46:44,748 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 53
[2024-03-09 03:46:44,754 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:46:44,755 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 28
[2024-03-09 03:46:44,764 INFO  L321             Elim1Store]: treesize reduction 40, result has 2.4 percent of original size
[2024-03-09 03:46:44,764 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1
[2024-03-09 03:46:44,769 INFO  L321             Elim1Store]: treesize reduction 40, result has 2.4 percent of original size
[2024-03-09 03:46:44,769 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1
[2024-03-09 03:46:44,775 INFO  L321             Elim1Store]: treesize reduction 40, result has 2.4 percent of original size
[2024-03-09 03:46:44,775 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1
[2024-03-09 03:46:44,792 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-03-09 03:46:44,792 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [207949361] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 03:46:44,792 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 03:46:44,793 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14
[2024-03-09 03:46:44,793 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389621385]
[2024-03-09 03:46:44,793 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 03:46:44,793 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2024-03-09 03:46:44,793 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:46:44,794 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2024-03-09 03:46:44,794 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=128, Unknown=11, NotChecked=50, Total=240
[2024-03-09 03:46:44,992 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 58 out of 189
[2024-03-09 03:46:44,994 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 1745 transitions, 24883 flow. Second operand  has 16 states, 16 states have (on average 59.8125) internal successors, (957), 16 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:46:44,994 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:46:44,994 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 189
[2024-03-09 03:46:44,994 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:46:53,250 INFO  L130       PetriNetUnfolder]: 11807/19671 cut-off events.
[2024-03-09 03:46:53,250 INFO  L131       PetriNetUnfolder]: For 184090/184104 co-relation queries the response was YES.
[2024-03-09 03:46:53,355 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 145115 conditions, 19671 events. 11807/19671 cut-off events. For 184090/184104 co-relation queries the response was YES. Maximal size of possible extension queue 682. Compared 133633 event pairs, 643 based on Foata normal form. 71/18703 useless extension candidates. Maximal degree in co-relation 142614. Up to 9595 conditions per place. 
[2024-03-09 03:46:53,440 INFO  L137   encePairwiseOnDemand]: 140/189 looper letters, 1136 selfloop transitions, 1217 changer transitions 10/2367 dead transitions.
[2024-03-09 03:46:53,440 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 2367 transitions, 37346 flow
[2024-03-09 03:46:53,441 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2024-03-09 03:46:53,441 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 18 states.
[2024-03-09 03:46:53,442 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1532 transitions.
[2024-03-09 03:46:53,443 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4503233392122281
[2024-03-09 03:46:53,443 INFO  L72            ComplementDD]: Start complementDD. Operand 18 states and 1532 transitions.
[2024-03-09 03:46:53,443 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 18 states and 1532 transitions.
[2024-03-09 03:46:53,443 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:46:53,444 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1532 transitions.
[2024-03-09 03:46:53,445 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 19 states, 18 states have (on average 85.11111111111111) internal successors, (1532), 18 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:46:53,448 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 19 states, 19 states have (on average 189.0) internal successors, (3591), 19 states have internal predecessors, (3591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:46:53,448 INFO  L81            ComplementDD]: Finished complementDD. Result  has 19 states, 19 states have (on average 189.0) internal successors, (3591), 19 states have internal predecessors, (3591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:46:53,448 INFO  L175             Difference]: Start difference. First operand has 215 places, 1745 transitions, 24883 flow. Second operand 18 states and 1532 transitions.
[2024-03-09 03:46:53,448 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 2367 transitions, 37346 flow
[2024-03-09 03:46:56,290 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 2367 transitions, 36115 flow, removed 522 selfloop flow, removed 8 redundant places.
[2024-03-09 03:46:56,320 INFO  L231             Difference]: Finished difference. Result has 228 places, 1904 transitions, 29128 flow
[2024-03-09 03:46:56,321 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=23924, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1745, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1058, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=599, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=29128, PETRI_PLACES=228, PETRI_TRANSITIONS=1904}
[2024-03-09 03:46:56,321 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 171 predicate places.
[2024-03-09 03:46:56,322 INFO  L495      AbstractCegarLoop]: Abstraction has has 228 places, 1904 transitions, 29128 flow
[2024-03-09 03:46:56,322 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 16 states have (on average 59.8125) internal successors, (957), 16 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:46:56,322 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:46:56,322 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:46:56,329 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2024-03-09 03:46:56,523 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2024-03-09 03:46:56,523 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 03:46:56,524 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:46:56,524 INFO  L85        PathProgramCache]: Analyzing trace with hash -658399713, now seen corresponding path program 1 times
[2024-03-09 03:46:56,525 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:46:56,525 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549211958]
[2024-03-09 03:46:56,525 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:46:56,525 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:46:56,541 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:46:56,742 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:46:56,743 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:46:56,743 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549211958]
[2024-03-09 03:46:56,743 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549211958] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 03:46:56,743 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37546357]
[2024-03-09 03:46:56,743 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:46:56,743 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 03:46:56,744 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 03:46:56,745 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 03:46:56,747 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2024-03-09 03:46:56,883 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:46:56,884 INFO  L263         TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 43 conjunts are in the unsatisfiable core
[2024-03-09 03:46:56,887 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 03:46:56,902 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 03:46:56,939 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-09 03:46:56,939 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-09 03:46:57,038 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-03-09 03:46:57,069 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-09 03:46:57,112 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2024-03-09 03:46:57,159 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2024-03-09 03:46:57,214 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-03-09 03:46:57,258 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:46:57,258 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 03:46:57,283 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1083 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1083) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_1083 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1083) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_1083 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1083) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_1083 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1083) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)))) is different from false
[2024-03-09 03:46:57,303 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_1083 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1083) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1083 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1083) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1083 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1083) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_1083 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1083) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) 0)))))) is different from false
[2024-03-09 03:46:57,325 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 0) .cse2 0)))) (and (forall ((v_ArrVal_1083 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1083) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_1083 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1083) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_1083 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1083) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1083 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1083) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false
[2024-03-09 03:46:57,349 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) (.cse4 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) .cse3 0) .cse4 0)))) (and (forall ((v_ArrVal_1083 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1083) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_1083 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1083) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1083 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1083) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1083 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1083) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4) 0)))))) is different from false
[2024-03-09 03:46:57,370 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:46:57,371 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67
[2024-03-09 03:46:57,376 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:46:57,376 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 39
[2024-03-09 03:46:57,381 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3
[2024-03-09 03:46:57,390 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-09 03:46:57,390 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1
[2024-03-09 03:46:57,395 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-09 03:46:57,396 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-03-09 03:46:57,402 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-09 03:46:57,402 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-03-09 03:46:57,440 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:46:57,440 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [37546357] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 03:46:57,440 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 03:46:57,440 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 24
[2024-03-09 03:46:57,440 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324194312]
[2024-03-09 03:46:57,441 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 03:46:57,441 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2024-03-09 03:46:57,441 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:46:57,441 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2024-03-09 03:46:57,442 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=379, Unknown=4, NotChecked=172, Total=650
[2024-03-09 03:46:57,557 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 48 out of 189
[2024-03-09 03:46:57,559 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 1904 transitions, 29128 flow. Second operand  has 26 states, 26 states have (on average 49.80769230769231) internal successors, (1295), 26 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:46:57,559 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:46:57,559 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 189
[2024-03-09 03:46:57,559 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:47:09,234 INFO  L130       PetriNetUnfolder]: 13945/23415 cut-off events.
[2024-03-09 03:47:09,235 INFO  L131       PetriNetUnfolder]: For 245087/245095 co-relation queries the response was YES.
[2024-03-09 03:47:09,374 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 186234 conditions, 23415 events. 13945/23415 cut-off events. For 245087/245095 co-relation queries the response was YES. Maximal size of possible extension queue 787. Compared 164246 event pairs, 857 based on Foata normal form. 176/22329 useless extension candidates. Maximal degree in co-relation 181676. Up to 9293 conditions per place. 
[2024-03-09 03:47:09,571 INFO  L137   encePairwiseOnDemand]: 157/189 looper letters, 2287 selfloop transitions, 746 changer transitions 2/3039 dead transitions.
[2024-03-09 03:47:09,571 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 3039 transitions, 50333 flow
[2024-03-09 03:47:09,576 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. 
[2024-03-09 03:47:09,576 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 32 states.
[2024-03-09 03:47:09,578 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 1992 transitions.
[2024-03-09 03:47:09,578 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.32936507936507936
[2024-03-09 03:47:09,578 INFO  L72            ComplementDD]: Start complementDD. Operand 32 states and 1992 transitions.
[2024-03-09 03:47:09,578 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 32 states and 1992 transitions.
[2024-03-09 03:47:09,579 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:47:09,579 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 1992 transitions.
[2024-03-09 03:47:09,582 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 33 states, 32 states have (on average 62.25) internal successors, (1992), 32 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:47:09,588 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 33 states, 33 states have (on average 189.0) internal successors, (6237), 33 states have internal predecessors, (6237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:47:09,588 INFO  L81            ComplementDD]: Finished complementDD. Result  has 33 states, 33 states have (on average 189.0) internal successors, (6237), 33 states have internal predecessors, (6237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:47:09,588 INFO  L175             Difference]: Start difference. First operand has 228 places, 1904 transitions, 29128 flow. Second operand 32 states and 1992 transitions.
[2024-03-09 03:47:09,588 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 3039 transitions, 50333 flow
[2024-03-09 03:47:14,038 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 3039 transitions, 48124 flow, removed 169 selfloop flow, removed 10 redundant places.
[2024-03-09 03:47:14,077 INFO  L231             Difference]: Finished difference. Result has 268 places, 2518 transitions, 40050 flow
[2024-03-09 03:47:14,078 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=27623, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1904, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=260, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1499, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=40050, PETRI_PLACES=268, PETRI_TRANSITIONS=2518}
[2024-03-09 03:47:14,078 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 211 predicate places.
[2024-03-09 03:47:14,078 INFO  L495      AbstractCegarLoop]: Abstraction has has 268 places, 2518 transitions, 40050 flow
[2024-03-09 03:47:14,079 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 49.80769230769231) internal successors, (1295), 26 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:47:14,079 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:47:14,079 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:47:14,087 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2024-03-09 03:47:14,279 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2024-03-09 03:47:14,280 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 03:47:14,281 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:47:14,281 INFO  L85        PathProgramCache]: Analyzing trace with hash 781280382, now seen corresponding path program 1 times
[2024-03-09 03:47:14,281 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:47:14,282 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565061213]
[2024-03-09 03:47:14,282 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:47:14,282 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:47:14,301 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:47:14,582 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:47:14,582 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:47:14,582 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565061213]
[2024-03-09 03:47:14,583 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565061213] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 03:47:14,583 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730288426]
[2024-03-09 03:47:14,583 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:47:14,583 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 03:47:14,583 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 03:47:14,584 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 03:47:14,586 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2024-03-09 03:47:14,713 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:47:14,715 INFO  L263         TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 43 conjunts are in the unsatisfiable core
[2024-03-09 03:47:14,719 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 03:47:14,734 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 03:47:14,768 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-09 03:47:14,768 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-09 03:47:14,847 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-03-09 03:47:14,878 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-09 03:47:14,917 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2024-03-09 03:47:14,962 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2024-03-09 03:47:15,060 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-03-09 03:47:15,109 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:47:15,109 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 03:47:15,247 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1174 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_1174 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_1174 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_1174 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)))) is different from false
[2024-03-09 03:47:15,265 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_1174 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_1174 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1174 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_1174 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) 0)))))) is different from false
[2024-03-09 03:47:15,289 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 0) .cse1 0)))) (and (forall ((v_ArrVal_1174 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1174 (Array Int Int))) (= 0 (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)))) (forall ((v_ArrVal_1174 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1174 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)))))) is different from false
[2024-03-09 03:47:15,315 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) (.cse4 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) .cse4 0) .cse3 0)))) (and (forall ((v_ArrVal_1174 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_1174 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1174 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1174 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4) 0)))))) is different from false
[2024-03-09 03:47:15,332 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:47:15,333 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67
[2024-03-09 03:47:15,338 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:47:15,338 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 39
[2024-03-09 03:47:15,342 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3
[2024-03-09 03:47:15,349 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-09 03:47:15,349 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-03-09 03:47:15,354 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-09 03:47:15,354 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1
[2024-03-09 03:47:15,362 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-09 03:47:15,362 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-03-09 03:47:15,393 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:47:15,393 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [730288426] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 03:47:15,393 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 03:47:15,393 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 25
[2024-03-09 03:47:15,393 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416505022]
[2024-03-09 03:47:15,393 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 03:47:15,393 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2024-03-09 03:47:15,394 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:47:15,394 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2024-03-09 03:47:15,394 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=402, Unknown=14, NotChecked=180, Total=702
[2024-03-09 03:47:15,461 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 48 out of 189
[2024-03-09 03:47:15,462 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 2518 transitions, 40050 flow. Second operand  has 27 states, 27 states have (on average 49.7037037037037) internal successors, (1342), 27 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:47:15,462 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:47:15,462 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 189
[2024-03-09 03:47:15,462 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:47:38,068 INFO  L130       PetriNetUnfolder]: 21744/38104 cut-off events.
[2024-03-09 03:47:38,069 INFO  L131       PetriNetUnfolder]: For 648138/648176 co-relation queries the response was YES.
[2024-03-09 03:47:38,545 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 334006 conditions, 38104 events. 21744/38104 cut-off events. For 648138/648176 co-relation queries the response was YES. Maximal size of possible extension queue 1037. Compared 297211 event pairs, 1152 based on Foata normal form. 35/35677 useless extension candidates. Maximal degree in co-relation 329116. Up to 13703 conditions per place. 
[2024-03-09 03:47:38,744 INFO  L137   encePairwiseOnDemand]: 157/189 looper letters, 3487 selfloop transitions, 919 changer transitions 2/4412 dead transitions.
[2024-03-09 03:47:38,744 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 4412 transitions, 76478 flow
[2024-03-09 03:47:38,745 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. 
[2024-03-09 03:47:38,745 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 41 states.
[2024-03-09 03:47:38,747 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 2684 transitions.
[2024-03-09 03:47:38,748 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3463672731965415
[2024-03-09 03:47:38,748 INFO  L72            ComplementDD]: Start complementDD. Operand 41 states and 2684 transitions.
[2024-03-09 03:47:38,748 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 41 states and 2684 transitions.
[2024-03-09 03:47:38,749 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:47:38,749 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 41 states and 2684 transitions.
[2024-03-09 03:47:38,751 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 42 states, 41 states have (on average 65.46341463414635) internal successors, (2684), 41 states have internal predecessors, (2684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:47:38,756 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 42 states, 42 states have (on average 189.0) internal successors, (7938), 42 states have internal predecessors, (7938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:47:38,757 INFO  L81            ComplementDD]: Finished complementDD. Result  has 42 states, 42 states have (on average 189.0) internal successors, (7938), 42 states have internal predecessors, (7938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:47:38,757 INFO  L175             Difference]: Start difference. First operand has 268 places, 2518 transitions, 40050 flow. Second operand 41 states and 2684 transitions.
[2024-03-09 03:47:38,757 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 4412 transitions, 76478 flow
[2024-03-09 03:47:51,651 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 4412 transitions, 72805 flow, removed 1831 selfloop flow, removed 4 redundant places.
[2024-03-09 03:47:51,706 INFO  L231             Difference]: Finished difference. Result has 336 places, 3154 transitions, 51630 flow
[2024-03-09 03:47:51,708 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=37819, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=371, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1926, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=51630, PETRI_PLACES=336, PETRI_TRANSITIONS=3154}
[2024-03-09 03:47:51,708 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 279 predicate places.
[2024-03-09 03:47:51,708 INFO  L495      AbstractCegarLoop]: Abstraction has has 336 places, 3154 transitions, 51630 flow
[2024-03-09 03:47:51,708 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 27 states, 27 states have (on average 49.7037037037037) internal successors, (1342), 27 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:47:51,709 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:47:51,709 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:47:51,714 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2024-03-09 03:47:51,913 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2024-03-09 03:47:51,914 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 03:47:51,914 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:47:51,915 INFO  L85        PathProgramCache]: Analyzing trace with hash 932464902, now seen corresponding path program 2 times
[2024-03-09 03:47:51,915 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:47:51,915 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353283725]
[2024-03-09 03:47:51,916 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:47:51,916 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:47:51,931 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:47:52,167 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:47:52,168 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:47:52,168 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353283725]
[2024-03-09 03:47:52,168 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353283725] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 03:47:52,168 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2497658]
[2024-03-09 03:47:52,168 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-09 03:47:52,168 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 03:47:52,168 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 03:47:52,170 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 03:47:52,171 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2024-03-09 03:47:52,332 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-09 03:47:52,332 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 03:47:52,334 INFO  L263         TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 39 conjunts are in the unsatisfiable core
[2024-03-09 03:47:52,338 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 03:47:52,347 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 03:47:52,378 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-09 03:47:52,378 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-09 03:47:52,507 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-03-09 03:47:52,533 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-09 03:47:52,609 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2024-03-09 03:47:52,653 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2024-03-09 03:47:52,704 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-03-09 03:47:52,749 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:47:52,749 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 03:47:52,770 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1264 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1264) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_1264 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1264) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)))) (forall ((v_ArrVal_1264 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1264) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_1264 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1264) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)))) is different from false
[2024-03-09 03:47:52,788 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_1264 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1264) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_1264 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1264) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1264 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1264) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_1264 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1264) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) 0)))))) is different from false
[2024-03-09 03:47:52,809 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) .cse3 0)))) (and (forall ((v_ArrVal_1264 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1264) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_1264 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1264) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1264 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1264) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3))) (forall ((v_ArrVal_1264 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1264) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)))))) is different from false
[2024-03-09 03:47:52,829 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 0) .cse2 0)))) (and (forall ((v_ArrVal_1264 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1264) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_1264 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1264) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1264 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1264) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1264 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1264) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)))))) is different from false
[2024-03-09 03:47:52,851 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4 0) .cse1 0) .cse3 0)))) (and (forall ((v_ArrVal_1264 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1264) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1264 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1264) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1264 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1264) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1264 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1264) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4) 0)))))) is different from false
[2024-03-09 03:47:52,869 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:47:52,870 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67
[2024-03-09 03:47:52,874 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:47:52,874 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 39
[2024-03-09 03:47:52,878 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3
[2024-03-09 03:47:52,884 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-09 03:47:52,884 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1
[2024-03-09 03:47:52,890 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-09 03:47:52,890 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-03-09 03:47:52,896 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-09 03:47:52,896 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-03-09 03:47:52,999 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:47:52,999 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2497658] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 03:47:53,000 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 03:47:53,000 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 29
[2024-03-09 03:47:53,000 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140588834]
[2024-03-09 03:47:53,000 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 03:47:53,000 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 31 states
[2024-03-09 03:47:53,001 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:47:53,001 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants.
[2024-03-09 03:47:53,001 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=552, Unknown=5, NotChecked=260, Total=930
[2024-03-09 03:47:53,050 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 51 out of 189
[2024-03-09 03:47:53,051 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 3154 transitions, 51630 flow. Second operand  has 31 states, 31 states have (on average 52.806451612903224) internal successors, (1637), 31 states have internal predecessors, (1637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:47:53,052 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:47:53,052 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 189
[2024-03-09 03:47:53,052 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:48:25,682 INFO  L130       PetriNetUnfolder]: 27561/48689 cut-off events.
[2024-03-09 03:48:25,683 INFO  L131       PetriNetUnfolder]: For 1030849/1030873 co-relation queries the response was YES.
[2024-03-09 03:48:26,473 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 458458 conditions, 48689 events. 27561/48689 cut-off events. For 1030849/1030873 co-relation queries the response was YES. Maximal size of possible extension queue 1298. Compared 398460 event pairs, 1892 based on Foata normal form. 185/45637 useless extension candidates. Maximal degree in co-relation 453300. Up to 19061 conditions per place. 
[2024-03-09 03:48:26,726 INFO  L137   encePairwiseOnDemand]: 158/189 looper letters, 2802 selfloop transitions, 1578 changer transitions 0/4384 dead transitions.
[2024-03-09 03:48:26,727 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 4384 transitions, 81628 flow
[2024-03-09 03:48:26,728 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. 
[2024-03-09 03:48:26,728 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 29 states.
[2024-03-09 03:48:26,729 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1900 transitions.
[2024-03-09 03:48:26,730 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3466520707900018
[2024-03-09 03:48:26,730 INFO  L72            ComplementDD]: Start complementDD. Operand 29 states and 1900 transitions.
[2024-03-09 03:48:26,730 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 29 states and 1900 transitions.
[2024-03-09 03:48:26,731 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:48:26,731 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 1900 transitions.
[2024-03-09 03:48:26,733 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 30 states, 29 states have (on average 65.51724137931035) internal successors, (1900), 29 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:48:26,736 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 30 states, 30 states have (on average 189.0) internal successors, (5670), 30 states have internal predecessors, (5670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:48:26,736 INFO  L81            ComplementDD]: Finished complementDD. Result  has 30 states, 30 states have (on average 189.0) internal successors, (5670), 30 states have internal predecessors, (5670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:48:26,737 INFO  L175             Difference]: Start difference. First operand has 336 places, 3154 transitions, 51630 flow. Second operand 29 states and 1900 transitions.
[2024-03-09 03:48:26,737 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 4384 transitions, 81628 flow
[2024-03-09 03:48:53,896 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 4384 transitions, 80768 flow, removed 425 selfloop flow, removed 3 redundant places.
[2024-03-09 03:48:53,963 INFO  L231             Difference]: Finished difference. Result has 380 places, 3866 transitions, 71114 flow
[2024-03-09 03:48:53,965 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=50930, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=967, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1976, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=71114, PETRI_PLACES=380, PETRI_TRANSITIONS=3866}
[2024-03-09 03:48:53,966 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 323 predicate places.
[2024-03-09 03:48:53,966 INFO  L495      AbstractCegarLoop]: Abstraction has has 380 places, 3866 transitions, 71114 flow
[2024-03-09 03:48:53,966 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 31 states, 31 states have (on average 52.806451612903224) internal successors, (1637), 31 states have internal predecessors, (1637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:48:53,966 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:48:53,967 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:48:53,975 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0
[2024-03-09 03:48:54,167 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 03:48:54,168 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 03:48:54,168 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:48:54,169 INFO  L85        PathProgramCache]: Analyzing trace with hash -184114937, now seen corresponding path program 2 times
[2024-03-09 03:48:54,169 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:48:54,169 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529982242]
[2024-03-09 03:48:54,169 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:48:54,170 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:48:54,185 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:48:54,422 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:48:54,422 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:48:54,423 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529982242]
[2024-03-09 03:48:54,423 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529982242] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 03:48:54,423 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093818422]
[2024-03-09 03:48:54,423 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-09 03:48:54,423 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 03:48:54,423 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 03:48:54,424 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 03:48:54,425 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2024-03-09 03:48:54,608 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-09 03:48:54,608 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 03:48:54,609 INFO  L263         TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 36 conjunts are in the unsatisfiable core
[2024-03-09 03:48:54,612 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 03:48:54,617 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 03:48:54,643 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-09 03:48:54,643 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-09 03:48:54,724 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-03-09 03:48:54,783 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-09 03:48:54,829 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30
[2024-03-09 03:48:54,846 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2024-03-09 03:48:54,891 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2024-03-09 03:48:54,946 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-03-09 03:48:54,983 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:48:54,984 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 03:48:55,101 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_1359 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1359) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1359 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1359) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1359 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1359) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_1359 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1359) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) 0)))))) is different from false
[2024-03-09 03:48:55,124 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 0) .cse1 0)))) (and (forall ((v_ArrVal_1359 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1359) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1359 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1359) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1359 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1359) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_1359 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1359) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false
[2024-03-09 03:48:55,143 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse4)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse4))) (and (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1354 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1354))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1359) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1354 (Array Int Int))) (= (select (select (store (let ((.cse3 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1354))) (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse3 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1359) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse4)) 0)) (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1354 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1354))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1359) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1354 (Array Int Int))) (= (select (select (store (let ((.cse6 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1354))) (store .cse6 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse6 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1359) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse4)) 0))))) is different from false
[2024-03-09 03:48:55,229 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:48:55,229 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093818422] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 03:48:55,230 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 03:48:55,230 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 24
[2024-03-09 03:48:55,230 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35308993]
[2024-03-09 03:48:55,230 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 03:48:55,230 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2024-03-09 03:48:55,231 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:48:55,231 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2024-03-09 03:48:55,231 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=418, Unknown=10, NotChecked=132, Total=650
[2024-03-09 03:48:55,313 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 55 out of 189
[2024-03-09 03:48:55,314 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 3866 transitions, 71114 flow. Second operand  has 26 states, 26 states have (on average 56.80769230769231) internal successors, (1477), 26 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:48:55,314 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:48:55,314 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 189
[2024-03-09 03:48:55,314 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:49:41,242 INFO  L130       PetriNetUnfolder]: 32422/57605 cut-off events.
[2024-03-09 03:49:41,242 INFO  L131       PetriNetUnfolder]: For 1500490/1500516 co-relation queries the response was YES.
[2024-03-09 03:49:42,434 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 577476 conditions, 57605 events. 32422/57605 cut-off events. For 1500490/1500516 co-relation queries the response was YES. Maximal size of possible extension queue 1555. Compared 487626 event pairs, 2308 based on Foata normal form. 185/53867 useless extension candidates. Maximal degree in co-relation 572172. Up to 21534 conditions per place. 
[2024-03-09 03:49:42,752 INFO  L137   encePairwiseOnDemand]: 159/189 looper letters, 3071 selfloop transitions, 2051 changer transitions 0/5126 dead transitions.
[2024-03-09 03:49:42,752 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 5126 transitions, 104877 flow
[2024-03-09 03:49:42,753 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2024-03-09 03:49:42,753 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 23 states.
[2024-03-09 03:49:42,754 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1628 transitions.
[2024-03-09 03:49:42,755 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3745111571198528
[2024-03-09 03:49:42,755 INFO  L72            ComplementDD]: Start complementDD. Operand 23 states and 1628 transitions.
[2024-03-09 03:49:42,755 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 23 states and 1628 transitions.
[2024-03-09 03:49:42,755 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:49:42,755 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1628 transitions.
[2024-03-09 03:49:42,757 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 24 states, 23 states have (on average 70.78260869565217) internal successors, (1628), 23 states have internal predecessors, (1628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:49:42,760 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 24 states, 24 states have (on average 189.0) internal successors, (4536), 24 states have internal predecessors, (4536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:49:42,760 INFO  L81            ComplementDD]: Finished complementDD. Result  has 24 states, 24 states have (on average 189.0) internal successors, (4536), 24 states have internal predecessors, (4536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:49:42,761 INFO  L175             Difference]: Start difference. First operand has 380 places, 3866 transitions, 71114 flow. Second operand 23 states and 1628 transitions.
[2024-03-09 03:49:42,761 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 5126 transitions, 104877 flow
[2024-03-09 03:50:25,294 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 5126 transitions, 102388 flow, removed 1174 selfloop flow, removed 7 redundant places.
[2024-03-09 03:50:25,418 INFO  L231             Difference]: Finished difference. Result has 411 places, 4581 transitions, 92700 flow
[2024-03-09 03:50:25,420 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=68755, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3866, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1413, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=92700, PETRI_PLACES=411, PETRI_TRANSITIONS=4581}
[2024-03-09 03:50:25,420 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 354 predicate places.
[2024-03-09 03:50:25,420 INFO  L495      AbstractCegarLoop]: Abstraction has has 411 places, 4581 transitions, 92700 flow
[2024-03-09 03:50:25,421 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 56.80769230769231) internal successors, (1477), 26 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:50:25,421 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:50:25,421 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:50:25,439 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0
[2024-03-09 03:50:25,621 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 03:50:25,622 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 03:50:25,623 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:50:25,623 INFO  L85        PathProgramCache]: Analyzing trace with hash 786019662, now seen corresponding path program 3 times
[2024-03-09 03:50:25,623 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:50:25,624 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331250326]
[2024-03-09 03:50:25,624 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:50:25,624 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:50:25,643 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:50:25,891 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:50:25,891 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:50:25,892 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331250326]
[2024-03-09 03:50:25,892 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331250326] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 03:50:25,892 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514016510]
[2024-03-09 03:50:25,892 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-03-09 03:50:25,892 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 03:50:25,892 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 03:50:25,893 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 03:50:25,895 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2024-03-09 03:50:26,063 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-03-09 03:50:26,063 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 03:50:26,064 INFO  L263         TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 33 conjunts are in the unsatisfiable core
[2024-03-09 03:50:26,067 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 03:50:26,071 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 03:50:26,095 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-09 03:50:26,096 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-09 03:50:26,181 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-03-09 03:50:26,232 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-09 03:50:26,275 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2024-03-09 03:50:26,359 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2024-03-09 03:50:26,402 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:50:26,403 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-03-09 03:50:26,440 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:50:26,441 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 03:50:26,465 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1447 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1447) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_1447 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1447) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_1447 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1447) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)))) is different from false
[2024-03-09 03:50:26,563 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_1447 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1447) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_1447 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1447) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_1447 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1447) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)))))) is different from false
[2024-03-09 03:50:26,581 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse3)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_1447 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1447) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1447 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1447) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1447 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1447) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse3)) 0)))))) is different from false
[2024-03-09 03:50:26,601 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:50:26,602 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 54
[2024-03-09 03:50:26,609 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:50:26,609 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 35
[2024-03-09 03:50:26,612 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3
[2024-03-09 03:50:26,621 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 03:50:26,621 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 1
[2024-03-09 03:50:26,626 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 03:50:26,627 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 1
[2024-03-09 03:50:26,647 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:50:26,647 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [514016510] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 03:50:26,647 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 03:50:26,647 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 23
[2024-03-09 03:50:26,647 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189346280]
[2024-03-09 03:50:26,648 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 03:50:26,648 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 25 states
[2024-03-09 03:50:26,648 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:50:26,648 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2024-03-09 03:50:26,648 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=371, Unknown=11, NotChecked=126, Total=600
[2024-03-09 03:50:26,840 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 55 out of 189
[2024-03-09 03:50:26,842 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 4581 transitions, 92700 flow. Second operand  has 25 states, 25 states have (on average 56.72) internal successors, (1418), 25 states have internal predecessors, (1418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:50:26,842 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:50:26,842 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 189
[2024-03-09 03:50:26,842 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:51:40,807 INFO  L130       PetriNetUnfolder]: 42473/77046 cut-off events.
[2024-03-09 03:51:40,807 INFO  L131       PetriNetUnfolder]: For 2320687/2320743 co-relation queries the response was YES.
[2024-03-09 03:51:42,643 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 803895 conditions, 77046 events. 42473/77046 cut-off events. For 2320687/2320743 co-relation queries the response was YES. Maximal size of possible extension queue 1913. Compared 693535 event pairs, 3494 based on Foata normal form. 253/71729 useless extension candidates. Maximal degree in co-relation 803118. Up to 29504 conditions per place. 
[2024-03-09 03:51:43,084 INFO  L137   encePairwiseOnDemand]: 150/189 looper letters, 4165 selfloop transitions, 2221 changer transitions 0/6390 dead transitions.
[2024-03-09 03:51:43,085 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 6390 transitions, 142255 flow
[2024-03-09 03:51:43,086 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. 
[2024-03-09 03:51:43,086 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 29 states.
[2024-03-09 03:51:43,087 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 2095 transitions.
[2024-03-09 03:51:43,088 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.38222952016055467
[2024-03-09 03:51:43,088 INFO  L72            ComplementDD]: Start complementDD. Operand 29 states and 2095 transitions.
[2024-03-09 03:51:43,088 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 29 states and 2095 transitions.
[2024-03-09 03:51:43,089 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:51:43,089 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 2095 transitions.
[2024-03-09 03:51:43,091 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 30 states, 29 states have (on average 72.24137931034483) internal successors, (2095), 29 states have internal predecessors, (2095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:51:43,095 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 30 states, 30 states have (on average 189.0) internal successors, (5670), 30 states have internal predecessors, (5670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:51:43,095 INFO  L81            ComplementDD]: Finished complementDD. Result  has 30 states, 30 states have (on average 189.0) internal successors, (5670), 30 states have internal predecessors, (5670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:51:43,095 INFO  L175             Difference]: Start difference. First operand has 411 places, 4581 transitions, 92700 flow. Second operand 29 states and 2095 transitions.
[2024-03-09 03:51:43,095 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 6390 transitions, 142255 flow
[2024-03-09 03:52:57,663 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 6390 transitions, 138683 flow, removed 1634 selfloop flow, removed 6 redundant places.
[2024-03-09 03:52:57,760 INFO  L231             Difference]: Finished difference. Result has 452 places, 5531 transitions, 122113 flow
[2024-03-09 03:52:57,763 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=89039, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1333, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2691, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=122113, PETRI_PLACES=452, PETRI_TRANSITIONS=5531}
[2024-03-09 03:52:57,763 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 395 predicate places.
[2024-03-09 03:52:57,764 INFO  L495      AbstractCegarLoop]: Abstraction has has 452 places, 5531 transitions, 122113 flow
[2024-03-09 03:52:57,764 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 25 states, 25 states have (on average 56.72) internal successors, (1418), 25 states have internal predecessors, (1418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:52:57,764 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:52:57,764 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:52:57,772 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0
[2024-03-09 03:52:57,965 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20
[2024-03-09 03:52:57,966 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 03:52:57,966 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:52:57,967 INFO  L85        PathProgramCache]: Analyzing trace with hash 785893182, now seen corresponding path program 4 times
[2024-03-09 03:52:57,967 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:52:57,967 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600057121]
[2024-03-09 03:52:57,968 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:52:57,968 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:52:57,983 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:52:58,235 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:52:58,235 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:52:58,235 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600057121]
[2024-03-09 03:52:58,235 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600057121] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 03:52:58,235 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085646904]
[2024-03-09 03:52:58,235 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-03-09 03:52:58,236 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 03:52:58,236 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 03:52:58,237 INFO  L229       MonitoredProcess]: Starting monitored process 14 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 03:52:58,238 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process
[2024-03-09 03:52:58,458 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-03-09 03:52:58,458 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 03:52:58,460 INFO  L263         TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 33 conjunts are in the unsatisfiable core
[2024-03-09 03:52:58,463 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 03:52:58,468 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 03:52:58,492 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-09 03:52:58,493 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-09 03:52:58,575 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-03-09 03:52:58,601 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-09 03:52:58,636 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2024-03-09 03:52:58,711 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2024-03-09 03:52:58,755 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-03-09 03:52:58,790 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:52:58,790 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 03:52:58,809 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1539 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1539) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_1539 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1539) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_1539 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1539) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_1539 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1539) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)))) is different from false
[2024-03-09 03:52:58,826 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_1539 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1539) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_1539 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1539) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1539 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1539) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)))) (forall ((v_ArrVal_1539 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1539) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)))))) is different from false
[2024-03-09 03:52:58,848 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_1539 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1539) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_1539 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1539) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_1539 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1539) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1539 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1539) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) 0)))))) is different from false
[2024-03-09 03:52:58,869 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse3)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_1539 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1539) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1539 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1539) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1539 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1539) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse3)) 0)) (forall ((v_ArrVal_1539 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1539) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse3)) 0)))))) is different from false
[2024-03-09 03:52:58,892 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse4)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse4)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse4))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) .cse3 0) .cse1 0)))) (and (forall ((v_ArrVal_1539 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1539) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1539 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1539) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1539 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1539) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1539 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1539) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse4)) 0)))))) is different from false
[2024-03-09 03:52:58,911 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:52:58,911 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67
[2024-03-09 03:52:58,918 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:52:58,918 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 39
[2024-03-09 03:52:58,922 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3
[2024-03-09 03:52:58,932 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-09 03:52:58,932 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1
[2024-03-09 03:52:58,939 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-09 03:52:58,939 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-03-09 03:52:58,946 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-09 03:52:58,946 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-03-09 03:52:58,963 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:52:58,963 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085646904] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 03:52:58,963 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 03:52:58,963 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 24
[2024-03-09 03:52:58,964 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995039595]
[2024-03-09 03:52:58,964 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 03:52:58,964 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2024-03-09 03:52:58,964 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:52:58,965 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2024-03-09 03:52:58,965 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=348, Unknown=5, NotChecked=210, Total=650
[2024-03-09 03:52:59,133 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 55 out of 189
[2024-03-09 03:52:59,134 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 5531 transitions, 122113 flow. Second operand  has 26 states, 26 states have (on average 56.69230769230769) internal successors, (1474), 26 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:52:59,134 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:52:59,134 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 189
[2024-03-09 03:52:59,134 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:54:41,802 INFO  L130       PetriNetUnfolder]: 44836/81291 cut-off events.
[2024-03-09 03:54:41,803 INFO  L131       PetriNetUnfolder]: For 2813083/2813139 co-relation queries the response was YES.
[2024-03-09 03:54:43,977 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 899160 conditions, 81291 events. 44836/81291 cut-off events. For 2813083/2813139 co-relation queries the response was YES. Maximal size of possible extension queue 2055. Compared 737973 event pairs, 2965 based on Foata normal form. 87/75462 useless extension candidates. Maximal degree in co-relation 898488. Up to 34134 conditions per place. 
[2024-03-09 03:54:44,457 INFO  L137   encePairwiseOnDemand]: 158/189 looper letters, 3450 selfloop transitions, 2804 changer transitions 0/6258 dead transitions.
[2024-03-09 03:54:44,457 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 481 places, 6258 transitions, 149905 flow
[2024-03-09 03:54:44,458 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. 
[2024-03-09 03:54:44,459 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 30 states.
[2024-03-09 03:54:44,460 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 2081 transitions.
[2024-03-09 03:54:44,461 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.36701940035273367
[2024-03-09 03:54:44,461 INFO  L72            ComplementDD]: Start complementDD. Operand 30 states and 2081 transitions.
[2024-03-09 03:54:44,461 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 30 states and 2081 transitions.
[2024-03-09 03:54:44,461 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:54:44,462 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 2081 transitions.
[2024-03-09 03:54:44,464 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 31 states, 30 states have (on average 69.36666666666666) internal successors, (2081), 30 states have internal predecessors, (2081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:54:44,467 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 31 states, 31 states have (on average 189.0) internal successors, (5859), 31 states have internal predecessors, (5859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:54:44,467 INFO  L81            ComplementDD]: Finished complementDD. Result  has 31 states, 31 states have (on average 189.0) internal successors, (5859), 31 states have internal predecessors, (5859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:54:44,467 INFO  L175             Difference]: Start difference. First operand has 452 places, 5531 transitions, 122113 flow. Second operand 30 states and 2081 transitions.
[2024-03-09 03:54:44,467 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 481 places, 6258 transitions, 149905 flow
[2024-03-09 03:56:13,779 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 6258 transitions, 148419 flow, removed 485 selfloop flow, removed 10 redundant places.
[2024-03-09 03:56:13,882 INFO  L231             Difference]: Finished difference. Result has 484 places, 5819 transitions, 139395 flow
[2024-03-09 03:56:13,886 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=120444, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=5512, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2498, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2824, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=139395, PETRI_PLACES=484, PETRI_TRANSITIONS=5819}
[2024-03-09 03:56:13,886 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 427 predicate places.
[2024-03-09 03:56:13,886 INFO  L495      AbstractCegarLoop]: Abstraction has has 484 places, 5819 transitions, 139395 flow
[2024-03-09 03:56:13,887 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 56.69230769230769) internal successors, (1474), 26 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:56:13,887 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:56:13,887 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:56:13,894 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0
[2024-03-09 03:56:14,087 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21
[2024-03-09 03:56:14,088 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 03:56:14,089 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:56:14,089 INFO  L85        PathProgramCache]: Analyzing trace with hash 2144962269, now seen corresponding path program 1 times
[2024-03-09 03:56:14,090 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:56:14,090 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929638897]
[2024-03-09 03:56:14,090 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:56:14,091 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:56:14,106 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:56:14,243 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-09 03:56:14,244 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:56:14,244 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929638897]
[2024-03-09 03:56:14,244 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929638897] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 03:56:14,244 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 03:56:14,244 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 03:56:14,244 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392580068]
[2024-03-09 03:56:14,244 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 03:56:14,245 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 03:56:14,245 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:56:14,245 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 03:56:14,245 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 03:56:14,461 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 189
[2024-03-09 03:56:14,462 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 5819 transitions, 139395 flow. Second operand  has 6 states, 6 states have (on average 93.0) internal successors, (558), 6 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:56:14,462 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:56:14,462 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 189
[2024-03-09 03:56:14,462 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:57:56,789 INFO  L130       PetriNetUnfolder]: 46391/85778 cut-off events.
[2024-03-09 03:57:56,790 INFO  L131       PetriNetUnfolder]: For 4155394/4174417 co-relation queries the response was YES.
[2024-03-09 03:57:59,309 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 954617 conditions, 85778 events. 46391/85778 cut-off events. For 4155394/4174417 co-relation queries the response was YES. Maximal size of possible extension queue 2296. Compared 808032 event pairs, 4906 based on Foata normal form. 211/83630 useless extension candidates. Maximal degree in co-relation 953773. Up to 55008 conditions per place. 
[2024-03-09 03:57:59,810 INFO  L137   encePairwiseOnDemand]: 174/189 looper letters, 4715 selfloop transitions, 1685 changer transitions 268/7496 dead transitions.
[2024-03-09 03:57:59,810 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 489 places, 7496 transitions, 201684 flow
[2024-03-09 03:57:59,819 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 03:57:59,819 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 03:57:59,820 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 633 transitions.
[2024-03-09 03:57:59,820 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5582010582010583
[2024-03-09 03:57:59,820 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 633 transitions.
[2024-03-09 03:57:59,821 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 633 transitions.
[2024-03-09 03:57:59,821 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:57:59,821 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 633 transitions.
[2024-03-09 03:57:59,822 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:57:59,824 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:57:59,824 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:57:59,824 INFO  L175             Difference]: Start difference. First operand has 484 places, 5819 transitions, 139395 flow. Second operand 6 states and 633 transitions.
[2024-03-09 03:57:59,824 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 489 places, 7496 transitions, 201684 flow
Killed by 15
