./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-ptr.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_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/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_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-ptr.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/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_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/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 2804a3d9c88e5ebdd5cd91ad2518af39bf332bf1cb9f17b40166d15deda7338f --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 20:27:13,398 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:27:13,464 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-28 20:27:13,469 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:27:13,469 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:27:13,491 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:27:13,492 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:27:13,492 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:27:13,493 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:27:13,494 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:27:13,494 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:27:13,495 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:27:13,496 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:27:13,496 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:27:13,497 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-28 20:27:13,497 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 20:27:13,498 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 20:27:13,498 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 20:27:13,499 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:27:13,499 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-28 20:27:13,500 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:27:13,500 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-28 20:27:13,501 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-28 20:27:13,504 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-28 20:27:13,505 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 20:27:13,505 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-28 20:27:13,505 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:27:13,506 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:27:13,506 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:27:13,507 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:27:13,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:27:13,508 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:27:13,508 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:27:13,508 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-28 20:27:13,508 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 20:27:13,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-28 20:27:13,509 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:27:13,509 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:27:13,509 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-28 20:27:13,509 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:27:13,510 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:27:13,510 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_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/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_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/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 -> 2804a3d9c88e5ebdd5cd91ad2518af39bf332bf1cb9f17b40166d15deda7338f [2023-11-28 20:27:13,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:27:13,748 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:27:13,751 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:27:13,752 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:27:13,752 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:27:13,754 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-ptr.i [2023-11-28 20:27:16,516 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:27:16,751 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:27:16,752 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/sv-benchmarks/c/pthread-race-challenges/per-thread-array-ptr.i [2023-11-28 20:27:16,770 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/data/ff7829896/86d11df78cb546cdb4adaa1c01512a9f/FLAGee9a84fa6 [2023-11-28 20:27:16,782 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/data/ff7829896/86d11df78cb546cdb4adaa1c01512a9f [2023-11-28 20:27:16,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:27:16,785 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:27:16,787 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:27:16,787 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:27:16,791 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:27:16,792 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:27:16" (1/1) ... [2023-11-28 20:27:16,793 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48040f4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:16, skipping insertion in model container [2023-11-28 20:27:16,793 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:27:16" (1/1) ... [2023-11-28 20:27:16,851 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:27:17,213 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:27:17,222 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 20:27:17,267 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:27:17,319 INFO L206 MainTranslator]: Completed translation [2023-11-28 20:27:17,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:17 WrapperNode [2023-11-28 20:27:17,319 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:27:17,320 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 20:27:17,320 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 20:27:17,320 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 20:27:17,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:17" (1/1) ... [2023-11-28 20:27:17,344 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:17" (1/1) ... [2023-11-28 20:27:17,372 INFO L138 Inliner]: procedures = 265, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2023-11-28 20:27:17,372 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 20:27:17,373 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 20:27:17,373 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 20:27:17,373 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 20:27:17,381 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:17" (1/1) ... [2023-11-28 20:27:17,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:17" (1/1) ... [2023-11-28 20:27:17,386 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:17" (1/1) ... [2023-11-28 20:27:17,386 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:17" (1/1) ... [2023-11-28 20:27:17,398 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:17" (1/1) ... [2023-11-28 20:27:17,402 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:17" (1/1) ... [2023-11-28 20:27:17,405 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:17" (1/1) ... [2023-11-28 20:27:17,407 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:17" (1/1) ... [2023-11-28 20:27:17,410 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 20:27:17,411 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 20:27:17,412 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 20:27:17,412 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 20:27:17,412 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:17" (1/1) ... [2023-11-28 20:27:17,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:27:17,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:27:17,442 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 20:27:17,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 20:27:17,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-28 20:27:17,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-28 20:27:17,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-28 20:27:17,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-28 20:27:17,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-28 20:27:17,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-28 20:27:17,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-28 20:27:17,479 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-28 20:27:17,480 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-28 20:27:17,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 20:27:17,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 20:27:17,481 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-28 20:27:17,644 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 20:27:17,647 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 20:27:17,886 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 20:27:17,896 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 20:27:17,896 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-28 20:27:17,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:27:17 BoogieIcfgContainer [2023-11-28 20:27:17,898 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 20:27:17,900 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 20:27:17,900 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 20:27:17,903 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 20:27:17,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:27:16" (1/3) ... [2023-11-28 20:27:17,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cee7077 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:27:17, skipping insertion in model container [2023-11-28 20:27:17,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:17" (2/3) ... [2023-11-28 20:27:17,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cee7077 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:27:17, skipping insertion in model container [2023-11-28 20:27:17,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:27:17" (3/3) ... [2023-11-28 20:27:17,905 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-ptr.i [2023-11-28 20:27:17,912 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-28 20:27:17,920 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 20:27:17,920 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-28 20:27:17,920 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-28 20:27:17,975 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-28 20:27:18,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 122 transitions, 251 flow [2023-11-28 20:27:18,072 INFO L124 PetriNetUnfolderBase]: 6/188 cut-off events. [2023-11-28 20:27:18,072 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-28 20:27:18,076 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 372 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-28 20:27:18,077 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 122 transitions, 251 flow [2023-11-28 20:27:18,081 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 122 transitions, 251 flow [2023-11-28 20:27:18,089 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 20:27:18,095 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;@192302a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 20:27:18,096 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-11-28 20:27:18,106 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-28 20:27:18,106 INFO L124 PetriNetUnfolderBase]: 3/42 cut-off events. [2023-11-28 20:27:18,106 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 20:27:18,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:27:18,107 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-28 20:27:18,107 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-28 20:27:18,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:27:18,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1948619337, now seen corresponding path program 1 times [2023-11-28 20:27:18,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:27:18,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298478352] [2023-11-28 20:27:18,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:27:18,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:27:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:27:18,805 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-28 20:27:18,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:27:18,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298478352] [2023-11-28 20:27:18,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298478352] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:27:18,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:27:18,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:27:18,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888474685] [2023-11-28 20:27:18,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:27:18,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:27:18,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:27:18,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:27:18,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:27:19,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 122 [2023-11-28 20:27:19,258 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-28 20:27:19,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:27:19,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 122 [2023-11-28 20:27:19,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:27:19,425 INFO L124 PetriNetUnfolderBase]: 81/497 cut-off events. [2023-11-28 20:27:19,425 INFO L125 PetriNetUnfolderBase]: For 8/12 co-relation queries the response was YES. [2023-11-28 20:27:19,427 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 2303 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-28 20:27:19,430 INFO L140 encePairwiseOnDemand]: 102/122 looper letters, 28 selfloop transitions, 24 changer transitions 1/149 dead transitions. [2023-11-28 20:27:19,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 149 transitions, 409 flow [2023-11-28 20:27:19,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:27:19,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 20:27:19,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 641 transitions. [2023-11-28 20:27:19,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8756830601092896 [2023-11-28 20:27:19,447 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 641 transitions. [2023-11-28 20:27:19,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 641 transitions. [2023-11-28 20:27:19,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:27:19,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 641 transitions. [2023-11-28 20:27:19,458 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-28 20:27:19,466 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-28 20:27:19,467 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-28 20:27:19,468 INFO L175 Difference]: Start difference. First operand has 121 places, 122 transitions, 251 flow. Second operand 6 states and 641 transitions. [2023-11-28 20:27:19,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 149 transitions, 409 flow [2023-11-28 20:27:19,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 149 transitions, 409 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-28 20:27:19,478 INFO L231 Difference]: Finished difference. Result has 131 places, 142 transitions, 421 flow [2023-11-28 20:27:19,480 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-28 20:27:19,483 INFO L281 CegarLoopForPetriNet]: 121 programPoint places, 10 predicate places. [2023-11-28 20:27:19,483 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 142 transitions, 421 flow [2023-11-28 20:27:19,484 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-28 20:27:19,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:27:19,484 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-28 20:27:19,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-28 20:27:19,485 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-28 20:27:19,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:27:19,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1544078002, now seen corresponding path program 1 times [2023-11-28 20:27:19,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:27:19,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167772874] [2023-11-28 20:27:19,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:27:19,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:27:19,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:27:19,604 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-28 20:27:19,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:27:19,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167772874] [2023-11-28 20:27:19,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167772874] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:27:19,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:27:19,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:27:19,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146089922] [2023-11-28 20:27:19,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:27:19,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:27:19,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:27:19,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:27:19,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:27:19,688 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 122 [2023-11-28 20:27:19,690 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-28 20:27:19,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:27:19,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 122 [2023-11-28 20:27:19,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:27:19,799 INFO L124 PetriNetUnfolderBase]: 59/485 cut-off events. [2023-11-28 20:27:19,799 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2023-11-28 20:27:19,802 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 2138 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-28 20:27:19,805 INFO L140 encePairwiseOnDemand]: 114/122 looper letters, 11 selfloop transitions, 6 changer transitions 1/147 dead transitions. [2023-11-28 20:27:19,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 147 transitions, 467 flow [2023-11-28 20:27:19,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:27:19,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 20:27:19,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 655 transitions. [2023-11-28 20:27:19,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.894808743169399 [2023-11-28 20:27:19,810 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 655 transitions. [2023-11-28 20:27:19,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 655 transitions. [2023-11-28 20:27:19,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:27:19,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 655 transitions. [2023-11-28 20:27:19,814 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-28 20:27:19,817 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-28 20:27:19,817 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-28 20:27:19,818 INFO L175 Difference]: Start difference. First operand has 131 places, 142 transitions, 421 flow. Second operand 6 states and 655 transitions. [2023-11-28 20:27:19,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 147 transitions, 467 flow [2023-11-28 20:27:19,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 147 transitions, 467 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-28 20:27:19,828 INFO L231 Difference]: Finished difference. Result has 139 places, 146 transitions, 463 flow [2023-11-28 20:27:19,829 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-28 20:27:19,830 INFO L281 CegarLoopForPetriNet]: 121 programPoint places, 18 predicate places. [2023-11-28 20:27:19,830 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 146 transitions, 463 flow [2023-11-28 20:27:19,831 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-28 20:27:19,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:27:19,831 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-28 20:27:19,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-28 20:27:19,831 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-28 20:27:19,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:27:19,832 INFO L85 PathProgramCache]: Analyzing trace with hash -340307480, now seen corresponding path program 1 times [2023-11-28 20:27:19,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:27:19,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464204760] [2023-11-28 20:27:19,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:27:19,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:27:19,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:27:20,165 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-28 20:27:20,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:27:20,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464204760] [2023-11-28 20:27:20,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464204760] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:27:20,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:27:20,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:27:20,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382785387] [2023-11-28 20:27:20,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:27:20,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:27:20,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:27:20,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:27:20,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:27:20,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 122 [2023-11-28 20:27:20,479 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-28 20:27:20,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:27:20,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 122 [2023-11-28 20:27:20,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:27:20,709 INFO L124 PetriNetUnfolderBase]: 207/965 cut-off events. [2023-11-28 20:27:20,709 INFO L125 PetriNetUnfolderBase]: For 330/330 co-relation queries the response was YES. [2023-11-28 20:27:20,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1948 conditions, 965 events. 207/965 cut-off events. For 330/330 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 6042 event pairs, 9 based on Foata normal form. 0/904 useless extension candidates. Maximal degree in co-relation 1815. Up to 294 conditions per place. [2023-11-28 20:27:20,718 INFO L140 encePairwiseOnDemand]: 99/122 looper letters, 51 selfloop transitions, 50 changer transitions 4/206 dead transitions. [2023-11-28 20:27:20,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 206 transitions, 900 flow [2023-11-28 20:27:20,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:27:20,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 20:27:20,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 616 transitions. [2023-11-28 20:27:20,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8415300546448088 [2023-11-28 20:27:20,721 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 616 transitions. [2023-11-28 20:27:20,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 616 transitions. [2023-11-28 20:27:20,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:27:20,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 616 transitions. [2023-11-28 20:27:20,725 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-28 20:27:20,727 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-28 20:27:20,728 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-28 20:27:20,728 INFO L175 Difference]: Start difference. First operand has 139 places, 146 transitions, 463 flow. Second operand 6 states and 616 transitions. [2023-11-28 20:27:20,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 206 transitions, 900 flow [2023-11-28 20:27:20,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 206 transitions, 898 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-28 20:27:20,738 INFO L231 Difference]: Finished difference. Result has 148 places, 192 transitions, 919 flow [2023-11-28 20:27:20,739 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-28 20:27:20,740 INFO L281 CegarLoopForPetriNet]: 121 programPoint places, 27 predicate places. [2023-11-28 20:27:20,740 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 192 transitions, 919 flow [2023-11-28 20:27:20,741 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-28 20:27:20,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:27:20,741 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-28 20:27:20,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-28 20:27:20,741 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-28 20:27:20,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:27:20,742 INFO L85 PathProgramCache]: Analyzing trace with hash 108159104, now seen corresponding path program 1 times [2023-11-28 20:27:20,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:27:20,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4700265] [2023-11-28 20:27:20,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:27:20,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:27:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:27:21,160 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-28 20:27:21,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:27:21,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4700265] [2023-11-28 20:27:21,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4700265] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:27:21,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:27:21,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:27:21,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438967443] [2023-11-28 20:27:21,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:27:21,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:27:21,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:27:21,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:27:21,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:27:21,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 122 [2023-11-28 20:27:21,301 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-28 20:27:21,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:27:21,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 122 [2023-11-28 20:27:21,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:27:21,784 INFO L124 PetriNetUnfolderBase]: 584/1937 cut-off events. [2023-11-28 20:27:21,784 INFO L125 PetriNetUnfolderBase]: For 1463/1580 co-relation queries the response was YES. [2023-11-28 20:27:21,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5122 conditions, 1937 events. 584/1937 cut-off events. For 1463/1580 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 14350 event pairs, 96 based on Foata normal form. 20/1852 useless extension candidates. Maximal degree in co-relation 4880. Up to 1013 conditions per place. [2023-11-28 20:27:21,797 INFO L140 encePairwiseOnDemand]: 91/122 looper letters, 98 selfloop transitions, 123 changer transitions 3/314 dead transitions. [2023-11-28 20:27:21,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 314 transitions, 1919 flow [2023-11-28 20:27:21,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:27:21,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 20:27:21,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 641 transitions. [2023-11-28 20:27:21,800 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8756830601092896 [2023-11-28 20:27:21,801 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 641 transitions. [2023-11-28 20:27:21,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 641 transitions. [2023-11-28 20:27:21,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:27:21,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 641 transitions. [2023-11-28 20:27:21,803 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-28 20:27:21,805 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-28 20:27:21,805 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-28 20:27:21,805 INFO L175 Difference]: Start difference. First operand has 148 places, 192 transitions, 919 flow. Second operand 6 states and 641 transitions. [2023-11-28 20:27:21,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 314 transitions, 1919 flow [2023-11-28 20:27:21,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 314 transitions, 1907 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-28 20:27:21,825 INFO L231 Difference]: Finished difference. Result has 151 places, 311 transitions, 2033 flow [2023-11-28 20:27:21,826 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=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2033, PETRI_PLACES=151, PETRI_TRANSITIONS=311} [2023-11-28 20:27:21,827 INFO L281 CegarLoopForPetriNet]: 121 programPoint places, 30 predicate places. [2023-11-28 20:27:21,827 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 311 transitions, 2033 flow [2023-11-28 20:27:21,828 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-28 20:27:21,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:27:21,828 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-28 20:27:21,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-28 20:27:21,829 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-28 20:27:21,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:27:21,829 INFO L85 PathProgramCache]: Analyzing trace with hash 724220416, now seen corresponding path program 1 times [2023-11-28 20:27:21,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:27:21,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068760035] [2023-11-28 20:27:21,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:27:21,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:27:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:27:22,313 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-28 20:27:22,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:27:22,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068760035] [2023-11-28 20:27:22,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068760035] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:27:22,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434343775] [2023-11-28 20:27:22,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:27:22,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:27:22,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:27:22,316 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:27:22,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-28 20:27:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:27:22,456 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-28 20:27:22,465 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:27:22,509 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-28 20:27:22,530 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-28 20:27:22,531 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-28 20:27:22,549 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-28 20:27:22,608 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-28 20:27:22,621 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-28 20:27:22,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:27:22,640 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-28 20:27:22,671 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-28 20:27:22,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:27:22,692 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-28 20:27:22,704 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-28 20:27:22,704 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:27:22,748 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_191 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_191) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_191 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_191) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_191 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_191) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-28 20:27:22,772 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_191 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_191) c_threadThread1of1ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_191 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_191) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_191 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_191) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-28 20:27:22,883 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-28 20:27:22,906 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-28 20:27:22,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434343775] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:27:22,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:27:22,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 16 [2023-11-28 20:27:22,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366816370] [2023-11-28 20:27:22,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:27:22,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-28 20:27:22,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:27:22,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-28 20:27:22,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=176, Unknown=2, NotChecked=54, Total=272 [2023-11-28 20:27:23,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 122 [2023-11-28 20:27:23,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 311 transitions, 2033 flow. Second operand has 17 states, 17 states have (on average 50.35294117647059) internal successors, (856), 17 states have internal predecessors, (856), 0 states have call successors, (0), 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-28 20:27:23,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:27:23,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 122 [2023-11-28 20:27:23,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:27:25,634 INFO L124 PetriNetUnfolderBase]: 1146/2932 cut-off events. [2023-11-28 20:27:25,635 INFO L125 PetriNetUnfolderBase]: For 4360/4362 co-relation queries the response was YES. [2023-11-28 20:27:25,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10322 conditions, 2932 events. 1146/2932 cut-off events. For 4360/4362 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 20925 event pairs, 152 based on Foata normal form. 41/2934 useless extension candidates. Maximal degree in co-relation 10037. Up to 993 conditions per place. [2023-11-28 20:27:25,657 INFO L140 encePairwiseOnDemand]: 87/122 looper letters, 389 selfloop transitions, 174 changer transitions 62/673 dead transitions. [2023-11-28 20:27:25,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 673 transitions, 5237 flow [2023-11-28 20:27:25,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-28 20:27:25,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2023-11-28 20:27:25,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1899 transitions. [2023-11-28 20:27:25,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5021152829190905 [2023-11-28 20:27:25,697 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 1899 transitions. [2023-11-28 20:27:25,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 1899 transitions. [2023-11-28 20:27:25,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:27:25,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 1899 transitions. [2023-11-28 20:27:25,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 61.25806451612903) internal successors, (1899), 31 states have internal predecessors, (1899), 0 states have call successors, (0), 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-28 20:27:25,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 122.0) internal successors, (3904), 32 states have internal predecessors, (3904), 0 states have call successors, (0), 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-28 20:27:25,715 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 122.0) internal successors, (3904), 32 states have internal predecessors, (3904), 0 states have call successors, (0), 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-28 20:27:25,715 INFO L175 Difference]: Start difference. First operand has 151 places, 311 transitions, 2033 flow. Second operand 31 states and 1899 transitions. [2023-11-28 20:27:25,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 673 transitions, 5237 flow [2023-11-28 20:27:25,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 673 transitions, 5147 flow, removed 45 selfloop flow, removed 0 redundant places. [2023-11-28 20:27:25,771 INFO L231 Difference]: Finished difference. Result has 196 places, 384 transitions, 3189 flow [2023-11-28 20:27:25,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=1943, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=3189, PETRI_PLACES=196, PETRI_TRANSITIONS=384} [2023-11-28 20:27:25,772 INFO L281 CegarLoopForPetriNet]: 121 programPoint places, 75 predicate places. [2023-11-28 20:27:25,772 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 384 transitions, 3189 flow [2023-11-28 20:27:25,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 50.35294117647059) internal successors, (856), 17 states have internal predecessors, (856), 0 states have call successors, (0), 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-28 20:27:25,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:27:25,773 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-28 20:27:25,785 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-28 20:27:25,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:27:25,977 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-28 20:27:25,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:27:25,977 INFO L85 PathProgramCache]: Analyzing trace with hash 2052336733, now seen corresponding path program 1 times [2023-11-28 20:27:25,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:27:25,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99663559] [2023-11-28 20:27:25,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:27:25,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:27:26,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:27:26,638 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-28 20:27:26,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:27:26,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99663559] [2023-11-28 20:27:26,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99663559] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:27:26,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197644185] [2023-11-28 20:27:26,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:27:26,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:27:26,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:27:26,640 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:27:26,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-28 20:27:26,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:27:26,761 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-28 20:27:26,765 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:27:26,772 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-28 20:27:26,799 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-28 20:27:26,800 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-28 20:27:26,860 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-28 20:27:27,048 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-28 20:27:27,080 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-28 20:27:27,135 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-28 20:27:27,192 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-28 20:27:27,253 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-28 20:27:27,292 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-28 20:27:27,292 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:27:27,445 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_291) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)) (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_291) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0)) (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_291) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) 0)) (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_291) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1) 0))))) is different from false [2023-11-28 20:27:27,470 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) (.cse1 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_291) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_291) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0)) (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_291) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_291) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0))))) is different from false [2023-11-28 20:27:27,602 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-28 20:27:27,627 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-28 20:27:27,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197644185] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:27:27,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:27:27,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 29 [2023-11-28 20:27:27,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246830373] [2023-11-28 20:27:27,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:27:27,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-28 20:27:27,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:27:27,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-28 20:27:27,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=645, Unknown=12, NotChecked=106, Total=870 [2023-11-28 20:27:27,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 122 [2023-11-28 20:27:27,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 384 transitions, 3189 flow. Second operand has 30 states, 30 states have (on average 52.3) internal successors, (1569), 30 states have internal predecessors, (1569), 0 states have call successors, (0), 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-28 20:27:27,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:27:27,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 122 [2023-11-28 20:27:27,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:27:29,566 INFO L124 PetriNetUnfolderBase]: 931/2700 cut-off events. [2023-11-28 20:27:29,566 INFO L125 PetriNetUnfolderBase]: For 9003/9006 co-relation queries the response was YES. [2023-11-28 20:27:29,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11202 conditions, 2700 events. 931/2700 cut-off events. For 9003/9006 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 20033 event pairs, 111 based on Foata normal form. 25/2672 useless extension candidates. Maximal degree in co-relation 10890. Up to 1242 conditions per place. [2023-11-28 20:27:29,592 INFO L140 encePairwiseOnDemand]: 107/122 looper letters, 363 selfloop transitions, 31 changer transitions 44/491 dead transitions. [2023-11-28 20:27:29,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 491 transitions, 4643 flow [2023-11-28 20:27:29,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-28 20:27:29,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-11-28 20:27:29,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1088 transitions. [2023-11-28 20:27:29,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49544626593806923 [2023-11-28 20:27:29,641 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1088 transitions. [2023-11-28 20:27:29,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1088 transitions. [2023-11-28 20:27:29,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:27:29,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1088 transitions. [2023-11-28 20:27:29,646 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-28 20:27:29,651 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-28 20:27:29,652 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-28 20:27:29,652 INFO L175 Difference]: Start difference. First operand has 196 places, 384 transitions, 3189 flow. Second operand 18 states and 1088 transitions. [2023-11-28 20:27:29,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 491 transitions, 4643 flow [2023-11-28 20:27:29,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 491 transitions, 4587 flow, removed 12 selfloop flow, removed 10 redundant places. [2023-11-28 20:27:29,724 INFO L231 Difference]: Finished difference. Result has 200 places, 352 transitions, 2847 flow [2023-11-28 20:27:29,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=3133, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2847, PETRI_PLACES=200, PETRI_TRANSITIONS=352} [2023-11-28 20:27:29,726 INFO L281 CegarLoopForPetriNet]: 121 programPoint places, 79 predicate places. [2023-11-28 20:27:29,726 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 352 transitions, 2847 flow [2023-11-28 20:27:29,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 52.3) internal successors, (1569), 30 states have internal predecessors, (1569), 0 states have call successors, (0), 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-28 20:27:29,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:27:29,728 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-28 20:27:29,734 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-28 20:27:29,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:27:29,933 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-28 20:27:29,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:27:29,933 INFO L85 PathProgramCache]: Analyzing trace with hash 946631182, now seen corresponding path program 1 times [2023-11-28 20:27:29,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:27:29,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037707592] [2023-11-28 20:27:29,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:27:29,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:27:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:27:30,291 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-28 20:27:30,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:27:30,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037707592] [2023-11-28 20:27:30,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037707592] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:27:30,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:27:30,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:27:30,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683212751] [2023-11-28 20:27:30,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:27:30,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:27:30,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:27:30,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:27:30,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:27:30,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 122 [2023-11-28 20:27:30,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 352 transitions, 2847 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-28 20:27:30,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:27:30,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 122 [2023-11-28 20:27:30,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:27:30,954 INFO L124 PetriNetUnfolderBase]: 503/1826 cut-off events. [2023-11-28 20:27:30,955 INFO L125 PetriNetUnfolderBase]: For 6019/6064 co-relation queries the response was YES. [2023-11-28 20:27:30,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7071 conditions, 1826 events. 503/1826 cut-off events. For 6019/6064 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 13925 event pairs, 42 based on Foata normal form. 3/1807 useless extension candidates. Maximal degree in co-relation 6907. Up to 454 conditions per place. [2023-11-28 20:27:30,971 INFO L140 encePairwiseOnDemand]: 111/122 looper letters, 109 selfloop transitions, 37 changer transitions 15/392 dead transitions. [2023-11-28 20:27:30,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 392 transitions, 3589 flow [2023-11-28 20:27:30,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:27:30,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 20:27:30,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 642 transitions. [2023-11-28 20:27:30,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8770491803278688 [2023-11-28 20:27:30,974 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 642 transitions. [2023-11-28 20:27:30,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 642 transitions. [2023-11-28 20:27:30,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:27:30,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 642 transitions. [2023-11-28 20:27:30,976 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-28 20:27:30,978 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-28 20:27:30,978 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-28 20:27:30,978 INFO L175 Difference]: Start difference. First operand has 200 places, 352 transitions, 2847 flow. Second operand 6 states and 642 transitions. [2023-11-28 20:27:30,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 392 transitions, 3589 flow [2023-11-28 20:27:31,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 392 transitions, 3510 flow, removed 10 selfloop flow, removed 17 redundant places. [2023-11-28 20:27:31,022 INFO L231 Difference]: Finished difference. Result has 192 places, 377 transitions, 3280 flow [2023-11-28 20:27:31,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=2776, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3280, PETRI_PLACES=192, PETRI_TRANSITIONS=377} [2023-11-28 20:27:31,023 INFO L281 CegarLoopForPetriNet]: 121 programPoint places, 71 predicate places. [2023-11-28 20:27:31,023 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 377 transitions, 3280 flow [2023-11-28 20:27:31,023 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-28 20:27:31,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:27:31,024 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-28 20:27:31,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-28 20:27:31,024 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-28 20:27:31,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:27:31,024 INFO L85 PathProgramCache]: Analyzing trace with hash -2097273391, now seen corresponding path program 1 times [2023-11-28 20:27:31,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:27:31,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115912106] [2023-11-28 20:27:31,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:27:31,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:27:31,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:27:31,059 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 20:27:31,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:27:31,096 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 20:27:31,096 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-28 20:27:31,097 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2023-11-28 20:27:31,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2023-11-28 20:27:31,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2023-11-28 20:27:31,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2023-11-28 20:27:31,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2023-11-28 20:27:31,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2023-11-28 20:27:31,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2023-11-28 20:27:31,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2023-11-28 20:27:31,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2023-11-28 20:27:31,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-28 20:27:31,100 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:27:31,102 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-28 20:27:31,102 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-28 20:27:31,132 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-28 20:27:31,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 140 transitions, 296 flow [2023-11-28 20:27:31,163 INFO L124 PetriNetUnfolderBase]: 11/335 cut-off events. [2023-11-28 20:27:31,163 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-28 20:27:31,164 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 762 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-28 20:27:31,164 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 140 transitions, 296 flow [2023-11-28 20:27:31,166 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 140 transitions, 296 flow [2023-11-28 20:27:31,167 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 20:27:31,168 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;@192302a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 20:27:31,168 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-28 20:27:31,172 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-28 20:27:31,172 INFO L124 PetriNetUnfolderBase]: 3/42 cut-off events. [2023-11-28 20:27:31,172 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 20:27:31,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:27:31,172 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-28 20:27:31,172 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-28 20:27:31,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:27:31,173 INFO L85 PathProgramCache]: Analyzing trace with hash -709281591, now seen corresponding path program 1 times [2023-11-28 20:27:31,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:27:31,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000300374] [2023-11-28 20:27:31,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:27:31,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:27:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:27:31,320 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-28 20:27:31,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:27:31,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000300374] [2023-11-28 20:27:31,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000300374] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:27:31,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:27:31,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:27:31,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925189427] [2023-11-28 20:27:31,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:27:31,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:27:31,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:27:31,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:27:31,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:27:31,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 140 [2023-11-28 20:27:31,585 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-28 20:27:31,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:27:31,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 140 [2023-11-28 20:27:31,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:27:32,225 INFO L124 PetriNetUnfolderBase]: 1139/4013 cut-off events. [2023-11-28 20:27:32,225 INFO L125 PetriNetUnfolderBase]: For 132/220 co-relation queries the response was YES. [2023-11-28 20:27:32,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6043 conditions, 4013 events. 1139/4013 cut-off events. For 132/220 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 31826 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-28 20:27:32,257 INFO L140 encePairwiseOnDemand]: 116/140 looper letters, 36 selfloop transitions, 43 changer transitions 1/188 dead transitions. [2023-11-28 20:27:32,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 188 transitions, 558 flow [2023-11-28 20:27:32,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:27:32,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 20:27:32,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 740 transitions. [2023-11-28 20:27:32,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8809523809523809 [2023-11-28 20:27:32,261 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 740 transitions. [2023-11-28 20:27:32,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 740 transitions. [2023-11-28 20:27:32,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:27:32,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 740 transitions. [2023-11-28 20:27:32,264 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-28 20:27:32,266 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-28 20:27:32,267 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-28 20:27:32,267 INFO L175 Difference]: Start difference. First operand has 140 places, 140 transitions, 296 flow. Second operand 6 states and 740 transitions. [2023-11-28 20:27:32,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 188 transitions, 558 flow [2023-11-28 20:27:32,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 188 transitions, 558 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-28 20:27:32,272 INFO L231 Difference]: Finished difference. Result has 150 places, 179 transitions, 588 flow [2023-11-28 20:27:32,272 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-28 20:27:32,273 INFO L281 CegarLoopForPetriNet]: 140 programPoint places, 10 predicate places. [2023-11-28 20:27:32,273 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 179 transitions, 588 flow [2023-11-28 20:27:32,274 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-28 20:27:32,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:27:32,274 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-28 20:27:32,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-28 20:27:32,274 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-28 20:27:32,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:27:32,275 INFO L85 PathProgramCache]: Analyzing trace with hash 2034740030, now seen corresponding path program 1 times [2023-11-28 20:27:32,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:27:32,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038226308] [2023-11-28 20:27:32,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:27:32,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:27:32,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:27:32,328 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-28 20:27:32,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:27:32,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038226308] [2023-11-28 20:27:32,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038226308] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:27:32,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:27:32,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:27:32,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737574423] [2023-11-28 20:27:32,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:27:32,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:27:32,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:27:32,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:27:32,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:27:32,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 140 [2023-11-28 20:27:32,390 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-28 20:27:32,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:27:32,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 140 [2023-11-28 20:27:32,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:27:32,930 INFO L124 PetriNetUnfolderBase]: 890/3527 cut-off events. [2023-11-28 20:27:32,930 INFO L125 PetriNetUnfolderBase]: For 563/567 co-relation queries the response was YES. [2023-11-28 20:27:32,945 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 28437 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-28 20:27:32,960 INFO L140 encePairwiseOnDemand]: 132/140 looper letters, 14 selfloop transitions, 6 changer transitions 1/185 dead transitions. [2023-11-28 20:27:32,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 185 transitions, 642 flow [2023-11-28 20:27:32,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:27:32,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 20:27:32,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 754 transitions. [2023-11-28 20:27:32,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8976190476190476 [2023-11-28 20:27:32,963 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 754 transitions. [2023-11-28 20:27:32,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 754 transitions. [2023-11-28 20:27:32,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:27:32,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 754 transitions. [2023-11-28 20:27:32,968 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-28 20:27:32,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-28 20:27:32,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-28 20:27:32,970 INFO L175 Difference]: Start difference. First operand has 150 places, 179 transitions, 588 flow. Second operand 6 states and 754 transitions. [2023-11-28 20:27:32,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 185 transitions, 642 flow [2023-11-28 20:27:32,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 185 transitions, 642 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-28 20:27:32,978 INFO L231 Difference]: Finished difference. Result has 158 places, 184 transitions, 634 flow [2023-11-28 20:27:32,978 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-28 20:27:32,979 INFO L281 CegarLoopForPetriNet]: 140 programPoint places, 18 predicate places. [2023-11-28 20:27:32,979 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 184 transitions, 634 flow [2023-11-28 20:27:32,980 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-28 20:27:32,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:27:32,980 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-28 20:27:32,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-28 20:27:32,980 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-28 20:27:32,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:27:32,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1985313640, now seen corresponding path program 1 times [2023-11-28 20:27:32,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:27:32,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368539366] [2023-11-28 20:27:32,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:27:32,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:27:32,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:27:33,182 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-28 20:27:33,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:27:33,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368539366] [2023-11-28 20:27:33,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368539366] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:27:33,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:27:33,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:27:33,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800686981] [2023-11-28 20:27:33,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:27:33,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:27:33,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:27:33,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:27:33,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:27:33,436 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 140 [2023-11-28 20:27:33,437 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-28 20:27:33,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:27:33,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 140 [2023-11-28 20:27:33,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:27:34,766 INFO L124 PetriNetUnfolderBase]: 3173/8714 cut-off events. [2023-11-28 20:27:34,766 INFO L125 PetriNetUnfolderBase]: For 4364/4375 co-relation queries the response was YES. [2023-11-28 20:27:34,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19459 conditions, 8714 events. 3173/8714 cut-off events. For 4364/4375 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 76220 event pairs, 410 based on Foata normal form. 7/8209 useless extension candidates. Maximal degree in co-relation 19325. Up to 3775 conditions per place. [2023-11-28 20:27:34,826 INFO L140 encePairwiseOnDemand]: 113/140 looper letters, 78 selfloop transitions, 104 changer transitions 4/300 dead transitions. [2023-11-28 20:27:34,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 300 transitions, 1529 flow [2023-11-28 20:27:34,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:27:34,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 20:27:34,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 715 transitions. [2023-11-28 20:27:34,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8511904761904762 [2023-11-28 20:27:34,829 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 715 transitions. [2023-11-28 20:27:34,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 715 transitions. [2023-11-28 20:27:34,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:27:34,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 715 transitions. [2023-11-28 20:27:34,832 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-28 20:27:34,834 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-28 20:27:34,835 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-28 20:27:34,835 INFO L175 Difference]: Start difference. First operand has 158 places, 184 transitions, 634 flow. Second operand 6 states and 715 transitions. [2023-11-28 20:27:34,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 300 transitions, 1529 flow [2023-11-28 20:27:34,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 300 transitions, 1527 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-28 20:27:34,850 INFO L231 Difference]: Finished difference. Result has 167 places, 284 transitions, 1638 flow [2023-11-28 20:27:34,851 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-28 20:27:34,851 INFO L281 CegarLoopForPetriNet]: 140 programPoint places, 27 predicate places. [2023-11-28 20:27:34,852 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 284 transitions, 1638 flow [2023-11-28 20:27:34,852 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-28 20:27:34,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:27:34,852 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-28 20:27:34,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-28 20:27:34,853 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-28 20:27:34,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:27:34,853 INFO L85 PathProgramCache]: Analyzing trace with hash 36319612, now seen corresponding path program 1 times [2023-11-28 20:27:34,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:27:34,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645592056] [2023-11-28 20:27:34,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:27:34,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:27:34,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:27:35,140 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-28 20:27:35,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:27:35,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645592056] [2023-11-28 20:27:35,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645592056] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:27:35,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:27:35,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:27:35,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662917149] [2023-11-28 20:27:35,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:27:35,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:27:35,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:27:35,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:27:35,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:27:35,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 140 [2023-11-28 20:27:35,287 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-28 20:27:35,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:27:35,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 140 [2023-11-28 20:27:35,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:27:38,332 INFO L124 PetriNetUnfolderBase]: 8581/20103 cut-off events. [2023-11-28 20:27:38,332 INFO L125 PetriNetUnfolderBase]: For 22414/24809 co-relation queries the response was YES. [2023-11-28 20:27:38,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58947 conditions, 20103 events. 8581/20103 cut-off events. For 22414/24809 co-relation queries the response was YES. Maximal size of possible extension queue 657. Compared 190219 event pairs, 1828 based on Foata normal form. 70/19089 useless extension candidates. Maximal degree in co-relation 20664. Up to 11835 conditions per place. [2023-11-28 20:27:38,459 INFO L140 encePairwiseOnDemand]: 105/140 looper letters, 173 selfloop transitions, 249 changer transitions 0/525 dead transitions. [2023-11-28 20:27:38,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 525 transitions, 3950 flow [2023-11-28 20:27:38,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:27:38,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 20:27:38,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 743 transitions. [2023-11-28 20:27:38,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8845238095238095 [2023-11-28 20:27:38,463 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 743 transitions. [2023-11-28 20:27:38,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 743 transitions. [2023-11-28 20:27:38,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:27:38,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 743 transitions. [2023-11-28 20:27:38,465 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-28 20:27:38,467 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-28 20:27:38,468 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-28 20:27:38,468 INFO L175 Difference]: Start difference. First operand has 167 places, 284 transitions, 1638 flow. Second operand 6 states and 743 transitions. [2023-11-28 20:27:38,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 525 transitions, 3950 flow [2023-11-28 20:27:38,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 525 transitions, 3940 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-11-28 20:27:38,522 INFO L231 Difference]: Finished difference. Result has 171 places, 517 transitions, 4284 flow [2023-11-28 20:27:38,523 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-28 20:27:38,523 INFO L281 CegarLoopForPetriNet]: 140 programPoint places, 31 predicate places. [2023-11-28 20:27:38,523 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 517 transitions, 4284 flow [2023-11-28 20:27:38,524 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-28 20:27:38,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:27:38,524 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-28 20:27:38,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-28 20:27:38,525 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-28 20:27:38,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:27:38,525 INFO L85 PathProgramCache]: Analyzing trace with hash -234940548, now seen corresponding path program 1 times [2023-11-28 20:27:38,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:27:38,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577269473] [2023-11-28 20:27:38,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:27:38,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:27:38,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:27:38,996 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-28 20:27:38,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:27:38,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577269473] [2023-11-28 20:27:38,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577269473] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:27:38,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127129811] [2023-11-28 20:27:38,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:27:38,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:27:38,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:27:38,998 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:27:39,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-28 20:27:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:27:39,127 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-28 20:27:39,132 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:27:39,136 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-28 20:27:39,146 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-28 20:27:39,147 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-28 20:27:39,161 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-28 20:27:39,210 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-28 20:27:39,219 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-28 20:27:39,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:27:39,234 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-28 20:27:39,253 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-28 20:27:39,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:27:39,268 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-28 20:27:39,278 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-28 20:27:39,278 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:27:39,308 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_580 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_580) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_580 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_580) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_580 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_580) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) is different from false [2023-11-28 20:27:39,325 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_580 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_580) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_580 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_580) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_580 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_580) c_threadThread1of2ForFork0_~p~0.base) .cse1)))))) is different from false [2023-11-28 20:27:39,414 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-28 20:27:39,431 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-28 20:27:39,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127129811] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:27:39,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:27:39,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 16 [2023-11-28 20:27:39,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447472750] [2023-11-28 20:27:39,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:27:39,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-28 20:27:39,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:27:39,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-28 20:27:39,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=176, Unknown=2, NotChecked=54, Total=272 [2023-11-28 20:27:39,528 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 140 [2023-11-28 20:27:39,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 517 transitions, 4284 flow. Second operand has 17 states, 17 states have (on average 59.35294117647059) internal successors, (1009), 17 states have internal predecessors, (1009), 0 states have call successors, (0), 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-28 20:27:39,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:27:39,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 140 [2023-11-28 20:27:39,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:27:50,404 INFO L124 PetriNetUnfolderBase]: 27293/52029 cut-off events. [2023-11-28 20:27:50,404 INFO L125 PetriNetUnfolderBase]: For 93807/93822 co-relation queries the response was YES. [2023-11-28 20:27:50,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182186 conditions, 52029 events. 27293/52029 cut-off events. For 93807/93822 co-relation queries the response was YES. Maximal size of possible extension queue 1469. Compared 491445 event pairs, 3835 based on Foata normal form. 369/49842 useless extension candidates. Maximal degree in co-relation 145047. Up to 20653 conditions per place. [2023-11-28 20:27:50,805 INFO L140 encePairwiseOnDemand]: 101/140 looper letters, 848 selfloop transitions, 666 changer transitions 2/1574 dead transitions. [2023-11-28 20:27:50,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 1574 transitions, 15802 flow [2023-11-28 20:27:50,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-28 20:27:50,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2023-11-28 20:27:50,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2329 transitions. [2023-11-28 20:27:50,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5366359447004608 [2023-11-28 20:27:50,812 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 2329 transitions. [2023-11-28 20:27:50,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 2329 transitions. [2023-11-28 20:27:50,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:27:50,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 2329 transitions. [2023-11-28 20:27:50,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 75.12903225806451) internal successors, (2329), 31 states have internal predecessors, (2329), 0 states have call successors, (0), 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-28 20:27:50,824 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-28 20:27:50,825 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-28 20:27:50,825 INFO L175 Difference]: Start difference. First operand has 171 places, 517 transitions, 4284 flow. Second operand 31 states and 2329 transitions. [2023-11-28 20:27:50,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 1574 transitions, 15802 flow [2023-11-28 20:27:51,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 1574 transitions, 15712 flow, removed 45 selfloop flow, removed 0 redundant places. [2023-11-28 20:27:51,853 INFO L231 Difference]: Finished difference. Result has 223 places, 1101 transitions, 13074 flow [2023-11-28 20:27:51,853 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-28 20:27:51,854 INFO L281 CegarLoopForPetriNet]: 140 programPoint places, 83 predicate places. [2023-11-28 20:27:51,854 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 1101 transitions, 13074 flow [2023-11-28 20:27:51,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 59.35294117647059) internal successors, (1009), 17 states have internal predecessors, (1009), 0 states have call successors, (0), 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-28 20:27:51,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:27:51,855 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-28 20:27:51,860 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-28 20:27:52,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-28 20:27:52,055 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-28 20:27:52,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:27:52,056 INFO L85 PathProgramCache]: Analyzing trace with hash -910386601, now seen corresponding path program 1 times [2023-11-28 20:27:52,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:27:52,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752988666] [2023-11-28 20:27:52,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:27:52,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:27:52,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:27:52,504 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-28 20:27:52,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:27:52,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752988666] [2023-11-28 20:27:52,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752988666] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:27:52,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295458050] [2023-11-28 20:27:52,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:27:52,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:27:52,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:27:52,508 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:27:52,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-28 20:27:52,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:27:52,628 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-28 20:27:52,631 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:27:52,635 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-28 20:27:52,661 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-28 20:27:52,662 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-28 20:27:52,726 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-28 20:27:52,863 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-28 20:27:52,892 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-28 20:27:52,927 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-28 20:27:52,968 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-28 20:27:53,120 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-28 20:27:53,150 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-28 20:27:53,150 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:27:53,167 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)))) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3)) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0))) is different from false [2023-11-28 20:27:53,215 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3)) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2))))) is different from false [2023-11-28 20:27:53,231 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1) 0))))) is different from false [2023-11-28 20:27:53,250 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) (.cse2 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse2) 0))))) is different from false [2023-11-28 20:27:53,331 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-28 20:27:53,351 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-28 20:27:53,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295458050] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:27:53,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:27:53,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30 [2023-11-28 20:27:53,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379990549] [2023-11-28 20:27:53,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:27:53,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-28 20:27:53,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:27:53,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-28 20:27:53,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=605, Unknown=4, NotChecked=212, Total=930 [2023-11-28 20:27:53,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 140 [2023-11-28 20:27:53,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 1101 transitions, 13074 flow. Second operand has 31 states, 31 states have (on average 61.29032258064516) internal successors, (1900), 31 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:27:53,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:27:53,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 140 [2023-11-28 20:27:53,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:28:09,850 INFO L124 PetriNetUnfolderBase]: 28641/54815 cut-off events. [2023-11-28 20:28:09,850 INFO L125 PetriNetUnfolderBase]: For 221856/221926 co-relation queries the response was YES. [2023-11-28 20:28:10,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241248 conditions, 54815 events. 28641/54815 cut-off events. For 221856/221926 co-relation queries the response was YES. Maximal size of possible extension queue 1522. Compared 514148 event pairs, 3482 based on Foata normal form. 164/52280 useless extension candidates. Maximal degree in co-relation 236036. Up to 17686 conditions per place. [2023-11-28 20:28:10,439 INFO L140 encePairwiseOnDemand]: 108/140 looper letters, 1154 selfloop transitions, 777 changer transitions 0/1998 dead transitions. [2023-11-28 20:28:10,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 1998 transitions, 25882 flow [2023-11-28 20:28:10,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-28 20:28:10,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-11-28 20:28:10,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 2136 transitions. [2023-11-28 20:28:10,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5448979591836735 [2023-11-28 20:28:10,444 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 2136 transitions. [2023-11-28 20:28:10,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 2136 transitions. [2023-11-28 20:28:10,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:28:10,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 2136 transitions. [2023-11-28 20:28:10,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 76.28571428571429) internal successors, (2136), 28 states have internal predecessors, (2136), 0 states have call successors, (0), 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-28 20:28:10,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 140.0) internal successors, (4060), 29 states have internal predecessors, (4060), 0 states have call successors, (0), 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-28 20:28:10,456 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 140.0) internal successors, (4060), 29 states have internal predecessors, (4060), 0 states have call successors, (0), 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-28 20:28:10,457 INFO L175 Difference]: Start difference. First operand has 223 places, 1101 transitions, 13074 flow. Second operand 28 states and 2136 transitions. [2023-11-28 20:28:10,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 1998 transitions, 25882 flow [2023-11-28 20:28:15,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 1998 transitions, 25789 flow, removed 42 selfloop flow, removed 4 redundant places. [2023-11-28 20:28:15,575 INFO L231 Difference]: Finished difference. Result has 263 places, 1473 transitions, 21451 flow [2023-11-28 20:28:15,576 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=420, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=21451, PETRI_PLACES=263, PETRI_TRANSITIONS=1473} [2023-11-28 20:28:15,576 INFO L281 CegarLoopForPetriNet]: 140 programPoint places, 123 predicate places. [2023-11-28 20:28:15,576 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 1473 transitions, 21451 flow [2023-11-28 20:28:15,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 61.29032258064516) internal successors, (1900), 31 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:28:15,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:28:15,577 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-28 20:28:15,582 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-28 20:28:15,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-28 20:28:15,778 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-28 20:28:15,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:28:15,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1684049398, now seen corresponding path program 1 times [2023-11-28 20:28:15,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:28:15,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257620679] [2023-11-28 20:28:15,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:28:15,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:28:15,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:15,993 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-28 20:28:15,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:28:15,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257620679] [2023-11-28 20:28:15,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257620679] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:28:15,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:28:15,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:28:15,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157582356] [2023-11-28 20:28:15,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:28:15,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:28:15,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:28:15,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:28:15,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:28:16,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 140 [2023-11-28 20:28:16,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 1473 transitions, 21451 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-28 20:28:16,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:28:16,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 140 [2023-11-28 20:28:16,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:28:24,032 INFO L124 PetriNetUnfolderBase]: 11910/27988 cut-off events. [2023-11-28 20:28:24,033 INFO L125 PetriNetUnfolderBase]: For 176040/178019 co-relation queries the response was YES. [2023-11-28 20:28:24,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136686 conditions, 27988 events. 11910/27988 cut-off events. For 176040/178019 co-relation queries the response was YES. Maximal size of possible extension queue 829. Compared 274237 event pairs, 933 based on Foata normal form. 221/27282 useless extension candidates. Maximal degree in co-relation 135272. Up to 10866 conditions per place. [2023-11-28 20:28:24,415 INFO L140 encePairwiseOnDemand]: 125/140 looper letters, 1118 selfloop transitions, 180 changer transitions 0/1650 dead transitions. [2023-11-28 20:28:24,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 1650 transitions, 26534 flow [2023-11-28 20:28:24,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:28:24,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 20:28:24,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 737 transitions. [2023-11-28 20:28:24,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8773809523809524 [2023-11-28 20:28:24,417 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 737 transitions. [2023-11-28 20:28:24,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 737 transitions. [2023-11-28 20:28:24,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:28:24,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 737 transitions. [2023-11-28 20:28:24,418 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-28 20:28:24,419 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-28 20:28:24,419 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-28 20:28:24,419 INFO L175 Difference]: Start difference. First operand has 263 places, 1473 transitions, 21451 flow. Second operand 6 states and 737 transitions. [2023-11-28 20:28:24,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 1650 transitions, 26534 flow [2023-11-28 20:28:26,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 1650 transitions, 26139 flow, removed 173 selfloop flow, removed 10 redundant places. [2023-11-28 20:28:26,402 INFO L231 Difference]: Finished difference. Result has 263 places, 1648 transitions, 24378 flow [2023-11-28 20:28:26,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=21056, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=24378, PETRI_PLACES=263, PETRI_TRANSITIONS=1648} [2023-11-28 20:28:26,404 INFO L281 CegarLoopForPetriNet]: 140 programPoint places, 123 predicate places. [2023-11-28 20:28:26,404 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 1648 transitions, 24378 flow [2023-11-28 20:28:26,404 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-28 20:28:26,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:28:26,404 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-28 20:28:26,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-28 20:28:26,405 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-28 20:28:26,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:28:26,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1805257116, now seen corresponding path program 1 times [2023-11-28 20:28:26,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:28:26,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373885449] [2023-11-28 20:28:26,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:28:26,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:28:26,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:26,773 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-28 20:28:26,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:28:26,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373885449] [2023-11-28 20:28:26,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373885449] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:28:26,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7633065] [2023-11-28 20:28:26,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:28:26,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:28:26,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:28:26,775 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:28:26,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-28 20:28:26,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:26,886 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-28 20:28:26,890 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:28:26,938 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-28 20:28:27,032 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-28 20:28:27,054 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-28 20:28:27,086 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:28:27,087 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-28 20:28:27,126 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:28:27,127 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-28 20:28:27,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:28:27,172 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-28 20:28:27,179 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-28 20:28:27,179 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:28:27,202 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_824 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_824) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_824 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_824) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_824 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_824) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_824 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_824) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) is different from false [2023-11-28 20:28:27,217 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_824 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_824) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_824 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_824) c_threadThread1of2ForFork0_~p~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_824 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_824) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_824 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_824) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false [2023-11-28 20:28:27,232 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_824 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_824) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_824 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_824) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_824 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_824) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_824 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_824) c_threadThread1of2ForFork0_~p~0.base) .cse2)))))) is different from false [2023-11-28 20:28:27,377 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-28 20:28:27,413 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-28 20:28:27,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7633065] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:28:27,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:28:27,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2023-11-28 20:28:27,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253040052] [2023-11-28 20:28:27,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:28:27,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-28 20:28:27,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:28:27,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-28 20:28:27,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=763, Unknown=3, NotChecked=174, Total=1056 [2023-11-28 20:28:27,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 140 [2023-11-28 20:28:27,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 1648 transitions, 24378 flow. Second operand has 33 states, 33 states have (on average 60.72727272727273) internal successors, (2004), 33 states have internal predecessors, (2004), 0 states have call successors, (0), 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-28 20:28:27,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:28:27,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 140 [2023-11-28 20:28:27,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:28:54,442 INFO L124 PetriNetUnfolderBase]: 34689/65691 cut-off events. [2023-11-28 20:28:54,442 INFO L125 PetriNetUnfolderBase]: For 396545/396696 co-relation queries the response was YES. [2023-11-28 20:28:55,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326370 conditions, 65691 events. 34689/65691 cut-off events. For 396545/396696 co-relation queries the response was YES. Maximal size of possible extension queue 1859. Compared 627637 event pairs, 8056 based on Foata normal form. 648/63279 useless extension candidates. Maximal degree in co-relation 322562. Up to 33602 conditions per place. [2023-11-28 20:28:55,496 INFO L140 encePairwiseOnDemand]: 106/140 looper letters, 1691 selfloop transitions, 853 changer transitions 1/2617 dead transitions. [2023-11-28 20:28:55,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 2617 transitions, 40404 flow [2023-11-28 20:28:55,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-28 20:28:55,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-11-28 20:28:55,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1803 transitions. [2023-11-28 20:28:55,499 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5599378881987578 [2023-11-28 20:28:55,499 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 1803 transitions. [2023-11-28 20:28:55,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 1803 transitions. [2023-11-28 20:28:55,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:28:55,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1803 transitions. [2023-11-28 20:28:55,502 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-28 20:28:55,505 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-28 20:28:55,506 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-28 20:28:55,506 INFO L175 Difference]: Start difference. First operand has 263 places, 1648 transitions, 24378 flow. Second operand 23 states and 1803 transitions. [2023-11-28 20:28:55,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 2617 transitions, 40404 flow [2023-11-28 20:29:04,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 2617 transitions, 40252 flow, removed 76 selfloop flow, removed 0 redundant places. [2023-11-28 20:29:04,522 INFO L231 Difference]: Finished difference. Result has 294 places, 2132 transitions, 35072 flow [2023-11-28 20:29:04,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=24226, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1648, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=502, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1042, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=35072, PETRI_PLACES=294, PETRI_TRANSITIONS=2132} [2023-11-28 20:29:04,524 INFO L281 CegarLoopForPetriNet]: 140 programPoint places, 154 predicate places. [2023-11-28 20:29:04,524 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 2132 transitions, 35072 flow [2023-11-28 20:29:04,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 60.72727272727273) internal successors, (2004), 33 states have internal predecessors, (2004), 0 states have call successors, (0), 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-28 20:29:04,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:29:04,524 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-28 20:29:04,529 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-28 20:29:04,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-28 20:29:04,725 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-28 20:29:04,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:29:04,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1377671740, now seen corresponding path program 1 times [2023-11-28 20:29:04,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:29:04,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828506365] [2023-11-28 20:29:04,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:29:04,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:29:04,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:29:05,102 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-28 20:29:05,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:29:05,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828506365] [2023-11-28 20:29:05,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828506365] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:29:05,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837192609] [2023-11-28 20:29:05,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:29:05,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:29:05,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:29:05,103 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:29:05,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-28 20:29:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:29:05,216 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-28 20:29:05,219 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:29:05,303 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-28 20:29:05,487 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-28 20:29:05,518 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-28 20:29:05,557 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-28 20:29:05,609 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-28 20:29:05,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:29:05,659 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-28 20:29:05,687 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-28 20:29:05,688 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:29:05,704 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_924 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))) is different from false [2023-11-28 20:29:05,864 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (+ 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|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_924 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2))) (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))))) is different from false [2023-11-28 20:29:06,012 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-28 20:29:06,048 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-28 20:29:06,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837192609] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:29:06,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:29:06,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34 [2023-11-28 20:29:06,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540572572] [2023-11-28 20:29:06,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:29:06,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-28 20:29:06,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:29:06,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-28 20:29:06,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=917, Unknown=18, NotChecked=126, Total=1190 [2023-11-28 20:29:06,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 140 [2023-11-28 20:29:06,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 2132 transitions, 35072 flow. Second operand has 35 states, 35 states have (on average 62.68571428571428) internal successors, (2194), 35 states have internal predecessors, (2194), 0 states have call successors, (0), 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-28 20:29:06,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:29:06,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 140 [2023-11-28 20:29:06,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:29:41,711 INFO L124 PetriNetUnfolderBase]: 37967/71921 cut-off events. [2023-11-28 20:29:41,711 INFO L125 PetriNetUnfolderBase]: For 604271/604572 co-relation queries the response was YES. [2023-11-28 20:29:42,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410129 conditions, 71921 events. 37967/71921 cut-off events. For 604271/604572 co-relation queries the response was YES. Maximal size of possible extension queue 1967. Compared 693840 event pairs, 4873 based on Foata normal form. 503/69005 useless extension candidates. Maximal degree in co-relation 406121. Up to 24123 conditions per place. [2023-11-28 20:29:43,113 INFO L140 encePairwiseOnDemand]: 107/140 looper letters, 1940 selfloop transitions, 1280 changer transitions 0/3303 dead transitions. [2023-11-28 20:29:43,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 3303 transitions, 57613 flow [2023-11-28 20:29:43,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-28 20:29:43,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-11-28 20:29:43,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1680 transitions. [2023-11-28 20:29:43,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2023-11-28 20:29:43,116 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1680 transitions. [2023-11-28 20:29:43,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1680 transitions. [2023-11-28 20:29:43,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:29:43,116 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1680 transitions. [2023-11-28 20:29:43,119 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-28 20:29:43,122 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-28 20:29:43,122 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-28 20:29:43,122 INFO L175 Difference]: Start difference. First operand has 294 places, 2132 transitions, 35072 flow. Second operand 21 states and 1680 transitions. [2023-11-28 20:29:43,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 3303 transitions, 57613 flow [2023-11-28 20:30:04,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 3303 transitions, 57443 flow, removed 69 selfloop flow, removed 12 redundant places. [2023-11-28 20:30:04,785 INFO L231 Difference]: Finished difference. Result has 311 places, 2712 transitions, 50679 flow [2023-11-28 20:30:04,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=34912, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=769, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1073, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=50679, PETRI_PLACES=311, PETRI_TRANSITIONS=2712} [2023-11-28 20:30:04,787 INFO L281 CegarLoopForPetriNet]: 140 programPoint places, 171 predicate places. [2023-11-28 20:30:04,787 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 2712 transitions, 50679 flow [2023-11-28 20:30:04,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 62.68571428571428) internal successors, (2194), 35 states have internal predecessors, (2194), 0 states have call successors, (0), 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-28 20:30:04,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:30:04,788 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-28 20:30:04,793 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-28 20:30:04,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-28 20:30:04,988 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-28 20:30:04,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:30:04,989 INFO L85 PathProgramCache]: Analyzing trace with hash -2103690581, now seen corresponding path program 2 times [2023-11-28 20:30:04,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:30:04,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234558467] [2023-11-28 20:30:04,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:30:04,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:30:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,513 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-28 20:30:05,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:30:05,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234558467] [2023-11-28 20:30:05,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234558467] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:30:05,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135780306] [2023-11-28 20:30:05,513 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-28 20:30:05,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:30:05,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:30:05,515 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:30:05,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-28 20:30:05,671 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-28 20:30:05,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:30:05,674 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-28 20:30:05,677 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:30:05,805 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-28 20:30:05,808 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 26 treesize of output 14 [2023-11-28 20:30:06,079 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-28 20:30:06,114 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-28 20:30:06,170 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-28 20:30:06,231 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-28 20:30:06,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:30:06,296 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-28 20:30:06,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:30:06,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 37 treesize of output 26 [2023-11-28 20:30:06,419 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-28 20:30:06,419 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:30:06,435 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1040 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) is different from false [2023-11-28 20:30:06,479 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) is different from false [2023-11-28 20:30:06,493 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false [2023-11-28 20:30:06,512 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) .cse2)))))) is different from false [2023-11-28 20:30:06,779 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 27 treesize of output 15 [2023-11-28 20:30:06,784 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 8 treesize of output 4 [2023-11-28 20:30:06,855 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-11-28 20:30:06,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135780306] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:30:06,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:30:06,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 15] total 40 [2023-11-28 20:30:06,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331325477] [2023-11-28 20:30:06,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:30:06,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-11-28 20:30:06,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:30:06,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-28 20:30:06,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1194, Unknown=4, NotChecked=292, Total=1640 [2023-11-28 20:30:06,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 140 [2023-11-28 20:30:06,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 2712 transitions, 50679 flow. Second operand has 41 states, 41 states have (on average 52.1219512195122) internal successors, (2137), 41 states have internal predecessors, (2137), 0 states have call successors, (0), 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-28 20:30:06,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:30:06,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 140 [2023-11-28 20:30:06,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:31:02,572 INFO L124 PetriNetUnfolderBase]: 46277/84325 cut-off events. [2023-11-28 20:31:02,572 INFO L125 PetriNetUnfolderBase]: For 872043/872143 co-relation queries the response was YES. [2023-11-28 20:31:03,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516606 conditions, 84325 events. 46277/84325 cut-off events. For 872043/872143 co-relation queries the response was YES. Maximal size of possible extension queue 2074. Compared 794329 event pairs, 5812 based on Foata normal form. 675/81288 useless extension candidates. Maximal degree in co-relation 511647. Up to 26880 conditions per place. [2023-11-28 20:31:04,285 INFO L140 encePairwiseOnDemand]: 111/140 looper letters, 1882 selfloop transitions, 1950 changer transitions 2/3883 dead transitions. [2023-11-28 20:31:04,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 3883 transitions, 73187 flow [2023-11-28 20:31:04,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-28 20:31:04,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-11-28 20:31:04,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 2216 transitions. [2023-11-28 20:31:04,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47965367965367967 [2023-11-28 20:31:04,289 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 2216 transitions. [2023-11-28 20:31:04,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 2216 transitions. [2023-11-28 20:31:04,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:31:04,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 2216 transitions. [2023-11-28 20:31:04,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 67.15151515151516) internal successors, (2216), 33 states have internal predecessors, (2216), 0 states have call successors, (0), 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-28 20:31:04,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 140.0) internal successors, (4760), 34 states have internal predecessors, (4760), 0 states have call successors, (0), 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-28 20:31:04,297 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 140.0) internal successors, (4760), 34 states have internal predecessors, (4760), 0 states have call successors, (0), 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-28 20:31:04,297 INFO L175 Difference]: Start difference. First operand has 311 places, 2712 transitions, 50679 flow. Second operand 33 states and 2216 transitions. [2023-11-28 20:31:04,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 3883 transitions, 73187 flow [2023-11-28 20:31:28,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 3883 transitions, 73008 flow, removed 63 selfloop flow, removed 10 redundant places. [2023-11-28 20:31:28,407 INFO L231 Difference]: Finished difference. Result has 345 places, 3204 transitions, 67957 flow [2023-11-28 20:31:28,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=50524, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2712, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1556, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1068, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=67957, PETRI_PLACES=345, PETRI_TRANSITIONS=3204} [2023-11-28 20:31:28,409 INFO L281 CegarLoopForPetriNet]: 140 programPoint places, 205 predicate places. [2023-11-28 20:31:28,409 INFO L495 AbstractCegarLoop]: Abstraction has has 345 places, 3204 transitions, 67957 flow [2023-11-28 20:31:28,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 52.1219512195122) internal successors, (2137), 41 states have internal predecessors, (2137), 0 states have call successors, (0), 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-28 20:31:28,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:31:28,410 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-28 20:31:28,416 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-28 20:31:28,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-28 20:31:28,611 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-28 20:31:28,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:31:28,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1578840465, now seen corresponding path program 1 times [2023-11-28 20:31:28,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:31:28,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063362268] [2023-11-28 20:31:28,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:31:28,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:31:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:31:29,190 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-28 20:31:29,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:31:29,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063362268] [2023-11-28 20:31:29,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063362268] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:31:29,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819480952] [2023-11-28 20:31:29,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:31:29,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:31:29,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:31:29,192 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:31:29,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-28 20:31:29,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:31:29,337 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-28 20:31:29,341 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:31:29,344 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-28 20:31:29,377 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-28 20:31:29,377 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-28 20:31:29,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:31:29,478 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-28 20:31:29,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2023-11-28 20:31:29,534 INFO L349 Elim1Store]: treesize reduction 4, result has 81.0 percent of original size [2023-11-28 20:31:29,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 30 [2023-11-28 20:31:30,278 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-11-28 20:31:30,279 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 92 treesize of output 84 [2023-11-28 20:31:30,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:31:30,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 71 [2023-11-28 20:31:30,986 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-28 20:31:30,993 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-28 20:31:31,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:31:31,004 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-28 20:31:31,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:31:31,017 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-28 20:31:31,043 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-28 20:31:31,051 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-28 20:31:31,051 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:31:31,067 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1159 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1159) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1159 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1159) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1159 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1159) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1159 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1159) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) is different from false [2023-11-28 20:31:31,086 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1159 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1159) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1159 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1159) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1159 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1159) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1159 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1159) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2023-11-28 20:31:31,103 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1159 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1159) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1159 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1159) c_threadThread1of2ForFork0_~p~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1159 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1159) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1159 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1159) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false [2023-11-28 20:31:31,593 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:31:31,594 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 62 treesize of output 45 [2023-11-28 20:31:31,600 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 20 treesize of output 18 [2023-11-28 20:31:35,630 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (or (not (= |c_ULTIMATE.start_main_#t~malloc6#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|)) (forall ((v_ArrVal_1151 Int) (v_arrayElimCell_95 Int) (|v_ULTIMATE.start_main_~#datas~0#1.base_28| Int)) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~#datas~0#1.base_28| v_ArrVal_1151) v_arrayElimCell_95) 0)) (< |v_ULTIMATE.start_main_~#datas~0#1.base_28| .cse0)))) (forall ((|v_ULTIMATE.start_main_~#datas~0#1.base_28| Int)) (or (forall ((v_ArrVal_1151 Int)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~#datas~0#1.base_28| v_ArrVal_1151) |c_ULTIMATE.start_main_#t~malloc6#1.base|) 0))) (< |v_ULTIMATE.start_main_~#datas~0#1.base_28| .cse0))))) is different from false [2023-11-28 20:31:37,331 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-28 20:31:37,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819480952] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:31:37,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:31:37,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 19] total 39 [2023-11-28 20:31:37,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091962264] [2023-11-28 20:31:37,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:31:37,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-11-28 20:31:37,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:31:37,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-11-28 20:31:37,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1132, Unknown=18, NotChecked=284, Total=1560 [2023-11-28 20:31:37,410 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 140 [2023-11-28 20:31:37,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 3204 transitions, 67957 flow. Second operand has 40 states, 40 states have (on average 53.4) internal successors, (2136), 40 states have internal predecessors, (2136), 0 states have call successors, (0), 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-28 20:31:37,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:31:37,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 140 [2023-11-28 20:31:37,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:33:14,333 INFO L124 PetriNetUnfolderBase]: 63502/116994 cut-off events. [2023-11-28 20:33:14,334 INFO L125 PetriNetUnfolderBase]: For 1706907/1707675 co-relation queries the response was YES. [2023-11-28 20:33:16,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 788883 conditions, 116994 events. 63502/116994 cut-off events. For 1706907/1707675 co-relation queries the response was YES. Maximal size of possible extension queue 3326. Compared 1182540 event pairs, 13245 based on Foata normal form. 697/112300 useless extension candidates. Maximal degree in co-relation 783539. Up to 45215 conditions per place. [2023-11-28 20:33:17,147 INFO L140 encePairwiseOnDemand]: 85/140 looper letters, 4042 selfloop transitions, 1009 changer transitions 9/5111 dead transitions. [2023-11-28 20:33:17,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 5111 transitions, 115652 flow [2023-11-28 20:33:17,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-28 20:33:17,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2023-11-28 20:33:17,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2088 transitions. [2023-11-28 20:33:17,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48110599078341015 [2023-11-28 20:33:17,150 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 2088 transitions. [2023-11-28 20:33:17,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 2088 transitions. [2023-11-28 20:33:17,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:33:17,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 2088 transitions. [2023-11-28 20:33:17,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 67.35483870967742) internal successors, (2088), 31 states have internal predecessors, (2088), 0 states have call successors, (0), 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-28 20:33:17,159 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-28 20:33:17,159 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-28 20:33:17,159 INFO L175 Difference]: Start difference. First operand has 345 places, 3204 transitions, 67957 flow. Second operand 31 states and 2088 transitions. [2023-11-28 20:33:17,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 5111 transitions, 115652 flow [2023-11-28 20:34:38,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 5111 transitions, 115075 flow, removed 252 selfloop flow, removed 17 redundant places. [2023-11-28 20:34:38,482 INFO L231 Difference]: Finished difference. Result has 377 places, 4109 transitions, 92560 flow [2023-11-28 20:34:38,485 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=67413, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=341, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2580, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=92560, PETRI_PLACES=377, PETRI_TRANSITIONS=4109} [2023-11-28 20:34:38,486 INFO L281 CegarLoopForPetriNet]: 140 programPoint places, 237 predicate places. [2023-11-28 20:34:38,486 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 4109 transitions, 92560 flow [2023-11-28 20:34:38,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 53.4) internal successors, (2136), 40 states have internal predecessors, (2136), 0 states have call successors, (0), 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-28 20:34:38,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:34:38,487 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-28 20:34:38,491 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-28 20:34:38,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:34:38,688 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-28 20:34:38,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:34:38,688 INFO L85 PathProgramCache]: Analyzing trace with hash 827473295, now seen corresponding path program 2 times [2023-11-28 20:34:38,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:34:38,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078564707] [2023-11-28 20:34:38,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:34:38,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:34:38,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:34:39,353 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-28 20:34:39,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:34:39,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078564707] [2023-11-28 20:34:39,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078564707] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:34:39,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373039745] [2023-11-28 20:34:39,354 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-28 20:34:39,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:34:39,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:34:39,355 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:34:39,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-28 20:34:39,517 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-28 20:34:39,517 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:34:39,519 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-28 20:34:39,522 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:34:39,546 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-28 20:34:39,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:34:39,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 13 [2023-11-28 20:34:39,663 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-28 20:34:39,663 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 15 treesize of output 15 [2023-11-28 20:34:39,865 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-28 20:34:40,293 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-28 20:34:40,293 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 72 treesize of output 66 [2023-11-28 20:34:40,624 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-11-28 20:34:40,624 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 63 treesize of output 40 [2023-11-28 20:34:40,743 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-28 20:34:40,780 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-28 20:34:40,838 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-28 20:34:40,891 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-28 20:34:40,951 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-28 20:34:40,993 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-28 20:34:40,993 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:34:41,147 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1277 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1277) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1277 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1277) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1277 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1277) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1277 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1277) c_threadThread1of2ForFork0_~p~0.base) .cse1)))))) is different from false [2023-11-28 20:34:41,160 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1277 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1277) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1277 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1277) c_threadThread1of2ForFork0_~p~0.base) .cse2))) (forall ((v_ArrVal_1277 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1277) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1277 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1277) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2023-11-28 20:34:41,437 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 8 treesize of output 4 [2023-11-28 20:34:41,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:34:41,680 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 71 treesize of output 50 [2023-11-28 20:34:41,687 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 20 treesize of output 18 [2023-11-28 20:34:41,816 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 114 treesize of output 110 [2023-11-28 20:34:41,866 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-28 20:34:41,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373039745] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:34:41,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:34:41,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 19] total 47 [2023-11-28 20:34:41,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505579135] [2023-11-28 20:34:41,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:34:41,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-11-28 20:34:41,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:34:41,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-11-28 20:34:41,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1855, Unknown=44, NotChecked=178, Total=2256 [2023-11-28 20:34:42,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 140 [2023-11-28 20:34:42,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 4109 transitions, 92560 flow. Second operand has 48 states, 48 states have (on average 47.583333333333336) internal successors, (2284), 48 states have internal predecessors, (2284), 0 states have call successors, (0), 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-28 20:34:42,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:34:42,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 140 [2023-11-28 20:34:42,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:37:12,408 INFO L124 PetriNetUnfolderBase]: 75389/135778 cut-off events. [2023-11-28 20:37:12,408 INFO L125 PetriNetUnfolderBase]: For 2435769/2436254 co-relation queries the response was YES. [2023-11-28 20:37:15,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1015214 conditions, 135778 events. 75389/135778 cut-off events. For 2435769/2436254 co-relation queries the response was YES. Maximal size of possible extension queue 3847. Compared 1362372 event pairs, 17212 based on Foata normal form. 285/129621 useless extension candidates. Maximal degree in co-relation 1012562. Up to 47809 conditions per place. [2023-11-28 20:37:16,123 INFO L140 encePairwiseOnDemand]: 82/140 looper letters, 5002 selfloop transitions, 1289 changer transitions 102/6437 dead transitions. [2023-11-28 20:37:16,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 6437 transitions, 148983 flow [2023-11-28 20:37:16,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-11-28 20:37:16,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2023-11-28 20:37:16,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 2842 transitions. [2023-11-28 20:37:16,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4319148936170213 [2023-11-28 20:37:16,129 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 2842 transitions. [2023-11-28 20:37:16,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 2842 transitions. [2023-11-28 20:37:16,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:37:16,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 2842 transitions. [2023-11-28 20:37:16,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 60.46808510638298) internal successors, (2842), 47 states have internal predecessors, (2842), 0 states have call successors, (0), 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-28 20:37:16,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 140.0) internal successors, (6720), 48 states have internal predecessors, (6720), 0 states have call successors, (0), 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-28 20:37:16,144 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 140.0) internal successors, (6720), 48 states have internal predecessors, (6720), 0 states have call successors, (0), 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-28 20:37:16,144 INFO L175 Difference]: Start difference. First operand has 377 places, 4109 transitions, 92560 flow. Second operand 47 states and 2842 transitions. [2023-11-28 20:37:16,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 6437 transitions, 148983 flow [2023-11-28 20:39:15,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 6437 transitions, 147775 flow, removed 596 selfloop flow, removed 8 redundant places. [2023-11-28 20:39:15,756 INFO L231 Difference]: Finished difference. Result has 440 places, 4839 transitions, 114206 flow [2023-11-28 20:39:15,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=91526, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=675, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=114206, PETRI_PLACES=440, PETRI_TRANSITIONS=4839} [2023-11-28 20:39:15,760 INFO L281 CegarLoopForPetriNet]: 140 programPoint places, 300 predicate places. [2023-11-28 20:39:15,760 INFO L495 AbstractCegarLoop]: Abstraction has has 440 places, 4839 transitions, 114206 flow [2023-11-28 20:39:15,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 47.583333333333336) internal successors, (2284), 48 states have internal predecessors, (2284), 0 states have call successors, (0), 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-28 20:39:15,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:39:15,760 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-28 20:39:15,765 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-28 20:39:15,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:39:15,961 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-28 20:39:15,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:15,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1908197607, now seen corresponding path program 3 times [2023-11-28 20:39:15,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:39:15,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794568236] [2023-11-28 20:39:15,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:15,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:39:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:17,348 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-28 20:39:17,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:39:17,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794568236] [2023-11-28 20:39:17,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794568236] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:39:17,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177659861] [2023-11-28 20:39:17,349 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-28 20:39:17,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:39:17,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:39:17,350 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:39:17,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2b3598d-d01b-4b6e-a923-15e3b2c3791a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-28 20:39:17,518 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-28 20:39:17,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:39:17,521 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-28 20:39:17,524 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:39:17,557 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-28 20:39:17,661 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2023-11-28 20:39:17,661 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 23 treesize of output 24 [2023-11-28 20:39:17,723 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-28 20:39:17,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 15 [2023-11-28 20:39:17,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-11-28 20:39:18,360 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-28 20:39:18,361 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 58 [2023-11-28 20:39:18,861 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-11-28 20:39:18,861 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 54 treesize of output 48 [2023-11-28 20:39:18,876 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 23 treesize of output 17 [2023-11-28 20:39:19,014 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 25 treesize of output 13 [2023-11-28 20:39:19,073 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-28 20:39:19,124 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-28 20:39:19,187 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-28 20:39:19,255 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-28 20:39:19,339 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-28 20:39:19,396 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-28 20:39:19,396 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:39:19,414 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1396 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1396) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1396 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1396) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1396 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1396) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1396 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1396) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) is different from false [2023-11-28 20:39:19,435 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1396 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1396) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1396 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1396) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1396 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1396) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1396 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1396) c_threadThread1of2ForFork0_~p~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2023-11-28 20:39:19,451 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1396 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1396) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1396 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1396) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1396 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1396) c_threadThread1of2ForFork0_~p~0.base) .cse2))) (forall ((v_ArrVal_1396 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1396) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false [2023-11-28 20:39:19,605 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:39:19,606 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-28 20:39:19,610 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:39:19,611 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 76 treesize of output 32 [2023-11-28 20:39:19,617 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-28 20:39:19,618 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-28 20:39:19,622 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-28 20:39:19,622 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-28 20:39:19,626 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-28 20:39:19,626 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-28 20:39:19,931 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1389 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1389) |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-28 20:39:20,045 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1389 (Array Int Int)) (v_ArrVal_1388 (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_1388) |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1389) |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-28 20:39:20,187 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 8 treesize of output 4 [2023-11-28 20:39:20,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:39:20,535 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-28 20:39:20,543 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 50 [2023-11-28 20:39:20,548 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 50 treesize of output 46 [2023-11-28 20:39:20,764 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:39:20,765 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 111 treesize of output 152 [2023-11-28 20:39:21,013 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-28 20:39:21,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177659861] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:39:21,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:39:21,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 20] total 60 [2023-11-28 20:39:21,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714386414] [2023-11-28 20:39:21,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:39:21,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2023-11-28 20:39:21,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:39:21,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2023-11-28 20:39:21,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=2837, Unknown=47, NotChecked=560, Total=3660 [2023-11-28 20:39:21,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 140 [2023-11-28 20:39:21,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 4839 transitions, 114206 flow. Second operand has 61 states, 61 states have (on average 41.442622950819676) internal successors, (2528), 61 states have internal predecessors, (2528), 0 states have call successors, (0), 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-28 20:39:21,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:39:21,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 140 [2023-11-28 20:39:21,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:39:38,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-28 20:39:44,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-28 20:39:48,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1]