./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-array-ptr.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-array-ptr.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 c8d964de1f9939284b07a303cd6738f27ad6151a08cde6c6c589697ec126ba86
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2024-02-28 17:37:19,244 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2024-02-28 17:37:19,246 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2024-02-28 17:37:19,267 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2024-02-28 17:37:19,267 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2024-02-28 17:37:19,268 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2024-02-28 17:37:19,269 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2024-02-28 17:37:19,270 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2024-02-28 17:37:19,271 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2024-02-28 17:37:19,272 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2024-02-28 17:37:19,273 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2024-02-28 17:37:19,274 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2024-02-28 17:37:19,274 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2024-02-28 17:37:19,275 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2024-02-28 17:37:19,276 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2024-02-28 17:37:19,277 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2024-02-28 17:37:19,277 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2024-02-28 17:37:19,278 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2024-02-28 17:37:19,279 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2024-02-28 17:37:19,281 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2024-02-28 17:37:19,282 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2024-02-28 17:37:19,283 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2024-02-28 17:37:19,284 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2024-02-28 17:37:19,285 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2024-02-28 17:37:19,288 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2024-02-28 17:37:19,288 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2024-02-28 17:37:19,288 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2024-02-28 17:37:19,289 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2024-02-28 17:37:19,289 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2024-02-28 17:37:19,290 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2024-02-28 17:37:19,290 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2024-02-28 17:37:19,291 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2024-02-28 17:37:19,292 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2024-02-28 17:37:19,292 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2024-02-28 17:37:19,293 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2024-02-28 17:37:19,293 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2024-02-28 17:37:19,294 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2024-02-28 17:37:19,294 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2024-02-28 17:37:19,294 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2024-02-28 17:37:19,295 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2024-02-28 17:37:19,295 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2024-02-28 17:37:19,296 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-02-28 17:37:19,317 INFO  L113        SettingsManager]: Loading preferences was successful
[2024-02-28 17:37:19,317 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2024-02-28 17:37:19,317 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-02-28 17:37:19,317 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-02-28 17:37:19,318 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-02-28 17:37:19,318 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-02-28 17:37:19,319 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-02-28 17:37:19,319 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2024-02-28 17:37:19,319 INFO  L138        SettingsManager]:  * Use SBE=true
[2024-02-28 17:37:19,319 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-02-28 17:37:19,319 INFO  L138        SettingsManager]:  * sizeof long=4
[2024-02-28 17:37:19,320 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2024-02-28 17:37:19,320 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-02-28 17:37:19,320 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2024-02-28 17:37:19,320 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2024-02-28 17:37:19,320 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-02-28 17:37:19,320 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-02-28 17:37:19,321 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-02-28 17:37:19,321 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-02-28 17:37:19,321 INFO  L138        SettingsManager]:  * sizeof long double=12
[2024-02-28 17:37:19,321 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2024-02-28 17:37:19,321 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2024-02-28 17:37:19,321 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-02-28 17:37:19,322 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-02-28 17:37:19,322 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-02-28 17:37:19,322 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-02-28 17:37:19,322 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-02-28 17:37:19,322 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-02-28 17:37:19,322 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-02-28 17:37:19,323 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2024-02-28 17:37:19,323 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-02-28 17:37:19,323 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-02-28 17:37:19,323 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-02-28 17:37:19,323 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-02-28 17:37:19,323 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-02-28 17:37:19,324 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-02-28 17:37:19,324 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2024-02-28 17:37:19,324 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 -> c8d964de1f9939284b07a303cd6738f27ad6151a08cde6c6c589697ec126ba86
[2024-02-28 17:37:19,496 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-02-28 17:37:19,515 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-02-28 17:37:19,517 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-02-28 17:37:19,517 INFO  L271        PluginConnector]: Initializing CDTParser...
[2024-02-28 17:37:19,519 INFO  L275        PluginConnector]: CDTParser initialized
[2024-02-28 17:37:19,520 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-ptr.i
[2024-02-28 17:37:20,564 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2024-02-28 17:37:20,781 INFO  L351              CDTParser]: Found 1 translation units.
[2024-02-28 17:37:20,781 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-ptr.i
[2024-02-28 17:37:20,791 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/9ee4ca132/f925011f0e4c4ef58ed54aa91920df13/FLAG4ab856618
[2024-02-28 17:37:21,161 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/9ee4ca132/f925011f0e4c4ef58ed54aa91920df13
[2024-02-28 17:37:21,166 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-02-28 17:37:21,167 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-02-28 17:37:21,168 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-02-28 17:37:21,169 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-02-28 17:37:21,173 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-02-28 17:37:21,174 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.02 05:37:21" (1/1) ...
[2024-02-28 17:37:21,175 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d4bcfa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:37:21, skipping insertion in model container
[2024-02-28 17:37:21,176 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.02 05:37:21" (1/1) ...
[2024-02-28 17:37:21,181 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2024-02-28 17:37:21,220 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2024-02-28 17:37:21,332 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-02-28 17:37:21,462 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-02-28 17:37:21,468 INFO  L203         MainTranslator]: Completed pre-run
[2024-02-28 17:37:21,478 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-02-28 17:37:21,511 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-02-28 17:37:21,553 INFO  L208         MainTranslator]: Completed translation
[2024-02-28 17:37:21,553 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:37:21 WrapperNode
[2024-02-28 17:37:21,553 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-02-28 17:37:21,554 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-02-28 17:37:21,554 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-02-28 17:37:21,555 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2024-02-28 17:37:21,560 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:37:21" (1/1) ...
[2024-02-28 17:37:21,576 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:37:21" (1/1) ...
[2024-02-28 17:37:21,601 INFO  L138                Inliner]: procedures = 266, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 97
[2024-02-28 17:37:21,602 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-02-28 17:37:21,602 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-02-28 17:37:21,603 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2024-02-28 17:37:21,603 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2024-02-28 17:37:21,611 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:37:21" (1/1) ...
[2024-02-28 17:37:21,611 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:37:21" (1/1) ...
[2024-02-28 17:37:21,614 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:37:21" (1/1) ...
[2024-02-28 17:37:21,615 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:37:21" (1/1) ...
[2024-02-28 17:37:21,622 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:37:21" (1/1) ...
[2024-02-28 17:37:21,625 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:37:21" (1/1) ...
[2024-02-28 17:37:21,627 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:37:21" (1/1) ...
[2024-02-28 17:37:21,628 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:37:21" (1/1) ...
[2024-02-28 17:37:21,631 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-02-28 17:37:21,631 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-02-28 17:37:21,632 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2024-02-28 17:37:21,632 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2024-02-28 17:37:21,632 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:37:21" (1/1) ...
[2024-02-28 17:37:21,637 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-02-28 17:37:21,646 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:37:21,659 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-02-28 17:37:21,667 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-02-28 17:37:21,692 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-02-28 17:37:21,692 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-02-28 17:37:21,692 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-02-28 17:37:21,692 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-02-28 17:37:21,693 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-02-28 17:37:21,693 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-02-28 17:37:21,693 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-02-28 17:37:21,693 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-02-28 17:37:21,693 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-02-28 17:37:21,693 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-02-28 17:37:21,694 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-02-28 17:37:21,695 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2024-02-28 17:37:21,842 INFO  L235             CfgBuilder]: Building ICFG
[2024-02-28 17:37:21,844 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-02-28 17:37:22,023 INFO  L276             CfgBuilder]: Performing block encoding
[2024-02-28 17:37:22,029 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-02-28 17:37:22,030 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2024-02-28 17:37:22,031 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 05:37:22 BoogieIcfgContainer
[2024-02-28 17:37:22,032 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-02-28 17:37:22,033 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-02-28 17:37:22,033 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2024-02-28 17:37:22,036 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2024-02-28 17:37:22,036 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.02 05:37:21" (1/3) ...
[2024-02-28 17:37:22,036 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74e650f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 05:37:22, skipping insertion in model container
[2024-02-28 17:37:22,037 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:37:21" (2/3) ...
[2024-02-28 17:37:22,037 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74e650f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 05:37:22, skipping insertion in model container
[2024-02-28 17:37:22,037 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 05:37:22" (3/3) ...
[2024-02-28 17:37:22,038 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-array-ptr.i
[2024-02-28 17:37:22,044 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-02-28 17:37:22,051 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-02-28 17:37:22,052 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations.
[2024-02-28 17:37:22,052 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-02-28 17:37:22,097 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-02-28 17:37:22,135 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 121 places, 122 transitions, 252 flow
[2024-02-28 17:37:22,187 INFO  L130       PetriNetUnfolder]: 6/186 cut-off events.
[2024-02-28 17:37:22,187 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-02-28 17:37:22,192 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 192 conditions, 186 events. 6/186 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 364 event pairs, 0 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 92. Up to 4 conditions per place. 
[2024-02-28 17:37:22,192 INFO  L82        GeneralOperation]: Start removeDead. Operand has 121 places, 122 transitions, 252 flow
[2024-02-28 17:37:22,196 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 121 places, 122 transitions, 252 flow
[2024-02-28 17:37:22,199 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-02-28 17:37:22,206 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 122 transitions, 252 flow
[2024-02-28 17:37:22,208 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 122 transitions, 252 flow
[2024-02-28 17:37:22,209 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 121 places, 122 transitions, 252 flow
[2024-02-28 17:37:22,237 INFO  L130       PetriNetUnfolder]: 6/186 cut-off events.
[2024-02-28 17:37:22,237 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-02-28 17:37:22,238 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 192 conditions, 186 events. 6/186 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 364 event pairs, 0 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 92. Up to 4 conditions per place. 
[2024-02-28 17:37:22,239 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2160
[2024-02-28 17:37:24,663 INFO  L134        LiptonReduction]: Checked pairs total: 9489
[2024-02-28 17:37:24,664 INFO  L136        LiptonReduction]: Total number of compositions: 75
[2024-02-28 17:37:24,677 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-02-28 17:37:24,683 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;@12facf47, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-02-28 17:37:24,683 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 9 error locations.
[2024-02-28 17:37:24,686 INFO  L130       PetriNetUnfolder]: 0/15 cut-off events.
[2024-02-28 17:37:24,687 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-02-28 17:37:24,687 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:37:24,687 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:37:24,688 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-02-28 17:37:24,692 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:37:24,692 INFO  L85        PathProgramCache]: Analyzing trace with hash 1980212676, now seen corresponding path program 1 times
[2024-02-28 17:37:24,699 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:37:24,700 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892322247]
[2024-02-28 17:37:24,700 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:37:24,700 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:37:24,798 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:37:25,139 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:37:25,139 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:37:25,140 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892322247]
[2024-02-28 17:37:25,140 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892322247] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:37:25,140 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:37:25,141 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:37:25,142 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535318606]
[2024-02-28 17:37:25,142 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:37:25,149 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:37:25,149 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:37:25,164 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:37:25,165 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:37:25,505 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 197
[2024-02-28 17:37:25,508 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 122 flow. Second operand  has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 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-02-28 17:37:25,508 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:37:25,509 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 197
[2024-02-28 17:37:25,509 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:37:25,736 INFO  L130       PetriNetUnfolder]: 146/507 cut-off events.
[2024-02-28 17:37:25,736 INFO  L131       PetriNetUnfolder]: For 4/8 co-relation queries the response was YES.
[2024-02-28 17:37:25,737 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 870 conditions, 507 events. 146/507 cut-off events. For 4/8 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2712 event pairs, 42 based on Foata normal form. 0/462 useless extension candidates. Maximal degree in co-relation 784. Up to 226 conditions per place. 
[2024-02-28 17:37:25,740 INFO  L137   encePairwiseOnDemand]: 181/197 looper letters, 47 selfloop transitions, 23 changer transitions 0/98 dead transitions.
[2024-02-28 17:37:25,740 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 98 transitions, 344 flow
[2024-02-28 17:37:25,742 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:37:25,743 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:37:25,751 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 660 transitions.
[2024-02-28 17:37:25,754 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5583756345177665
[2024-02-28 17:37:25,755 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 660 transitions.
[2024-02-28 17:37:25,755 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 660 transitions.
[2024-02-28 17:37:25,757 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:37:25,759 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 660 transitions.
[2024-02-28 17:37:25,764 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 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-02-28 17:37:25,769 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 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-02-28 17:37:25,770 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 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-02-28 17:37:25,771 INFO  L175             Difference]: Start difference. First operand has 59 places, 57 transitions, 122 flow. Second operand 6 states and 660 transitions.
[2024-02-28 17:37:25,772 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 98 transitions, 344 flow
[2024-02-28 17:37:25,775 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 98 transitions, 344 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:37:25,777 INFO  L231             Difference]: Finished difference. Result has 69 places, 80 transitions, 292 flow
[2024-02-28 17:37:25,779 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=292, PETRI_PLACES=69, PETRI_TRANSITIONS=80}
[2024-02-28 17:37:25,782 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 10 predicate places.
[2024-02-28 17:37:25,782 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 80 transitions, 292 flow
[2024-02-28 17:37:25,783 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 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-02-28 17:37:25,783 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:37:25,783 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:37:25,783 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-02-28 17:37:25,783 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-02-28 17:37:25,784 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:37:25,784 INFO  L85        PathProgramCache]: Analyzing trace with hash 1641346575, now seen corresponding path program 1 times
[2024-02-28 17:37:25,784 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:37:25,785 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99123066]
[2024-02-28 17:37:25,785 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:37:25,785 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:37:25,799 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:37:25,950 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:37:25,951 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:37:25,951 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99123066]
[2024-02-28 17:37:25,951 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99123066] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:37:25,951 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:37:25,951 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:37:25,952 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378399912]
[2024-02-28 17:37:25,952 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:37:25,953 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:37:25,953 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:37:25,954 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:37:25,954 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:37:26,196 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 92 out of 197
[2024-02-28 17:37:26,197 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 80 transitions, 292 flow. Second operand  has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 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-02-28 17:37:26,197 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:37:26,197 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 197
[2024-02-28 17:37:26,197 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:37:26,439 INFO  L130       PetriNetUnfolder]: 284/850 cut-off events.
[2024-02-28 17:37:26,439 INFO  L131       PetriNetUnfolder]: For 332/338 co-relation queries the response was YES.
[2024-02-28 17:37:26,442 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2021 conditions, 850 events. 284/850 cut-off events. For 332/338 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5116 event pairs, 51 based on Foata normal form. 5/813 useless extension candidates. Maximal degree in co-relation 1873. Up to 398 conditions per place. 
[2024-02-28 17:37:26,445 INFO  L137   encePairwiseOnDemand]: 174/197 looper letters, 73 selfloop transitions, 50 changer transitions 0/152 dead transitions.
[2024-02-28 17:37:26,445 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 152 transitions, 799 flow
[2024-02-28 17:37:26,447 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:37:26,447 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:37:26,449 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 643 transitions.
[2024-02-28 17:37:26,450 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5439932318104906
[2024-02-28 17:37:26,450 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 643 transitions.
[2024-02-28 17:37:26,451 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 643 transitions.
[2024-02-28 17:37:26,451 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:37:26,451 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 643 transitions.
[2024-02-28 17:37:26,453 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 107.16666666666667) internal successors, (643), 6 states have internal predecessors, (643), 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-02-28 17:37:26,454 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 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-02-28 17:37:26,455 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 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-02-28 17:37:26,455 INFO  L175             Difference]: Start difference. First operand has 69 places, 80 transitions, 292 flow. Second operand 6 states and 643 transitions.
[2024-02-28 17:37:26,456 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 152 transitions, 799 flow
[2024-02-28 17:37:26,459 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 152 transitions, 799 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:37:26,461 INFO  L231             Difference]: Finished difference. Result has 79 places, 129 transitions, 770 flow
[2024-02-28 17:37:26,461 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=770, PETRI_PLACES=79, PETRI_TRANSITIONS=129}
[2024-02-28 17:37:26,462 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 20 predicate places.
[2024-02-28 17:37:26,462 INFO  L495      AbstractCegarLoop]: Abstraction has has 79 places, 129 transitions, 770 flow
[2024-02-28 17:37:26,463 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 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-02-28 17:37:26,463 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:37:26,463 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:37:26,463 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-02-28 17:37:26,463 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-02-28 17:37:26,464 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:37:26,464 INFO  L85        PathProgramCache]: Analyzing trace with hash 61135557, now seen corresponding path program 1 times
[2024-02-28 17:37:26,464 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:37:26,464 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395016840]
[2024-02-28 17:37:26,464 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:37:26,465 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:37:26,483 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:37:26,663 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:37:26,663 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:37:26,664 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395016840]
[2024-02-28 17:37:26,664 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395016840] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:37:26,664 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:37:26,665 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:37:26,665 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558472604]
[2024-02-28 17:37:26,666 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:37:26,666 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:37:26,666 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:37:26,667 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:37:26,667 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:37:26,935 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 102 out of 197
[2024-02-28 17:37:26,936 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 129 transitions, 770 flow. Second operand  has 6 states, 6 states have (on average 103.33333333333333) internal successors, (620), 6 states have internal predecessors, (620), 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-02-28 17:37:26,936 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:37:26,936 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 197
[2024-02-28 17:37:26,936 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:37:27,154 INFO  L130       PetriNetUnfolder]: 280/858 cut-off events.
[2024-02-28 17:37:27,154 INFO  L131       PetriNetUnfolder]: For 1118/1126 co-relation queries the response was YES.
[2024-02-28 17:37:27,156 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2591 conditions, 858 events. 280/858 cut-off events. For 1118/1126 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5295 event pairs, 47 based on Foata normal form. 1/832 useless extension candidates. Maximal degree in co-relation 2418. Up to 429 conditions per place. 
[2024-02-28 17:37:27,159 INFO  L137   encePairwiseOnDemand]: 186/197 looper letters, 76 selfloop transitions, 33 changer transitions 8/171 dead transitions.
[2024-02-28 17:37:27,159 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 171 transitions, 1243 flow
[2024-02-28 17:37:27,160 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:37:27,161 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:37:27,162 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 668 transitions.
[2024-02-28 17:37:27,162 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5651438240270727
[2024-02-28 17:37:27,163 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 668 transitions.
[2024-02-28 17:37:27,163 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 668 transitions.
[2024-02-28 17:37:27,163 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:37:27,163 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 668 transitions.
[2024-02-28 17:37:27,165 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 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-02-28 17:37:27,166 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 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-02-28 17:37:27,167 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 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-02-28 17:37:27,167 INFO  L175             Difference]: Start difference. First operand has 79 places, 129 transitions, 770 flow. Second operand 6 states and 668 transitions.
[2024-02-28 17:37:27,167 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 171 transitions, 1243 flow
[2024-02-28 17:37:27,171 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 171 transitions, 1243 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:37:27,173 INFO  L231             Difference]: Finished difference. Result has 89 places, 159 transitions, 1135 flow
[2024-02-28 17:37:27,174 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1135, PETRI_PLACES=89, PETRI_TRANSITIONS=159}
[2024-02-28 17:37:27,174 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 30 predicate places.
[2024-02-28 17:37:27,175 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 159 transitions, 1135 flow
[2024-02-28 17:37:27,175 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 103.33333333333333) internal successors, (620), 6 states have internal predecessors, (620), 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-02-28 17:37:27,175 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:37:27,175 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-02-28 17:37:27,176 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-02-28 17:37:27,176 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-02-28 17:37:27,176 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:37:27,176 INFO  L85        PathProgramCache]: Analyzing trace with hash -1282532369, now seen corresponding path program 1 times
[2024-02-28 17:37:27,176 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:37:27,177 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99547573]
[2024-02-28 17:37:27,177 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:37:27,177 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:37:27,203 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:37:27,399 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:37:27,399 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:37:27,399 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99547573]
[2024-02-28 17:37:27,400 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99547573] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:37:27,400 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:37:27,400 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:37:27,400 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004272470]
[2024-02-28 17:37:27,400 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:37:27,401 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:37:27,401 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:37:27,401 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:37:27,401 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:37:27,523 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 84 out of 197
[2024-02-28 17:37:27,524 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 159 transitions, 1135 flow. Second operand  has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 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-02-28 17:37:27,524 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:37:27,524 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 197
[2024-02-28 17:37:27,524 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:37:27,924 INFO  L130       PetriNetUnfolder]: 536/1340 cut-off events.
[2024-02-28 17:37:27,925 INFO  L131       PetriNetUnfolder]: For 1846/1860 co-relation queries the response was YES.
[2024-02-28 17:37:27,927 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4866 conditions, 1340 events. 536/1340 cut-off events. For 1846/1860 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 8489 event pairs, 92 based on Foata normal form. 0/1253 useless extension candidates. Maximal degree in co-relation 4685. Up to 994 conditions per place. 
[2024-02-28 17:37:27,932 INFO  L137   encePairwiseOnDemand]: 167/197 looper letters, 167 selfloop transitions, 111 changer transitions 10/304 dead transitions.
[2024-02-28 17:37:27,932 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 304 transitions, 2365 flow
[2024-02-28 17:37:27,934 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:37:27,934 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:37:27,935 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 683 transitions.
[2024-02-28 17:37:27,936 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.577834179357022
[2024-02-28 17:37:27,936 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 683 transitions.
[2024-02-28 17:37:27,936 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 683 transitions.
[2024-02-28 17:37:27,937 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:37:27,937 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 683 transitions.
[2024-02-28 17:37:27,938 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 113.83333333333333) internal successors, (683), 6 states have internal predecessors, (683), 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-02-28 17:37:27,940 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 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-02-28 17:37:27,941 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 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-02-28 17:37:27,941 INFO  L175             Difference]: Start difference. First operand has 89 places, 159 transitions, 1135 flow. Second operand 6 states and 683 transitions.
[2024-02-28 17:37:27,941 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 304 transitions, 2365 flow
[2024-02-28 17:37:27,947 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 304 transitions, 2365 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:37:27,951 INFO  L231             Difference]: Finished difference. Result has 97 places, 262 transitions, 2045 flow
[2024-02-28 17:37:27,952 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=1135, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2045, PETRI_PLACES=97, PETRI_TRANSITIONS=262}
[2024-02-28 17:37:27,952 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 38 predicate places.
[2024-02-28 17:37:27,953 INFO  L495      AbstractCegarLoop]: Abstraction has has 97 places, 262 transitions, 2045 flow
[2024-02-28 17:37:27,953 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 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-02-28 17:37:27,953 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:37:27,953 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:37:27,953 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-02-28 17:37:27,954 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-02-28 17:37:27,954 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:37:27,954 INFO  L85        PathProgramCache]: Analyzing trace with hash 1889096930, now seen corresponding path program 1 times
[2024-02-28 17:37:27,954 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:37:27,954 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205986018]
[2024-02-28 17:37:27,955 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:37:27,955 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:37:27,972 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:37:28,330 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:37:28,331 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:37:28,331 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205986018]
[2024-02-28 17:37:28,331 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205986018] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:37:28,331 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619850639]
[2024-02-28 17:37:28,331 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:37:28,332 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:37:28,332 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:37:28,333 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-02-28 17:37:28,346 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-02-28 17:37:28,463 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:37:28,479 INFO  L263         TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 26 conjunts are in the unsatisfiable core
[2024-02-28 17:37:28,487 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:37:28,547 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 17 treesize of output 9
[2024-02-28 17:37:28,672 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 17:37:28,705 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:37:28,706 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 21 treesize of output 20
[2024-02-28 17:37:28,741 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:37:28,743 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:37:28,744 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-02-28 17:37:28,799 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:37:28,800 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:37:28,801 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:37:28,802 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 0 case distinctions, treesize of input 39 treesize of output 44
[2024-02-28 17:37:28,854 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:37:28,855 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 41 treesize of output 37
[2024-02-28 17:37:28,883 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:37:28,883 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 17:37:28,920 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3)) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) 0))) is different from false
[2024-02-28 17:37:28,965 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0))))) is different from false
[2024-02-28 17:37:29,142 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-02-28 17:37:29,142 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [619850639] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 17:37:29,142 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 17:37:29,143 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24
[2024-02-28 17:37:29,143 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487767473]
[2024-02-28 17:37:29,143 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 17:37:29,144 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2024-02-28 17:37:29,144 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:37:29,145 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2024-02-28 17:37:29,146 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=459, Unknown=2, NotChecked=90, Total=650
[2024-02-28 17:37:29,244 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 59 out of 197
[2024-02-28 17:37:29,246 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 262 transitions, 2045 flow. Second operand  has 26 states, 26 states have (on average 61.57692307692308) internal successors, (1601), 26 states have internal predecessors, (1601), 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-02-28 17:37:29,246 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:37:29,247 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 197
[2024-02-28 17:37:29,247 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:37:30,180 INFO  L130       PetriNetUnfolder]: 631/1461 cut-off events.
[2024-02-28 17:37:30,180 INFO  L131       PetriNetUnfolder]: For 3916/3922 co-relation queries the response was YES.
[2024-02-28 17:37:30,185 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6505 conditions, 1461 events. 631/1461 cut-off events. For 3916/3922 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 9098 event pairs, 154 based on Foata normal form. 10/1371 useless extension candidates. Maximal degree in co-relation 6378. Up to 1331 conditions per place. 
[2024-02-28 17:37:30,191 INFO  L137   encePairwiseOnDemand]: 187/197 looper letters, 304 selfloop transitions, 12 changer transitions 12/330 dead transitions.
[2024-02-28 17:37:30,191 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 330 transitions, 3086 flow
[2024-02-28 17:37:30,192 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-02-28 17:37:30,192 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-02-28 17:37:30,193 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 709 transitions.
[2024-02-28 17:37:30,194 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3598984771573604
[2024-02-28 17:37:30,194 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 709 transitions.
[2024-02-28 17:37:30,194 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 709 transitions.
[2024-02-28 17:37:30,194 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:37:30,194 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 709 transitions.
[2024-02-28 17:37:30,196 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 70.9) internal successors, (709), 10 states have internal predecessors, (709), 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-02-28 17:37:30,198 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 197.0) internal successors, (2167), 11 states have internal predecessors, (2167), 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-02-28 17:37:30,198 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 197.0) internal successors, (2167), 11 states have internal predecessors, (2167), 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-02-28 17:37:30,199 INFO  L175             Difference]: Start difference. First operand has 97 places, 262 transitions, 2045 flow. Second operand 10 states and 709 transitions.
[2024-02-28 17:37:30,199 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 330 transitions, 3086 flow
[2024-02-28 17:37:30,217 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 330 transitions, 2942 flow, removed 72 selfloop flow, removed 0 redundant places.
[2024-02-28 17:37:30,221 INFO  L231             Difference]: Finished difference. Result has 107 places, 265 transitions, 1941 flow
[2024-02-28 17:37:30,222 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=1893, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1941, PETRI_PLACES=107, PETRI_TRANSITIONS=265}
[2024-02-28 17:37:30,222 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 48 predicate places.
[2024-02-28 17:37:30,222 INFO  L495      AbstractCegarLoop]: Abstraction has has 107 places, 265 transitions, 1941 flow
[2024-02-28 17:37:30,223 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 61.57692307692308) internal successors, (1601), 26 states have internal predecessors, (1601), 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-02-28 17:37:30,223 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:37:30,223 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:37:30,235 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-02-28 17:37:30,429 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:37:30,430 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-02-28 17:37:30,430 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:37:30,431 INFO  L85        PathProgramCache]: Analyzing trace with hash 109794428, now seen corresponding path program 1 times
[2024-02-28 17:37:30,431 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:37:30,431 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623315582]
[2024-02-28 17:37:30,431 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:37:30,431 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:37:30,454 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:37:30,797 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:37:30,797 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:37:30,797 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623315582]
[2024-02-28 17:37:30,797 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623315582] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:37:30,798 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659679742]
[2024-02-28 17:37:30,798 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:37:30,798 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:37:30,798 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:37:30,799 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-02-28 17:37:30,801 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-02-28 17:37:30,927 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:37:30,929 INFO  L263         TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 28 conjunts are in the unsatisfiable core
[2024-02-28 17:37:30,931 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:37:30,956 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 17 treesize of output 9
[2024-02-28 17:37:31,017 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 17:37:31,054 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 21 treesize of output 20
[2024-02-28 17:37:31,087 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:37:31,087 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 32
[2024-02-28 17:37:31,131 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:37:31,131 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 39 treesize of output 44
[2024-02-28 17:37:31,195 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:37:31,196 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 41 treesize of output 37
[2024-02-28 17:37:31,205 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:37:31,205 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 17:37:31,229 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false
[2024-02-28 17:37:31,285 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_350 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2024-02-28 17:37:31,305 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) .cse2)))))) is different from false
[2024-02-28 17:37:31,364 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2024-02-28 17:37:31,365 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659679742] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 17:37:31,365 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 17:37:31,365 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21
[2024-02-28 17:37:31,365 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121416112]
[2024-02-28 17:37:31,365 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 17:37:31,366 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 23 states
[2024-02-28 17:37:31,366 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:37:31,366 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2024-02-28 17:37:31,367 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=304, Unknown=3, NotChecked=114, Total=506
[2024-02-28 17:37:31,479 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 197
[2024-02-28 17:37:31,481 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 265 transitions, 1941 flow. Second operand  has 23 states, 23 states have (on average 59.869565217391305) internal successors, (1377), 23 states have internal predecessors, (1377), 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-02-28 17:37:31,481 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:37:31,481 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 197
[2024-02-28 17:37:31,481 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:37:34,212 INFO  L130       PetriNetUnfolder]: 720/1653 cut-off events.
[2024-02-28 17:37:34,212 INFO  L131       PetriNetUnfolder]: For 3859/3865 co-relation queries the response was YES.
[2024-02-28 17:37:34,216 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7496 conditions, 1653 events. 720/1653 cut-off events. For 3859/3865 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 10567 event pairs, 75 based on Foata normal form. 2/1572 useless extension candidates. Maximal degree in co-relation 7351. Up to 979 conditions per place. 
[2024-02-28 17:37:34,222 INFO  L137   encePairwiseOnDemand]: 146/197 looper letters, 279 selfloop transitions, 236 changer transitions 41/558 dead transitions.
[2024-02-28 17:37:34,222 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 558 transitions, 4800 flow
[2024-02-28 17:37:34,223 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2024-02-28 17:37:34,223 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2024-02-28 17:37:34,226 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1554 transitions.
[2024-02-28 17:37:34,227 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3756345177664975
[2024-02-28 17:37:34,227 INFO  L72            ComplementDD]: Start complementDD. Operand 21 states and 1554 transitions.
[2024-02-28 17:37:34,227 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 21 states and 1554 transitions.
[2024-02-28 17:37:34,228 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:37:34,228 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1554 transitions.
[2024-02-28 17:37:34,230 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 22 states, 21 states have (on average 74.0) internal successors, (1554), 21 states have internal predecessors, (1554), 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-02-28 17:37:34,234 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 22 states, 22 states have (on average 197.0) internal successors, (4334), 22 states have internal predecessors, (4334), 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-02-28 17:37:34,235 INFO  L81            ComplementDD]: Finished complementDD. Result  has 22 states, 22 states have (on average 197.0) internal successors, (4334), 22 states have internal predecessors, (4334), 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-02-28 17:37:34,235 INFO  L175             Difference]: Start difference. First operand has 107 places, 265 transitions, 1941 flow. Second operand 21 states and 1554 transitions.
[2024-02-28 17:37:34,235 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 558 transitions, 4800 flow
[2024-02-28 17:37:34,251 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 558 transitions, 4770 flow, removed 0 selfloop flow, removed 4 redundant places.
[2024-02-28 17:37:34,257 INFO  L231             Difference]: Finished difference. Result has 131 places, 395 transitions, 3786 flow
[2024-02-28 17:37:34,257 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=1930, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=3786, PETRI_PLACES=131, PETRI_TRANSITIONS=395}
[2024-02-28 17:37:34,258 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 72 predicate places.
[2024-02-28 17:37:34,258 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 395 transitions, 3786 flow
[2024-02-28 17:37:34,258 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 23 states, 23 states have (on average 59.869565217391305) internal successors, (1377), 23 states have internal predecessors, (1377), 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-02-28 17:37:34,258 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:37:34,258 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-02-28 17:37:34,265 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-02-28 17:37:34,459 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:37:34,463 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-02-28 17:37:34,463 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:37:34,463 INFO  L85        PathProgramCache]: Analyzing trace with hash -2068764240, now seen corresponding path program 1 times
[2024-02-28 17:37:34,463 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:37:34,464 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588457762]
[2024-02-28 17:37:34,464 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:37:34,464 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:37:34,485 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:37:34,552 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:37:34,552 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:37:34,552 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588457762]
[2024-02-28 17:37:34,552 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588457762] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:37:34,552 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506266139]
[2024-02-28 17:37:34,552 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:37:34,552 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:37:34,552 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:37:34,553 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-02-28 17:37:34,565 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-02-28 17:37:34,653 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:37:34,654 INFO  L263         TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 4 conjunts are in the unsatisfiable core
[2024-02-28 17:37:34,656 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:37:34,687 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:37:34,688 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 17:37:34,718 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:37:34,718 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [506266139] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 17:37:34,718 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 17:37:34,718 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2024-02-28 17:37:34,718 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054955757]
[2024-02-28 17:37:34,719 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 17:37:34,719 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-02-28 17:37:34,719 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:37:34,720 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-02-28 17:37:34,720 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-02-28 17:37:34,802 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 107 out of 197
[2024-02-28 17:37:34,803 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 395 transitions, 3786 flow. Second operand  has 9 states, 9 states have (on average 109.22222222222223) internal successors, (983), 9 states have internal predecessors, (983), 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-02-28 17:37:34,803 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:37:34,803 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 197
[2024-02-28 17:37:34,804 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:37:34,943 INFO  L130       PetriNetUnfolder]: 322/901 cut-off events.
[2024-02-28 17:37:34,943 INFO  L131       PetriNetUnfolder]: For 3755/3789 co-relation queries the response was YES.
[2024-02-28 17:37:34,946 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4681 conditions, 901 events. 322/901 cut-off events. For 3755/3789 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5583 event pairs, 11 based on Foata normal form. 16/905 useless extension candidates. Maximal degree in co-relation 4536. Up to 295 conditions per place. 
[2024-02-28 17:37:34,949 INFO  L137   encePairwiseOnDemand]: 191/197 looper letters, 31 selfloop transitions, 12 changer transitions 3/294 dead transitions.
[2024-02-28 17:37:34,949 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 294 transitions, 2894 flow
[2024-02-28 17:37:34,950 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-02-28 17:37:34,950 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-02-28 17:37:34,951 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 770 transitions.
[2024-02-28 17:37:34,951 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5583756345177665
[2024-02-28 17:37:34,951 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 770 transitions.
[2024-02-28 17:37:34,951 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 770 transitions.
[2024-02-28 17:37:34,952 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:37:34,952 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 770 transitions.
[2024-02-28 17:37:34,953 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 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-02-28 17:37:34,955 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 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-02-28 17:37:34,955 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 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-02-28 17:37:34,955 INFO  L175             Difference]: Start difference. First operand has 131 places, 395 transitions, 3786 flow. Second operand 7 states and 770 transitions.
[2024-02-28 17:37:34,955 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 294 transitions, 2894 flow
[2024-02-28 17:37:34,978 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 294 transitions, 2722 flow, removed 63 selfloop flow, removed 8 redundant places.
[2024-02-28 17:37:34,981 INFO  L231             Difference]: Finished difference. Result has 117 places, 286 transitions, 2600 flow
[2024-02-28 17:37:34,981 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=2580, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2600, PETRI_PLACES=117, PETRI_TRANSITIONS=286}
[2024-02-28 17:37:34,982 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 58 predicate places.
[2024-02-28 17:37:34,982 INFO  L495      AbstractCegarLoop]: Abstraction has has 117 places, 286 transitions, 2600 flow
[2024-02-28 17:37:34,982 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 109.22222222222223) internal successors, (983), 9 states have internal predecessors, (983), 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-02-28 17:37:34,982 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:37:34,982 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-02-28 17:37:34,989 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-02-28 17:37:35,184 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:37:35,184 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-02-28 17:37:35,185 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:37:35,185 INFO  L85        PathProgramCache]: Analyzing trace with hash 2139930529, now seen corresponding path program 1 times
[2024-02-28 17:37:35,185 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:37:35,186 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460258043]
[2024-02-28 17:37:35,186 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:37:35,186 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:37:35,206 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:37:35,503 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:37:35,503 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:37:35,503 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460258043]
[2024-02-28 17:37:35,503 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460258043] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:37:35,504 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123864641]
[2024-02-28 17:37:35,504 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:37:35,504 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:37:35,504 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:37:35,505 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-02-28 17:37:35,505 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-02-28 17:37:35,630 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:37:35,632 INFO  L263         TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 24 conjunts are in the unsatisfiable core
[2024-02-28 17:37:35,636 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:37:35,667 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 17 treesize of output 9
[2024-02-28 17:37:35,756 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 17:37:35,796 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 21 treesize of output 20
[2024-02-28 17:37:35,826 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:37:35,826 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 32
[2024-02-28 17:37:35,871 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:37:35,871 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 39 treesize of output 44
[2024-02-28 17:37:35,933 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:37:35,934 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 41 treesize of output 37
[2024-02-28 17:37:35,947 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:37:35,947 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 17:37:35,968 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_567 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)))) is different from false
[2024-02-28 17:37:35,994 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_567 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2024-02-28 17:37:36,015 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_567 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_567 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2024-02-28 17:37:36,154 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:37:36,155 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123864641] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 17:37:36,155 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 17:37:36,155 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24
[2024-02-28 17:37:36,155 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128127379]
[2024-02-28 17:37:36,155 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 17:37:36,156 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2024-02-28 17:37:36,156 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:37:36,157 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2024-02-28 17:37:36,157 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=418, Unknown=3, NotChecked=132, Total=650
[2024-02-28 17:37:36,196 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 54 out of 197
[2024-02-28 17:37:36,198 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 286 transitions, 2600 flow. Second operand  has 26 states, 26 states have (on average 56.65384615384615) internal successors, (1473), 26 states have internal predecessors, (1473), 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-02-28 17:37:36,198 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:37:36,198 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 197
[2024-02-28 17:37:36,198 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:37:38,488 INFO  L130       PetriNetUnfolder]: 532/1249 cut-off events.
[2024-02-28 17:37:38,489 INFO  L131       PetriNetUnfolder]: For 5011/5011 co-relation queries the response was YES.
[2024-02-28 17:37:38,493 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6797 conditions, 1249 events. 532/1249 cut-off events. For 5011/5011 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 7590 event pairs, 30 based on Foata normal form. 43/1292 useless extension candidates. Maximal degree in co-relation 6640. Up to 666 conditions per place. 
[2024-02-28 17:37:38,500 INFO  L137   encePairwiseOnDemand]: 160/197 looper letters, 276 selfloop transitions, 203 changer transitions 6/487 dead transitions.
[2024-02-28 17:37:38,500 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 487 transitions, 5040 flow
[2024-02-28 17:37:38,501 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2024-02-28 17:37:38,501 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20 states.
[2024-02-28 17:37:38,504 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1342 transitions.
[2024-02-28 17:37:38,504 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.34060913705583756
[2024-02-28 17:37:38,504 INFO  L72            ComplementDD]: Start complementDD. Operand 20 states and 1342 transitions.
[2024-02-28 17:37:38,504 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 20 states and 1342 transitions.
[2024-02-28 17:37:38,505 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:37:38,505 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1342 transitions.
[2024-02-28 17:37:38,508 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 21 states, 20 states have (on average 67.1) internal successors, (1342), 20 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-02-28 17:37:38,512 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 21 states, 21 states have (on average 197.0) internal successors, (4137), 21 states have internal predecessors, (4137), 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-02-28 17:37:38,513 INFO  L81            ComplementDD]: Finished complementDD. Result  has 21 states, 21 states have (on average 197.0) internal successors, (4137), 21 states have internal predecessors, (4137), 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-02-28 17:37:38,513 INFO  L175             Difference]: Start difference. First operand has 117 places, 286 transitions, 2600 flow. Second operand 20 states and 1342 transitions.
[2024-02-28 17:37:38,513 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 487 transitions, 5040 flow
[2024-02-28 17:37:38,540 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 487 transitions, 5016 flow, removed 6 selfloop flow, removed 4 redundant places.
[2024-02-28 17:37:38,548 INFO  L231             Difference]: Finished difference. Result has 137 places, 364 transitions, 4084 flow
[2024-02-28 17:37:38,548 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=2586, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=4084, PETRI_PLACES=137, PETRI_TRANSITIONS=364}
[2024-02-28 17:37:38,550 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 78 predicate places.
[2024-02-28 17:37:38,550 INFO  L495      AbstractCegarLoop]: Abstraction has has 137 places, 364 transitions, 4084 flow
[2024-02-28 17:37:38,551 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 56.65384615384615) internal successors, (1473), 26 states have internal predecessors, (1473), 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-02-28 17:37:38,551 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:37:38,551 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-02-28 17:37:38,556 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-02-28 17:37:38,751 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:37:38,752 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-02-28 17:37:38,753 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:37:38,753 INFO  L85        PathProgramCache]: Analyzing trace with hash -920454980, now seen corresponding path program 1 times
[2024-02-28 17:37:38,753 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:37:38,753 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916618580]
[2024-02-28 17:37:38,753 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:37:38,754 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:37:38,785 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:37:39,101 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:37:39,101 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:37:39,101 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916618580]
[2024-02-28 17:37:39,102 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916618580] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:37:39,102 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914073893]
[2024-02-28 17:37:39,102 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:37:39,102 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:37:39,102 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:37:39,104 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-02-28 17:37:39,113 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-02-28 17:37:39,237 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:37:39,238 INFO  L263         TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 26 conjunts are in the unsatisfiable core
[2024-02-28 17:37:39,241 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:37:39,261 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 17 treesize of output 9
[2024-02-28 17:37:39,339 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 17:37:39,363 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:37:39,363 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 21 treesize of output 20
[2024-02-28 17:37:39,394 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:37:39,396 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:37:39,396 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-02-28 17:37:39,441 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:37:39,442 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:37:39,443 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:37:39,444 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 0 case distinctions, treesize of input 39 treesize of output 44
[2024-02-28 17:37:39,526 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:37:39,526 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 41 treesize of output 37
[2024-02-28 17:37:39,559 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:37:39,559 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 17:37:39,583 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0))) is different from false
[2024-02-28 17:37:39,626 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_threadThread1of1ForFork0_~p~0.base_39 Int)) (or (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of1ForFork0_~p~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~p~0.base_39))) (forall ((v_threadThread1of1ForFork0_~p~0.base_39 Int)) (or (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of1ForFork0_~p~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~p~0.base_39))) (forall ((v_threadThread1of1ForFork0_~p~0.base_39 Int)) (or (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of1ForFork0_~p~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~p~0.base_39))) (forall ((v_threadThread1of1ForFork0_~p~0.base_39 Int)) (or (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of1ForFork0_~p~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~p~0.base_39)))) is different from false
[2024-02-28 17:37:39,963 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (and (forall ((v_threadThread1of1ForFork0_~p~0.base_39 Int)) (or (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of1ForFork0_~p~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~p~0.base_39))) (forall ((v_threadThread1of1ForFork0_~p~0.base_39 Int)) (or (forall ((v_ArrVal_680 (Array Int Int))) (= 0 (select (select (store .cse0 v_threadThread1of1ForFork0_~p~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)))) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~p~0.base_39))) (forall ((v_threadThread1of1ForFork0_~p~0.base_39 Int)) (or (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of1ForFork0_~p~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~p~0.base_39)))))) is different from false
[2024-02-28 17:37:40,152 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:37:40,153 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 33 treesize of output 49
[2024-02-28 17:37:40,163 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:37:40,164 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 60 treesize of output 34
[2024-02-28 17:37:40,167 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 5 treesize of output 3
[2024-02-28 17:37:40,242 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:37:40,243 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914073893] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 17:37:40,243 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 17:37:40,243 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27
[2024-02-28 17:37:40,243 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475672052]
[2024-02-28 17:37:40,243 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 17:37:40,243 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2024-02-28 17:37:40,243 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:37:40,244 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2024-02-28 17:37:40,244 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=520, Unknown=17, NotChecked=150, Total=812
[2024-02-28 17:37:40,327 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 56 out of 197
[2024-02-28 17:37:40,328 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 364 transitions, 4084 flow. Second operand  has 29 states, 29 states have (on average 58.55172413793103) internal successors, (1698), 29 states have internal predecessors, (1698), 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-02-28 17:37:40,328 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:37:40,328 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 197
[2024-02-28 17:37:40,328 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:37:41,129 INFO  L130       PetriNetUnfolder]: 506/1193 cut-off events.
[2024-02-28 17:37:41,129 INFO  L131       PetriNetUnfolder]: For 8524/8531 co-relation queries the response was YES.
[2024-02-28 17:37:41,134 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7861 conditions, 1193 events. 506/1193 cut-off events. For 8524/8531 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 7068 event pairs, 48 based on Foata normal form. 29/1221 useless extension candidates. Maximal degree in co-relation 7689. Up to 1103 conditions per place. 
[2024-02-28 17:37:41,141 INFO  L137   encePairwiseOnDemand]: 188/197 looper letters, 365 selfloop transitions, 13 changer transitions 1/381 dead transitions.
[2024-02-28 17:37:41,141 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 381 transitions, 4949 flow
[2024-02-28 17:37:41,142 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-02-28 17:37:41,142 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-02-28 17:37:41,144 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 643 transitions.
[2024-02-28 17:37:41,144 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.32639593908629444
[2024-02-28 17:37:41,144 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 643 transitions.
[2024-02-28 17:37:41,145 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 643 transitions.
[2024-02-28 17:37:41,145 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:37:41,145 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 643 transitions.
[2024-02-28 17:37:41,146 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 64.3) internal successors, (643), 10 states have internal predecessors, (643), 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-02-28 17:37:41,149 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 197.0) internal successors, (2167), 11 states have internal predecessors, (2167), 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-02-28 17:37:41,149 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 197.0) internal successors, (2167), 11 states have internal predecessors, (2167), 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-02-28 17:37:41,149 INFO  L175             Difference]: Start difference. First operand has 137 places, 364 transitions, 4084 flow. Second operand 10 states and 643 transitions.
[2024-02-28 17:37:41,149 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 381 transitions, 4949 flow
[2024-02-28 17:37:41,189 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 381 transitions, 4786 flow, removed 42 selfloop flow, removed 12 redundant places.
[2024-02-28 17:37:41,195 INFO  L231             Difference]: Finished difference. Result has 133 places, 349 transitions, 3800 flow
[2024-02-28 17:37:41,195 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=3766, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3800, PETRI_PLACES=133, PETRI_TRANSITIONS=349}
[2024-02-28 17:37:41,196 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 74 predicate places.
[2024-02-28 17:37:41,196 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 349 transitions, 3800 flow
[2024-02-28 17:37:41,196 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 29 states, 29 states have (on average 58.55172413793103) internal successors, (1698), 29 states have internal predecessors, (1698), 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-02-28 17:37:41,197 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:37:41,197 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:37:41,203 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-02-28 17:37:41,397 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:37:41,398 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-02-28 17:37:41,398 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:37:41,398 INFO  L85        PathProgramCache]: Analyzing trace with hash 819311960, now seen corresponding path program 2 times
[2024-02-28 17:37:41,398 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:37:41,398 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689202202]
[2024-02-28 17:37:41,398 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:37:41,399 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:37:41,423 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:37:41,838 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:37:41,838 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:37:41,838 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689202202]
[2024-02-28 17:37:41,838 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689202202] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:37:41,839 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369759242]
[2024-02-28 17:37:41,839 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-02-28 17:37:41,839 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:37:41,839 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:37:41,840 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-02-28 17:37:41,844 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-02-28 17:37:42,002 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-02-28 17:37:42,003 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 17:37:42,005 INFO  L263         TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 47 conjunts are in the unsatisfiable core
[2024-02-28 17:37:42,010 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:37:42,045 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 26 treesize of output 14
[2024-02-28 17:37:42,052 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 15 treesize of output 7
[2024-02-28 17:37:42,204 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 17:37:42,248 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:37:42,248 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 21 treesize of output 20
[2024-02-28 17:37:42,287 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:37:42,288 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:37:42,289 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-02-28 17:37:42,335 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:37:42,336 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 32 treesize of output 30
[2024-02-28 17:37:42,356 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:37:42,356 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:37:42,357 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:37:42,358 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 0 case distinctions, treesize of input 39 treesize of output 44
[2024-02-28 17:37:42,402 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:37:42,403 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 41 treesize of output 37
[2024-02-28 17:37:42,423 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:37:42,424 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 41 treesize of output 37
[2024-02-28 17:37:42,442 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:37:42,443 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 41 treesize of output 37
[2024-02-28 17:37:42,503 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:37:42,504 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 41 treesize of output 37
[2024-02-28 17:37:42,535 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:37:42,535 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 17:37:42,553 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_813 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_813 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_813 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_813 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false
[2024-02-28 17:37:42,589 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false
[2024-02-28 17:37:42,635 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)))) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2024-02-28 17:37:42,657 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_807))) (store .cse0 c_threadThread1of1ForFork0_~p~0.base (store (select .cse0 c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (= (select (select (store (store (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_807))) (store .cse2 c_threadThread1of1ForFork0_~p~0.base (store (select .cse2 c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_807))) (store .cse3 c_threadThread1of1ForFork0_~p~0.base (store (select .cse3 c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_807))) (store .cse4 c_threadThread1of1ForFork0_~p~0.base (store (select .cse4 c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false
[2024-02-28 17:37:42,678 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_807))) (store .cse0 c_threadThread1of1ForFork0_~p~0.base (store (select .cse0 c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_807))) (store .cse4 c_threadThread1of1ForFork0_~p~0.base (store (select .cse4 c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (= (select (select (store (store (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_807))) (store .cse5 c_threadThread1of1ForFork0_~p~0.base (store (select .cse5 c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (= (select (select (store (store (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_807))) (store .cse6 c_threadThread1of1ForFork0_~p~0.base (store (select .cse6 c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2024-02-28 17:37:42,796 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked.
[2024-02-28 17:37:42,796 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369759242] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 17:37:42,796 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 17:37:42,796 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 26
[2024-02-28 17:37:42,796 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73092873]
[2024-02-28 17:37:42,796 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 17:37:42,796 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 28 states
[2024-02-28 17:37:42,797 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:37:42,797 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2024-02-28 17:37:42,797 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=417, Unknown=5, NotChecked=230, Total=756
[2024-02-28 17:37:42,798 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 49 out of 197
[2024-02-28 17:37:42,799 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 349 transitions, 3800 flow. Second operand  has 28 states, 28 states have (on average 51.964285714285715) internal successors, (1455), 28 states have internal predecessors, (1455), 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-02-28 17:37:42,799 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:37:42,799 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 197
[2024-02-28 17:37:42,799 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:37:44,910 INFO  L130       PetriNetUnfolder]: 499/1175 cut-off events.
[2024-02-28 17:37:44,910 INFO  L131       PetriNetUnfolder]: For 7545/7552 co-relation queries the response was YES.
[2024-02-28 17:37:44,914 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7604 conditions, 1175 events. 499/1175 cut-off events. For 7545/7552 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 6971 event pairs, 21 based on Foata normal form. 22/1196 useless extension candidates. Maximal degree in co-relation 7438. Up to 399 conditions per place. 
[2024-02-28 17:37:44,921 INFO  L137   encePairwiseOnDemand]: 162/197 looper letters, 280 selfloop transitions, 219 changer transitions 6/507 dead transitions.
[2024-02-28 17:37:44,921 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 507 transitions, 6268 flow
[2024-02-28 17:37:44,922 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2024-02-28 17:37:44,922 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2024-02-28 17:37:44,925 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1166 transitions.
[2024-02-28 17:37:44,926 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3115148276783329
[2024-02-28 17:37:44,926 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1166 transitions.
[2024-02-28 17:37:44,926 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1166 transitions.
[2024-02-28 17:37:44,927 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:37:44,927 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1166 transitions.
[2024-02-28 17:37:44,929 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 61.36842105263158) internal successors, (1166), 19 states have internal predecessors, (1166), 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-02-28 17:37:44,933 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 197.0) internal successors, (3940), 20 states have internal predecessors, (3940), 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-02-28 17:37:44,934 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 197.0) internal successors, (3940), 20 states have internal predecessors, (3940), 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-02-28 17:37:44,934 INFO  L175             Difference]: Start difference. First operand has 133 places, 349 transitions, 3800 flow. Second operand 19 states and 1166 transitions.
[2024-02-28 17:37:44,934 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 507 transitions, 6268 flow
[2024-02-28 17:37:44,978 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 507 transitions, 6250 flow, removed 0 selfloop flow, removed 7 redundant places.
[2024-02-28 17:37:44,986 INFO  L231             Difference]: Finished difference. Result has 147 places, 364 transitions, 4621 flow
[2024-02-28 17:37:44,986 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=3782, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=206, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4621, PETRI_PLACES=147, PETRI_TRANSITIONS=364}
[2024-02-28 17:37:44,987 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 88 predicate places.
[2024-02-28 17:37:44,987 INFO  L495      AbstractCegarLoop]: Abstraction has has 147 places, 364 transitions, 4621 flow
[2024-02-28 17:37:44,988 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 28 states, 28 states have (on average 51.964285714285715) internal successors, (1455), 28 states have internal predecessors, (1455), 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-02-28 17:37:44,988 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:37:44,988 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2024-02-28 17:37:44,994 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-02-28 17:37:45,189 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,SelfDestructingSolverStorable9
[2024-02-28 17:37:45,189 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-02-28 17:37:45,190 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:37:45,190 INFO  L85        PathProgramCache]: Analyzing trace with hash -1870719176, now seen corresponding path program 1 times
[2024-02-28 17:37:45,190 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:37:45,190 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112848814]
[2024-02-28 17:37:45,190 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:37:45,191 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:37:45,219 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 17:37:45,219 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-28 17:37:45,236 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 17:37:45,254 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-28 17:37:45,255 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-02-28 17:37:45,255 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining)
[2024-02-28 17:37:45,257 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining)
[2024-02-28 17:37:45,257 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining)
[2024-02-28 17:37:45,257 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining)
[2024-02-28 17:37:45,257 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining)
[2024-02-28 17:37:45,257 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining)
[2024-02-28 17:37:45,257 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining)
[2024-02-28 17:37:45,257 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining)
[2024-02-28 17:37:45,257 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining)
[2024-02-28 17:37:45,257 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-02-28 17:37:45,257 INFO  L445         BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:37:45,259 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-02-28 17:37:45,259 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-02-28 17:37:45,272 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-02-28 17:37:45,274 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 139 places, 139 transitions, 296 flow
[2024-02-28 17:37:45,293 INFO  L130       PetriNetUnfolder]: 11/329 cut-off events.
[2024-02-28 17:37:45,293 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2024-02-28 17:37:45,293 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 343 conditions, 329 events. 11/329 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 736 event pairs, 0 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 188. Up to 8 conditions per place. 
[2024-02-28 17:37:45,293 INFO  L82        GeneralOperation]: Start removeDead. Operand has 139 places, 139 transitions, 296 flow
[2024-02-28 17:37:45,294 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 139 places, 139 transitions, 296 flow
[2024-02-28 17:37:45,295 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-02-28 17:37:45,295 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 139 transitions, 296 flow
[2024-02-28 17:37:45,295 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 139 transitions, 296 flow
[2024-02-28 17:37:45,295 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 139 places, 139 transitions, 296 flow
[2024-02-28 17:37:45,312 INFO  L130       PetriNetUnfolder]: 11/329 cut-off events.
[2024-02-28 17:37:45,312 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2024-02-28 17:37:45,313 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 343 conditions, 329 events. 11/329 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 736 event pairs, 0 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 188. Up to 8 conditions per place. 
[2024-02-28 17:37:45,316 INFO  L119        LiptonReduction]: Number of co-enabled transitions 5160
[2024-02-28 17:37:47,766 INFO  L134        LiptonReduction]: Checked pairs total: 23932
[2024-02-28 17:37:47,766 INFO  L136        LiptonReduction]: Total number of compositions: 78
[2024-02-28 17:37:47,767 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-02-28 17:37:47,767 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;@12facf47, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-02-28 17:37:47,767 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 10 error locations.
[2024-02-28 17:37:47,769 INFO  L130       PetriNetUnfolder]: 0/15 cut-off events.
[2024-02-28 17:37:47,769 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-02-28 17:37:47,769 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:37:47,769 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:37:47,769 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-02-28 17:37:47,769 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:37:47,769 INFO  L85        PathProgramCache]: Analyzing trace with hash 1725264381, now seen corresponding path program 1 times
[2024-02-28 17:37:47,769 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:37:47,769 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174399578]
[2024-02-28 17:37:47,769 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:37:47,769 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:37:47,783 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:37:47,895 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:37:47,895 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:37:47,895 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174399578]
[2024-02-28 17:37:47,895 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174399578] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:37:47,895 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:37:47,895 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:37:47,896 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937034069]
[2024-02-28 17:37:47,896 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:37:47,896 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:37:47,896 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:37:47,896 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:37:47,896 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:37:48,154 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 109 out of 217
[2024-02-28 17:37:48,155 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 68 transitions, 154 flow. Second operand  has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 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-02-28 17:37:48,155 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:37:48,155 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 217
[2024-02-28 17:37:48,155 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:37:48,778 INFO  L130       PetriNetUnfolder]: 2858/5896 cut-off events.
[2024-02-28 17:37:48,778 INFO  L131       PetriNetUnfolder]: For 191/349 co-relation queries the response was YES.
[2024-02-28 17:37:48,783 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10786 conditions, 5896 events. 2858/5896 cut-off events. For 191/349 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 40990 event pairs, 819 based on Foata normal form. 0/5496 useless extension candidates. Maximal degree in co-relation 5173. Up to 3444 conditions per place. 
[2024-02-28 17:37:48,798 INFO  L137   encePairwiseOnDemand]: 197/217 looper letters, 69 selfloop transitions, 42 changer transitions 0/142 dead transitions.
[2024-02-28 17:37:48,798 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 142 transitions, 532 flow
[2024-02-28 17:37:48,799 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:37:48,799 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:37:48,800 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 767 transitions.
[2024-02-28 17:37:48,800 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5890937019969278
[2024-02-28 17:37:48,800 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 767 transitions.
[2024-02-28 17:37:48,800 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 767 transitions.
[2024-02-28 17:37:48,800 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:37:48,800 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 767 transitions.
[2024-02-28 17:37:48,801 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 127.83333333333333) internal successors, (767), 6 states have internal predecessors, (767), 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-02-28 17:37:48,803 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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-02-28 17:37:48,803 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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-02-28 17:37:48,804 INFO  L175             Difference]: Start difference. First operand has 71 places, 68 transitions, 154 flow. Second operand 6 states and 767 transitions.
[2024-02-28 17:37:48,804 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 142 transitions, 532 flow
[2024-02-28 17:37:48,804 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 142 transitions, 532 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:37:48,805 INFO  L231             Difference]: Finished difference. Result has 81 places, 110 transitions, 446 flow
[2024-02-28 17:37:48,806 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=446, PETRI_PLACES=81, PETRI_TRANSITIONS=110}
[2024-02-28 17:37:48,806 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 10 predicate places.
[2024-02-28 17:37:48,806 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 110 transitions, 446 flow
[2024-02-28 17:37:48,807 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 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-02-28 17:37:48,807 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:37:48,807 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:37:48,807 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-02-28 17:37:48,807 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-02-28 17:37:48,807 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:37:48,807 INFO  L85        PathProgramCache]: Analyzing trace with hash -329715416, now seen corresponding path program 1 times
[2024-02-28 17:37:48,807 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:37:48,807 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863167765]
[2024-02-28 17:37:48,807 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:37:48,807 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:37:48,820 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:37:48,859 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:37:48,859 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:37:48,859 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863167765]
[2024-02-28 17:37:48,860 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863167765] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:37:48,860 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:37:48,860 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-02-28 17:37:48,860 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630864308]
[2024-02-28 17:37:48,860 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:37:48,861 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-02-28 17:37:48,861 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:37:48,861 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-02-28 17:37:48,862 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-02-28 17:37:48,919 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 126 out of 217
[2024-02-28 17:37:48,920 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 110 transitions, 446 flow. Second operand  has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 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-02-28 17:37:48,921 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:37:48,921 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 217
[2024-02-28 17:37:48,921 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:37:49,289 INFO  L130       PetriNetUnfolder]: 1510/4077 cut-off events.
[2024-02-28 17:37:49,289 INFO  L131       PetriNetUnfolder]: For 1360/1548 co-relation queries the response was YES.
[2024-02-28 17:37:49,296 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8852 conditions, 4077 events. 1510/4077 cut-off events. For 1360/1548 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 31624 event pairs, 527 based on Foata normal form. 0/3748 useless extension candidates. Maximal degree in co-relation 3838. Up to 1446 conditions per place. 
[2024-02-28 17:37:49,307 INFO  L137   encePairwiseOnDemand]: 213/217 looper letters, 37 selfloop transitions, 3 changer transitions 2/121 dead transitions.
[2024-02-28 17:37:49,307 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 121 transitions, 562 flow
[2024-02-28 17:37:49,307 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-02-28 17:37:49,308 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-02-28 17:37:49,308 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 537 transitions.
[2024-02-28 17:37:49,308 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.618663594470046
[2024-02-28 17:37:49,308 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 537 transitions.
[2024-02-28 17:37:49,308 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 537 transitions.
[2024-02-28 17:37:49,309 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:37:49,309 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 537 transitions.
[2024-02-28 17:37:49,310 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 134.25) internal successors, (537), 4 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-02-28 17:37:49,311 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 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-02-28 17:37:49,311 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 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-02-28 17:37:49,311 INFO  L175             Difference]: Start difference. First operand has 81 places, 110 transitions, 446 flow. Second operand 4 states and 537 transitions.
[2024-02-28 17:37:49,311 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 121 transitions, 562 flow
[2024-02-28 17:37:49,315 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 121 transitions, 562 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:37:49,316 INFO  L231             Difference]: Finished difference. Result has 86 places, 112 transitions, 466 flow
[2024-02-28 17:37:49,316 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=466, PETRI_PLACES=86, PETRI_TRANSITIONS=112}
[2024-02-28 17:37:49,317 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 15 predicate places.
[2024-02-28 17:37:49,317 INFO  L495      AbstractCegarLoop]: Abstraction has has 86 places, 112 transitions, 466 flow
[2024-02-28 17:37:49,317 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 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-02-28 17:37:49,317 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:37:49,317 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:37:49,317 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-02-28 17:37:49,317 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-02-28 17:37:49,317 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:37:49,318 INFO  L85        PathProgramCache]: Analyzing trace with hash 580316733, now seen corresponding path program 1 times
[2024-02-28 17:37:49,318 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:37:49,318 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190817772]
[2024-02-28 17:37:49,318 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:37:49,318 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:37:49,327 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:37:49,452 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:37:49,452 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:37:49,452 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190817772]
[2024-02-28 17:37:49,452 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190817772] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:37:49,452 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:37:49,452 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:37:49,453 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102073766]
[2024-02-28 17:37:49,453 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:37:49,456 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:37:49,456 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:37:49,457 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:37:49,457 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:37:49,725 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 217
[2024-02-28 17:37:49,725 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 112 transitions, 466 flow. Second operand  has 6 states, 6 states have (on average 104.33333333333333) internal successors, (626), 6 states have internal predecessors, (626), 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-02-28 17:37:49,725 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:37:49,725 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 217
[2024-02-28 17:37:49,726 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:37:50,836 INFO  L130       PetriNetUnfolder]: 6215/11785 cut-off events.
[2024-02-28 17:37:50,836 INFO  L131       PetriNetUnfolder]: For 6036/6204 co-relation queries the response was YES.
[2024-02-28 17:37:50,879 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30089 conditions, 11785 events. 6215/11785 cut-off events. For 6036/6204 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 86479 event pairs, 1278 based on Foata normal form. 19/11441 useless extension candidates. Maximal degree in co-relation 29960. Up to 6839 conditions per place. 
[2024-02-28 17:37:50,907 INFO  L137   encePairwiseOnDemand]: 190/217 looper letters, 116 selfloop transitions, 104 changer transitions 1/253 dead transitions.
[2024-02-28 17:37:50,907 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 253 transitions, 1504 flow
[2024-02-28 17:37:50,908 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:37:50,908 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:37:50,909 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 749 transitions.
[2024-02-28 17:37:50,909 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5752688172043011
[2024-02-28 17:37:50,909 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 749 transitions.
[2024-02-28 17:37:50,909 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 749 transitions.
[2024-02-28 17:37:50,909 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:37:50,910 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 749 transitions.
[2024-02-28 17:37:50,910 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 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-02-28 17:37:50,912 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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-02-28 17:37:50,912 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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-02-28 17:37:50,912 INFO  L175             Difference]: Start difference. First operand has 86 places, 112 transitions, 466 flow. Second operand 6 states and 749 transitions.
[2024-02-28 17:37:50,912 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 253 transitions, 1504 flow
[2024-02-28 17:37:50,920 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 253 transitions, 1501 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-02-28 17:37:50,922 INFO  L231             Difference]: Finished difference. Result has 95 places, 215 transitions, 1492 flow
[2024-02-28 17:37:50,922 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1492, PETRI_PLACES=95, PETRI_TRANSITIONS=215}
[2024-02-28 17:37:50,922 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 24 predicate places.
[2024-02-28 17:37:50,922 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 215 transitions, 1492 flow
[2024-02-28 17:37:50,923 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 104.33333333333333) internal successors, (626), 6 states have internal predecessors, (626), 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-02-28 17:37:50,923 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:37:50,923 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-02-28 17:37:50,923 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-02-28 17:37:50,923 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-02-28 17:37:50,924 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:37:50,924 INFO  L85        PathProgramCache]: Analyzing trace with hash 747515608, now seen corresponding path program 1 times
[2024-02-28 17:37:50,924 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:37:50,924 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629214683]
[2024-02-28 17:37:50,924 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:37:50,924 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:37:50,938 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:37:51,075 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:37:51,076 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:37:51,076 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629214683]
[2024-02-28 17:37:51,076 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629214683] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:37:51,076 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:37:51,076 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:37:51,076 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039250820]
[2024-02-28 17:37:51,076 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:37:51,076 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:37:51,076 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:37:51,077 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:37:51,077 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:37:51,215 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 95 out of 217
[2024-02-28 17:37:51,216 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 215 transitions, 1492 flow. Second operand  has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 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-02-28 17:37:51,216 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:37:51,216 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 217
[2024-02-28 17:37:51,216 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:37:53,074 INFO  L130       PetriNetUnfolder]: 10728/18665 cut-off events.
[2024-02-28 17:37:53,074 INFO  L131       PetriNetUnfolder]: For 23070/23295 co-relation queries the response was YES.
[2024-02-28 17:37:53,104 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 63188 conditions, 18665 events. 10728/18665 cut-off events. For 23070/23295 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 132578 event pairs, 3389 based on Foata normal form. 4/17840 useless extension candidates. Maximal degree in co-relation 44831. Up to 15062 conditions per place. 
[2024-02-28 17:37:53,157 INFO  L137   encePairwiseOnDemand]: 183/217 looper letters, 241 selfloop transitions, 178 changer transitions 0/437 dead transitions.
[2024-02-28 17:37:53,157 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 437 transitions, 3398 flow
[2024-02-28 17:37:53,157 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:37:53,158 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:37:53,158 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 795 transitions.
[2024-02-28 17:37:53,158 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6105990783410138
[2024-02-28 17:37:53,159 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 795 transitions.
[2024-02-28 17:37:53,159 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 795 transitions.
[2024-02-28 17:37:53,159 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:37:53,159 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 795 transitions.
[2024-02-28 17:37:53,160 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 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-02-28 17:37:53,161 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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-02-28 17:37:53,161 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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-02-28 17:37:53,161 INFO  L175             Difference]: Start difference. First operand has 95 places, 215 transitions, 1492 flow. Second operand 6 states and 795 transitions.
[2024-02-28 17:37:53,161 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 437 transitions, 3398 flow
[2024-02-28 17:37:53,186 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 437 transitions, 3388 flow, removed 5 selfloop flow, removed 1 redundant places.
[2024-02-28 17:37:53,190 INFO  L231             Difference]: Finished difference. Result has 102 places, 377 transitions, 2975 flow
[2024-02-28 17:37:53,190 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=1490, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2975, PETRI_PLACES=102, PETRI_TRANSITIONS=377}
[2024-02-28 17:37:53,190 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 31 predicate places.
[2024-02-28 17:37:53,191 INFO  L495      AbstractCegarLoop]: Abstraction has has 102 places, 377 transitions, 2975 flow
[2024-02-28 17:37:53,191 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 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-02-28 17:37:53,191 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:37:53,191 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:37:53,191 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-02-28 17:37:53,191 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-02-28 17:37:53,191 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:37:53,191 INFO  L85        PathProgramCache]: Analyzing trace with hash 102692192, now seen corresponding path program 1 times
[2024-02-28 17:37:53,191 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:37:53,191 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447107388]
[2024-02-28 17:37:53,192 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:37:53,192 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:37:53,206 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:37:53,491 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:37:53,491 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:37:53,491 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447107388]
[2024-02-28 17:37:53,491 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447107388] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:37:53,492 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666946130]
[2024-02-28 17:37:53,492 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:37:53,492 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:37:53,492 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:37:53,493 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-02-28 17:37:53,499 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-02-28 17:37:53,630 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:37:53,631 INFO  L263         TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 24 conjunts are in the unsatisfiable core
[2024-02-28 17:37:53,633 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:37:53,650 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 17 treesize of output 9
[2024-02-28 17:37:53,703 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 17:37:53,726 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 21 treesize of output 20
[2024-02-28 17:37:53,760 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:37:53,761 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 32
[2024-02-28 17:37:53,821 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:37:53,821 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 39 treesize of output 44
[2024-02-28 17:37:53,880 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:37:53,881 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 41 treesize of output 37
[2024-02-28 17:37:53,895 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:37:53,895 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 17:37:53,925 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1100 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1100 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) is different from false
[2024-02-28 17:37:53,944 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false
[2024-02-28 17:37:53,962 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1100 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) .cse2)))))) is different from false
[2024-02-28 17:37:54,074 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-02-28 17:37:54,074 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666946130] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 17:37:54,074 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 17:37:54,074 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24
[2024-02-28 17:37:54,075 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022527374]
[2024-02-28 17:37:54,075 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 17:37:54,076 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2024-02-28 17:37:54,076 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:37:54,076 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2024-02-28 17:37:54,077 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=418, Unknown=3, NotChecked=132, Total=650
[2024-02-28 17:37:54,104 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 65 out of 217
[2024-02-28 17:37:54,105 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 377 transitions, 2975 flow. Second operand  has 26 states, 26 states have (on average 67.76923076923077) internal successors, (1762), 26 states have internal predecessors, (1762), 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-02-28 17:37:54,106 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:37:54,106 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 217
[2024-02-28 17:37:54,106 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:37:59,450 INFO  L130       PetriNetUnfolder]: 16562/27029 cut-off events.
[2024-02-28 17:37:59,451 INFO  L131       PetriNetUnfolder]: For 50811/50817 co-relation queries the response was YES.
[2024-02-28 17:37:59,517 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 109425 conditions, 27029 events. 16562/27029 cut-off events. For 50811/50817 co-relation queries the response was YES. Maximal size of possible extension queue 703. Compared 187796 event pairs, 4731 based on Foata normal form. 6/24531 useless extension candidates. Maximal degree in co-relation 73100. Up to 19181 conditions per place. 
[2024-02-28 17:37:59,686 INFO  L137   encePairwiseOnDemand]: 184/217 looper letters, 551 selfloop transitions, 371 changer transitions 1/926 dead transitions.
[2024-02-28 17:37:59,687 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 926 transitions, 8498 flow
[2024-02-28 17:37:59,688 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2024-02-28 17:37:59,688 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 18 states.
[2024-02-28 17:37:59,689 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1563 transitions.
[2024-02-28 17:37:59,689 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4001536098310292
[2024-02-28 17:37:59,689 INFO  L72            ComplementDD]: Start complementDD. Operand 18 states and 1563 transitions.
[2024-02-28 17:37:59,689 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 18 states and 1563 transitions.
[2024-02-28 17:37:59,690 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:37:59,690 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1563 transitions.
[2024-02-28 17:37:59,692 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 19 states, 18 states have (on average 86.83333333333333) internal successors, (1563), 18 states have internal predecessors, (1563), 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-02-28 17:37:59,694 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 19 states, 19 states have (on average 217.0) internal successors, (4123), 19 states have internal predecessors, (4123), 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-02-28 17:37:59,695 INFO  L81            ComplementDD]: Finished complementDD. Result  has 19 states, 19 states have (on average 217.0) internal successors, (4123), 19 states have internal predecessors, (4123), 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-02-28 17:37:59,695 INFO  L175             Difference]: Start difference. First operand has 102 places, 377 transitions, 2975 flow. Second operand 18 states and 1563 transitions.
[2024-02-28 17:37:59,695 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 926 transitions, 8498 flow
[2024-02-28 17:38:00,100 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 926 transitions, 8378 flow, removed 60 selfloop flow, removed 0 redundant places.
[2024-02-28 17:38:00,114 INFO  L231             Difference]: Finished difference. Result has 133 places, 653 transitions, 6935 flow
[2024-02-28 17:38:00,115 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=2855, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=177, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=6935, PETRI_PLACES=133, PETRI_TRANSITIONS=653}
[2024-02-28 17:38:00,116 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 62 predicate places.
[2024-02-28 17:38:00,116 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 653 transitions, 6935 flow
[2024-02-28 17:38:00,117 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 67.76923076923077) internal successors, (1762), 26 states have internal predecessors, (1762), 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-02-28 17:38:00,117 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:38:00,117 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:38:00,127 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-02-28 17:38:00,318 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-02-28 17:38:00,319 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-02-28 17:38:00,319 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:38:00,320 INFO  L85        PathProgramCache]: Analyzing trace with hash -1170144666, now seen corresponding path program 1 times
[2024-02-28 17:38:00,320 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:38:00,320 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69227581]
[2024-02-28 17:38:00,320 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:38:00,320 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:38:00,338 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:38:00,564 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:38:00,564 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:38:00,564 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69227581]
[2024-02-28 17:38:00,564 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69227581] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:38:00,564 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015523488]
[2024-02-28 17:38:00,564 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:38:00,564 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:38:00,564 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:38:00,566 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-02-28 17:38:00,572 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-02-28 17:38:00,700 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:38:00,701 INFO  L263         TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 26 conjunts are in the unsatisfiable core
[2024-02-28 17:38:00,704 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:38:00,725 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 17 treesize of output 9
[2024-02-28 17:38:00,819 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 17:38:00,849 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:38:00,850 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 21 treesize of output 20
[2024-02-28 17:38:00,888 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:38:00,889 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:38:00,890 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-02-28 17:38:00,951 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:38:00,953 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:38:00,954 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:38:00,955 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 0 case distinctions, treesize of input 39 treesize of output 44
[2024-02-28 17:38:00,999 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:38:01,000 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 41 treesize of output 37
[2024-02-28 17:38:01,029 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:38:01,030 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 17:38:01,246 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) (.cse2 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_1213 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1213) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)) (forall ((v_ArrVal_1213 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1213) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1213 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1213) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1213 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1213) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse2) 0))))) is different from false
[2024-02-28 17:38:01,348 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-02-28 17:38:01,348 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015523488] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 17:38:01,348 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 17:38:01,348 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25
[2024-02-28 17:38:01,348 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354680343]
[2024-02-28 17:38:01,348 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 17:38:01,348 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2024-02-28 17:38:01,349 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:38:01,349 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2024-02-28 17:38:01,349 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=520, Unknown=23, NotChecked=48, Total=702
[2024-02-28 17:38:01,491 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 67 out of 217
[2024-02-28 17:38:01,492 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 653 transitions, 6935 flow. Second operand  has 27 states, 27 states have (on average 69.5925925925926) internal successors, (1879), 27 states have internal predecessors, (1879), 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-02-28 17:38:01,492 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:38:01,492 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 217
[2024-02-28 17:38:01,492 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:38:08,528 INFO  L130       PetriNetUnfolder]: 19305/31847 cut-off events.
[2024-02-28 17:38:08,528 INFO  L131       PetriNetUnfolder]: For 113899/113899 co-relation queries the response was YES.
[2024-02-28 17:38:08,624 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 154854 conditions, 31847 events. 19305/31847 cut-off events. For 113899/113899 co-relation queries the response was YES. Maximal size of possible extension queue 809. Compared 228008 event pairs, 2748 based on Foata normal form. 230/29258 useless extension candidates. Maximal degree in co-relation 134937. Up to 15974 conditions per place. 
[2024-02-28 17:38:08,730 INFO  L137   encePairwiseOnDemand]: 187/217 looper letters, 841 selfloop transitions, 489 changer transitions 0/1333 dead transitions.
[2024-02-28 17:38:08,730 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 1333 transitions, 15562 flow
[2024-02-28 17:38:08,731 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2024-02-28 17:38:08,731 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2024-02-28 17:38:08,734 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1382 transitions.
[2024-02-28 17:38:08,734 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3980414746543779
[2024-02-28 17:38:08,734 INFO  L72            ComplementDD]: Start complementDD. Operand 16 states and 1382 transitions.
[2024-02-28 17:38:08,734 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 16 states and 1382 transitions.
[2024-02-28 17:38:08,735 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:38:08,735 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1382 transitions.
[2024-02-28 17:38:08,736 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 17 states, 16 states have (on average 86.375) internal successors, (1382), 16 states have internal predecessors, (1382), 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-02-28 17:38:08,739 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 17 states, 17 states have (on average 217.0) internal successors, (3689), 17 states have internal predecessors, (3689), 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-02-28 17:38:08,739 INFO  L81            ComplementDD]: Finished complementDD. Result  has 17 states, 17 states have (on average 217.0) internal successors, (3689), 17 states have internal predecessors, (3689), 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-02-28 17:38:08,739 INFO  L175             Difference]: Start difference. First operand has 133 places, 653 transitions, 6935 flow. Second operand 16 states and 1382 transitions.
[2024-02-28 17:38:08,739 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 1333 transitions, 15562 flow
[2024-02-28 17:38:10,059 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 1333 transitions, 15515 flow, removed 22 selfloop flow, removed 1 redundant places.
[2024-02-28 17:38:10,079 INFO  L231             Difference]: Finished difference. Result has 154 places, 931 transitions, 11989 flow
[2024-02-28 17:38:10,080 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=6889, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=244, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=11989, PETRI_PLACES=154, PETRI_TRANSITIONS=931}
[2024-02-28 17:38:10,080 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 83 predicate places.
[2024-02-28 17:38:10,080 INFO  L495      AbstractCegarLoop]: Abstraction has has 154 places, 931 transitions, 11989 flow
[2024-02-28 17:38:10,081 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 27 states, 27 states have (on average 69.5925925925926) internal successors, (1879), 27 states have internal predecessors, (1879), 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-02-28 17:38:10,081 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:38:10,081 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, 1]
[2024-02-28 17:38:10,086 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-02-28 17:38:10,285 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-02-28 17:38:10,286 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-02-28 17:38:10,286 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:38:10,286 INFO  L85        PathProgramCache]: Analyzing trace with hash 1669689062, now seen corresponding path program 1 times
[2024-02-28 17:38:10,287 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:38:10,287 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072738414]
[2024-02-28 17:38:10,287 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:38:10,287 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:38:10,312 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:38:10,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-02-28 17:38:10,582 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:38:10,583 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072738414]
[2024-02-28 17:38:10,583 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072738414] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:38:10,583 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715899888]
[2024-02-28 17:38:10,583 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:38:10,583 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:38:10,584 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:38:10,585 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-02-28 17:38:10,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-02-28 17:38:10,724 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:38:10,726 INFO  L263         TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 24 conjunts are in the unsatisfiable core
[2024-02-28 17:38:10,730 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:38:10,749 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 17 treesize of output 9
[2024-02-28 17:38:10,814 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 17:38:10,840 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 21 treesize of output 20
[2024-02-28 17:38:10,877 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:38:10,877 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 32
[2024-02-28 17:38:10,918 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:38:10,919 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 39 treesize of output 44
[2024-02-28 17:38:10,959 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:38:10,960 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 41 treesize of output 37
[2024-02-28 17:38:10,969 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:38:10,969 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 17:38:10,995 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1326 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1326) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1326 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1326) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1326 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1326) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1326 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1326) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2024-02-28 17:38:11,101 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1326 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1326) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1326 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1326) c_threadThread1of2ForFork0_~p~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1326 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1326) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1326 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1326) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false
[2024-02-28 17:38:11,204 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:38:11,205 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715899888] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 17:38:11,205 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 17:38:11,205 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24
[2024-02-28 17:38:11,205 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103802166]
[2024-02-28 17:38:11,205 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 17:38:11,205 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2024-02-28 17:38:11,205 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:38:11,205 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2024-02-28 17:38:11,206 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=446, Unknown=12, NotChecked=90, Total=650
[2024-02-28 17:38:11,551 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 62 out of 217
[2024-02-28 17:38:11,552 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 931 transitions, 11989 flow. Second operand  has 26 states, 26 states have (on average 64.88461538461539) internal successors, (1687), 26 states have internal predecessors, (1687), 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-02-28 17:38:11,552 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:38:11,552 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 217
[2024-02-28 17:38:11,552 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:38:21,934 INFO  L130       PetriNetUnfolder]: 23371/38348 cut-off events.
[2024-02-28 17:38:21,934 INFO  L131       PetriNetUnfolder]: For 185516/185516 co-relation queries the response was YES.
[2024-02-28 17:38:22,083 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 210064 conditions, 38348 events. 23371/38348 cut-off events. For 185516/185516 co-relation queries the response was YES. Maximal size of possible extension queue 993. Compared 282963 event pairs, 3764 based on Foata normal form. 0/35273 useless extension candidates. Maximal degree in co-relation 181911. Up to 26196 conditions per place. 
[2024-02-28 17:38:22,226 INFO  L137   encePairwiseOnDemand]: 153/217 looper letters, 975 selfloop transitions, 621 changer transitions 1/1600 dead transitions.
[2024-02-28 17:38:22,226 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 1600 transitions, 20849 flow
[2024-02-28 17:38:22,227 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2024-02-28 17:38:22,227 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2024-02-28 17:38:22,228 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1627 transitions.
[2024-02-28 17:38:22,229 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3946155711860296
[2024-02-28 17:38:22,229 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1627 transitions.
[2024-02-28 17:38:22,229 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1627 transitions.
[2024-02-28 17:38:22,230 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:38:22,230 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1627 transitions.
[2024-02-28 17:38:22,232 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 85.63157894736842) internal successors, (1627), 19 states have internal predecessors, (1627), 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-02-28 17:38:22,234 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 217.0) internal successors, (4340), 20 states have internal predecessors, (4340), 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-02-28 17:38:22,235 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 217.0) internal successors, (4340), 20 states have internal predecessors, (4340), 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-02-28 17:38:22,235 INFO  L175             Difference]: Start difference. First operand has 154 places, 931 transitions, 11989 flow. Second operand 19 states and 1627 transitions.
[2024-02-28 17:38:22,235 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 1600 transitions, 20849 flow
[2024-02-28 17:38:24,957 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 1600 transitions, 20663 flow, removed 68 selfloop flow, removed 5 redundant places.
[2024-02-28 17:38:24,976 INFO  L231             Difference]: Finished difference. Result has 172 places, 1306 transitions, 18102 flow
[2024-02-28 17:38:24,976 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=11813, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=931, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=321, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=18102, PETRI_PLACES=172, PETRI_TRANSITIONS=1306}
[2024-02-28 17:38:24,977 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 101 predicate places.
[2024-02-28 17:38:24,977 INFO  L495      AbstractCegarLoop]: Abstraction has has 172 places, 1306 transitions, 18102 flow
[2024-02-28 17:38:24,977 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 64.88461538461539) internal successors, (1687), 26 states have internal predecessors, (1687), 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-02-28 17:38:24,977 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:38:24,978 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, 1]
[2024-02-28 17:38:24,983 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-02-28 17:38:25,182 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-02-28 17:38:25,183 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-02-28 17:38:25,183 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:38:25,184 INFO  L85        PathProgramCache]: Analyzing trace with hash 517033069, now seen corresponding path program 1 times
[2024-02-28 17:38:25,184 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:38:25,184 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379217657]
[2024-02-28 17:38:25,185 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:38:25,185 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:38:25,204 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:38:25,498 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:38:25,498 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:38:25,498 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379217657]
[2024-02-28 17:38:25,498 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379217657] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:38:25,499 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732261981]
[2024-02-28 17:38:25,499 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:38:25,499 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:38:25,499 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:38:25,500 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-02-28 17:38:25,502 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-02-28 17:38:25,651 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:38:25,652 INFO  L263         TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 26 conjunts are in the unsatisfiable core
[2024-02-28 17:38:25,654 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:38:25,688 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 17 treesize of output 9
[2024-02-28 17:38:25,790 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 17:38:25,819 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:38:25,819 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 21 treesize of output 20
[2024-02-28 17:38:25,866 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:38:25,867 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:38:25,868 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-02-28 17:38:25,914 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:38:25,915 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:38:25,916 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:38:25,917 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 0 case distinctions, treesize of input 39 treesize of output 44
[2024-02-28 17:38:26,010 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:38:26,010 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 41 treesize of output 37
[2024-02-28 17:38:26,042 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:38:26,042 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 17:38:26,064 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1439 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))) is different from false
[2024-02-28 17:38:26,102 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))))) is different from false
[2024-02-28 17:38:26,149 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0)))) (and (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0))))))) is different from false
[2024-02-28 17:38:26,192 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= 0 (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)))))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (forall ((v_ArrVal_1439 (Array Int Int))) (= 0 (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2))) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39)))))) is different from false
[2024-02-28 17:38:26,233 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) (.cse2 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) .cse2 0) .cse3 0)))) (and (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= 0 (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse3) 0))))))) is different from false
[2024-02-28 17:38:26,265 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:38:26,265 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 35 treesize of output 51
[2024-02-28 17:38:26,274 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:38:26,274 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 64 treesize of output 36
[2024-02-28 17:38:26,282 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 7 treesize of output 3
[2024-02-28 17:38:26,294 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 17:38:26,294 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 33 treesize of output 1
[2024-02-28 17:38:26,302 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 17:38:26,302 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 35 treesize of output 1
[2024-02-28 17:38:26,310 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 17:38:26,310 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 35 treesize of output 1
[2024-02-28 17:38:26,382 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:38:26,382 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [732261981] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 17:38:26,382 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 17:38:26,382 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27
[2024-02-28 17:38:26,383 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539306964]
[2024-02-28 17:38:26,383 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 17:38:26,383 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2024-02-28 17:38:26,383 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:38:26,384 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2024-02-28 17:38:26,384 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=455, Unknown=5, NotChecked=240, Total=812
[2024-02-28 17:38:26,495 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 64 out of 217
[2024-02-28 17:38:26,496 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 1306 transitions, 18102 flow. Second operand  has 29 states, 29 states have (on average 66.65517241379311) internal successors, (1933), 29 states have internal predecessors, (1933), 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-02-28 17:38:26,496 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:38:26,496 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 217
[2024-02-28 17:38:26,497 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:38:39,289 INFO  L130       PetriNetUnfolder]: 27062/44967 cut-off events.
[2024-02-28 17:38:39,290 INFO  L131       PetriNetUnfolder]: For 320825/320835 co-relation queries the response was YES.
[2024-02-28 17:38:39,530 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 294720 conditions, 44967 events. 27062/44967 cut-off events. For 320825/320835 co-relation queries the response was YES. Maximal size of possible extension queue 1177. Compared 342153 event pairs, 3307 based on Foata normal form. 283/41530 useless extension candidates. Maximal degree in co-relation 256432. Up to 23187 conditions per place. 
[2024-02-28 17:38:39,740 INFO  L137   encePairwiseOnDemand]: 184/217 looper letters, 1188 selfloop transitions, 910 changer transitions 0/2101 dead transitions.
[2024-02-28 17:38:39,740 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 2101 transitions, 32784 flow
[2024-02-28 17:38:39,741 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2024-02-28 17:38:39,741 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2024-02-28 17:38:39,742 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1157 transitions.
[2024-02-28 17:38:39,743 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.380842659644503
[2024-02-28 17:38:39,743 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 1157 transitions.
[2024-02-28 17:38:39,743 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 1157 transitions.
[2024-02-28 17:38:39,743 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:38:39,744 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1157 transitions.
[2024-02-28 17:38:39,745 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 15 states, 14 states have (on average 82.64285714285714) internal successors, (1157), 14 states have internal predecessors, (1157), 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-02-28 17:38:39,747 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 15 states, 15 states have (on average 217.0) internal successors, (3255), 15 states have internal predecessors, (3255), 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-02-28 17:38:39,747 INFO  L81            ComplementDD]: Finished complementDD. Result  has 15 states, 15 states have (on average 217.0) internal successors, (3255), 15 states have internal predecessors, (3255), 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-02-28 17:38:39,748 INFO  L175             Difference]: Start difference. First operand has 172 places, 1306 transitions, 18102 flow. Second operand 14 states and 1157 transitions.
[2024-02-28 17:38:39,748 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 2101 transitions, 32784 flow
[2024-02-28 17:38:46,481 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 2101 transitions, 32421 flow, removed 138 selfloop flow, removed 9 redundant places.
[2024-02-28 17:38:46,507 INFO  L231             Difference]: Finished difference. Result has 183 places, 1750 transitions, 28975 flow
[2024-02-28 17:38:46,508 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=17885, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=466, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=525, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=28975, PETRI_PLACES=183, PETRI_TRANSITIONS=1750}
[2024-02-28 17:38:46,509 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 112 predicate places.
[2024-02-28 17:38:46,509 INFO  L495      AbstractCegarLoop]: Abstraction has has 183 places, 1750 transitions, 28975 flow
[2024-02-28 17:38:46,509 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 29 states, 29 states have (on average 66.65517241379311) internal successors, (1933), 29 states have internal predecessors, (1933), 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-02-28 17:38:46,509 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:38:46,509 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, 1, 1, 1, 1, 1]
[2024-02-28 17:38:46,516 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-02-28 17:38:46,710 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-02-28 17:38:46,711 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-02-28 17:38:46,711 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:38:46,712 INFO  L85        PathProgramCache]: Analyzing trace with hash -785127108, now seen corresponding path program 1 times
[2024-02-28 17:38:46,712 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:38:46,712 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549665859]
[2024-02-28 17:38:46,712 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:38:46,713 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:38:46,730 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:38:46,870 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 17:38:46,871 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:38:46,871 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549665859]
[2024-02-28 17:38:46,871 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549665859] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:38:46,871 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:38:46,871 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:38:46,872 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082808096]
[2024-02-28 17:38:46,872 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:38:46,873 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:38:46,873 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:38:46,873 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:38:46,874 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:38:47,178 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 113 out of 217
[2024-02-28 17:38:47,178 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 1750 transitions, 28975 flow. Second operand  has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 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-02-28 17:38:47,179 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:38:47,179 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 217
[2024-02-28 17:38:47,179 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:38:56,847 INFO  L130       PetriNetUnfolder]: 21880/39367 cut-off events.
[2024-02-28 17:38:56,848 INFO  L131       PetriNetUnfolder]: For 410800/417515 co-relation queries the response was YES.
[2024-02-28 17:38:57,040 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 266213 conditions, 39367 events. 21880/39367 cut-off events. For 410800/417515 co-relation queries the response was YES. Maximal size of possible extension queue 1269. Compared 331804 event pairs, 4147 based on Foata normal form. 1101/39049 useless extension candidates. Maximal degree in co-relation 240356. Up to 24514 conditions per place. 
[2024-02-28 17:38:57,233 INFO  L137   encePairwiseOnDemand]: 202/217 looper letters, 1438 selfloop transitions, 201 changer transitions 0/1965 dead transitions.
[2024-02-28 17:38:57,234 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 1965 transitions, 35740 flow
[2024-02-28 17:38:57,234 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:38:57,235 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:38:57,235 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 768 transitions.
[2024-02-28 17:38:57,236 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5898617511520737
[2024-02-28 17:38:57,236 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 768 transitions.
[2024-02-28 17:38:57,236 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 768 transitions.
[2024-02-28 17:38:57,236 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:38:57,236 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 768 transitions.
[2024-02-28 17:38:57,237 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 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-02-28 17:38:57,238 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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-02-28 17:38:57,238 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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-02-28 17:38:57,238 INFO  L175             Difference]: Start difference. First operand has 183 places, 1750 transitions, 28975 flow. Second operand 6 states and 768 transitions.
[2024-02-28 17:38:57,239 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 1965 transitions, 35740 flow
[2024-02-28 17:39:01,142 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 1965 transitions, 35658 flow, removed 0 selfloop flow, removed 6 redundant places.
[2024-02-28 17:39:01,177 INFO  L231             Difference]: Finished difference. Result has 187 places, 1938 transitions, 33051 flow
[2024-02-28 17:39:01,179 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=28893, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1750, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1663, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=33051, PETRI_PLACES=187, PETRI_TRANSITIONS=1938}
[2024-02-28 17:39:01,179 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 116 predicate places.
[2024-02-28 17:39:01,179 INFO  L495      AbstractCegarLoop]: Abstraction has has 187 places, 1938 transitions, 33051 flow
[2024-02-28 17:39:01,180 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 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-02-28 17:39:01,180 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:39:01,180 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:39:01,180 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-02-28 17:39:01,180 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-02-28 17:39:01,181 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:39:01,181 INFO  L85        PathProgramCache]: Analyzing trace with hash -672070267, now seen corresponding path program 2 times
[2024-02-28 17:39:01,181 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:39:01,181 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426069718]
[2024-02-28 17:39:01,181 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:39:01,181 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:39:01,195 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:39:01,579 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:39:01,579 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:39:01,579 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426069718]
[2024-02-28 17:39:01,580 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426069718] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:39:01,580 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680135763]
[2024-02-28 17:39:01,580 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-02-28 17:39:01,580 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:39:01,580 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:39:01,581 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-02-28 17:39:01,582 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-02-28 17:39:01,762 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-02-28 17:39:01,762 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 17:39:01,764 INFO  L263         TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 33 conjunts are in the unsatisfiable core
[2024-02-28 17:39:01,767 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:39:01,855 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 26 treesize of output 14
[2024-02-28 17:39:01,983 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 17:39:02,021 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 21 treesize of output 20
[2024-02-28 17:39:02,057 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:39:02,057 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 32
[2024-02-28 17:39:02,095 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:39:02,096 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 39 treesize of output 44
[2024-02-28 17:39:02,149 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:39:02,150 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 41 treesize of output 37
[2024-02-28 17:39:02,173 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:39:02,174 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 41 treesize of output 37
[2024-02-28 17:39:02,195 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:39:02,196 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 41 treesize of output 37
[2024-02-28 17:39:02,213 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:39:02,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 41 treesize of output 37
[2024-02-28 17:39:02,278 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:39:02,278 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 41 treesize of output 37
[2024-02-28 17:39:02,293 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:39:02,293 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 17:39:02,312 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1624 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1624 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1624 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1624 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) is different from false
[2024-02-28 17:39:13,412 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false
[2024-02-28 17:39:13,447 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2024-02-28 17:39:13,475 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse2 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) .cse2))) (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2024-02-28 17:39:13,519 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:39:13,520 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 38 treesize of output 54
[2024-02-28 17:39:13,530 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:39:13,531 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 130 treesize of output 66
[2024-02-28 17:39:13,538 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 28 treesize of output 24
[2024-02-28 17:39:13,541 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 42 treesize of output 34
[2024-02-28 17:39:13,567 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 17:39:13,567 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 1
[2024-02-28 17:39:13,572 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 17:39:13,572 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 1
[2024-02-28 17:39:13,577 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 17:39:13,578 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 1
[2024-02-28 17:39:13,635 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 4 times theorem prover too weak. 0 trivial. 4 not checked.
[2024-02-28 17:39:13,636 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [680135763] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 17:39:13,636 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 17:39:13,636 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 25
[2024-02-28 17:39:13,636 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361214604]
[2024-02-28 17:39:13,636 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 17:39:13,637 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2024-02-28 17:39:13,637 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:39:13,637 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2024-02-28 17:39:13,638 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=405, Unknown=16, NotChecked=180, Total=702
[2024-02-28 17:39:13,750 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 62 out of 217
[2024-02-28 17:39:13,752 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 1938 transitions, 33051 flow. Second operand  has 27 states, 27 states have (on average 65.18518518518519) internal successors, (1760), 27 states have internal predecessors, (1760), 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-02-28 17:39:13,752 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:39:13,752 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 217
[2024-02-28 17:39:13,753 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:39:37,626 INFO  L130       PetriNetUnfolder]: 31291/52080 cut-off events.
[2024-02-28 17:39:37,626 INFO  L131       PetriNetUnfolder]: For 537104/537122 co-relation queries the response was YES.
[2024-02-28 17:39:37,974 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 383472 conditions, 52080 events. 31291/52080 cut-off events. For 537104/537122 co-relation queries the response was YES. Maximal size of possible extension queue 1425. Compared 405223 event pairs, 4267 based on Foata normal form. 12/48558 useless extension candidates. Maximal degree in co-relation 350443. Up to 26739 conditions per place. 
[2024-02-28 17:39:38,212 INFO  L137   encePairwiseOnDemand]: 153/217 looper letters, 1319 selfloop transitions, 1776 changer transitions 1/3100 dead transitions.
[2024-02-28 17:39:38,212 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 3100 transitions, 53789 flow
[2024-02-28 17:39:38,213 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2024-02-28 17:39:38,213 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20 states.
[2024-02-28 17:39:38,214 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1745 transitions.
[2024-02-28 17:39:38,215 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.402073732718894
[2024-02-28 17:39:38,215 INFO  L72            ComplementDD]: Start complementDD. Operand 20 states and 1745 transitions.
[2024-02-28 17:39:38,215 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 20 states and 1745 transitions.
[2024-02-28 17:39:38,216 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:39:38,216 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1745 transitions.
[2024-02-28 17:39:38,217 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 21 states, 20 states have (on average 87.25) internal successors, (1745), 20 states have internal predecessors, (1745), 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-02-28 17:39:38,220 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 21 states, 21 states have (on average 217.0) internal successors, (4557), 21 states have internal predecessors, (4557), 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-02-28 17:39:38,221 INFO  L81            ComplementDD]: Finished complementDD. Result  has 21 states, 21 states have (on average 217.0) internal successors, (4557), 21 states have internal predecessors, (4557), 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-02-28 17:39:38,221 INFO  L175             Difference]: Start difference. First operand has 187 places, 1938 transitions, 33051 flow. Second operand 20 states and 1745 transitions.
[2024-02-28 17:39:38,221 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 3100 transitions, 53789 flow
[2024-02-28 17:39:48,147 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 3100 transitions, 53495 flow, removed 147 selfloop flow, removed 0 redundant places.
[2024-02-28 17:39:48,188 INFO  L231             Difference]: Finished difference. Result has 213 places, 2619 transitions, 49692 flow
[2024-02-28 17:39:48,189 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=32763, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1938, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1169, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=49692, PETRI_PLACES=213, PETRI_TRANSITIONS=2619}
[2024-02-28 17:39:48,190 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 142 predicate places.
[2024-02-28 17:39:48,190 INFO  L495      AbstractCegarLoop]: Abstraction has has 213 places, 2619 transitions, 49692 flow
[2024-02-28 17:39:48,190 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 27 states, 27 states have (on average 65.18518518518519) internal successors, (1760), 27 states have internal predecessors, (1760), 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-02-28 17:39:48,190 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:39:48,191 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, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:39:48,198 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-02-28 17:39:48,391 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,12 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:39:48,392 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-02-28 17:39:48,392 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:39:48,393 INFO  L85        PathProgramCache]: Analyzing trace with hash -72607429, now seen corresponding path program 1 times
[2024-02-28 17:39:48,393 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:39:48,393 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904827968]
[2024-02-28 17:39:48,394 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:39:48,394 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:39:48,416 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:39:48,876 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:39:48,876 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:39:48,876 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904827968]
[2024-02-28 17:39:48,876 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904827968] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:39:48,876 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113960630]
[2024-02-28 17:39:48,876 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:39:48,877 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:39:48,877 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:39:48,878 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-02-28 17:39:48,879 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-02-28 17:39:49,052 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:39:49,054 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 37 conjunts are in the unsatisfiable core
[2024-02-28 17:39:49,061 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:39:49,072 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:39:49,077 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:39:49,080 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 38 treesize of output 32
[2024-02-28 17:39:49,490 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-02-28 17:39:49,490 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 62
[2024-02-28 17:39:49,599 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-02-28 17:39:49,600 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 57
[2024-02-28 17:39:49,747 INFO  L321             Elim1Store]: treesize reduction 3, result has 75.0 percent of original size
[2024-02-28 17:39:49,747 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 63 treesize of output 40
[2024-02-28 17:39:49,773 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 11 treesize of output 7
[2024-02-28 17:39:49,784 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 21 treesize of output 20
[2024-02-28 17:39:49,802 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:39:49,803 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 30 treesize of output 32
[2024-02-28 17:39:49,818 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:39:49,818 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 39 treesize of output 44
[2024-02-28 17:39:49,835 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 41 treesize of output 37
[2024-02-28 17:39:49,845 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:39:49,846 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 17:39:49,863 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) is different from false
[2024-02-28 17:39:49,994 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) .cse2)))))) is different from false
[2024-02-28 17:39:50,022 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse2 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse3 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1758 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) .cse2))) (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) .cse3))) (forall ((v_ArrVal_1758 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2024-02-28 17:39:50,044 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:39:50,045 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 35 treesize of output 51
[2024-02-28 17:39:50,053 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:39:50,053 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 84 treesize of output 32
[2024-02-28 17:39:50,063 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 17:39:50,063 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 35 treesize of output 1
[2024-02-28 17:39:50,068 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 17:39:50,068 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 33 treesize of output 1
[2024-02-28 17:39:50,074 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 17:39:50,075 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 35 treesize of output 1
[2024-02-28 17:39:50,136 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1749 (Array Int Int))) (not (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1749) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false
[2024-02-28 17:39:50,144 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1749 (Array Int Int)) (v_ArrVal_1748 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1748) |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1749) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_#t~mem9#1.base|))) is different from false
[2024-02-28 17:39:50,330 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:39:50,330 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [113960630] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 17:39:50,330 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 17:39:50,330 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 27
[2024-02-28 17:39:50,331 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032545258]
[2024-02-28 17:39:50,331 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 17:39:50,331 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2024-02-28 17:39:50,332 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:39:50,332 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2024-02-28 17:39:50,333 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=464, Unknown=16, NotChecked=240, Total=812
[2024-02-28 17:39:50,502 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 59 out of 217
[2024-02-28 17:39:50,503 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 2619 transitions, 49692 flow. Second operand  has 29 states, 29 states have (on average 61.51724137931034) internal successors, (1784), 29 states have internal predecessors, (1784), 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-02-28 17:39:50,503 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:39:50,503 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 217
[2024-02-28 17:39:50,504 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:40:25,773 INFO  L130       PetriNetUnfolder]: 42687/70364 cut-off events.
[2024-02-28 17:40:25,773 INFO  L131       PetriNetUnfolder]: For 990319/990319 co-relation queries the response was YES.
[2024-02-28 17:40:26,373 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 604583 conditions, 70364 events. 42687/70364 cut-off events. For 990319/990319 co-relation queries the response was YES. Maximal size of possible extension queue 1794. Compared 557742 event pairs, 5213 based on Foata normal form. 0/65979 useless extension candidates. Maximal degree in co-relation 552010. Up to 52833 conditions per place. 
[2024-02-28 17:40:26,736 INFO  L137   encePairwiseOnDemand]: 182/217 looper letters, 4073 selfloop transitions, 657 changer transitions 4/4735 dead transitions.
[2024-02-28 17:40:26,736 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 4735 transitions, 92514 flow
[2024-02-28 17:40:26,737 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2024-02-28 17:40:26,737 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 26 states.
[2024-02-28 17:40:26,739 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1971 transitions.
[2024-02-28 17:40:26,740 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.34934420418291384
[2024-02-28 17:40:26,740 INFO  L72            ComplementDD]: Start complementDD. Operand 26 states and 1971 transitions.
[2024-02-28 17:40:26,740 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 26 states and 1971 transitions.
[2024-02-28 17:40:26,740 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:40:26,741 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1971 transitions.
[2024-02-28 17:40:26,742 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 27 states, 26 states have (on average 75.8076923076923) internal successors, (1971), 26 states have internal predecessors, (1971), 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-02-28 17:40:26,746 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 27 states, 27 states have (on average 217.0) internal successors, (5859), 27 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-02-28 17:40:26,747 INFO  L81            ComplementDD]: Finished complementDD. Result  has 27 states, 27 states have (on average 217.0) internal successors, (5859), 27 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-02-28 17:40:26,747 INFO  L175             Difference]: Start difference. First operand has 213 places, 2619 transitions, 49692 flow. Second operand 26 states and 1971 transitions.
[2024-02-28 17:40:26,747 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 4735 transitions, 92514 flow
[2024-02-28 17:41:02,733 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 4735 transitions, 90444 flow, removed 952 selfloop flow, removed 11 redundant places.
[2024-02-28 17:41:02,796 INFO  L231             Difference]: Finished difference. Result has 245 places, 3307 transitions, 64319 flow
[2024-02-28 17:41:02,799 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=48472, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2619, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=64319, PETRI_PLACES=245, PETRI_TRANSITIONS=3307}
[2024-02-28 17:41:02,800 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 174 predicate places.
[2024-02-28 17:41:02,800 INFO  L495      AbstractCegarLoop]: Abstraction has has 245 places, 3307 transitions, 64319 flow
[2024-02-28 17:41:02,800 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 29 states, 29 states have (on average 61.51724137931034) internal successors, (1784), 29 states have internal predecessors, (1784), 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-02-28 17:41:02,800 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:41:02,800 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, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:41:02,806 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-02-28 17:41:03,001 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,SelfDestructingSolverStorable21
[2024-02-28 17:41:03,002 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-02-28 17:41:03,003 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:41:03,003 INFO  L85        PathProgramCache]: Analyzing trace with hash -824079329, now seen corresponding path program 2 times
[2024-02-28 17:41:03,004 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:41:03,004 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932211571]
[2024-02-28 17:41:03,004 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:41:03,004 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:41:03,034 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:41:03,430 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:41:03,431 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:41:03,431 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932211571]
[2024-02-28 17:41:03,431 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932211571] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:41:03,431 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742576424]
[2024-02-28 17:41:03,431 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-02-28 17:41:03,431 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:41:03,431 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:41:03,433 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-02-28 17:41:03,434 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-02-28 17:41:03,655 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-02-28 17:41:03,655 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 17:41:03,657 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 62 conjunts are in the unsatisfiable core
[2024-02-28 17:41:03,661 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:41:03,687 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 103 treesize of output 97
[2024-02-28 17:41:04,182 INFO  L321             Elim1Store]: treesize reduction 32, result has 31.9 percent of original size
[2024-02-28 17:41:04,182 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 59
[2024-02-28 17:41:04,188 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:41:04,190 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:41:04,205 INFO  L321             Elim1Store]: treesize reduction 15, result has 46.4 percent of original size
[2024-02-28 17:41:04,205 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 1 case distinctions, treesize of input 32 treesize of output 43
[2024-02-28 17:41:04,229 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 11 treesize of output 7
[2024-02-28 17:41:04,240 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 22 treesize of output 16
[2024-02-28 17:41:04,437 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 25 treesize of output 13
[2024-02-28 17:41:04,444 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 15 treesize of output 7
[2024-02-28 17:41:04,565 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 11 treesize of output 7
[2024-02-28 17:41:04,616 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:41:04,617 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 21 treesize of output 20
[2024-02-28 17:41:04,673 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:41:04,674 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:41:04,677 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 30 treesize of output 32
[2024-02-28 17:41:04,754 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:41:04,755 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:41:04,756 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:41:04,757 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 39 treesize of output 44
[2024-02-28 17:41:04,820 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:41:04,821 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:41:04,823 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:41:04,823 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 46 treesize of output 54
[2024-02-28 17:41:04,869 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:41:04,869 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 17:41:06,209 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_1883 (Array Int Int))) (not (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1883) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))))) (.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (or .cse0 (forall ((v_ArrVal_1882 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1882) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| .cse1 3))))) (or .cse0 (forall ((v_ArrVal_1882 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1882) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| .cse1 1))))) (or .cse0 (forall ((v_ArrVal_1882 (Array Int Int))) (not (= (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| .cse1) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1882) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))))) (or .cse0 (forall ((v_ArrVal_1882 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1882) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| .cse1 2))))))) is different from false
[2024-02-28 17:41:06,836 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:41:06,836 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742576424] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 17:41:06,836 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 17:41:06,837 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 38
[2024-02-28 17:41:06,837 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097111159]
[2024-02-28 17:41:06,837 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 17:41:06,838 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 40 states
[2024-02-28 17:41:06,838 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:41:06,838 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants.
[2024-02-28 17:41:06,839 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1277, Unknown=10, NotChecked=74, Total=1560
[2024-02-28 17:41:07,483 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 49 out of 217
[2024-02-28 17:41:07,485 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 3307 transitions, 64319 flow. Second operand  has 40 states, 40 states have (on average 51.375) internal successors, (2055), 40 states have internal predecessors, (2055), 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-02-28 17:41:07,486 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:41:07,486 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 217
[2024-02-28 17:41:07,486 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:42:04,000 INFO  L130       PetriNetUnfolder]: 49515/81428 cut-off events.
[2024-02-28 17:42:04,000 INFO  L131       PetriNetUnfolder]: For 1633611/1633611 co-relation queries the response was YES.
[2024-02-28 17:42:04,815 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 755413 conditions, 81428 events. 49515/81428 cut-off events. For 1633611/1633611 co-relation queries the response was YES. Maximal size of possible extension queue 2184. Compared 665098 event pairs, 9667 based on Foata normal form. 262/78309 useless extension candidates. Maximal degree in co-relation 690433. Up to 68717 conditions per place. 
[2024-02-28 17:42:05,250 INFO  L137   encePairwiseOnDemand]: 189/217 looper letters, 3883 selfloop transitions, 533 changer transitions 8/4425 dead transitions.
[2024-02-28 17:42:05,250 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 4425 transitions, 93765 flow
[2024-02-28 17:42:05,251 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2024-02-28 17:42:05,252 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 23 states.
[2024-02-28 17:42:05,253 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1454 transitions.
[2024-02-28 17:42:05,254 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2913243838910038
[2024-02-28 17:42:05,254 INFO  L72            ComplementDD]: Start complementDD. Operand 23 states and 1454 transitions.
[2024-02-28 17:42:05,254 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 23 states and 1454 transitions.
[2024-02-28 17:42:05,254 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:42:05,255 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1454 transitions.
[2024-02-28 17:42:05,256 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 24 states, 23 states have (on average 63.21739130434783) internal successors, (1454), 23 states have internal predecessors, (1454), 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-02-28 17:42:05,259 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 24 states, 24 states have (on average 217.0) internal successors, (5208), 24 states have internal predecessors, (5208), 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-02-28 17:42:05,259 INFO  L81            ComplementDD]: Finished complementDD. Result  has 24 states, 24 states have (on average 217.0) internal successors, (5208), 24 states have internal predecessors, (5208), 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-02-28 17:42:05,260 INFO  L175             Difference]: Start difference. First operand has 245 places, 3307 transitions, 64319 flow. Second operand 23 states and 1454 transitions.
[2024-02-28 17:42:05,260 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 4425 transitions, 93765 flow
[2024-02-28 17:42:59,476 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 4425 transitions, 92805 flow, removed 477 selfloop flow, removed 3 redundant places.
[2024-02-28 17:42:59,549 INFO  L231             Difference]: Finished difference. Result has 277 places, 3887 transitions, 78848 flow
[2024-02-28 17:42:59,552 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=63383, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2989, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=78848, PETRI_PLACES=277, PETRI_TRANSITIONS=3887}
[2024-02-28 17:42:59,552 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 206 predicate places.
[2024-02-28 17:42:59,552 INFO  L495      AbstractCegarLoop]: Abstraction has has 277 places, 3887 transitions, 78848 flow
[2024-02-28 17:42:59,553 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 40 states, 40 states have (on average 51.375) internal successors, (2055), 40 states have internal predecessors, (2055), 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-02-28 17:42:59,553 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:42:59,553 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, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:42:59,560 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-02-28 17:42:59,753 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,SelfDestructingSolverStorable22
[2024-02-28 17:42:59,754 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-02-28 17:42:59,754 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:42:59,755 INFO  L85        PathProgramCache]: Analyzing trace with hash -1854593521, now seen corresponding path program 3 times
[2024-02-28 17:42:59,755 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:42:59,755 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174978546]
[2024-02-28 17:42:59,755 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:42:59,756 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:42:59,777 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:43:00,310 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:43:00,311 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:43:00,311 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174978546]
[2024-02-28 17:43:00,311 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174978546] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:43:00,311 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246830017]
[2024-02-28 17:43:00,311 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-02-28 17:43:00,312 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:43:00,312 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:43:00,313 INFO  L229       MonitoredProcess]: Starting monitored process 15 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 17:43:00,314 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process
[2024-02-28 17:43:00,483 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-02-28 17:43:00,483 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 17:43:00,485 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 82 conjunts are in the unsatisfiable core
[2024-02-28 17:43:00,490 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:43:00,524 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:43:00,527 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:43:00,530 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 22 treesize of output 16
[2024-02-28 17:43:01,122 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-02-28 17:43:01,122 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 70
[2024-02-28 17:43:01,132 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:43:01,134 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:43:01,135 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:43:01,136 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 32 treesize of output 35
[2024-02-28 17:43:01,318 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-02-28 17:43:01,318 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 57
[2024-02-28 17:43:01,327 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:43:01,329 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:43:01,331 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:43:01,332 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31
[2024-02-28 17:43:01,421 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 17:43:01,605 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-02-28 17:43:01,606 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 63 treesize of output 35
[2024-02-28 17:43:01,619 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10
[2024-02-28 17:43:01,694 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:43:01,695 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 21 treesize of output 20
[2024-02-28 17:43:01,772 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:43:01,774 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:43:01,774 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 30 treesize of output 32
[2024-02-28 17:43:01,857 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:43:01,858 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:43:01,860 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:43:01,861 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 39 treesize of output 44
[2024-02-28 17:43:01,949 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:43:01,950 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 41 treesize of output 37
[2024-02-28 17:43:01,992 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:43:01,993 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 41 treesize of output 37
[2024-02-28 17:43:02,032 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:43:02,033 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 41 treesize of output 37
[2024-02-28 17:43:02,074 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:43:02,075 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:43:02,076 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:43:02,077 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:43:02,079 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56
[2024-02-28 17:43:02,288 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:43:02,290 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:43:02,290 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47
[2024-02-28 17:43:02,367 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:43:02,368 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 17:43:02,393 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2037 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2037 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_2037 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_2037 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) is different from false
[2024-02-28 17:43:02,515 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (and (forall ((v_ArrVal_2037 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2037 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_2037 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2037 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false
[2024-02-28 17:43:02,529 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:43:02,530 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24
[2024-02-28 17:43:02,544 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:43:02,545 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22
[2024-02-28 17:43:02,557 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:43:02,557 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24
[2024-02-28 17:43:02,568 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:43:02,568 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24
[2024-02-28 17:43:02,581 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_arrayElimArr_15 (Array Int Int)) (v_ArrVal_2037 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_arrayElimArr_15) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (not (= (select v_arrayElimArr_15 .cse0) 0)))) (forall ((v_arrayElimArr_17 (Array Int Int)) (v_ArrVal_2037 (Array Int Int))) (or (not (= (select v_arrayElimArr_17 .cse0) 0)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_2037 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_arrayElimArr_14) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (not (= (select v_arrayElimArr_14 .cse0) 0)))) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_ArrVal_2037 (Array Int Int))) (or (not (= (select v_arrayElimArr_16 .cse0) 0)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_arrayElimArr_16) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2024-02-28 17:43:02,682 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_arrayElimArr_17 (Array Int Int)) (v_ArrVal_2037 (Array Int Int))) (or (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|) (not (= (select v_arrayElimArr_17 .cse2) 0)))) (forall ((v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_2037 (Array Int Int))) (or (not (= (select v_arrayElimArr_14 .cse2) 0)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_arrayElimArr_14) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_ArrVal_2037 (Array Int Int))) (or (not (= (select v_arrayElimArr_16 .cse2) 0)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_arrayElimArr_16) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) (forall ((v_arrayElimArr_15 (Array Int Int)) (v_ArrVal_2037 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_arrayElimArr_15) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (not (= (select v_arrayElimArr_15 .cse2) 0))))))) is different from false
[2024-02-28 17:43:02,732 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_arrayElimArr_17 (Array Int Int)) (v_ArrVal_2037 (Array Int Int))) (or (not (= (select v_arrayElimArr_17 .cse0) 0)) (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_arrayElimArr_15 (Array Int Int)) (v_ArrVal_2037 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_arrayElimArr_15) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (not (= (select v_arrayElimArr_15 .cse0) 0)))) (forall ((v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_2037 (Array Int Int))) (or (not (= (select v_arrayElimArr_14 .cse0) 0)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_arrayElimArr_14) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) .cse3)))) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_ArrVal_2037 (Array Int Int))) (or (not (= (select v_arrayElimArr_16 .cse0) 0)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_arrayElimArr_16) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))))))) is different from false
[2024-02-28 17:43:02,782 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse4 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse3 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse2 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_arrayElimArr_16 (Array Int Int)) (v_ArrVal_2037 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_arrayElimArr_16) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) .cse1)) (not (= (select v_arrayElimArr_16 .cse2) 0)))) (forall ((v_arrayElimArr_17 (Array Int Int)) (v_ArrVal_2037 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) .cse3)) (not (= (select v_arrayElimArr_17 .cse2) 0)))) (forall ((v_arrayElimArr_15 (Array Int Int)) (v_ArrVal_2037 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_arrayElimArr_15) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (not (= (select v_arrayElimArr_15 .cse2) 0)))) (forall ((v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_2037 (Array Int Int))) (or (not (= (select v_arrayElimArr_14 .cse2) 0)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_arrayElimArr_14) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) .cse4))))))) is different from false
[2024-02-28 17:43:02,834 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse5 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse4 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_arrayElimArr_16 (Array Int Int)) (v_ArrVal_2037 (Array Int Int))) (or (not (= (select v_arrayElimArr_16 .cse0) 0)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_arrayElimArr_16) .cse2 v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) .cse3)))) (forall ((v_arrayElimArr_15 (Array Int Int)) (v_ArrVal_2037 (Array Int Int))) (or (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_arrayElimArr_15) .cse2 v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (not (= (select v_arrayElimArr_15 .cse0) 0)))) (forall ((v_arrayElimArr_17 (Array Int Int)) (v_ArrVal_2037 (Array Int Int))) (or (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_arrayElimArr_17) .cse2 v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) .cse4) |c_threadThread1of2ForFork0_#t~nondet4|) (not (= (select v_arrayElimArr_17 .cse0) 0)))) (forall ((v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_2037 (Array Int Int))) (or (not (= (select v_arrayElimArr_14 .cse0) 0)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_arrayElimArr_14) .cse2 v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) .cse5))))))) is different from false
[2024-02-28 17:43:02,952 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:43:02,953 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 40 treesize of output 56
[2024-02-28 17:43:02,960 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:43:02,960 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 138 treesize of output 76
[2024-02-28 17:43:02,965 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 52 treesize of output 48
[2024-02-28 17:43:02,976 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:43:02,976 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 39 treesize of output 43
[2024-02-28 17:43:03,038 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 17:43:03,038 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2024-02-28 17:43:03,047 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 17:43:03,047 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2024-02-28 17:43:03,057 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 17:43:03,057 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2024-02-28 17:43:03,200 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-02-28 17:43:03,201 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [246830017] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 17:43:03,201 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 17:43:03,201 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 15] total 36
[2024-02-28 17:43:03,201 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426209098]
[2024-02-28 17:43:03,202 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 17:43:03,202 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 38 states
[2024-02-28 17:43:03,202 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:43:03,202 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants.
[2024-02-28 17:43:03,203 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=807, Unknown=9, NotChecked=448, Total=1406
[2024-02-28 17:43:03,479 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 54 out of 217
[2024-02-28 17:43:03,480 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 3887 transitions, 78848 flow. Second operand  has 38 states, 38 states have (on average 56.39473684210526) internal successors, (2143), 38 states have internal predecessors, (2143), 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-02-28 17:43:03,480 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:43:03,481 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 217
[2024-02-28 17:43:03,481 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:43:17,979 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1]
[2024-02-28 17:43:21,586 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1]
[2024-02-28 17:43:23,606 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1]
[2024-02-28 17:44:26,425 INFO  L130       PetriNetUnfolder]: 50592/83256 cut-off events.
[2024-02-28 17:44:26,426 INFO  L131       PetriNetUnfolder]: For 1816496/1816496 co-relation queries the response was YES.
[2024-02-28 17:44:27,495 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 792809 conditions, 83256 events. 50592/83256 cut-off events. For 1816496/1816496 co-relation queries the response was YES. Maximal size of possible extension queue 2251. Compared 679260 event pairs, 9489 based on Foata normal form. 54/79929 useless extension candidates. Maximal degree in co-relation 791289. Up to 73539 conditions per place. 
[2024-02-28 17:44:27,955 INFO  L137   encePairwiseOnDemand]: 166/217 looper letters, 5498 selfloop transitions, 764 changer transitions 132/6395 dead transitions.
[2024-02-28 17:44:27,955 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 6395 transitions, 133104 flow
[2024-02-28 17:44:27,956 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. 
[2024-02-28 17:44:27,956 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 38 states.
[2024-02-28 17:44:27,958 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 2731 transitions.
[2024-02-28 17:44:27,959 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3311908804268736
[2024-02-28 17:44:27,959 INFO  L72            ComplementDD]: Start complementDD. Operand 38 states and 2731 transitions.
[2024-02-28 17:44:27,959 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 38 states and 2731 transitions.
[2024-02-28 17:44:27,959 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:44:27,959 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 2731 transitions.
[2024-02-28 17:44:27,962 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 39 states, 38 states have (on average 71.86842105263158) internal successors, (2731), 38 states have internal predecessors, (2731), 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-02-28 17:44:27,971 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 39 states, 39 states have (on average 217.0) internal successors, (8463), 39 states have internal predecessors, (8463), 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-02-28 17:44:27,972 INFO  L81            ComplementDD]: Finished complementDD. Result  has 39 states, 39 states have (on average 217.0) internal successors, (8463), 39 states have internal predecessors, (8463), 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-02-28 17:44:27,972 INFO  L175             Difference]: Start difference. First operand has 277 places, 3887 transitions, 78848 flow. Second operand 38 states and 2731 transitions.
[2024-02-28 17:44:27,972 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 6395 transitions, 133104 flow
[2024-02-28 17:45:32,471 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 6395 transitions, 131212 flow, removed 939 selfloop flow, removed 6 redundant places.
[2024-02-28 17:45:32,565 INFO  L231             Difference]: Finished difference. Result has 328 places, 4534 transitions, 92682 flow
[2024-02-28 17:45:32,567 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=77566, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3887, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=233, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3505, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=92682, PETRI_PLACES=328, PETRI_TRANSITIONS=4534}
[2024-02-28 17:45:32,568 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 257 predicate places.
[2024-02-28 17:45:32,568 INFO  L495      AbstractCegarLoop]: Abstraction has has 328 places, 4534 transitions, 92682 flow
[2024-02-28 17:45:32,568 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 38 states, 38 states have (on average 56.39473684210526) internal successors, (2143), 38 states have internal predecessors, (2143), 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-02-28 17:45:32,568 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:45:32,568 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, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:45:32,576 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0
[2024-02-28 17:45:32,769 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:45:32,769 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-02-28 17:45:32,770 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:45:32,770 INFO  L85        PathProgramCache]: Analyzing trace with hash 707852091, now seen corresponding path program 4 times
[2024-02-28 17:45:32,771 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:45:32,771 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380160937]
[2024-02-28 17:45:32,771 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:45:32,771 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:45:32,796 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:45:33,381 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:45:33,381 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:45:33,381 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380160937]
[2024-02-28 17:45:33,381 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380160937] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:45:33,382 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245994803]
[2024-02-28 17:45:33,382 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-02-28 17:45:33,382 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:45:33,382 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:45:33,383 INFO  L229       MonitoredProcess]: Starting monitored process 16 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 17:45:33,385 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process
[2024-02-28 17:45:33,657 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-02-28 17:45:33,657 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 17:45:33,660 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 55 conjunts are in the unsatisfiable core
[2024-02-28 17:45:33,664 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:45:33,687 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:45:33,689 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:45:33,692 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 38 treesize of output 32
[2024-02-28 17:45:33,765 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 15 treesize of output 7
[2024-02-28 17:45:34,298 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-02-28 17:45:34,298 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 62
[2024-02-28 17:45:34,423 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-02-28 17:45:34,424 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 57
[2024-02-28 17:45:34,532 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 17:45:34,622 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:45:34,622 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 21 treesize of output 20
[2024-02-28 17:45:34,724 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:45:34,725 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:45:34,728 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:45:34,728 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2024-02-28 17:45:34,820 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:45:34,822 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:45:34,823 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:45:34,827 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:45:34,827 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 39 treesize of output 44
[2024-02-28 17:45:35,065 INFO  L321             Elim1Store]: treesize reduction 3, result has 75.0 percent of original size
[2024-02-28 17:45:35,066 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 63 treesize of output 40
[2024-02-28 17:45:35,146 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:45:35,147 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 41 treesize of output 37
[2024-02-28 17:45:35,165 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:45:35,166 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 41 treesize of output 37
[2024-02-28 17:45:35,185 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:45:35,185 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 41 treesize of output 37
[2024-02-28 17:45:35,208 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:45:35,208 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 41 treesize of output 37
[2024-02-28 17:45:35,295 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 41 treesize of output 37
[2024-02-28 17:45:35,349 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:45:35,349 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 17:45:35,372 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2175 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2175) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2175 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2175) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2175 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2175) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2175 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2175) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2024-02-28 17:45:35,418 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2174 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2174) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2175) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2174 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2174) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2175) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2174 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2174) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2175) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2174 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2174) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2175) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) is different from false
[2024-02-28 17:45:35,485 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2174 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2174) .cse0 v_ArrVal_2175) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2174 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2174) .cse0 v_ArrVal_2175) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2174 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2174) .cse0 v_ArrVal_2175) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2174 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2174) .cse0 v_ArrVal_2175) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false
[2024-02-28 17:45:35,994 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse3 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2174 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2174) .cse1 v_ArrVal_2175) c_threadThread1of2ForFork0_~p~0.base) .cse2))) (forall ((v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2174 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2174) .cse1 v_ArrVal_2175) c_threadThread1of2ForFork0_~p~0.base) .cse3))) (forall ((v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2174 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2174) .cse1 v_ArrVal_2175) c_threadThread1of2ForFork0_~p~0.base) .cse4))) (forall ((v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2174 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2174) .cse1 v_ArrVal_2175) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false
[2024-02-28 17:45:36,013 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:45:36,014 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 40 treesize of output 56
[2024-02-28 17:45:36,020 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:45:36,020 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 138 treesize of output 76
[2024-02-28 17:45:36,026 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 32 treesize of output 30
[2024-02-28 17:45:36,028 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 50 treesize of output 46
[2024-02-28 17:45:36,054 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 17:45:36,055 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2024-02-28 17:45:36,059 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 17:45:36,059 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2024-02-28 17:45:36,064 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 17:45:36,064 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2024-02-28 17:45:36,338 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-02-28 17:45:36,338 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [245994803] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 17:45:36,339 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 17:45:36,339 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 13] total 35
[2024-02-28 17:45:36,339 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768380591]
[2024-02-28 17:45:36,339 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 17:45:36,339 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 37 states
[2024-02-28 17:45:36,340 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:45:36,340 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants.
[2024-02-28 17:45:36,340 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=881, Unknown=35, NotChecked=260, Total=1332
[2024-02-28 17:45:36,611 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 54 out of 217
[2024-02-28 17:45:36,613 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 4534 transitions, 92682 flow. Second operand  has 37 states, 37 states have (on average 56.513513513513516) internal successors, (2091), 37 states have internal predecessors, (2091), 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-02-28 17:45:36,613 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:45:36,614 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 217
[2024-02-28 17:45:36,614 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:47:04,174 INFO  L130       PetriNetUnfolder]: 53834/88298 cut-off events.
[2024-02-28 17:47:04,177 INFO  L131       PetriNetUnfolder]: For 2345795/2345795 co-relation queries the response was YES.
[2024-02-28 17:47:05,586 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 894355 conditions, 88298 events. 53834/88298 cut-off events. For 2345795/2345795 co-relation queries the response was YES. Maximal size of possible extension queue 2328. Compared 721642 event pairs, 9525 based on Foata normal form. 35/84952 useless extension candidates. Maximal degree in co-relation 892768. Up to 78731 conditions per place. 
[2024-02-28 17:47:06,094 INFO  L137   encePairwiseOnDemand]: 164/217 looper letters, 5723 selfloop transitions, 1184 changer transitions 83/6991 dead transitions.
[2024-02-28 17:47:06,094 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 6991 transitions, 147627 flow
[2024-02-28 17:47:06,095 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. 
[2024-02-28 17:47:06,095 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 60 states.
[2024-02-28 17:47:06,099 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 4207 transitions.
[2024-02-28 17:47:06,101 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3231182795698925
[2024-02-28 17:47:06,102 INFO  L72            ComplementDD]: Start complementDD. Operand 60 states and 4207 transitions.
[2024-02-28 17:47:06,102 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 60 states and 4207 transitions.
[2024-02-28 17:47:06,104 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:47:06,106 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 60 states and 4207 transitions.
[2024-02-28 17:47:06,114 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 61 states, 60 states have (on average 70.11666666666666) internal successors, (4207), 60 states have internal predecessors, (4207), 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-02-28 17:47:06,121 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 61 states, 61 states have (on average 217.0) internal successors, (13237), 61 states have internal predecessors, (13237), 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-02-28 17:47:06,122 INFO  L81            ComplementDD]: Finished complementDD. Result  has 61 states, 61 states have (on average 217.0) internal successors, (13237), 61 states have internal predecessors, (13237), 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-02-28 17:47:06,122 INFO  L175             Difference]: Start difference. First operand has 328 places, 4534 transitions, 92682 flow. Second operand 60 states and 4207 transitions.
[2024-02-28 17:47:06,122 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 6991 transitions, 147627 flow
[2024-02-28 17:49:03,035 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 6991 transitions, 145506 flow, removed 1032 selfloop flow, removed 16 redundant places.
[2024-02-28 17:49:03,131 INFO  L231             Difference]: Finished difference. Result has 394 places, 5399 transitions, 114358 flow
[2024-02-28 17:49:03,133 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=91433, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4534, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=469, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3713, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=114358, PETRI_PLACES=394, PETRI_TRANSITIONS=5399}
[2024-02-28 17:49:03,134 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 323 predicate places.
[2024-02-28 17:49:03,134 INFO  L495      AbstractCegarLoop]: Abstraction has has 394 places, 5399 transitions, 114358 flow
[2024-02-28 17:49:03,134 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 37 states, 37 states have (on average 56.513513513513516) internal successors, (2091), 37 states have internal predecessors, (2091), 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-02-28 17:49:03,134 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:49:03,134 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, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:49:03,143 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0
[2024-02-28 17:49:03,336 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:49:03,336 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-02-28 17:49:03,337 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:49:03,337 INFO  L85        PathProgramCache]: Analyzing trace with hash 1518527059, now seen corresponding path program 5 times
[2024-02-28 17:49:03,337 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:49:03,337 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228058241]
[2024-02-28 17:49:03,337 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:49:03,337 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:49:03,354 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:49:03,895 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:49:03,895 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:49:03,896 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228058241]
[2024-02-28 17:49:03,896 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228058241] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:49:03,896 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862380171]
[2024-02-28 17:49:03,896 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-02-28 17:49:03,896 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:49:03,896 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:49:03,897 INFO  L229       MonitoredProcess]: Starting monitored process 17 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 17:49:03,898 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process
[2024-02-28 17:49:04,138 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-02-28 17:49:04,138 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 17:49:04,140 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 62 conjunts are in the unsatisfiable core
[2024-02-28 17:49:04,144 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:49:04,157 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:49:04,159 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:49:04,167 INFO  L321             Elim1Store]: treesize reduction 15, result has 6.3 percent of original size
[2024-02-28 17:49:04,167 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 39 treesize of output 27
[2024-02-28 17:49:04,234 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 15 treesize of output 7
[2024-02-28 17:49:04,589 INFO  L321             Elim1Store]: treesize reduction 32, result has 31.9 percent of original size
[2024-02-28 17:49:04,589 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 58
[2024-02-28 17:49:04,606 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 24 treesize of output 18
[2024-02-28 17:49:04,787 INFO  L321             Elim1Store]: treesize reduction 32, result has 31.9 percent of original size
[2024-02-28 17:49:04,787 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 68
[2024-02-28 17:49:04,878 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 17:49:04,968 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:49:04,969 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 21 treesize of output 20
[2024-02-28 17:49:05,079 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:49:05,081 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:49:05,083 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:49:05,083 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2024-02-28 17:49:05,318 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:49:05,318 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 70 treesize of output 50
[2024-02-28 17:49:05,408 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:49:05,409 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:49:05,410 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:49:05,412 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 39 treesize of output 44
[2024-02-28 17:49:05,476 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:49:05,477 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-02-28 17:49:05,500 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:49:05,500 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-02-28 17:49:05,523 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:49:05,524 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-02-28 17:49:05,541 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:49:05,542 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-02-28 17:49:05,617 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 41 treesize of output 37
[2024-02-28 17:49:05,662 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:49:05,663 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 17:49:05,683 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2314 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2314) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2314 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2314) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_2314 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2314) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2314 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2314) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) is different from false
[2024-02-28 17:49:05,716 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2314 (Array Int Int)) (v_ArrVal_2313 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2313) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2314) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2314 (Array Int Int)) (v_ArrVal_2313 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2313) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2314) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2314 (Array Int Int)) (v_ArrVal_2313 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2313) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2314) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2314 (Array Int Int)) (v_ArrVal_2313 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2313) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2314) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2024-02-28 17:49:06,868 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:49:06,868 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 42 treesize of output 58
[2024-02-28 17:49:06,874 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:49:06,875 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 228 treesize of output 154
[2024-02-28 17:49:06,884 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 126 treesize of output 110
[2024-02-28 17:49:06,891 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 59 treesize of output 51
[2024-02-28 17:49:06,917 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 17:49:06,917 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2024-02-28 17:49:06,922 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 17:49:06,923 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2024-02-28 17:49:06,927 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 17:49:06,927 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 1
[2024-02-28 17:49:07,090 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:49:07,090 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862380171] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 17:49:07,090 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 17:49:07,090 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 34
[2024-02-28 17:49:07,090 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622439264]
[2024-02-28 17:49:07,091 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 17:49:07,091 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 36 states
[2024-02-28 17:49:07,091 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:49:07,092 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants.
[2024-02-28 17:49:07,092 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=902, Unknown=85, NotChecked=130, Total=1260
[2024-02-28 17:49:07,641 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 54 out of 217
[2024-02-28 17:49:07,642 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 5399 transitions, 114358 flow. Second operand  has 36 states, 36 states have (on average 56.55555555555556) internal successors, (2036), 36 states have internal predecessors, (2036), 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-02-28 17:49:07,642 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:49:07,642 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 217
[2024-02-28 17:49:07,643 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
Killed by 15
