./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-in-array.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-in-array.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --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 0026ab1092a8a0465a20b39c2dea92fa9c4dc52098c477016ebc8544f5aaf0f0 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:28:03,359 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:28:03,440 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-29 04:28:03,444 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:28:03,445 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:28:03,469 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:28:03,470 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:28:03,470 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:28:03,471 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:28:03,472 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:28:03,472 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:28:03,473 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:28:03,473 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:28:03,474 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:28:03,474 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:28:03,475 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:28:03,475 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:28:03,476 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:28:03,476 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:28:03,477 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:28:03,477 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:28:03,478 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:28:03,478 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-29 04:28:03,479 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 04:28:03,479 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:28:03,479 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:28:03,480 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:28:03,480 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:28:03,481 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:28:03,481 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:28:03,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:28:03,482 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:28:03,482 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:28:03,483 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:28:03,483 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:28:03,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:28:03,484 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:28:03,484 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:28:03,485 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:28:03,485 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:28:03,485 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:28:03,485 INFO L153 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 0026ab1092a8a0465a20b39c2dea92fa9c4dc52098c477016ebc8544f5aaf0f0 [2023-11-29 04:28:03,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:28:03,733 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:28:03,736 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:28:03,737 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:28:03,737 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:28:03,739 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-in-array.i [2023-11-29 04:28:06,405 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:28:06,685 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:28:06,686 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/sv-benchmarks/c/pthread-race-challenges/per-thread-struct-in-array.i [2023-11-29 04:28:06,702 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/data/8839d7ee2/590f2aa4ef1b4627914995c71ee96905/FLAG15e1fb21b [2023-11-29 04:28:06,714 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/data/8839d7ee2/590f2aa4ef1b4627914995c71ee96905 [2023-11-29 04:28:06,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:28:06,718 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:28:06,719 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:28:06,719 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:28:06,723 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:28:06,724 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:28:06" (1/1) ... [2023-11-29 04:28:06,725 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32abb284 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:28:06, skipping insertion in model container [2023-11-29 04:28:06,725 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:28:06" (1/1) ... [2023-11-29 04:28:06,776 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:28:07,130 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:28:07,139 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:28:07,181 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:28:07,226 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:28:07,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:28:07 WrapperNode [2023-11-29 04:28:07,226 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:28:07,227 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:28:07,227 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:28:07,228 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:28:07,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:28:07" (1/1) ... [2023-11-29 04:28:07,252 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:28:07" (1/1) ... [2023-11-29 04:28:07,280 INFO L138 Inliner]: procedures = 265, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2023-11-29 04:28:07,280 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:28:07,281 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:28:07,281 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:28:07,281 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:28:07,288 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:28:07" (1/1) ... [2023-11-29 04:28:07,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:28:07" (1/1) ... [2023-11-29 04:28:07,293 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:28:07" (1/1) ... [2023-11-29 04:28:07,293 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:28:07" (1/1) ... [2023-11-29 04:28:07,305 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:28:07" (1/1) ... [2023-11-29 04:28:07,309 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:28:07" (1/1) ... [2023-11-29 04:28:07,311 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:28:07" (1/1) ... [2023-11-29 04:28:07,313 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:28:07" (1/1) ... [2023-11-29 04:28:07,316 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:28:07,317 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:28:07,317 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:28:07,318 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:28:07,319 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:28:07" (1/1) ... [2023-11-29 04:28:07,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:28:07,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:28:07,348 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:28:07,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:28:07,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 04:28:07,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-29 04:28:07,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:28:07,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-29 04:28:07,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 04:28:07,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 04:28:07,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 04:28:07,390 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-29 04:28:07,391 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-29 04:28:07,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:28:07,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:28:07,392 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 04:28:07,515 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:28:07,517 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:28:07,749 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:28:07,760 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:28:07,760 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 04:28:07,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:28:07 BoogieIcfgContainer [2023-11-29 04:28:07,762 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:28:07,765 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:28:07,765 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:28:07,768 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:28:07,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:28:06" (1/3) ... [2023-11-29 04:28:07,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d70404c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:28:07, skipping insertion in model container [2023-11-29 04:28:07,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:28:07" (2/3) ... [2023-11-29 04:28:07,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d70404c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:28:07, skipping insertion in model container [2023-11-29 04:28:07,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:28:07" (3/3) ... [2023-11-29 04:28:07,772 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-struct-in-array.i [2023-11-29 04:28:07,781 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 04:28:07,792 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:28:07,792 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-29 04:28:07,792 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 04:28:07,851 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-29 04:28:07,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 122 transitions, 251 flow [2023-11-29 04:28:07,964 INFO L124 PetriNetUnfolderBase]: 6/188 cut-off events. [2023-11-29 04:28:07,964 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-29 04:28:07,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 188 events. 6/188 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 382 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 91. Up to 4 conditions per place. [2023-11-29 04:28:07,970 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 122 transitions, 251 flow [2023-11-29 04:28:07,975 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 122 transitions, 251 flow [2023-11-29 04:28:07,986 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:28:07,993 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=LoopHeads, 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;@345563a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:28:07,993 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-11-29 04:28:08,005 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 04:28:08,005 INFO L124 PetriNetUnfolderBase]: 3/42 cut-off events. [2023-11-29 04:28:08,005 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 04:28:08,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:28:08,006 INFO L208 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] [2023-11-29 04:28:08,007 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)] === [2023-11-29 04:28:08,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:28:08,012 INFO L85 PathProgramCache]: Analyzing trace with hash 578939384, now seen corresponding path program 1 times [2023-11-29 04:28:08,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:28:08,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692997396] [2023-11-29 04:28:08,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:28:08,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:28:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:28:08,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:28:08,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:28:08,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692997396] [2023-11-29 04:28:08,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692997396] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:28:08,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:28:08,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:28:08,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817406047] [2023-11-29 04:28:08,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:28:08,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:28:08,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:28:08,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:28:08,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:28:09,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 122 [2023-11-29 04:28:09,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 122 transitions, 251 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) [2023-11-29 04:28:09,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:28:09,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 122 [2023-11-29 04:28:09,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:28:09,382 INFO L124 PetriNetUnfolderBase]: 81/497 cut-off events. [2023-11-29 04:28:09,383 INFO L125 PetriNetUnfolderBase]: For 8/12 co-relation queries the response was YES. [2023-11-29 04:28:09,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 711 conditions, 497 events. 81/497 cut-off events. For 8/12 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2288 event pairs, 6 based on Foata normal form. 12/466 useless extension candidates. Maximal degree in co-relation 591. Up to 140 conditions per place. [2023-11-29 04:28:09,388 INFO L140 encePairwiseOnDemand]: 102/122 looper letters, 28 selfloop transitions, 24 changer transitions 1/149 dead transitions. [2023-11-29 04:28:09,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 149 transitions, 409 flow [2023-11-29 04:28:09,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:28:09,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:28:09,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 641 transitions. [2023-11-29 04:28:09,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8756830601092896 [2023-11-29 04:28:09,406 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 641 transitions. [2023-11-29 04:28:09,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 641 transitions. [2023-11-29 04:28:09,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:28:09,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 641 transitions. [2023-11-29 04:28:09,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 106.83333333333333) internal successors, (641), 6 states have internal predecessors, (641), 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) [2023-11-29 04:28:09,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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) [2023-11-29 04:28:09,425 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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) [2023-11-29 04:28:09,427 INFO L175 Difference]: Start difference. First operand has 121 places, 122 transitions, 251 flow. Second operand 6 states and 641 transitions. [2023-11-29 04:28:09,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 149 transitions, 409 flow [2023-11-29 04:28:09,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 149 transitions, 409 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 04:28:09,436 INFO L231 Difference]: Finished difference. Result has 131 places, 142 transitions, 421 flow [2023-11-29 04:28:09,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=421, PETRI_PLACES=131, PETRI_TRANSITIONS=142} [2023-11-29 04:28:09,442 INFO L281 CegarLoopForPetriNet]: 121 programPoint places, 10 predicate places. [2023-11-29 04:28:09,442 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 142 transitions, 421 flow [2023-11-29 04:28:09,443 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) [2023-11-29 04:28:09,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:28:09,443 INFO L208 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, 1] [2023-11-29 04:28:09,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 04:28:09,444 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-29 04:28:09,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:28:09,445 INFO L85 PathProgramCache]: Analyzing trace with hash -2012313278, now seen corresponding path program 1 times [2023-11-29 04:28:09,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:28:09,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845760381] [2023-11-29 04:28:09,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:28:09,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:28:09,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:28:09,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:28:09,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:28:09,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845760381] [2023-11-29 04:28:09,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845760381] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:28:09,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:28:09,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:28:09,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777961870] [2023-11-29 04:28:09,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:28:09,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:28:09,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:28:09,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:28:09,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:28:09,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 122 [2023-11-29 04:28:09,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 142 transitions, 421 flow. Second operand has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 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) [2023-11-29 04:28:09,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:28:09,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 122 [2023-11-29 04:28:09,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:28:09,716 INFO L124 PetriNetUnfolderBase]: 59/485 cut-off events. [2023-11-29 04:28:09,716 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2023-11-29 04:28:09,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 788 conditions, 485 events. 59/485 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2126 event pairs, 3 based on Foata normal form. 1/457 useless extension candidates. Maximal degree in co-relation 609. Up to 73 conditions per place. [2023-11-29 04:28:09,721 INFO L140 encePairwiseOnDemand]: 114/122 looper letters, 11 selfloop transitions, 6 changer transitions 1/147 dead transitions. [2023-11-29 04:28:09,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 147 transitions, 467 flow [2023-11-29 04:28:09,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:28:09,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:28:09,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 655 transitions. [2023-11-29 04:28:09,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.894808743169399 [2023-11-29 04:28:09,725 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 655 transitions. [2023-11-29 04:28:09,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 655 transitions. [2023-11-29 04:28:09,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:28:09,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 655 transitions. [2023-11-29 04:28:09,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 109.16666666666667) internal successors, (655), 6 states have internal predecessors, (655), 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) [2023-11-29 04:28:09,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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) [2023-11-29 04:28:09,731 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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) [2023-11-29 04:28:09,732 INFO L175 Difference]: Start difference. First operand has 131 places, 142 transitions, 421 flow. Second operand 6 states and 655 transitions. [2023-11-29 04:28:09,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 147 transitions, 467 flow [2023-11-29 04:28:09,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 147 transitions, 467 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 04:28:09,741 INFO L231 Difference]: Finished difference. Result has 139 places, 146 transitions, 463 flow [2023-11-29 04:28:09,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=463, PETRI_PLACES=139, PETRI_TRANSITIONS=146} [2023-11-29 04:28:09,742 INFO L281 CegarLoopForPetriNet]: 121 programPoint places, 18 predicate places. [2023-11-29 04:28:09,742 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 146 transitions, 463 flow [2023-11-29 04:28:09,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 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) [2023-11-29 04:28:09,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:28:09,743 INFO L208 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, 1, 1] [2023-11-29 04:28:09,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 04:28:09,744 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-29 04:28:09,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:28:09,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1180280619, now seen corresponding path program 1 times [2023-11-29 04:28:09,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:28:09,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177658623] [2023-11-29 04:28:09,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:28:09,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:28:09,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:28:10,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:28:10,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:28:10,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177658623] [2023-11-29 04:28:10,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177658623] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:28:10,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:28:10,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:28:10,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775187904] [2023-11-29 04:28:10,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:28:10,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:28:10,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:28:10,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:28:10,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:28:10,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 122 [2023-11-29 04:28:10,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 146 transitions, 463 flow. Second operand has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 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) [2023-11-29 04:28:10,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:28:10,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 122 [2023-11-29 04:28:10,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:28:10,671 INFO L124 PetriNetUnfolderBase]: 207/964 cut-off events. [2023-11-29 04:28:10,672 INFO L125 PetriNetUnfolderBase]: For 329/329 co-relation queries the response was YES. [2023-11-29 04:28:10,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1947 conditions, 964 events. 207/964 cut-off events. For 329/329 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 6054 event pairs, 9 based on Foata normal form. 0/903 useless extension candidates. Maximal degree in co-relation 1814. Up to 294 conditions per place. [2023-11-29 04:28:10,680 INFO L140 encePairwiseOnDemand]: 99/122 looper letters, 51 selfloop transitions, 50 changer transitions 4/206 dead transitions. [2023-11-29 04:28:10,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 206 transitions, 900 flow [2023-11-29 04:28:10,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:28:10,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:28:10,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 616 transitions. [2023-11-29 04:28:10,683 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8415300546448088 [2023-11-29 04:28:10,684 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 616 transitions. [2023-11-29 04:28:10,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 616 transitions. [2023-11-29 04:28:10,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:28:10,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 616 transitions. [2023-11-29 04:28:10,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 102.66666666666667) internal successors, (616), 6 states have internal predecessors, (616), 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) [2023-11-29 04:28:10,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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) [2023-11-29 04:28:10,690 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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) [2023-11-29 04:28:10,690 INFO L175 Difference]: Start difference. First operand has 139 places, 146 transitions, 463 flow. Second operand 6 states and 616 transitions. [2023-11-29 04:28:10,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 206 transitions, 900 flow [2023-11-29 04:28:10,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 206 transitions, 898 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:28:10,700 INFO L231 Difference]: Finished difference. Result has 148 places, 192 transitions, 919 flow [2023-11-29 04:28:10,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=919, PETRI_PLACES=148, PETRI_TRANSITIONS=192} [2023-11-29 04:28:10,701 INFO L281 CegarLoopForPetriNet]: 121 programPoint places, 27 predicate places. [2023-11-29 04:28:10,701 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 192 transitions, 919 flow [2023-11-29 04:28:10,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 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) [2023-11-29 04:28:10,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:28:10,702 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:28:10,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 04:28:10,703 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-29 04:28:10,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:28:10,703 INFO L85 PathProgramCache]: Analyzing trace with hash -396544275, now seen corresponding path program 1 times [2023-11-29 04:28:10,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:28:10,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267389372] [2023-11-29 04:28:10,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:28:10,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:28:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:28:11,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:28:11,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:28:11,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267389372] [2023-11-29 04:28:11,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267389372] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:28:11,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:28:11,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:28:11,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125683733] [2023-11-29 04:28:11,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:28:11,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:28:11,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:28:11,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:28:11,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:28:11,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 122 [2023-11-29 04:28:11,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 192 transitions, 919 flow. Second operand has 6 states, 6 states have (on average 86.66666666666667) internal successors, (520), 6 states have internal predecessors, (520), 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) [2023-11-29 04:28:11,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:28:11,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 122 [2023-11-29 04:28:11,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:28:11,742 INFO L124 PetriNetUnfolderBase]: 589/1951 cut-off events. [2023-11-29 04:28:11,743 INFO L125 PetriNetUnfolderBase]: For 1487/1604 co-relation queries the response was YES. [2023-11-29 04:28:11,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5160 conditions, 1951 events. 589/1951 cut-off events. For 1487/1604 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 14467 event pairs, 97 based on Foata normal form. 20/1866 useless extension candidates. Maximal degree in co-relation 4918. Up to 1020 conditions per place. [2023-11-29 04:28:11,762 INFO L140 encePairwiseOnDemand]: 91/122 looper letters, 98 selfloop transitions, 120 changer transitions 6/314 dead transitions. [2023-11-29 04:28:11,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 314 transitions, 1919 flow [2023-11-29 04:28:11,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:28:11,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:28:11,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 641 transitions. [2023-11-29 04:28:11,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8756830601092896 [2023-11-29 04:28:11,766 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 641 transitions. [2023-11-29 04:28:11,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 641 transitions. [2023-11-29 04:28:11,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:28:11,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 641 transitions. [2023-11-29 04:28:11,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 106.83333333333333) internal successors, (641), 6 states have internal predecessors, (641), 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) [2023-11-29 04:28:11,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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) [2023-11-29 04:28:11,790 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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) [2023-11-29 04:28:11,790 INFO L175 Difference]: Start difference. First operand has 148 places, 192 transitions, 919 flow. Second operand 6 states and 641 transitions. [2023-11-29 04:28:11,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 314 transitions, 1919 flow [2023-11-29 04:28:11,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 314 transitions, 1907 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-29 04:28:11,813 INFO L231 Difference]: Finished difference. Result has 151 places, 308 transitions, 2003 flow [2023-11-29 04:28:11,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=907, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2003, PETRI_PLACES=151, PETRI_TRANSITIONS=308} [2023-11-29 04:28:11,814 INFO L281 CegarLoopForPetriNet]: 121 programPoint places, 30 predicate places. [2023-11-29 04:28:11,815 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 308 transitions, 2003 flow [2023-11-29 04:28:11,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.66666666666667) internal successors, (520), 6 states have internal predecessors, (520), 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) [2023-11-29 04:28:11,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:28:11,815 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:28:11,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 04:28:11,816 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-29 04:28:11,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:28:11,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1434386381, now seen corresponding path program 1 times [2023-11-29 04:28:11,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:28:11,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397240510] [2023-11-29 04:28:11,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:28:11,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:28:11,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:28:12,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:28:12,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:28:12,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397240510] [2023-11-29 04:28:12,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397240510] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:28:12,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742081846] [2023-11-29 04:28:12,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:28:12,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:28:12,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:28:12,496 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:28:12,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 04:28:12,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:28:12,619 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-29 04:28:12,637 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:28:12,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:28:12,716 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 04:28:12,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-29 04:28:12,731 INFO L378 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 16 treesize of output 8 [2023-11-29 04:28:12,771 INFO L378 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 [2023-11-29 04:28:12,784 INFO L378 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 [2023-11-29 04:28:12,802 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:28:12,802 INFO L378 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 [2023-11-29 04:28:12,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:28:12,827 INFO L378 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 [2023-11-29 04:28:12,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-29 04:28:12,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:28:12,998 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:28:13,031 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) (+ 3 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_192 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-29 04:28:13,166 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_192 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset))) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-29 04:28:13,189 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) (.cse1 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-29 04:28:13,292 INFO L378 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 [2023-11-29 04:28:13,313 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-29 04:28:13,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742081846] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:28:13,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:28:13,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2023-11-29 04:28:13,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271494241] [2023-11-29 04:28:13,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:28:13,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 04:28:13,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:28:13,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 04:28:13,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=202, Unknown=3, NotChecked=90, Total=342 [2023-11-29 04:28:13,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 122 [2023-11-29 04:28:13,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 308 transitions, 2003 flow. Second operand has 19 states, 19 states have (on average 49.421052631578945) internal successors, (939), 19 states have internal predecessors, (939), 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) [2023-11-29 04:28:13,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:28:13,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 122 [2023-11-29 04:28:13,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:28:16,186 INFO L124 PetriNetUnfolderBase]: 1141/3010 cut-off events. [2023-11-29 04:28:16,187 INFO L125 PetriNetUnfolderBase]: For 4432/4432 co-relation queries the response was YES. [2023-11-29 04:28:16,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10366 conditions, 3010 events. 1141/3010 cut-off events. For 4432/4432 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 21992 event pairs, 66 based on Foata normal form. 39/3011 useless extension candidates. Maximal degree in co-relation 10083. Up to 990 conditions per place. [2023-11-29 04:28:16,217 INFO L140 encePairwiseOnDemand]: 87/122 looper letters, 395 selfloop transitions, 176 changer transitions 49/667 dead transitions. [2023-11-29 04:28:16,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 667 transitions, 5177 flow [2023-11-29 04:28:16,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-29 04:28:16,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-11-29 04:28:16,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 1820 transitions. [2023-11-29 04:28:16,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4972677595628415 [2023-11-29 04:28:16,225 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 1820 transitions. [2023-11-29 04:28:16,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 1820 transitions. [2023-11-29 04:28:16,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:28:16,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 1820 transitions. [2023-11-29 04:28:16,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 60.666666666666664) internal successors, (1820), 30 states have internal predecessors, (1820), 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) [2023-11-29 04:28:16,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 122.0) internal successors, (3782), 31 states have internal predecessors, (3782), 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) [2023-11-29 04:28:16,243 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 122.0) internal successors, (3782), 31 states have internal predecessors, (3782), 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) [2023-11-29 04:28:16,243 INFO L175 Difference]: Start difference. First operand has 151 places, 308 transitions, 2003 flow. Second operand 30 states and 1820 transitions. [2023-11-29 04:28:16,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 667 transitions, 5177 flow [2023-11-29 04:28:16,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 667 transitions, 5087 flow, removed 45 selfloop flow, removed 0 redundant places. [2023-11-29 04:28:16,296 INFO L231 Difference]: Finished difference. Result has 194 places, 386 transitions, 3205 flow [2023-11-29 04:28:16,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=1913, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=3205, PETRI_PLACES=194, PETRI_TRANSITIONS=386} [2023-11-29 04:28:16,297 INFO L281 CegarLoopForPetriNet]: 121 programPoint places, 73 predicate places. [2023-11-29 04:28:16,298 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 386 transitions, 3205 flow [2023-11-29 04:28:16,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 49.421052631578945) internal successors, (939), 19 states have internal predecessors, (939), 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) [2023-11-29 04:28:16,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:28:16,299 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:28:16,306 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 04:28:16,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:28:16,504 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-29 04:28:16,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:28:16,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1664169463, now seen corresponding path program 1 times [2023-11-29 04:28:16,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:28:16,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390606124] [2023-11-29 04:28:16,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:28:16,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:28:16,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:28:17,214 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:28:17,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:28:17,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390606124] [2023-11-29 04:28:17,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390606124] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:28:17,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204204793] [2023-11-29 04:28:17,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:28:17,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:28:17,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:28:17,217 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:28:17,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 04:28:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:28:17,342 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-29 04:28:17,347 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:28:17,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:28:17,380 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 04:28:17,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-29 04:28:17,438 INFO L378 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 16 treesize of output 8 [2023-11-29 04:28:17,601 INFO L378 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 [2023-11-29 04:28:17,639 INFO L378 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 19 treesize of output 18 [2023-11-29 04:28:17,685 INFO L378 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 26 treesize of output 28 [2023-11-29 04:28:17,735 INFO L378 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 33 treesize of output 38 [2023-11-29 04:28:17,903 INFO L378 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 37 treesize of output 26 [2023-11-29 04:28:17,944 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:28:17,944 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:28:17,975 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)))) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0))) is different from false [2023-11-29 04:28:18,034 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~arg.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~arg.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~arg.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~arg.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0))) is different from false [2023-11-29 04:28:18,052 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0))))) is different from false [2023-11-29 04:28:18,072 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse2) 0))))) is different from false [2023-11-29 04:28:18,175 INFO L378 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 [2023-11-29 04:28:18,196 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-29 04:28:18,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204204793] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:28:18,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:28:18,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30 [2023-11-29 04:28:18,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023372717] [2023-11-29 04:28:18,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:28:18,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-29 04:28:18,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:28:18,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-29 04:28:18,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=605, Unknown=4, NotChecked=212, Total=930 [2023-11-29 04:28:18,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 122 [2023-11-29 04:28:18,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 386 transitions, 3205 flow. Second operand has 31 states, 31 states have (on average 52.29032258064516) internal successors, (1621), 31 states have internal predecessors, (1621), 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) [2023-11-29 04:28:18,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:28:18,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 122 [2023-11-29 04:28:18,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:28:19,909 INFO L124 PetriNetUnfolderBase]: 934/2711 cut-off events. [2023-11-29 04:28:19,909 INFO L125 PetriNetUnfolderBase]: For 8899/8902 co-relation queries the response was YES. [2023-11-29 04:28:19,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11193 conditions, 2711 events. 934/2711 cut-off events. For 8899/8902 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 20054 event pairs, 111 based on Foata normal form. 25/2683 useless extension candidates. Maximal degree in co-relation 10881. Up to 1242 conditions per place. [2023-11-29 04:28:19,935 INFO L140 encePairwiseOnDemand]: 107/122 looper letters, 378 selfloop transitions, 34 changer transitions 28/493 dead transitions. [2023-11-29 04:28:19,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 493 transitions, 4659 flow [2023-11-29 04:28:19,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 04:28:19,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-11-29 04:28:19,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1088 transitions. [2023-11-29 04:28:19,939 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49544626593806923 [2023-11-29 04:28:19,939 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1088 transitions. [2023-11-29 04:28:19,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1088 transitions. [2023-11-29 04:28:19,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:28:19,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1088 transitions. [2023-11-29 04:28:19,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 60.44444444444444) internal successors, (1088), 18 states have internal predecessors, (1088), 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) [2023-11-29 04:28:19,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 122.0) internal successors, (2318), 19 states have internal predecessors, (2318), 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) [2023-11-29 04:28:19,947 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 122.0) internal successors, (2318), 19 states have internal predecessors, (2318), 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) [2023-11-29 04:28:19,947 INFO L175 Difference]: Start difference. First operand has 194 places, 386 transitions, 3205 flow. Second operand 18 states and 1088 transitions. [2023-11-29 04:28:19,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 493 transitions, 4659 flow [2023-11-29 04:28:19,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 493 transitions, 4607 flow, removed 9 selfloop flow, removed 9 redundant places. [2023-11-29 04:28:20,005 INFO L231 Difference]: Finished difference. Result has 200 places, 370 transitions, 3051 flow [2023-11-29 04:28:20,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=3149, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3051, PETRI_PLACES=200, PETRI_TRANSITIONS=370} [2023-11-29 04:28:20,006 INFO L281 CegarLoopForPetriNet]: 121 programPoint places, 79 predicate places. [2023-11-29 04:28:20,006 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 370 transitions, 3051 flow [2023-11-29 04:28:20,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 52.29032258064516) internal successors, (1621), 31 states have internal predecessors, (1621), 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) [2023-11-29 04:28:20,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:28:20,008 INFO L208 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, 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] [2023-11-29 04:28:20,013 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 04:28:20,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:28:20,212 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-29 04:28:20,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:28:20,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1234583565, now seen corresponding path program 1 times [2023-11-29 04:28:20,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:28:20,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636620502] [2023-11-29 04:28:20,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:28:20,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:28:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:28:20,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 04:28:20,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:28:20,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636620502] [2023-11-29 04:28:20,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636620502] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:28:20,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:28:20,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:28:20,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082126510] [2023-11-29 04:28:20,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:28:20,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:28:20,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:28:20,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:28:20,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:28:20,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 122 [2023-11-29 04:28:20,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 370 transitions, 3051 flow. Second operand has 6 states, 6 states have (on average 101.5) internal successors, (609), 6 states have internal predecessors, (609), 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) [2023-11-29 04:28:20,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:28:20,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 122 [2023-11-29 04:28:20,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:28:21,261 INFO L124 PetriNetUnfolderBase]: 523/1893 cut-off events. [2023-11-29 04:28:21,261 INFO L125 PetriNetUnfolderBase]: For 6342/6398 co-relation queries the response was YES. [2023-11-29 04:28:21,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7336 conditions, 1893 events. 523/1893 cut-off events. For 6342/6398 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 14517 event pairs, 42 based on Foata normal form. 5/1876 useless extension candidates. Maximal degree in co-relation 7172. Up to 474 conditions per place. [2023-11-29 04:28:21,282 INFO L140 encePairwiseOnDemand]: 111/122 looper letters, 120 selfloop transitions, 37 changer transitions 15/410 dead transitions. [2023-11-29 04:28:21,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 410 transitions, 3815 flow [2023-11-29 04:28:21,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:28:21,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:28:21,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 642 transitions. [2023-11-29 04:28:21,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8770491803278688 [2023-11-29 04:28:21,285 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 642 transitions. [2023-11-29 04:28:21,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 642 transitions. [2023-11-29 04:28:21,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:28:21,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 642 transitions. [2023-11-29 04:28:21,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 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) [2023-11-29 04:28:21,290 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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) [2023-11-29 04:28:21,290 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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) [2023-11-29 04:28:21,290 INFO L175 Difference]: Start difference. First operand has 200 places, 370 transitions, 3051 flow. Second operand 6 states and 642 transitions. [2023-11-29 04:28:21,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 410 transitions, 3815 flow [2023-11-29 04:28:21,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 410 transitions, 3748 flow, removed 1 selfloop flow, removed 16 redundant places. [2023-11-29 04:28:21,355 INFO L231 Difference]: Finished difference. Result has 194 places, 395 transitions, 3496 flow [2023-11-29 04:28:21,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=2984, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3496, PETRI_PLACES=194, PETRI_TRANSITIONS=395} [2023-11-29 04:28:21,356 INFO L281 CegarLoopForPetriNet]: 121 programPoint places, 73 predicate places. [2023-11-29 04:28:21,357 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 395 transitions, 3496 flow [2023-11-29 04:28:21,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.5) internal successors, (609), 6 states have internal predecessors, (609), 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) [2023-11-29 04:28:21,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:28:21,357 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-29 04:28:21,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 04:28:21,358 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-29 04:28:21,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:28:21,358 INFO L85 PathProgramCache]: Analyzing trace with hash -767136527, now seen corresponding path program 1 times [2023-11-29 04:28:21,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:28:21,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337607226] [2023-11-29 04:28:21,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:28:21,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:28:21,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:28:21,398 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:28:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:28:21,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:28:21,442 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 04:28:21,443 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2023-11-29 04:28:21,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2023-11-29 04:28:21,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2023-11-29 04:28:21,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2023-11-29 04:28:21,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2023-11-29 04:28:21,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2023-11-29 04:28:21,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2023-11-29 04:28:21,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2023-11-29 04:28:21,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2023-11-29 04:28:21,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 04:28:21,447 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:28:21,449 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 04:28:21,449 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-29 04:28:21,472 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-29 04:28:21,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 140 transitions, 296 flow [2023-11-29 04:28:21,511 INFO L124 PetriNetUnfolderBase]: 11/335 cut-off events. [2023-11-29 04:28:21,511 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-29 04:28:21,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347 conditions, 335 events. 11/335 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 764 event pairs, 0 based on Foata normal form. 0/296 useless extension candidates. Maximal degree in co-relation 190. Up to 8 conditions per place. [2023-11-29 04:28:21,512 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 140 transitions, 296 flow [2023-11-29 04:28:21,514 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 140 transitions, 296 flow [2023-11-29 04:28:21,515 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:28:21,516 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=LoopHeads, 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;@345563a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:28:21,516 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-29 04:28:21,520 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 04:28:21,520 INFO L124 PetriNetUnfolderBase]: 3/42 cut-off events. [2023-11-29 04:28:21,520 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 04:28:21,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:28:21,520 INFO L208 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] [2023-11-29 04:28:21,520 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)] === [2023-11-29 04:28:21,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:28:21,521 INFO L85 PathProgramCache]: Analyzing trace with hash -2078961544, now seen corresponding path program 1 times [2023-11-29 04:28:21,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:28:21,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218511914] [2023-11-29 04:28:21,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:28:21,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:28:21,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:28:21,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:28:21,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:28:21,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218511914] [2023-11-29 04:28:21,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218511914] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:28:21,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:28:21,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:28:21,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754252478] [2023-11-29 04:28:21,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:28:21,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:28:21,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:28:21,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:28:21,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:28:21,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 140 [2023-11-29 04:28:21,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 140 transitions, 296 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) [2023-11-29 04:28:21,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:28:21,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 140 [2023-11-29 04:28:21,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:28:22,616 INFO L124 PetriNetUnfolderBase]: 1139/4013 cut-off events. [2023-11-29 04:28:22,616 INFO L125 PetriNetUnfolderBase]: For 115/203 co-relation queries the response was YES. [2023-11-29 04:28:22,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6043 conditions, 4013 events. 1139/4013 cut-off events. For 115/203 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 31909 event pairs, 192 based on Foata normal form. 74/3754 useless extension candidates. Maximal degree in co-relation 2969. Up to 1538 conditions per place. [2023-11-29 04:28:22,645 INFO L140 encePairwiseOnDemand]: 116/140 looper letters, 36 selfloop transitions, 43 changer transitions 1/188 dead transitions. [2023-11-29 04:28:22,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 188 transitions, 558 flow [2023-11-29 04:28:22,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:28:22,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:28:22,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 740 transitions. [2023-11-29 04:28:22,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8809523809523809 [2023-11-29 04:28:22,648 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 740 transitions. [2023-11-29 04:28:22,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 740 transitions. [2023-11-29 04:28:22,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:28:22,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 740 transitions. [2023-11-29 04:28:22,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.33333333333333) internal successors, (740), 6 states have internal predecessors, (740), 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) [2023-11-29 04:28:22,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:22,653 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:22,653 INFO L175 Difference]: Start difference. First operand has 140 places, 140 transitions, 296 flow. Second operand 6 states and 740 transitions. [2023-11-29 04:28:22,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 188 transitions, 558 flow [2023-11-29 04:28:22,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 188 transitions, 558 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 04:28:22,657 INFO L231 Difference]: Finished difference. Result has 150 places, 179 transitions, 588 flow [2023-11-29 04:28:22,657 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=588, PETRI_PLACES=150, PETRI_TRANSITIONS=179} [2023-11-29 04:28:22,658 INFO L281 CegarLoopForPetriNet]: 140 programPoint places, 10 predicate places. [2023-11-29 04:28:22,658 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 179 transitions, 588 flow [2023-11-29 04:28:22,659 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) [2023-11-29 04:28:22,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:28:22,659 INFO L208 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, 1] [2023-11-29 04:28:22,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 04:28:22,659 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)] === [2023-11-29 04:28:22,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:28:22,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1521651250, now seen corresponding path program 1 times [2023-11-29 04:28:22,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:28:22,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427020373] [2023-11-29 04:28:22,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:28:22,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:28:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:28:22,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:28:22,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:28:22,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427020373] [2023-11-29 04:28:22,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427020373] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:28:22,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:28:22,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:28:22,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458142449] [2023-11-29 04:28:22,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:28:22,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:28:22,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:28:22,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:28:22,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:28:22,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 140 [2023-11-29 04:28:22,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 179 transitions, 588 flow. Second operand has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 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) [2023-11-29 04:28:22,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:28:22,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 140 [2023-11-29 04:28:22,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:28:23,264 INFO L124 PetriNetUnfolderBase]: 890/3527 cut-off events. [2023-11-29 04:28:23,264 INFO L125 PetriNetUnfolderBase]: For 563/567 co-relation queries the response was YES. [2023-11-29 04:28:23,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6149 conditions, 3527 events. 890/3527 cut-off events. For 563/567 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 28422 event pairs, 150 based on Foata normal form. 1/3305 useless extension candidates. Maximal degree in co-relation 3349. Up to 983 conditions per place. [2023-11-29 04:28:23,290 INFO L140 encePairwiseOnDemand]: 132/140 looper letters, 14 selfloop transitions, 6 changer transitions 1/185 dead transitions. [2023-11-29 04:28:23,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 185 transitions, 642 flow [2023-11-29 04:28:23,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:28:23,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:28:23,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 754 transitions. [2023-11-29 04:28:23,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8976190476190476 [2023-11-29 04:28:23,293 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 754 transitions. [2023-11-29 04:28:23,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 754 transitions. [2023-11-29 04:28:23,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:28:23,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 754 transitions. [2023-11-29 04:28:23,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.66666666666667) internal successors, (754), 6 states have internal predecessors, (754), 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) [2023-11-29 04:28:23,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:23,298 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:23,298 INFO L175 Difference]: Start difference. First operand has 150 places, 179 transitions, 588 flow. Second operand 6 states and 754 transitions. [2023-11-29 04:28:23,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 185 transitions, 642 flow [2023-11-29 04:28:23,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 185 transitions, 642 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 04:28:23,306 INFO L231 Difference]: Finished difference. Result has 158 places, 184 transitions, 634 flow [2023-11-29 04:28:23,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=634, PETRI_PLACES=158, PETRI_TRANSITIONS=184} [2023-11-29 04:28:23,307 INFO L281 CegarLoopForPetriNet]: 140 programPoint places, 18 predicate places. [2023-11-29 04:28:23,307 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 184 transitions, 634 flow [2023-11-29 04:28:23,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 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) [2023-11-29 04:28:23,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:28:23,308 INFO L208 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, 1, 1] [2023-11-29 04:28:23,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 04:28:23,309 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)] === [2023-11-29 04:28:23,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:28:23,309 INFO L85 PathProgramCache]: Analyzing trace with hash -789065557, now seen corresponding path program 1 times [2023-11-29 04:28:23,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:28:23,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31228313] [2023-11-29 04:28:23,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:28:23,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:28:23,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:28:23,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:28:23,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:28:23,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31228313] [2023-11-29 04:28:23,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31228313] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:28:23,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:28:23,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:28:23,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817571383] [2023-11-29 04:28:23,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:28:23,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:28:23,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:28:23,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:28:23,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:28:23,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 140 [2023-11-29 04:28:23,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 184 transitions, 634 flow. Second operand has 6 states, 6 states have (on average 104.16666666666667) internal successors, (625), 6 states have internal predecessors, (625), 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) [2023-11-29 04:28:23,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:28:23,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 140 [2023-11-29 04:28:23,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:28:24,920 INFO L124 PetriNetUnfolderBase]: 3173/8712 cut-off events. [2023-11-29 04:28:24,920 INFO L125 PetriNetUnfolderBase]: For 4361/4372 co-relation queries the response was YES. [2023-11-29 04:28:24,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19457 conditions, 8712 events. 3173/8712 cut-off events. For 4361/4372 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 76112 event pairs, 410 based on Foata normal form. 7/8207 useless extension candidates. Maximal degree in co-relation 19323. Up to 3775 conditions per place. [2023-11-29 04:28:24,965 INFO L140 encePairwiseOnDemand]: 113/140 looper letters, 78 selfloop transitions, 104 changer transitions 4/300 dead transitions. [2023-11-29 04:28:24,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 300 transitions, 1529 flow [2023-11-29 04:28:24,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:28:24,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:28:24,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 715 transitions. [2023-11-29 04:28:24,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8511904761904762 [2023-11-29 04:28:24,967 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 715 transitions. [2023-11-29 04:28:24,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 715 transitions. [2023-11-29 04:28:24,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:28:24,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 715 transitions. [2023-11-29 04:28:24,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 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) [2023-11-29 04:28:24,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:24,970 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:24,970 INFO L175 Difference]: Start difference. First operand has 158 places, 184 transitions, 634 flow. Second operand 6 states and 715 transitions. [2023-11-29 04:28:24,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 300 transitions, 1529 flow [2023-11-29 04:28:24,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 300 transitions, 1527 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:28:24,981 INFO L231 Difference]: Finished difference. Result has 167 places, 284 transitions, 1638 flow [2023-11-29 04:28:24,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1638, PETRI_PLACES=167, PETRI_TRANSITIONS=284} [2023-11-29 04:28:24,982 INFO L281 CegarLoopForPetriNet]: 140 programPoint places, 27 predicate places. [2023-11-29 04:28:24,982 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 284 transitions, 1638 flow [2023-11-29 04:28:24,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.16666666666667) internal successors, (625), 6 states have internal predecessors, (625), 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) [2023-11-29 04:28:24,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:28:24,983 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:28:24,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 04:28:24,983 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-29 04:28:24,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:28:24,984 INFO L85 PathProgramCache]: Analyzing trace with hash -468383767, now seen corresponding path program 1 times [2023-11-29 04:28:24,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:28:24,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147320221] [2023-11-29 04:28:24,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:28:24,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:28:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:28:25,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:28:25,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:28:25,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147320221] [2023-11-29 04:28:25,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147320221] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:28:25,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:28:25,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:28:25,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508485400] [2023-11-29 04:28:25,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:28:25,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:28:25,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:28:25,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:28:25,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:28:25,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 140 [2023-11-29 04:28:25,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 284 transitions, 1638 flow. Second operand has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 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) [2023-11-29 04:28:25,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:28:25,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 140 [2023-11-29 04:28:25,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:28:28,125 INFO L124 PetriNetUnfolderBase]: 8581/20124 cut-off events. [2023-11-29 04:28:28,125 INFO L125 PetriNetUnfolderBase]: For 22364/24762 co-relation queries the response was YES. [2023-11-29 04:28:28,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58964 conditions, 20124 events. 8581/20124 cut-off events. For 22364/24762 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 190622 event pairs, 1832 based on Foata normal form. 70/19104 useless extension candidates. Maximal degree in co-relation 20664. Up to 11835 conditions per place. [2023-11-29 04:28:28,310 INFO L140 encePairwiseOnDemand]: 105/140 looper letters, 173 selfloop transitions, 249 changer transitions 0/525 dead transitions. [2023-11-29 04:28:28,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 525 transitions, 3950 flow [2023-11-29 04:28:28,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:28:28,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:28:28,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 743 transitions. [2023-11-29 04:28:28,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8845238095238095 [2023-11-29 04:28:28,313 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 743 transitions. [2023-11-29 04:28:28,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 743 transitions. [2023-11-29 04:28:28,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:28:28,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 743 transitions. [2023-11-29 04:28:28,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.83333333333333) internal successors, (743), 6 states have internal predecessors, (743), 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) [2023-11-29 04:28:28,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:28,318 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:28,318 INFO L175 Difference]: Start difference. First operand has 167 places, 284 transitions, 1638 flow. Second operand 6 states and 743 transitions. [2023-11-29 04:28:28,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 525 transitions, 3950 flow [2023-11-29 04:28:28,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 525 transitions, 3940 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-11-29 04:28:28,369 INFO L231 Difference]: Finished difference. Result has 171 places, 517 transitions, 4284 flow [2023-11-29 04:28:28,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=1628, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4284, PETRI_PLACES=171, PETRI_TRANSITIONS=517} [2023-11-29 04:28:28,370 INFO L281 CegarLoopForPetriNet]: 140 programPoint places, 31 predicate places. [2023-11-29 04:28:28,371 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 517 transitions, 4284 flow [2023-11-29 04:28:28,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 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) [2023-11-29 04:28:28,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:28:28,372 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:28:28,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 04:28:28,372 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-29 04:28:28,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:28:28,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1146121371, now seen corresponding path program 1 times [2023-11-29 04:28:28,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:28:28,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287708751] [2023-11-29 04:28:28,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:28:28,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:28:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:28:28,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:28:28,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:28:28,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287708751] [2023-11-29 04:28:28,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287708751] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:28:28,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855352295] [2023-11-29 04:28:28,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:28:28,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:28:28,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:28:28,822 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:28:28,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 04:28:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:28:28,949 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 04:28:28,953 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:28:29,010 INFO L378 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 [2023-11-29 04:28:29,137 INFO L378 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 [2023-11-29 04:28:29,167 INFO L378 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 [2023-11-29 04:28:29,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:28:29,209 INFO L378 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 [2023-11-29 04:28:29,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:28:29,261 INFO L378 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 34 treesize of output 25 [2023-11-29 04:28:29,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:28:29,305 INFO L378 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 [2023-11-29 04:28:29,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:28:29,314 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:28:29,345 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_578 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_578) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_578 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_578) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_578 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_578) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false [2023-11-29 04:28:29,365 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_578 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_578) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_578 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_578) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_578 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_578) c_threadThread1of2ForFork0_~t~0.base) .cse1)))))) is different from false [2023-11-29 04:28:29,536 INFO L378 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 [2023-11-29 04:28:29,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-29 04:28:29,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855352295] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:28:29,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:28:29,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 31 [2023-11-29 04:28:29,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137675581] [2023-11-29 04:28:29,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:28:29,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-29 04:28:29,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:28:29,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-29 04:28:29,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=774, Unknown=2, NotChecked=114, Total=992 [2023-11-29 04:28:29,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 140 [2023-11-29 04:28:29,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 517 transitions, 4284 flow. Second operand has 32 states, 32 states have (on average 58.78125) internal successors, (1881), 32 states have internal predecessors, (1881), 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) [2023-11-29 04:28:29,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:28:29,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 140 [2023-11-29 04:28:29,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:28:40,719 INFO L124 PetriNetUnfolderBase]: 27291/52119 cut-off events. [2023-11-29 04:28:40,720 INFO L125 PetriNetUnfolderBase]: For 94045/94084 co-relation queries the response was YES. [2023-11-29 04:28:40,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182288 conditions, 52119 events. 27291/52119 cut-off events. For 94045/94084 co-relation queries the response was YES. Maximal size of possible extension queue 1519. Compared 492246 event pairs, 6010 based on Foata normal form. 387/49864 useless extension candidates. Maximal degree in co-relation 121061. Up to 20653 conditions per place. [2023-11-29 04:28:41,152 INFO L140 encePairwiseOnDemand]: 101/140 looper letters, 849 selfloop transitions, 666 changer transitions 2/1574 dead transitions. [2023-11-29 04:28:41,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 1574 transitions, 15804 flow [2023-11-29 04:28:41,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-29 04:28:41,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2023-11-29 04:28:41,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2299 transitions. [2023-11-29 04:28:41,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5297235023041474 [2023-11-29 04:28:41,160 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 2299 transitions. [2023-11-29 04:28:41,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 2299 transitions. [2023-11-29 04:28:41,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:28:41,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 2299 transitions. [2023-11-29 04:28:41,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 74.16129032258064) internal successors, (2299), 31 states have internal predecessors, (2299), 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) [2023-11-29 04:28:41,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 140.0) internal successors, (4480), 32 states have internal predecessors, (4480), 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) [2023-11-29 04:28:41,179 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 140.0) internal successors, (4480), 32 states have internal predecessors, (4480), 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) [2023-11-29 04:28:41,179 INFO L175 Difference]: Start difference. First operand has 171 places, 517 transitions, 4284 flow. Second operand 31 states and 2299 transitions. [2023-11-29 04:28:41,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 1574 transitions, 15804 flow [2023-11-29 04:28:42,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 1574 transitions, 15714 flow, removed 45 selfloop flow, removed 0 redundant places. [2023-11-29 04:28:42,169 INFO L231 Difference]: Finished difference. Result has 223 places, 1101 transitions, 13074 flow [2023-11-29 04:28:42,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=4194, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=252, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=13074, PETRI_PLACES=223, PETRI_TRANSITIONS=1101} [2023-11-29 04:28:42,170 INFO L281 CegarLoopForPetriNet]: 140 programPoint places, 83 predicate places. [2023-11-29 04:28:42,170 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 1101 transitions, 13074 flow [2023-11-29 04:28:42,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 58.78125) internal successors, (1881), 32 states have internal predecessors, (1881), 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) [2023-11-29 04:28:42,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:28:42,171 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:28:42,176 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 04:28:42,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:28:42,372 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)] === [2023-11-29 04:28:42,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:28:42,372 INFO L85 PathProgramCache]: Analyzing trace with hash -385947047, now seen corresponding path program 1 times [2023-11-29 04:28:42,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:28:42,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127132917] [2023-11-29 04:28:42,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:28:42,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:28:42,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:28:42,837 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:28:42,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:28:42,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127132917] [2023-11-29 04:28:42,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127132917] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:28:42,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112774467] [2023-11-29 04:28:42,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:28:42,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:28:42,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:28:42,839 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:28:42,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 04:28:42,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:28:42,954 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-29 04:28:42,958 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:28:42,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:28:42,991 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 04:28:42,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-29 04:28:43,042 INFO L378 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 16 treesize of output 8 [2023-11-29 04:28:43,198 INFO L378 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 [2023-11-29 04:28:43,226 INFO L378 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 19 treesize of output 18 [2023-11-29 04:28:43,262 INFO L378 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 26 treesize of output 28 [2023-11-29 04:28:43,307 INFO L378 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 33 treesize of output 38 [2023-11-29 04:28:43,355 INFO L378 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 37 treesize of output 26 [2023-11-29 04:28:43,390 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:28:43,391 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:28:43,410 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0))) is different from false [2023-11-29 04:28:43,427 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0))))) is different from false [2023-11-29 04:28:43,446 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse1 (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)))) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse2) 0))))) is different from false [2023-11-29 04:28:43,542 INFO L378 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 [2023-11-29 04:28:43,564 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-29 04:28:43,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112774467] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:28:43,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:28:43,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 29 [2023-11-29 04:28:43,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071469258] [2023-11-29 04:28:43,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:28:43,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-29 04:28:43,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:28:43,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-29 04:28:43,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=607, Unknown=3, NotChecked=156, Total=870 [2023-11-29 04:28:43,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 140 [2023-11-29 04:28:43,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 1101 transitions, 13074 flow. Second operand has 30 states, 30 states have (on average 61.3) internal successors, (1839), 30 states have internal predecessors, (1839), 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) [2023-11-29 04:28:43,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:28:43,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 140 [2023-11-29 04:28:43,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:28:59,416 INFO L124 PetriNetUnfolderBase]: 28522/54319 cut-off events. [2023-11-29 04:28:59,416 INFO L125 PetriNetUnfolderBase]: For 210090/210130 co-relation queries the response was YES. [2023-11-29 04:28:59,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239099 conditions, 54319 events. 28522/54319 cut-off events. For 210090/210130 co-relation queries the response was YES. Maximal size of possible extension queue 1515. Compared 507459 event pairs, 3771 based on Foata normal form. 254/51772 useless extension candidates. Maximal degree in co-relation 233527. Up to 15909 conditions per place. [2023-11-29 04:29:00,080 INFO L140 encePairwiseOnDemand]: 112/140 looper letters, 1325 selfloop transitions, 813 changer transitions 0/2205 dead transitions. [2023-11-29 04:29:00,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 2205 transitions, 28069 flow [2023-11-29 04:29:00,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-29 04:29:00,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-11-29 04:29:00,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 2293 transitions. [2023-11-29 04:29:00,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.545952380952381 [2023-11-29 04:29:00,083 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 2293 transitions. [2023-11-29 04:29:00,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 2293 transitions. [2023-11-29 04:29:00,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:29:00,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 2293 transitions. [2023-11-29 04:29:00,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 76.43333333333334) internal successors, (2293), 30 states have internal predecessors, (2293), 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) [2023-11-29 04:29:00,095 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 140.0) internal successors, (4340), 31 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) [2023-11-29 04:29:00,097 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 140.0) internal successors, (4340), 31 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) [2023-11-29 04:29:00,097 INFO L175 Difference]: Start difference. First operand has 223 places, 1101 transitions, 13074 flow. Second operand 30 states and 2293 transitions. [2023-11-29 04:29:00,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 2205 transitions, 28069 flow [2023-11-29 04:29:04,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 2205 transitions, 27976 flow, removed 42 selfloop flow, removed 4 redundant places. [2023-11-29 04:29:04,527 INFO L231 Difference]: Finished difference. Result has 264 places, 1515 transitions, 21501 flow [2023-11-29 04:29:04,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=12982, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=467, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=503, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=21501, PETRI_PLACES=264, PETRI_TRANSITIONS=1515} [2023-11-29 04:29:04,528 INFO L281 CegarLoopForPetriNet]: 140 programPoint places, 124 predicate places. [2023-11-29 04:29:04,528 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 1515 transitions, 21501 flow [2023-11-29 04:29:04,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 61.3) internal successors, (1839), 30 states have internal predecessors, (1839), 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) [2023-11-29 04:29:04,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:29:04,530 INFO L208 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, 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] [2023-11-29 04:29:04,535 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-29 04:29:04,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:29:04,730 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-29 04:29:04,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:29:04,731 INFO L85 PathProgramCache]: Analyzing trace with hash 429703151, now seen corresponding path program 1 times [2023-11-29 04:29:04,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:29:04,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660941023] [2023-11-29 04:29:04,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:29:04,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:29:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:29:05,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 04:29:05,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:29:05,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660941023] [2023-11-29 04:29:05,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660941023] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:29:05,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:29:05,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:29:05,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943005936] [2023-11-29 04:29:05,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:29:05,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:29:05,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:29:05,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:29:05,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:29:05,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 140 [2023-11-29 04:29:05,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 1515 transitions, 21501 flow. Second operand has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 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) [2023-11-29 04:29:05,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:29:05,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 140 [2023-11-29 04:29:05,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:29:12,776 INFO L124 PetriNetUnfolderBase]: 12016/27764 cut-off events. [2023-11-29 04:29:12,776 INFO L125 PetriNetUnfolderBase]: For 160276/162009 co-relation queries the response was YES. [2023-11-29 04:29:13,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135824 conditions, 27764 events. 12016/27764 cut-off events. For 160276/162009 co-relation queries the response was YES. Maximal size of possible extension queue 818. Compared 270153 event pairs, 948 based on Foata normal form. 199/27084 useless extension candidates. Maximal degree in co-relation 134822. Up to 10884 conditions per place. [2023-11-29 04:29:13,126 INFO L140 encePairwiseOnDemand]: 125/140 looper letters, 1129 selfloop transitions, 180 changer transitions 0/1692 dead transitions. [2023-11-29 04:29:13,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 1692 transitions, 26542 flow [2023-11-29 04:29:13,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:29:13,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:29:13,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 737 transitions. [2023-11-29 04:29:13,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8773809523809524 [2023-11-29 04:29:13,127 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 737 transitions. [2023-11-29 04:29:13,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 737 transitions. [2023-11-29 04:29:13,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:29:13,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 737 transitions. [2023-11-29 04:29:13,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 states have internal predecessors, (737), 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) [2023-11-29 04:29:13,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:29:13,129 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:29:13,129 INFO L175 Difference]: Start difference. First operand has 264 places, 1515 transitions, 21501 flow. Second operand 6 states and 737 transitions. [2023-11-29 04:29:13,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 1692 transitions, 26542 flow [2023-11-29 04:29:14,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 1692 transitions, 26334 flow, removed 82 selfloop flow, removed 10 redundant places. [2023-11-29 04:29:14,714 INFO L231 Difference]: Finished difference. Result has 264 places, 1690 transitions, 24551 flow [2023-11-29 04:29:14,715 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=21293, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1515, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1449, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=24551, PETRI_PLACES=264, PETRI_TRANSITIONS=1690} [2023-11-29 04:29:14,715 INFO L281 CegarLoopForPetriNet]: 140 programPoint places, 124 predicate places. [2023-11-29 04:29:14,715 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 1690 transitions, 24551 flow [2023-11-29 04:29:14,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 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) [2023-11-29 04:29:14,715 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:29:14,716 INFO L208 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, 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] [2023-11-29 04:29:14,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 04:29:14,716 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-29 04:29:14,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:29:14,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1587439492, now seen corresponding path program 1 times [2023-11-29 04:29:14,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:29:14,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270083338] [2023-11-29 04:29:14,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:29:14,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:29:14,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:29:15,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:29:15,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:29:15,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270083338] [2023-11-29 04:29:15,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270083338] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:29:15,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405579302] [2023-11-29 04:29:15,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:29:15,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:29:15,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:29:15,100 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:29:15,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 04:29:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:29:15,236 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 04:29:15,239 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:29:15,279 INFO L378 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 [2023-11-29 04:29:15,357 INFO L378 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 [2023-11-29 04:29:15,379 INFO L378 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 [2023-11-29 04:29:15,407 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:29:15,408 INFO L378 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 [2023-11-29 04:29:15,444 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:29:15,445 INFO L378 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 [2023-11-29 04:29:15,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:29:15,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-29 04:29:15,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:29:15,497 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:29:15,600 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_822 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_822) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_822 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_822) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_822 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_822) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_822 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_822) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false [2023-11-29 04:29:15,617 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_822 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_822) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_822 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_822) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_822 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_822) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_822 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_822) c_threadThread1of2ForFork0_~t~0.base) .cse2)))))) is different from false [2023-11-29 04:29:15,777 INFO L378 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 [2023-11-29 04:29:15,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:29:15,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405579302] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:29:15,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:29:15,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2023-11-29 04:29:15,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562882014] [2023-11-29 04:29:15,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:29:15,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-29 04:29:15,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:29:15,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-29 04:29:15,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=812, Unknown=7, NotChecked=118, Total=1056 [2023-11-29 04:29:16,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 140 [2023-11-29 04:29:16,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 1690 transitions, 24551 flow. Second operand has 33 states, 33 states have (on average 60.78787878787879) internal successors, (2006), 33 states have internal predecessors, (2006), 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) [2023-11-29 04:29:16,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:29:16,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 140 [2023-11-29 04:29:16,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:29:40,560 INFO L124 PetriNetUnfolderBase]: 34943/65622 cut-off events. [2023-11-29 04:29:40,560 INFO L125 PetriNetUnfolderBase]: For 371375/371536 co-relation queries the response was YES. [2023-11-29 04:29:41,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326617 conditions, 65622 events. 34943/65622 cut-off events. For 371375/371536 co-relation queries the response was YES. Maximal size of possible extension queue 1839. Compared 622480 event pairs, 8565 based on Foata normal form. 614/63115 useless extension candidates. Maximal degree in co-relation 324224. Up to 34761 conditions per place. [2023-11-29 04:29:41,550 INFO L140 encePairwiseOnDemand]: 106/140 looper letters, 1643 selfloop transitions, 828 changer transitions 1/2544 dead transitions. [2023-11-29 04:29:41,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 2544 transitions, 38535 flow [2023-11-29 04:29:41,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 04:29:41,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-11-29 04:29:41,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1803 transitions. [2023-11-29 04:29:41,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5599378881987578 [2023-11-29 04:29:41,553 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 1803 transitions. [2023-11-29 04:29:41,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 1803 transitions. [2023-11-29 04:29:41,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:29:41,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1803 transitions. [2023-11-29 04:29:41,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 78.3913043478261) internal successors, (1803), 23 states have internal predecessors, (1803), 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) [2023-11-29 04:29:41,558 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 140.0) internal successors, (3360), 24 states have internal predecessors, (3360), 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) [2023-11-29 04:29:41,559 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 140.0) internal successors, (3360), 24 states have internal predecessors, (3360), 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) [2023-11-29 04:29:41,559 INFO L175 Difference]: Start difference. First operand has 264 places, 1690 transitions, 24551 flow. Second operand 23 states and 1803 transitions. [2023-11-29 04:29:41,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 2544 transitions, 38535 flow [2023-11-29 04:29:49,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 2544 transitions, 38407 flow, removed 64 selfloop flow, removed 0 redundant places. [2023-11-29 04:29:49,831 INFO L231 Difference]: Finished difference. Result has 295 places, 2084 transitions, 33531 flow [2023-11-29 04:29:49,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=24423, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1690, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=540, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1070, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=33531, PETRI_PLACES=295, PETRI_TRANSITIONS=2084} [2023-11-29 04:29:49,832 INFO L281 CegarLoopForPetriNet]: 140 programPoint places, 155 predicate places. [2023-11-29 04:29:49,832 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 2084 transitions, 33531 flow [2023-11-29 04:29:49,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 60.78787878787879) internal successors, (2006), 33 states have internal predecessors, (2006), 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) [2023-11-29 04:29:49,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:29:49,833 INFO L208 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, 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] [2023-11-29 04:29:49,837 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 04:29:50,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:29:50,033 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-29 04:29:50,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:29:50,034 INFO L85 PathProgramCache]: Analyzing trace with hash 2049487195, now seen corresponding path program 1 times [2023-11-29 04:29:50,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:29:50,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752634185] [2023-11-29 04:29:50,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:29:50,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:29:50,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:29:50,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:29:50,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:29:50,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752634185] [2023-11-29 04:29:50,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752634185] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:29:50,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028289853] [2023-11-29 04:29:50,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:29:50,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:29:50,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:29:50,451 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:29:50,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 04:29:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:29:50,591 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 04:29:50,595 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:29:50,682 INFO L378 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 [2023-11-29 04:29:50,845 INFO L378 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 [2023-11-29 04:29:50,874 INFO L378 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 19 treesize of output 18 [2023-11-29 04:29:50,912 INFO L378 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 26 treesize of output 28 [2023-11-29 04:29:50,957 INFO L378 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 33 treesize of output 38 [2023-11-29 04:29:51,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:29:51,000 INFO L378 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 37 treesize of output 26 [2023-11-29 04:29:51,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:29:51,029 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:29:51,045 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_922 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_922) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_922 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_922) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_922 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_922) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_922 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_922) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))) is different from false [2023-11-29 04:29:51,058 WARN L854 $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_ArrVal_922 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_922) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_922 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_922) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_922 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_922) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_922 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_922) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0))))) is different from false [2023-11-29 04:29:51,072 WARN L854 $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_ArrVal_922 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_922) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_922 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_922) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_922 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_922) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_922 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_922) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0))))) is different from false [2023-11-29 04:29:51,216 INFO L378 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 [2023-11-29 04:29:51,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:29:51,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028289853] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:29:51,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:29:51,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34 [2023-11-29 04:29:51,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297984587] [2023-11-29 04:29:51,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:29:51,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-29 04:29:51,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:29:51,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-29 04:29:51,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=877, Unknown=3, NotChecked=186, Total=1190 [2023-11-29 04:29:51,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 140 [2023-11-29 04:29:51,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 2084 transitions, 33531 flow. Second operand has 35 states, 35 states have (on average 62.65714285714286) internal successors, (2193), 35 states have internal predecessors, (2193), 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) [2023-11-29 04:29:51,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:29:51,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 140 [2023-11-29 04:29:51,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:30:23,641 INFO L124 PetriNetUnfolderBase]: 38498/72048 cut-off events. [2023-11-29 04:30:23,641 INFO L125 PetriNetUnfolderBase]: For 578436/578616 co-relation queries the response was YES. [2023-11-29 04:30:24,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412821 conditions, 72048 events. 38498/72048 cut-off events. For 578436/578616 co-relation queries the response was YES. Maximal size of possible extension queue 1944. Compared 685820 event pairs, 6563 based on Foata normal form. 512/68829 useless extension candidates. Maximal degree in co-relation 410086. Up to 25371 conditions per place. [2023-11-29 04:30:24,817 INFO L140 encePairwiseOnDemand]: 107/140 looper letters, 1980 selfloop transitions, 1271 changer transitions 0/3334 dead transitions. [2023-11-29 04:30:24,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 3334 transitions, 57441 flow [2023-11-29 04:30:24,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 04:30:24,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-11-29 04:30:24,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1680 transitions. [2023-11-29 04:30:24,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2023-11-29 04:30:24,819 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1680 transitions. [2023-11-29 04:30:24,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1680 transitions. [2023-11-29 04:30:24,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:30:24,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1680 transitions. [2023-11-29 04:30:24,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 80.0) internal successors, (1680), 21 states have internal predecessors, (1680), 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) [2023-11-29 04:30:24,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 140.0) internal successors, (3080), 22 states have internal predecessors, (3080), 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) [2023-11-29 04:30:24,825 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 140.0) internal successors, (3080), 22 states have internal predecessors, (3080), 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) [2023-11-29 04:30:24,825 INFO L175 Difference]: Start difference. First operand has 295 places, 2084 transitions, 33531 flow. Second operand 21 states and 1680 transitions. [2023-11-29 04:30:24,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 3334 transitions, 57441 flow [2023-11-29 04:30:46,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 3334 transitions, 57295 flow, removed 56 selfloop flow, removed 13 redundant places. [2023-11-29 04:30:47,020 INFO L231 Difference]: Finished difference. Result has 311 places, 2733 transitions, 50447 flow [2023-11-29 04:30:47,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=33395, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2084, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=691, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1028, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=50447, PETRI_PLACES=311, PETRI_TRANSITIONS=2733} [2023-11-29 04:30:47,022 INFO L281 CegarLoopForPetriNet]: 140 programPoint places, 171 predicate places. [2023-11-29 04:30:47,022 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 2733 transitions, 50447 flow [2023-11-29 04:30:47,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 62.65714285714286) internal successors, (2193), 35 states have internal predecessors, (2193), 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) [2023-11-29 04:30:47,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:30:47,023 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:30:47,028 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 04:30:47,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:30:47,224 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-29 04:30:47,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:30:47,224 INFO L85 PathProgramCache]: Analyzing trace with hash -387163283, now seen corresponding path program 2 times [2023-11-29 04:30:47,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:30:47,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253481822] [2023-11-29 04:30:47,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:30:47,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:30:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:30:47,756 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:30:47,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:30:47,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253481822] [2023-11-29 04:30:47,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253481822] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:30:47,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987432628] [2023-11-29 04:30:47,757 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:30:47,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:30:47,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:30:47,758 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:30:47,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 04:30:47,953 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 04:30:47,953 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:30:47,956 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-29 04:30:47,959 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:30:48,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:30:48,093 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 04:30:48,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-29 04:30:48,192 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-11-29 04:30:48,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 21 treesize of output 26 [2023-11-29 04:30:48,276 INFO L349 Elim1Store]: treesize reduction 32, result has 34.7 percent of original size [2023-11-29 04:30:48,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 25 treesize of output 29 [2023-11-29 04:30:48,492 INFO L378 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 7 treesize of output 3 [2023-11-29 04:30:48,506 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 04:30:48,506 INFO L378 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 44 treesize of output 24 [2023-11-29 04:30:49,136 INFO L378 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:30:49,189 INFO L378 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 19 treesize of output 18 [2023-11-29 04:30:49,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-29 04:30:49,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-29 04:30:49,370 INFO L378 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 37 treesize of output 26 [2023-11-29 04:30:49,491 INFO L378 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 40 treesize of output 48 [2023-11-29 04:30:49,557 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:30:49,557 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:30:55,537 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:30:55,537 INFO L378 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 69 treesize of output 62 [2023-11-29 04:30:55,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:30:55,551 INFO L378 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 208 treesize of output 188 [2023-11-29 04:30:55,564 INFO L378 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 173 treesize of output 157 [2023-11-29 04:30:55,692 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:30:55,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 89 treesize of output 59 [2023-11-29 04:30:55,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:30:55,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 69 treesize of output 62 [2023-11-29 04:30:55,733 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:30:55,749 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 04:30:55,749 INFO L378 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 1 case distinctions, treesize of input 128 treesize of output 106 [2023-11-29 04:30:55,761 INFO L378 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 36 treesize of output 32 [2023-11-29 04:30:55,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 70 [2023-11-29 04:30:55,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:30:55,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 69 treesize of output 62 [2023-11-29 04:30:55,815 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:30:55,832 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 04:30:55,833 INFO L378 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 1 case distinctions, treesize of input 140 treesize of output 118 [2023-11-29 04:30:55,846 INFO L378 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 40 treesize of output 36 [2023-11-29 04:30:55,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 70 [2023-11-29 04:30:55,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:30:55,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 67 treesize of output 60 [2023-11-29 04:30:55,914 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:30:55,933 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 04:30:55,933 INFO L378 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 1 case distinctions, treesize of input 132 treesize of output 110 [2023-11-29 04:30:55,948 INFO L378 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 34 treesize of output 32 [2023-11-29 04:30:55,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 62 [2023-11-29 04:30:58,807 INFO L378 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 92 treesize of output 72 [2023-11-29 04:30:59,660 INFO L349 Elim1Store]: treesize reduction 11, result has 88.2 percent of original size [2023-11-29 04:30:59,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 114 treesize of output 159 [2023-11-29 04:31:03,804 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:31:03,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987432628] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:31:03,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:31:03,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 24, 21] total 57 [2023-11-29 04:31:03,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198673363] [2023-11-29 04:31:03,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:31:03,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-11-29 04:31:03,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:31:03,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-11-29 04:31:03,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=2972, Unknown=31, NotChecked=0, Total=3306 [2023-11-29 04:31:26,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 140 [2023-11-29 04:31:26,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 2733 transitions, 50447 flow. Second operand has 58 states, 58 states have (on average 39.63793103448276) internal successors, (2299), 58 states have internal predecessors, (2299), 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) [2023-11-29 04:31:26,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:31:26,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 140 [2023-11-29 04:31:26,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:33:54,566 INFO L124 PetriNetUnfolderBase]: 103876/186563 cut-off events. [2023-11-29 04:33:54,566 INFO L125 PetriNetUnfolderBase]: For 1916210/1916554 co-relation queries the response was YES. [2023-11-29 04:33:57,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1157727 conditions, 186563 events. 103876/186563 cut-off events. For 1916210/1916554 co-relation queries the response was YES. Maximal size of possible extension queue 4651. Compared 1928446 event pairs, 13884 based on Foata normal form. 1685/179643 useless extension candidates. Maximal degree in co-relation 1154325. Up to 57301 conditions per place. [2023-11-29 04:33:58,408 INFO L140 encePairwiseOnDemand]: 90/140 looper letters, 3940 selfloop transitions, 5745 changer transitions 17/9740 dead transitions. [2023-11-29 04:33:58,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 9740 transitions, 187891 flow [2023-11-29 04:33:58,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2023-11-29 04:33:58,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2023-11-29 04:33:58,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 6089 transitions. [2023-11-29 04:33:58,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37173382173382175 [2023-11-29 04:33:58,418 INFO L72 ComplementDD]: Start complementDD. Operand 117 states and 6089 transitions. [2023-11-29 04:33:58,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 6089 transitions. [2023-11-29 04:33:58,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:33:58,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 117 states and 6089 transitions. [2023-11-29 04:33:58,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 118 states, 117 states have (on average 52.042735042735046) internal successors, (6089), 117 states have internal predecessors, (6089), 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) [2023-11-29 04:33:58,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 118 states, 118 states have (on average 140.0) internal successors, (16520), 118 states have internal predecessors, (16520), 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) [2023-11-29 04:33:58,455 INFO L81 ComplementDD]: Finished complementDD. Result has 118 states, 118 states have (on average 140.0) internal successors, (16520), 118 states have internal predecessors, (16520), 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) [2023-11-29 04:33:58,455 INFO L175 Difference]: Start difference. First operand has 311 places, 2733 transitions, 50447 flow. Second operand 117 states and 6089 transitions. [2023-11-29 04:33:58,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 9740 transitions, 187891 flow [2023-11-29 04:36:47,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 9740 transitions, 187740 flow, removed 36 selfloop flow, removed 10 redundant places. [2023-11-29 04:36:47,439 INFO L231 Difference]: Finished difference. Result has 493 places, 7177 transitions, 165958 flow [2023-11-29 04:36:47,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=50346, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2733, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1673, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1003, PETRI_DIFFERENCE_SUBTRAHEND_STATES=117, PETRI_FLOW=165958, PETRI_PLACES=493, PETRI_TRANSITIONS=7177} [2023-11-29 04:36:47,442 INFO L281 CegarLoopForPetriNet]: 140 programPoint places, 353 predicate places. [2023-11-29 04:36:47,442 INFO L495 AbstractCegarLoop]: Abstraction has has 493 places, 7177 transitions, 165958 flow [2023-11-29 04:36:47,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 39.63793103448276) internal successors, (2299), 58 states have internal predecessors, (2299), 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) [2023-11-29 04:36:47,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:36:47,442 INFO L208 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, 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, 1, 1, 1, 1, 1, 1] [2023-11-29 04:36:47,447 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 04:36:47,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-29 04:36:47,643 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-29 04:36:47,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:36:47,643 INFO L85 PathProgramCache]: Analyzing trace with hash -660913479, now seen corresponding path program 1 times [2023-11-29 04:36:47,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:36:47,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576899965] [2023-11-29 04:36:47,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:36:47,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:36:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:36:48,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:36:48,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:36:48,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576899965] [2023-11-29 04:36:48,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576899965] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:36:48,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11765161] [2023-11-29 04:36:48,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:36:48,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:36:48,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:36:48,488 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:36:48,489 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c9dac2a-e7c7-4955-b3ab-81a035259329/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 04:36:48,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:36:48,626 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-29 04:36:48,629 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:36:48,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:36:48,687 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 04:36:48,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-29 04:36:48,820 INFO L349 Elim1Store]: treesize reduction 32, result has 45.8 percent of original size [2023-11-29 04:36:48,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 23 treesize of output 33 [2023-11-29 04:36:48,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:36:48,921 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 04:36:48,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 30 [2023-11-29 04:36:49,427 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-11-29 04:36:49,427 INFO L378 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 62 treesize of output 62 [2023-11-29 04:36:49,447 INFO L378 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 [2023-11-29 04:36:49,948 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-11-29 04:36:49,948 INFO L378 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 71 treesize of output 63 [2023-11-29 04:36:50,285 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:36:50,286 INFO L378 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 [2023-11-29 04:36:50,313 INFO L378 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 [2023-11-29 04:36:50,320 INFO L378 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 [2023-11-29 04:36:50,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:36:50,334 INFO L378 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 [2023-11-29 04:36:50,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:36:50,353 INFO L378 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 [2023-11-29 04:36:50,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-29 04:36:50,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:36:50,393 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:36:50,414 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1157 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1157) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1157 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1157) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1157 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1157) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1157 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1157) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false [2023-11-29 04:36:50,441 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1157 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1157) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1157 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1157) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1157 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1157) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1157 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1157) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2023-11-29 04:36:50,461 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1157 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1157) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1157 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1157) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1157 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1157) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1157 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1157) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2023-11-29 04:36:50,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:36:50,641 INFO L378 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 [2023-11-29 04:36:50,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:36:50,647 INFO L378 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 [2023-11-29 04:36:50,656 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-29 04:36:50,656 INFO L378 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 [2023-11-29 04:36:50,661 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-29 04:36:50,661 INFO L378 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 [2023-11-29 04:36:50,666 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-29 04:36:50,666 INFO L378 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 [2023-11-29 04:36:50,699 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1152 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1152) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) c_threadThread1of2ForFork0_~t~0.base))) is different from false [2023-11-29 04:36:50,779 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1152 (Array Int Int))) (not (= |c_threadThread1of2ForFork0_#in~arg.base| (select (select (store |c_#memory_$Pointer$.base| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1152) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false [2023-11-29 04:36:50,786 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1152 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1152) |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 [2023-11-29 04:36:50,794 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1152 (Array Int Int)) (v_ArrVal_1151 (Array Int Int))) (not (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1151) |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1152) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false [2023-11-29 04:36:50,816 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1152 (Array Int Int)) (v_ArrVal_1151 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1151) |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1152) |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 [2023-11-29 04:36:51,285 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:36:51,285 INFO L378 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 241 treesize of output 144 [2023-11-29 04:36:51,294 INFO L378 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 [2023-11-29 04:36:51,300 INFO L378 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 48 treesize of output 46 [2023-11-29 04:36:51,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:36:51,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11765161] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:36:51,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:36:51,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 20] total 48 [2023-11-29 04:36:51,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131299743] [2023-11-29 04:36:51,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:36:51,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-11-29 04:36:51,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:36:51,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-11-29 04:36:51,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1475, Unknown=36, NotChecked=680, Total=2352 [2023-11-29 04:36:51,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 140 [2023-11-29 04:36:51,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 493 places, 7177 transitions, 165958 flow. Second operand has 49 states, 49 states have (on average 53.12244897959184) internal successors, (2603), 49 states have internal predecessors, (2603), 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) [2023-11-29 04:36:51,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:36:51,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 140 [2023-11-29 04:36:51,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand