./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd --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 da100b5cb95d7325be7357bb16aa7526e66fa3d3a90ac0a0850ac9736c0f81ee --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:35:20,004 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:35:20,069 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-13 13:35:20,074 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:35:20,075 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:35:20,104 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:35:20,104 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:35:20,105 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:35:20,105 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:35:20,105 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:35:20,105 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:35:20,105 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:35:20,106 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:35:20,106 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:35:20,106 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 13:35:20,106 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:35:20,106 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:35:20,106 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:35:20,106 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:35:20,106 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 13:35:20,107 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:35:20,107 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 13:35:20,107 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-13 13:35:20,107 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:35:20,107 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 13:35:20,107 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:35:20,107 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 13:35:20,107 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:35:20,107 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:35:20,108 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:35:20,108 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:35:20,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:35:20,108 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:35:20,108 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:35:20,108 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 13:35:20,108 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:35:20,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 13:35:20,108 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:35:20,109 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:35:20,109 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:35:20,109 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:35:20,109 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd 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 -> da100b5cb95d7325be7357bb16aa7526e66fa3d3a90ac0a0850ac9736c0f81ee [2024-11-13 13:35:20,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:35:20,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:35:20,452 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:35:20,460 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:35:20,461 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:35:20,462 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid.i Unable to find full path for "g++" [2024-11-13 13:35:22,639 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:35:23,177 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:35:23,178 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid.i [2024-11-13 13:35:23,203 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/data/b4c3b118f/bcd0c3f1b24e4d01ad0fe86e0610478f/FLAG2e707d23b [2024-11-13 13:35:23,231 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/data/b4c3b118f/bcd0c3f1b24e4d01ad0fe86e0610478f [2024-11-13 13:35:23,236 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:35:23,240 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:35:23,242 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:35:23,242 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:35:23,248 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:35:23,249 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:35:23" (1/1) ... [2024-11-13 13:35:23,251 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c8f816d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:23, skipping insertion in model container [2024-11-13 13:35:23,254 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:35:23" (1/1) ... [2024-11-13 13:35:23,319 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:35:24,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:35:24,159 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:35:24,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:35:24,326 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:35:24,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:24 WrapperNode [2024-11-13 13:35:24,327 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:35:24,329 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:35:24,329 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:35:24,329 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:35:24,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:24" (1/1) ... [2024-11-13 13:35:24,361 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:24" (1/1) ... [2024-11-13 13:35:24,406 INFO L138 Inliner]: procedures = 263, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 82 [2024-11-13 13:35:24,411 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:35:24,411 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:35:24,411 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:35:24,412 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:35:24,419 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:24" (1/1) ... [2024-11-13 13:35:24,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:24" (1/1) ... [2024-11-13 13:35:24,424 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:24" (1/1) ... [2024-11-13 13:35:24,425 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:24" (1/1) ... [2024-11-13 13:35:24,437 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:24" (1/1) ... [2024-11-13 13:35:24,441 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:24" (1/1) ... [2024-11-13 13:35:24,443 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:24" (1/1) ... [2024-11-13 13:35:24,444 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:24" (1/1) ... [2024-11-13 13:35:24,447 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:35:24,448 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:35:24,448 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:35:24,448 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:35:24,449 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:24" (1/1) ... [2024-11-13 13:35:24,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:35:24,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:35:24,497 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:35:24,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:35:24,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-13 13:35:24,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 13:35:24,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 13:35:24,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 13:35:24,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 13:35:24,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-13 13:35:24,539 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-13 13:35:24,540 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-13 13:35:24,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:35:24,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:35:24,542 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 13:35:24,737 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:35:24,740 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:35:25,186 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 13:35:25,187 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:35:25,201 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:35:25,204 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-13 13:35:25,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:35:25 BoogieIcfgContainer [2024-11-13 13:35:25,204 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:35:25,208 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:35:25,208 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:35:25,214 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:35:25,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:35:23" (1/3) ... [2024-11-13 13:35:25,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@702794e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:35:25, skipping insertion in model container [2024-11-13 13:35:25,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:24" (2/3) ... [2024-11-13 13:35:25,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@702794e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:35:25, skipping insertion in model container [2024-11-13 13:35:25,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:35:25" (3/3) ... [2024-11-13 13:35:25,217 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-struct-tid.i [2024-11-13 13:35:25,235 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:35:25,237 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-struct-tid.i that has 2 procedures, 106 locations, 1 initial locations, 2 loop locations, and 6 error locations. [2024-11-13 13:35:25,239 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 13:35:25,356 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-13 13:35:25,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 110 transitions, 227 flow [2024-11-13 13:35:25,550 INFO L124 PetriNetUnfolderBase]: 6/160 cut-off events. [2024-11-13 13:35:25,552 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-13 13:35:25,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 160 events. 6/160 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 223 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 73. Up to 4 conditions per place. [2024-11-13 13:35:25,562 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 110 transitions, 227 flow [2024-11-13 13:35:25,568 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 110 transitions, 227 flow [2024-11-13 13:35:25,577 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:35:25,590 INFO L333 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, 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;@68c1e927, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:35:25,590 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-13 13:35:25,603 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-13 13:35:25,603 INFO L124 PetriNetUnfolderBase]: 3/47 cut-off events. [2024-11-13 13:35:25,604 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 13:35:25,604 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:35:25,604 INFO L204 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] [2024-11-13 13:35:25,605 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-13 13:35:25,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:35:25,610 INFO L85 PathProgramCache]: Analyzing trace with hash 2003961256, now seen corresponding path program 1 times [2024-11-13 13:35:25,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:35:25,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639001369] [2024-11-13 13:35:25,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:35:25,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:35:25,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:26,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:35:26,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:35:26,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639001369] [2024-11-13 13:35:26,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639001369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:35:26,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:35:26,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:35:26,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251413704] [2024-11-13 13:35:26,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:35:26,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:35:26,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:35:26,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:35:26,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:35:26,321 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 110 [2024-11-13 13:35:26,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 110 transitions, 227 flow. Second operand has 5 states, 5 states have (on average 95.4) internal successors, (477), 5 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:35:26,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:35:26,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 110 [2024-11-13 13:35:26,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:35:26,444 INFO L124 PetriNetUnfolderBase]: 1/161 cut-off events. [2024-11-13 13:35:26,444 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-13 13:35:26,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 161 events. 1/161 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 178 event pairs, 0 based on Foata normal form. 2/152 useless extension candidates. Maximal degree in co-relation 39. Up to 16 conditions per place. [2024-11-13 13:35:26,446 INFO L140 encePairwiseOnDemand]: 99/110 looper letters, 11 selfloop transitions, 2 changer transitions 6/112 dead transitions. [2024-11-13 13:35:26,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 112 transitions, 267 flow [2024-11-13 13:35:26,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:35:26,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 13:35:26,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 588 transitions. [2024-11-13 13:35:26,471 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8909090909090909 [2024-11-13 13:35:26,472 INFO L175 Difference]: Start difference. First operand has 109 places, 110 transitions, 227 flow. Second operand 6 states and 588 transitions. [2024-11-13 13:35:26,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 112 transitions, 267 flow [2024-11-13 13:35:26,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 112 transitions, 267 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-13 13:35:26,490 INFO L231 Difference]: Finished difference. Result has 118 places, 106 transitions, 237 flow [2024-11-13 13:35:26,494 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=237, PETRI_PLACES=118, PETRI_TRANSITIONS=106} [2024-11-13 13:35:26,500 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 9 predicate places. [2024-11-13 13:35:26,500 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 106 transitions, 237 flow [2024-11-13 13:35:26,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.4) internal successors, (477), 5 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:35:26,502 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:35:26,502 INFO L204 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] [2024-11-13 13:35:26,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 13:35:26,504 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-13 13:35:26,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:35:26,505 INFO L85 PathProgramCache]: Analyzing trace with hash -606120817, now seen corresponding path program 1 times [2024-11-13 13:35:26,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:35:26,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263600232] [2024-11-13 13:35:26,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:35:26,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:35:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:27,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:35:27,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:35:27,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263600232] [2024-11-13 13:35:27,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263600232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:35:27,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:35:27,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:35:27,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256367032] [2024-11-13 13:35:27,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:35:27,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:35:27,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:35:27,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:35:27,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:35:27,765 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 110 [2024-11-13 13:35:27,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 106 transitions, 237 flow. Second operand has 6 states, 6 states have (on average 72.5) internal successors, (435), 6 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:35:27,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:35:27,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 110 [2024-11-13 13:35:27,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:35:28,076 INFO L124 PetriNetUnfolderBase]: 106/500 cut-off events. [2024-11-13 13:35:28,076 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-11-13 13:35:28,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 816 conditions, 500 events. 106/500 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2454 event pairs, 68 based on Foata normal form. 0/450 useless extension candidates. Maximal degree in co-relation 692. Up to 240 conditions per place. [2024-11-13 13:35:28,083 INFO L140 encePairwiseOnDemand]: 99/110 looper letters, 35 selfloop transitions, 22 changer transitions 0/127 dead transitions. [2024-11-13 13:35:28,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 127 transitions, 393 flow [2024-11-13 13:35:28,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:35:28,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 13:35:28,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 484 transitions. [2024-11-13 13:35:28,087 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2024-11-13 13:35:28,087 INFO L175 Difference]: Start difference. First operand has 118 places, 106 transitions, 237 flow. Second operand 6 states and 484 transitions. [2024-11-13 13:35:28,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 127 transitions, 393 flow [2024-11-13 13:35:28,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 127 transitions, 379 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-13 13:35:28,098 INFO L231 Difference]: Finished difference. Result has 119 places, 127 transitions, 373 flow [2024-11-13 13:35:28,098 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=373, PETRI_PLACES=119, PETRI_TRANSITIONS=127} [2024-11-13 13:35:28,100 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 10 predicate places. [2024-11-13 13:35:28,100 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 127 transitions, 373 flow [2024-11-13 13:35:28,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.5) internal successors, (435), 6 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:35:28,100 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:35:28,100 INFO L204 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] [2024-11-13 13:35:28,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 13:35:28,102 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-13 13:35:28,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:35:28,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1919493879, now seen corresponding path program 1 times [2024-11-13 13:35:28,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:35:28,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012366779] [2024-11-13 13:35:28,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:35:28,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:35:28,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:28,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:35:28,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:35:28,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012366779] [2024-11-13 13:35:28,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012366779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:35:28,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:35:28,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:35:28,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133224608] [2024-11-13 13:35:28,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:35:28,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:35:28,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:35:28,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:35:28,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:35:29,070 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 110 [2024-11-13 13:35:29,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 127 transitions, 373 flow. Second operand has 6 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:35:29,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:35:29,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 110 [2024-11-13 13:35:29,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:35:29,269 INFO L124 PetriNetUnfolderBase]: 125/565 cut-off events. [2024-11-13 13:35:29,270 INFO L125 PetriNetUnfolderBase]: For 108/114 co-relation queries the response was YES. [2024-11-13 13:35:29,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1130 conditions, 565 events. 125/565 cut-off events. For 108/114 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2794 event pairs, 55 based on Foata normal form. 0/513 useless extension candidates. Maximal degree in co-relation 998. Up to 268 conditions per place. [2024-11-13 13:35:29,280 INFO L140 encePairwiseOnDemand]: 99/110 looper letters, 52 selfloop transitions, 22 changer transitions 0/148 dead transitions. [2024-11-13 13:35:29,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 148 transitions, 595 flow [2024-11-13 13:35:29,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:35:29,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 13:35:29,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 494 transitions. [2024-11-13 13:35:29,283 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7484848484848485 [2024-11-13 13:35:29,283 INFO L175 Difference]: Start difference. First operand has 119 places, 127 transitions, 373 flow. Second operand 6 states and 494 transitions. [2024-11-13 13:35:29,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 148 transitions, 595 flow [2024-11-13 13:35:29,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 148 transitions, 595 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-13 13:35:29,294 INFO L231 Difference]: Finished difference. Result has 129 places, 148 transitions, 555 flow [2024-11-13 13:35:29,294 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=555, PETRI_PLACES=129, PETRI_TRANSITIONS=148} [2024-11-13 13:35:29,296 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 20 predicate places. [2024-11-13 13:35:29,297 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 148 transitions, 555 flow [2024-11-13 13:35:29,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:35:29,297 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:35:29,298 INFO L204 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] [2024-11-13 13:35:29,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 13:35:29,298 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-13 13:35:29,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:35:29,300 INFO L85 PathProgramCache]: Analyzing trace with hash -962495764, now seen corresponding path program 1 times [2024-11-13 13:35:29,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:35:29,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274435803] [2024-11-13 13:35:29,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:35:29,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:35:29,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:29,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:35:29,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:35:29,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274435803] [2024-11-13 13:35:29,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274435803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:35:29,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:35:29,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:35:29,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98442309] [2024-11-13 13:35:29,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:35:29,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:35:29,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:35:29,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:35:29,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:35:30,149 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 110 [2024-11-13 13:35:30,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 148 transitions, 555 flow. Second operand has 6 states, 6 states have (on average 78.66666666666667) internal successors, (472), 6 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:35:30,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:35:30,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 110 [2024-11-13 13:35:30,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:35:30,578 INFO L124 PetriNetUnfolderBase]: 283/933 cut-off events. [2024-11-13 13:35:30,579 INFO L125 PetriNetUnfolderBase]: For 443/479 co-relation queries the response was YES. [2024-11-13 13:35:30,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2306 conditions, 933 events. 283/933 cut-off events. For 443/479 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5323 event pairs, 47 based on Foata normal form. 0/871 useless extension candidates. Maximal degree in co-relation 2159. Up to 489 conditions per place. [2024-11-13 13:35:30,588 INFO L140 encePairwiseOnDemand]: 87/110 looper letters, 60 selfloop transitions, 90 changer transitions 7/229 dead transitions. [2024-11-13 13:35:30,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 229 transitions, 1163 flow [2024-11-13 13:35:30,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:35:30,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 13:35:30,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 557 transitions. [2024-11-13 13:35:30,593 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.843939393939394 [2024-11-13 13:35:30,593 INFO L175 Difference]: Start difference. First operand has 129 places, 148 transitions, 555 flow. Second operand 6 states and 557 transitions. [2024-11-13 13:35:30,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 229 transitions, 1163 flow [2024-11-13 13:35:30,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 229 transitions, 1125 flow, removed 19 selfloop flow, removed 0 redundant places. [2024-11-13 13:35:30,612 INFO L231 Difference]: Finished difference. Result has 139 places, 222 transitions, 1239 flow [2024-11-13 13:35:30,614 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1239, PETRI_PLACES=139, PETRI_TRANSITIONS=222} [2024-11-13 13:35:30,615 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 30 predicate places. [2024-11-13 13:35:30,615 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 222 transitions, 1239 flow [2024-11-13 13:35:30,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.66666666666667) internal successors, (472), 6 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:35:30,615 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:35:30,616 INFO L204 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] [2024-11-13 13:35:30,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 13:35:30,617 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-13 13:35:30,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:35:30,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1494973339, now seen corresponding path program 1 times [2024-11-13 13:35:30,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:35:30,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109412018] [2024-11-13 13:35:30,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:35:30,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:35:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:31,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:35:31,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:35:31,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109412018] [2024-11-13 13:35:31,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109412018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:35:31,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:35:31,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:35:31,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147908485] [2024-11-13 13:35:31,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:35:31,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:35:31,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:35:31,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:35:31,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:35:31,507 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 110 [2024-11-13 13:35:31,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 222 transitions, 1239 flow. Second operand has 6 states, 6 states have (on average 77.83333333333333) internal successors, (467), 6 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:35:31,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:35:31,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 110 [2024-11-13 13:35:31,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:35:31,852 INFO L124 PetriNetUnfolderBase]: 282/973 cut-off events. [2024-11-13 13:35:31,853 INFO L125 PetriNetUnfolderBase]: For 1088/1180 co-relation queries the response was YES. [2024-11-13 13:35:31,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3096 conditions, 973 events. 282/973 cut-off events. For 1088/1180 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 6038 event pairs, 18 based on Foata normal form. 0/948 useless extension candidates. Maximal degree in co-relation 2922. Up to 400 conditions per place. [2024-11-13 13:35:31,867 INFO L140 encePairwiseOnDemand]: 94/110 looper letters, 125 selfloop transitions, 36 changer transitions 0/252 dead transitions. [2024-11-13 13:35:31,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 252 transitions, 1770 flow [2024-11-13 13:35:31,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:35:31,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 13:35:31,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 506 transitions. [2024-11-13 13:35:31,870 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7666666666666667 [2024-11-13 13:35:31,870 INFO L175 Difference]: Start difference. First operand has 139 places, 222 transitions, 1239 flow. Second operand 6 states and 506 transitions. [2024-11-13 13:35:31,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 252 transitions, 1770 flow [2024-11-13 13:35:31,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 252 transitions, 1734 flow, removed 18 selfloop flow, removed 0 redundant places. [2024-11-13 13:35:31,897 INFO L231 Difference]: Finished difference. Result has 141 places, 251 transitions, 1589 flow [2024-11-13 13:35:31,897 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=1201, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1589, PETRI_PLACES=141, PETRI_TRANSITIONS=251} [2024-11-13 13:35:31,898 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 32 predicate places. [2024-11-13 13:35:31,899 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 251 transitions, 1589 flow [2024-11-13 13:35:31,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.83333333333333) internal successors, (467), 6 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:35:31,899 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:35:31,899 INFO L204 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] [2024-11-13 13:35:31,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 13:35:31,900 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-13 13:35:31,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:35:31,901 INFO L85 PathProgramCache]: Analyzing trace with hash -347752339, now seen corresponding path program 1 times [2024-11-13 13:35:31,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:35:31,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008064797] [2024-11-13 13:35:31,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:35:31,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:35:31,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:32,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:35:32,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:35:32,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008064797] [2024-11-13 13:35:32,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008064797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:35:32,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:35:32,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:35:32,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704884703] [2024-11-13 13:35:32,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:35:32,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:35:32,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:35:32,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:35:32,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:35:32,635 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 110 [2024-11-13 13:35:32,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 251 transitions, 1589 flow. Second operand has 6 states, 6 states have (on average 85.66666666666667) internal successors, (514), 6 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:35:32,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:35:32,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 110 [2024-11-13 13:35:32,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:35:33,011 INFO L124 PetriNetUnfolderBase]: 324/1067 cut-off events. [2024-11-13 13:35:33,012 INFO L125 PetriNetUnfolderBase]: For 1949/2043 co-relation queries the response was YES. [2024-11-13 13:35:33,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3802 conditions, 1067 events. 324/1067 cut-off events. For 1949/2043 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6703 event pairs, 21 based on Foata normal form. 0/1053 useless extension candidates. Maximal degree in co-relation 3604. Up to 441 conditions per place. [2024-11-13 13:35:33,023 INFO L140 encePairwiseOnDemand]: 99/110 looper letters, 136 selfloop transitions, 37 changer transitions 29/291 dead transitions. [2024-11-13 13:35:33,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 291 transitions, 2350 flow [2024-11-13 13:35:33,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:35:33,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 13:35:33,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 544 transitions. [2024-11-13 13:35:33,025 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8242424242424242 [2024-11-13 13:35:33,026 INFO L175 Difference]: Start difference. First operand has 141 places, 251 transitions, 1589 flow. Second operand 6 states and 544 transitions. [2024-11-13 13:35:33,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 291 transitions, 2350 flow [2024-11-13 13:35:33,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 291 transitions, 2192 flow, removed 79 selfloop flow, removed 0 redundant places. [2024-11-13 13:35:33,059 INFO L231 Difference]: Finished difference. Result has 151 places, 262 transitions, 1852 flow [2024-11-13 13:35:33,059 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=1495, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1852, PETRI_PLACES=151, PETRI_TRANSITIONS=262} [2024-11-13 13:35:33,060 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 42 predicate places. [2024-11-13 13:35:33,060 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 262 transitions, 1852 flow [2024-11-13 13:35:33,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.66666666666667) internal successors, (514), 6 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:35:33,061 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:35:33,061 INFO L204 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] [2024-11-13 13:35:33,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 13:35:33,062 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-13 13:35:33,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:35:33,062 INFO L85 PathProgramCache]: Analyzing trace with hash 371007830, now seen corresponding path program 1 times [2024-11-13 13:35:33,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:35:33,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292208726] [2024-11-13 13:35:33,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:35:33,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:35:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:33,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:35:33,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:35:33,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292208726] [2024-11-13 13:35:33,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292208726] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:35:33,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309731581] [2024-11-13 13:35:33,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:35:33,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:35:33,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:35:33,956 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:35:33,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 13:35:34,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:34,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-13 13:35:34,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:35:34,176 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 [2024-11-13 13:35:34,210 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:35:34,211 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 [2024-11-13 13:35:34,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 13:35:34,327 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 23 treesize of output 22 [2024-11-13 13:35:34,361 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:35:34,362 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 32 treesize of output 34 [2024-11-13 13:35:34,397 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:35:34,397 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 41 treesize of output 46 [2024-11-13 13:35:34,451 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 45 treesize of output 34 [2024-11-13 13:35:34,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:35:34,470 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:35:34,535 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) (+ 7 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2024-11-13 13:35:34,574 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_298 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4))))))) is different from false [2024-11-13 13:35:34,617 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse1 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_298 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)))) (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2024-11-13 13:35:34,669 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) (.cse2 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse1 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2024-11-13 13:35:34,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:35:34,713 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 37 treesize of output 53 [2024-11-13 13:35:34,732 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:35:34,732 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 86 treesize of output 32 [2024-11-13 13:35:34,756 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 13:35:34,756 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 37 treesize of output 1 [2024-11-13 13:35:34,770 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 13:35:34,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-11-13 13:35:34,781 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 13:35:34,782 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 37 treesize of output 1 [2024-11-13 13:35:34,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:35:34,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309731581] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:35:34,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:35:34,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 19 [2024-11-13 13:35:34,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901025575] [2024-11-13 13:35:34,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:35:34,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-13 13:35:34,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:35:34,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-13 13:35:34,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=202, Unknown=4, NotChecked=124, Total=380 [2024-11-13 13:35:34,942 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 110 [2024-11-13 13:35:34,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 262 transitions, 1852 flow. Second operand has 20 states, 20 states have (on average 50.1) internal successors, (1002), 20 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:35:34,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:35:34,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 110 [2024-11-13 13:35:34,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:35:38,056 INFO L124 PetriNetUnfolderBase]: 543/1476 cut-off events. [2024-11-13 13:35:38,057 INFO L125 PetriNetUnfolderBase]: For 2830/2830 co-relation queries the response was YES. [2024-11-13 13:35:38,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5714 conditions, 1476 events. 543/1476 cut-off events. For 2830/2830 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 9296 event pairs, 41 based on Foata normal form. 23/1494 useless extension candidates. Maximal degree in co-relation 5582. Up to 350 conditions per place. [2024-11-13 13:35:38,069 INFO L140 encePairwiseOnDemand]: 85/110 looper letters, 290 selfloop transitions, 166 changer transitions 8/501 dead transitions. [2024-11-13 13:35:38,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 501 transitions, 4196 flow [2024-11-13 13:35:38,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-13 13:35:38,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2024-11-13 13:35:38,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 2012 transitions. [2024-11-13 13:35:38,077 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5080808080808081 [2024-11-13 13:35:38,077 INFO L175 Difference]: Start difference. First operand has 151 places, 262 transitions, 1852 flow. Second operand 36 states and 2012 transitions. [2024-11-13 13:35:38,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 501 transitions, 4196 flow [2024-11-13 13:35:38,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 501 transitions, 4112 flow, removed 42 selfloop flow, removed 0 redundant places. [2024-11-13 13:35:38,120 INFO L231 Difference]: Finished difference. Result has 183 places, 330 transitions, 2820 flow [2024-11-13 13:35:38,121 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=1768, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=2820, PETRI_PLACES=183, PETRI_TRANSITIONS=330} [2024-11-13 13:35:38,122 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 74 predicate places. [2024-11-13 13:35:38,123 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 330 transitions, 2820 flow [2024-11-13 13:35:38,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 50.1) internal successors, (1002), 20 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:35:38,125 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:35:38,125 INFO L204 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] [2024-11-13 13:35:38,146 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 13:35:38,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:35:38,329 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-13 13:35:38,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:35:38,330 INFO L85 PathProgramCache]: Analyzing trace with hash 68334222, now seen corresponding path program 1 times [2024-11-13 13:35:38,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:35:38,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929904057] [2024-11-13 13:35:38,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:35:38,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:35:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:39,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:35:39,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:35:39,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929904057] [2024-11-13 13:35:39,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929904057] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:35:39,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959986486] [2024-11-13 13:35:39,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:35:39,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:35:39,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:35:39,195 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:35:39,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 13:35:39,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:39,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-13 13:35:39,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:35:39,350 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 [2024-11-13 13:35:39,399 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:35:39,400 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 [2024-11-13 13:35:39,516 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 [2024-11-13 13:35:39,566 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 [2024-11-13 13:35:39,625 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:35:39,626 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 [2024-11-13 13:35:39,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:35:39,698 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 [2024-11-13 13:35:39,781 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 [2024-11-13 13:35:39,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:35:39,838 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:35:39,874 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_403 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_403) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_403 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_403) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_403 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_403) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_403 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_403) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)))) is different from false [2024-11-13 13:35:39,913 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_403 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_403) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_403 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_403) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_403 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_403) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) 0)) (forall ((v_ArrVal_403 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_403) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)))))) is different from false [2024-11-13 13:35:39,943 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) .cse3 0)))) (and (forall ((v_ArrVal_403 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_403) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_403 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_403) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_403 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_403) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_403 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_403) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false [2024-11-13 13:35:43,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:35:43,640 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 51 treesize of output 67 [2024-11-13 13:35:43,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:35:43,650 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 83 treesize of output 39 [2024-11-13 13:35:43,656 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 10 treesize of output 3 [2024-11-13 13:35:43,667 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:35:43,667 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 51 treesize of output 1 [2024-11-13 13:35:43,676 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:35:43,676 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 51 treesize of output 1 [2024-11-13 13:35:43,685 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:35:43,686 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 50 treesize of output 1 [2024-11-13 13:35:43,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:35:43,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959986486] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:35:43,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:35:43,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 25 [2024-11-13 13:35:43,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324833343] [2024-11-13 13:35:43,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:35:43,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-13 13:35:43,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:35:43,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-13 13:35:43,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=401, Unknown=19, NotChecked=132, Total=650 [2024-11-13 13:35:44,142 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 110 [2024-11-13 13:35:44,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 330 transitions, 2820 flow. Second operand has 26 states, 26 states have (on average 46.03846153846154) internal successors, (1197), 26 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:35:44,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:35:44,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 110 [2024-11-13 13:35:44,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:35:47,844 INFO L124 PetriNetUnfolderBase]: 738/2074 cut-off events. [2024-11-13 13:35:47,845 INFO L125 PetriNetUnfolderBase]: For 8047/8055 co-relation queries the response was YES. [2024-11-13 13:35:47,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9760 conditions, 2074 events. 738/2074 cut-off events. For 8047/8055 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 14929 event pairs, 51 based on Foata normal form. 23/2093 useless extension candidates. Maximal degree in co-relation 9606. Up to 566 conditions per place. [2024-11-13 13:35:47,870 INFO L140 encePairwiseOnDemand]: 93/110 looper letters, 455 selfloop transitions, 97 changer transitions 17/612 dead transitions. [2024-11-13 13:35:47,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 612 transitions, 6695 flow [2024-11-13 13:35:47,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-13 13:35:47,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2024-11-13 13:35:47,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1586 transitions. [2024-11-13 13:35:47,878 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46510263929618767 [2024-11-13 13:35:47,879 INFO L175 Difference]: Start difference. First operand has 183 places, 330 transitions, 2820 flow. Second operand 31 states and 1586 transitions. [2024-11-13 13:35:47,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 612 transitions, 6695 flow [2024-11-13 13:35:47,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 612 transitions, 6337 flow, removed 152 selfloop flow, removed 8 redundant places. [2024-11-13 13:35:47,977 INFO L231 Difference]: Finished difference. Result has 215 places, 380 transitions, 3350 flow [2024-11-13 13:35:47,978 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=2661, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=3350, PETRI_PLACES=215, PETRI_TRANSITIONS=380} [2024-11-13 13:35:47,979 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 106 predicate places. [2024-11-13 13:35:47,979 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 380 transitions, 3350 flow [2024-11-13 13:35:47,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 46.03846153846154) internal successors, (1197), 26 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:35:47,982 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:35:47,982 INFO L204 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] [2024-11-13 13:35:48,005 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-13 13:35:48,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:35:48,187 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-13 13:35:48,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:35:48,187 INFO L85 PathProgramCache]: Analyzing trace with hash -109233638, now seen corresponding path program 2 times [2024-11-13 13:35:48,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:35:48,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879155045] [2024-11-13 13:35:48,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:35:48,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:35:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:48,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:35:48,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:35:48,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879155045] [2024-11-13 13:35:48,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879155045] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:35:48,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294854521] [2024-11-13 13:35:48,936 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 13:35:48,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:35:48,936 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:35:48,939 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:35:48,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 13:35:49,133 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 13:35:49,133 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:35:49,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-13 13:35:49,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:35:49,546 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 [2024-11-13 13:35:49,608 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 [2024-11-13 13:35:49,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:35:49,676 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 1 case distinctions, treesize of input 26 treesize of output 28 [2024-11-13 13:35:49,748 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:35:49,749 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 3 case distinctions, treesize of input 33 treesize of output 38 [2024-11-13 13:35:50,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:35:50,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:35:50,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:35:50,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:35:50,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:35:50,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 41 [2024-11-13 13:35:50,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:35:50,085 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:35:50,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294854521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:35:50,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 13:35:50,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [13] total 26 [2024-11-13 13:35:50,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837899164] [2024-11-13 13:35:50,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:35:50,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-13 13:35:50,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:35:50,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-13 13:35:50,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2024-11-13 13:35:51,207 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 110 [2024-11-13 13:35:51,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 380 transitions, 3350 flow. Second operand has 15 states, 15 states have (on average 68.73333333333333) internal successors, (1031), 15 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:35:51,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:35:51,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 110 [2024-11-13 13:35:51,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:35:52,936 INFO L124 PetriNetUnfolderBase]: 822/2592 cut-off events. [2024-11-13 13:35:52,936 INFO L125 PetriNetUnfolderBase]: For 10392/10505 co-relation queries the response was YES. [2024-11-13 13:35:52,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12123 conditions, 2592 events. 822/2592 cut-off events. For 10392/10505 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 21609 event pairs, 21 based on Foata normal form. 19/2598 useless extension candidates. Maximal degree in co-relation 11964. Up to 830 conditions per place. [2024-11-13 13:35:52,968 INFO L140 encePairwiseOnDemand]: 89/110 looper letters, 361 selfloop transitions, 102 changer transitions 0/555 dead transitions. [2024-11-13 13:35:52,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 555 transitions, 6182 flow [2024-11-13 13:35:52,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-13 13:35:52,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-11-13 13:35:52,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1592 transitions. [2024-11-13 13:35:52,976 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6578512396694215 [2024-11-13 13:35:52,976 INFO L175 Difference]: Start difference. First operand has 215 places, 380 transitions, 3350 flow. Second operand 22 states and 1592 transitions. [2024-11-13 13:35:52,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 555 transitions, 6182 flow [2024-11-13 13:35:53,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 555 transitions, 6113 flow, removed 0 selfloop flow, removed 16 redundant places. [2024-11-13 13:35:53,120 INFO L231 Difference]: Finished difference. Result has 227 places, 432 transitions, 4346 flow [2024-11-13 13:35:53,121 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=3281, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=4346, PETRI_PLACES=227, PETRI_TRANSITIONS=432} [2024-11-13 13:35:53,121 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 118 predicate places. [2024-11-13 13:35:53,122 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 432 transitions, 4346 flow [2024-11-13 13:35:53,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 68.73333333333333) internal successors, (1031), 15 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:35:53,122 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:35:53,124 INFO L204 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] [2024-11-13 13:35:53,150 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 13:35:53,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:35:53,326 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-13 13:35:53,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:35:53,326 INFO L85 PathProgramCache]: Analyzing trace with hash -871352016, now seen corresponding path program 3 times [2024-11-13 13:35:53,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:35:53,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028678654] [2024-11-13 13:35:53,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:35:53,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:35:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:54,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:35:54,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:35:54,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028678654] [2024-11-13 13:35:54,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028678654] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:35:54,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847811529] [2024-11-13 13:35:54,007 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 13:35:54,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:35:54,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:35:54,009 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:35:54,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 13:35:54,174 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-13 13:35:54,174 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:35:54,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-13 13:35:54,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:35:54,195 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 [2024-11-13 13:35:54,284 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:35:54,285 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 [2024-11-13 13:35:54,593 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 [2024-11-13 13:35:54,698 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 [2024-11-13 13:35:54,771 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 [2024-11-13 13:35:54,853 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 [2024-11-13 13:35:55,054 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 [2024-11-13 13:35:55,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:35:55,122 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:35:55,405 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) 0)) (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)))))) is different from false [2024-11-13 13:35:55,435 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse3 0)))) (and (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false [2024-11-13 13:35:55,466 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse3)) (.cse4 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse3)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse4 0) .cse2 0)))) (and (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse3)) 0)) (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4) 0)))))) is different from false [2024-11-13 13:35:55,496 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse4)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse4)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse4))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) .cse3 0) .cse1 0)))) (and (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse4)) 0)))))) is different from false [2024-11-13 13:35:55,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:35:55,522 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 50 treesize of output 66 [2024-11-13 13:35:55,529 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:35:55,530 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 81 treesize of output 38 [2024-11-13 13:35:55,535 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 9 treesize of output 3 [2024-11-13 13:35:55,545 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:35:55,545 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 51 treesize of output 1 [2024-11-13 13:35:55,553 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:35:55,554 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 51 treesize of output 1 [2024-11-13 13:35:55,563 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:35:55,563 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 51 treesize of output 1 [2024-11-13 13:35:55,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:35:55,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847811529] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:35:55,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:35:55,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 33 [2024-11-13 13:35:55,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819916025] [2024-11-13 13:35:55,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:35:55,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-13 13:35:55,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:35:55,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-13 13:35:55,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=757, Unknown=19, NotChecked=236, Total=1122 [2024-11-13 13:35:55,714 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 110 [2024-11-13 13:35:55,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 432 transitions, 4346 flow. Second operand has 34 states, 34 states have (on average 46.26470588235294) internal successors, (1573), 34 states have internal predecessors, (1573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:35:55,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:35:55,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 110 [2024-11-13 13:35:55,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:35:59,525 INFO L124 PetriNetUnfolderBase]: 1439/4061 cut-off events. [2024-11-13 13:35:59,525 INFO L125 PetriNetUnfolderBase]: For 18801/18825 co-relation queries the response was YES. [2024-11-13 13:35:59,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20566 conditions, 4061 events. 1439/4061 cut-off events. For 18801/18825 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 35721 event pairs, 149 based on Foata normal form. 30/4081 useless extension candidates. Maximal degree in co-relation 20391. Up to 1243 conditions per place. [2024-11-13 13:35:59,650 INFO L140 encePairwiseOnDemand]: 89/110 looper letters, 677 selfloop transitions, 193 changer transitions 13/926 dead transitions. [2024-11-13 13:35:59,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 926 transitions, 11449 flow [2024-11-13 13:35:59,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-13 13:35:59,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2024-11-13 13:35:59,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 1587 transitions. [2024-11-13 13:35:59,655 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4809090909090909 [2024-11-13 13:35:59,655 INFO L175 Difference]: Start difference. First operand has 227 places, 432 transitions, 4346 flow. Second operand 30 states and 1587 transitions. [2024-11-13 13:35:59,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 926 transitions, 11449 flow [2024-11-13 13:35:59,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 926 transitions, 11378 flow, removed 2 selfloop flow, removed 14 redundant places. [2024-11-13 13:35:59,861 INFO L231 Difference]: Finished difference. Result has 255 places, 540 transitions, 6549 flow [2024-11-13 13:35:59,862 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=4277, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=6549, PETRI_PLACES=255, PETRI_TRANSITIONS=540} [2024-11-13 13:35:59,864 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 146 predicate places. [2024-11-13 13:35:59,864 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 540 transitions, 6549 flow [2024-11-13 13:35:59,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 46.26470588235294) internal successors, (1573), 34 states have internal predecessors, (1573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:35:59,866 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:35:59,866 INFO L204 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] [2024-11-13 13:35:59,888 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 13:36:00,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-13 13:36:00,071 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-13 13:36:00,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:36:00,071 INFO L85 PathProgramCache]: Analyzing trace with hash 370159118, now seen corresponding path program 4 times [2024-11-13 13:36:00,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:36:00,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860141634] [2024-11-13 13:36:00,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:36:00,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:36:00,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:36:00,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:36:00,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:36:00,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860141634] [2024-11-13 13:36:00,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860141634] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:36:00,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544865216] [2024-11-13 13:36:00,712 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 13:36:00,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:36:00,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:36:00,715 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:36:00,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 13:36:01,038 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 13:36:01,038 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:36:01,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-13 13:36:01,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:36:01,333 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 [2024-11-13 13:36:01,373 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 [2024-11-13 13:36:01,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:36:01,425 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 1 case distinctions, treesize of input 26 treesize of output 28 [2024-11-13 13:36:01,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:36:01,552 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 3 case distinctions, treesize of input 33 treesize of output 38 [2024-11-13 13:36:01,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:36:01,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:36:01,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:36:01,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:36:01,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:36:01,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 41 [2024-11-13 13:36:01,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:36:01,928 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:36:01,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544865216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:36:01,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 13:36:01,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [13] total 26 [2024-11-13 13:36:01,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063617998] [2024-11-13 13:36:01,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:36:01,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-13 13:36:01,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:36:01,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-13 13:36:01,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2024-11-13 13:36:02,878 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 110 [2024-11-13 13:36:02,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 540 transitions, 6549 flow. Second operand has 15 states, 15 states have (on average 68.73333333333333) internal successors, (1031), 15 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:36:02,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:36:02,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 110 [2024-11-13 13:36:02,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:36:04,153 INFO L124 PetriNetUnfolderBase]: 1227/3866 cut-off events. [2024-11-13 13:36:04,153 INFO L125 PetriNetUnfolderBase]: For 24834/25235 co-relation queries the response was YES. [2024-11-13 13:36:04,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20058 conditions, 3866 events. 1227/3866 cut-off events. For 24834/25235 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 36333 event pairs, 53 based on Foata normal form. 88/3937 useless extension candidates. Maximal degree in co-relation 19877. Up to 1289 conditions per place. [2024-11-13 13:36:04,185 INFO L140 encePairwiseOnDemand]: 89/110 looper letters, 306 selfloop transitions, 220 changer transitions 0/618 dead transitions. [2024-11-13 13:36:04,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 618 transitions, 8696 flow [2024-11-13 13:36:04,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 13:36:04,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-11-13 13:36:04,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1374 transitions. [2024-11-13 13:36:04,188 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6574162679425838 [2024-11-13 13:36:04,188 INFO L175 Difference]: Start difference. First operand has 255 places, 540 transitions, 6549 flow. Second operand 19 states and 1374 transitions. [2024-11-13 13:36:04,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 618 transitions, 8696 flow [2024-11-13 13:36:04,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 618 transitions, 8370 flow, removed 115 selfloop flow, removed 16 redundant places. [2024-11-13 13:36:04,498 INFO L231 Difference]: Finished difference. Result has 261 places, 569 transitions, 7556 flow [2024-11-13 13:36:04,498 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=6283, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=191, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=7556, PETRI_PLACES=261, PETRI_TRANSITIONS=569} [2024-11-13 13:36:04,499 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 152 predicate places. [2024-11-13 13:36:04,499 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 569 transitions, 7556 flow [2024-11-13 13:36:04,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 68.73333333333333) internal successors, (1031), 15 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:36:04,502 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:36:04,502 INFO L204 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] [2024-11-13 13:36:04,529 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 13:36:04,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:36:04,703 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-13 13:36:04,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:36:04,704 INFO L85 PathProgramCache]: Analyzing trace with hash -2141291888, now seen corresponding path program 5 times [2024-11-13 13:36:04,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:36:04,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656422865] [2024-11-13 13:36:04,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:36:04,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:36:04,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:36:05,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:36:05,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:36:05,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656422865] [2024-11-13 13:36:05,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656422865] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:36:05,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388147717] [2024-11-13 13:36:05,404 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-13 13:36:05,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:36:05,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:36:05,407 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:36:05,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 13:36:05,594 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 13:36:05,594 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:36:05,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-13 13:36:05,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:36:05,605 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 [2024-11-13 13:36:05,700 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:36:05,700 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 [2024-11-13 13:36:05,967 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 [2024-11-13 13:36:06,014 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 [2024-11-13 13:36:06,116 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 [2024-11-13 13:36:06,177 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 [2024-11-13 13:36:06,305 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 [2024-11-13 13:36:06,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:36:06,357 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:36:06,557 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) 0)) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)))))) is different from false [2024-11-13 13:36:06,583 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 0) .cse2 0)))) (and (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)))))) is different from false [2024-11-13 13:36:06,616 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) .cse3 0)))) (and (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false [2024-11-13 13:36:06,643 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse3)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse3)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4 0) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse3)) 0)) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4) 0)))))) is different from false [2024-11-13 13:36:06,665 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:36:06,665 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 50 treesize of output 66 [2024-11-13 13:36:06,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:36:06,671 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 81 treesize of output 38 [2024-11-13 13:36:06,674 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 9 treesize of output 3 [2024-11-13 13:36:06,687 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:36:06,687 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 51 treesize of output 1 [2024-11-13 13:36:06,701 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:36:06,701 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 51 treesize of output 1 [2024-11-13 13:36:06,711 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:36:06,711 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 51 treesize of output 1 [2024-11-13 13:36:06,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:36:06,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388147717] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:36:06,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:36:06,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 13] total 32 [2024-11-13 13:36:06,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820919105] [2024-11-13 13:36:06,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:36:06,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-13 13:36:06,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:36:06,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-13 13:36:06,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=712, Unknown=12, NotChecked=228, Total=1056 [2024-11-13 13:36:06,903 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 110 [2024-11-13 13:36:06,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 569 transitions, 7556 flow. Second operand has 33 states, 33 states have (on average 40.57575757575758) internal successors, (1339), 33 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:36:06,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:36:06,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 110 [2024-11-13 13:36:06,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:36:11,360 INFO L124 PetriNetUnfolderBase]: 1937/5507 cut-off events. [2024-11-13 13:36:11,360 INFO L125 PetriNetUnfolderBase]: For 36114/36121 co-relation queries the response was YES. [2024-11-13 13:36:11,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29867 conditions, 5507 events. 1937/5507 cut-off events. For 36114/36121 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 52032 event pairs, 194 based on Foata normal form. 27/5529 useless extension candidates. Maximal degree in co-relation 29674. Up to 1696 conditions per place. [2024-11-13 13:36:11,407 INFO L140 encePairwiseOnDemand]: 87/110 looper letters, 704 selfloop transitions, 274 changer transitions 15/1030 dead transitions. [2024-11-13 13:36:11,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 1030 transitions, 15155 flow [2024-11-13 13:36:11,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-13 13:36:11,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2024-11-13 13:36:11,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 1623 transitions. [2024-11-13 13:36:11,411 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4215584415584416 [2024-11-13 13:36:11,411 INFO L175 Difference]: Start difference. First operand has 261 places, 569 transitions, 7556 flow. Second operand 35 states and 1623 transitions. [2024-11-13 13:36:11,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 1030 transitions, 15155 flow [2024-11-13 13:36:11,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 1030 transitions, 14982 flow, removed 3 selfloop flow, removed 13 redundant places. [2024-11-13 13:36:11,836 INFO L231 Difference]: Finished difference. Result has 293 places, 654 transitions, 9960 flow [2024-11-13 13:36:11,837 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=7410, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=569, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=193, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=9960, PETRI_PLACES=293, PETRI_TRANSITIONS=654} [2024-11-13 13:36:11,838 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 184 predicate places. [2024-11-13 13:36:11,838 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 654 transitions, 9960 flow [2024-11-13 13:36:11,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 40.57575757575758) internal successors, (1339), 33 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:36:11,839 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:36:11,839 INFO L204 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] [2024-11-13 13:36:11,861 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 13:36:12,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:36:12,039 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-13 13:36:12,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:36:12,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1805217866, now seen corresponding path program 6 times [2024-11-13 13:36:12,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:36:12,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861875799] [2024-11-13 13:36:12,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:36:12,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:36:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:36:12,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:36:12,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:36:12,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861875799] [2024-11-13 13:36:12,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861875799] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:36:12,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145836707] [2024-11-13 13:36:12,774 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-13 13:36:12,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:36:12,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:36:12,776 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:36:12,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 13:36:12,979 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-11-13 13:36:12,979 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:36:12,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-13 13:36:12,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:36:12,993 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 [2024-11-13 13:36:13,077 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:36:13,078 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 [2024-11-13 13:36:13,351 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 [2024-11-13 13:36:13,396 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 [2024-11-13 13:36:13,463 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 [2024-11-13 13:36:13,645 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 [2024-11-13 13:36:13,736 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 [2024-11-13 13:36:13,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:36:13,790 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:36:13,939 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) 0)) (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)))))) is different from false [2024-11-13 13:36:14,028 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) 0)) (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)))))) is different from false [2024-11-13 13:36:14,057 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse3 0)))) (and (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)))))) is different from false [2024-11-13 13:36:14,089 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse4)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse4)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse4))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) .cse3 0) .cse1 0)))) (and (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse4)) 0)))))) is different from false [2024-11-13 13:36:14,114 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:36:14,114 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 51 treesize of output 67 [2024-11-13 13:36:14,122 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:36:14,123 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 83 treesize of output 39 [2024-11-13 13:36:14,127 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 10 treesize of output 3 [2024-11-13 13:36:14,137 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:36:14,138 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 51 treesize of output 1 [2024-11-13 13:36:14,145 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:36:14,146 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 50 treesize of output 1 [2024-11-13 13:36:14,153 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:36:14,153 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 51 treesize of output 1 [2024-11-13 13:36:14,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:36:14,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145836707] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:36:14,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:36:14,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 31 [2024-11-13 13:36:14,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484056645] [2024-11-13 13:36:14,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:36:14,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-13 13:36:14,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:36:14,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-13 13:36:14,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=659, Unknown=9, NotChecked=220, Total=992 [2024-11-13 13:36:14,417 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 110 [2024-11-13 13:36:14,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 654 transitions, 9960 flow. Second operand has 32 states, 32 states have (on average 46.28125) internal successors, (1481), 32 states have internal predecessors, (1481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:36:14,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:36:14,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 110 [2024-11-13 13:36:14,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:36:18,723 INFO L124 PetriNetUnfolderBase]: 2104/6051 cut-off events. [2024-11-13 13:36:18,723 INFO L125 PetriNetUnfolderBase]: For 45523/45545 co-relation queries the response was YES. [2024-11-13 13:36:18,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33866 conditions, 6051 events. 2104/6051 cut-off events. For 45523/45545 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 59596 event pairs, 257 based on Foata normal form. 28/6070 useless extension candidates. Maximal degree in co-relation 33662. Up to 1932 conditions per place. [2024-11-13 13:36:18,778 INFO L140 encePairwiseOnDemand]: 89/110 looper letters, 650 selfloop transitions, 318 changer transitions 19/1031 dead transitions. [2024-11-13 13:36:18,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 1031 transitions, 16650 flow [2024-11-13 13:36:18,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-13 13:36:18,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2024-11-13 13:36:18,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 1579 transitions. [2024-11-13 13:36:18,781 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47848484848484846 [2024-11-13 13:36:18,782 INFO L175 Difference]: Start difference. First operand has 293 places, 654 transitions, 9960 flow. Second operand 30 states and 1579 transitions. [2024-11-13 13:36:18,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 1031 transitions, 16650 flow [2024-11-13 13:36:19,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 1031 transitions, 16361 flow, removed 100 selfloop flow, removed 17 redundant places. [2024-11-13 13:36:19,316 INFO L231 Difference]: Finished difference. Result has 314 places, 718 transitions, 12133 flow [2024-11-13 13:36:19,317 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=9671, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=654, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=259, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=12133, PETRI_PLACES=314, PETRI_TRANSITIONS=718} [2024-11-13 13:36:19,318 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 205 predicate places. [2024-11-13 13:36:19,318 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 718 transitions, 12133 flow [2024-11-13 13:36:19,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 46.28125) internal successors, (1481), 32 states have internal predecessors, (1481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:36:19,318 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:36:19,318 INFO L204 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] [2024-11-13 13:36:19,333 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-13 13:36:19,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:36:19,519 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-13 13:36:19,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:36:19,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1480035222, now seen corresponding path program 7 times [2024-11-13 13:36:19,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:36:19,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249494448] [2024-11-13 13:36:19,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:36:19,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:36:19,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:36:20,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:36:20,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:36:20,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249494448] [2024-11-13 13:36:20,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249494448] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:36:20,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836236110] [2024-11-13 13:36:20,107 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-13 13:36:20,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:36:20,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:36:20,109 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:36:20,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 13:36:20,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:36:20,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-13 13:36:20,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:36:20,251 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 [2024-11-13 13:36:20,305 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:36:20,305 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 [2024-11-13 13:36:20,380 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 [2024-11-13 13:36:20,412 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 [2024-11-13 13:36:20,457 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:36:20,457 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 [2024-11-13 13:36:20,619 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:36:20,619 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 [2024-11-13 13:36:20,691 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 [2024-11-13 13:36:20,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:36:20,737 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:36:20,890 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_1033 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)))) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)))))) is different from false [2024-11-13 13:36:20,965 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)))))) is different from false [2024-11-13 13:36:20,989 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) 0)))))) is different from false [2024-11-13 13:36:21,019 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) .cse3 0)))) (and (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false [2024-11-13 13:36:21,166 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4 0) .cse3 0) .cse1 0)))) (and (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4) 0)))))) is different from false [2024-11-13 13:36:21,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:36:21,190 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 51 treesize of output 67 [2024-11-13 13:36:21,198 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:36:21,199 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 83 treesize of output 39 [2024-11-13 13:36:21,205 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 10 treesize of output 3 [2024-11-13 13:36:21,215 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:36:21,216 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 51 treesize of output 1 [2024-11-13 13:36:21,225 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:36:21,225 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 51 treesize of output 1 [2024-11-13 13:36:21,234 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:36:21,235 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 50 treesize of output 1 [2024-11-13 13:36:21,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:36:21,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836236110] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:36:21,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:36:21,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 29 [2024-11-13 13:36:21,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367178152] [2024-11-13 13:36:21,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:36:21,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-13 13:36:21,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:36:21,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-13 13:36:21,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=514, Unknown=13, NotChecked=250, Total=870 [2024-11-13 13:36:21,414 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 110 [2024-11-13 13:36:21,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 718 transitions, 12133 flow. Second operand has 30 states, 30 states have (on average 45.93333333333333) internal successors, (1378), 30 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:36:21,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:36:21,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 110 [2024-11-13 13:36:21,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:36:25,239 INFO L124 PetriNetUnfolderBase]: 2319/6655 cut-off events. [2024-11-13 13:36:25,239 INFO L125 PetriNetUnfolderBase]: For 55313/55336 co-relation queries the response was YES. [2024-11-13 13:36:25,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38289 conditions, 6655 events. 2319/6655 cut-off events. For 55313/55336 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 66965 event pairs, 302 based on Foata normal form. 19/6663 useless extension candidates. Maximal degree in co-relation 38078. Up to 2722 conditions per place. [2024-11-13 13:36:25,317 INFO L140 encePairwiseOnDemand]: 89/110 looper letters, 490 selfloop transitions, 343 changer transitions 10/887 dead transitions. [2024-11-13 13:36:25,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 887 transitions, 16065 flow [2024-11-13 13:36:25,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 13:36:25,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-11-13 13:36:25,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1093 transitions. [2024-11-13 13:36:25,321 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47316017316017317 [2024-11-13 13:36:25,321 INFO L175 Difference]: Start difference. First operand has 314 places, 718 transitions, 12133 flow. Second operand 21 states and 1093 transitions. [2024-11-13 13:36:25,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 887 transitions, 16065 flow [2024-11-13 13:36:25,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 887 transitions, 15565 flow, removed 186 selfloop flow, removed 19 redundant places. [2024-11-13 13:36:25,962 INFO L231 Difference]: Finished difference. Result has 322 places, 758 transitions, 13950 flow [2024-11-13 13:36:25,962 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=11647, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=718, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=303, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=13950, PETRI_PLACES=322, PETRI_TRANSITIONS=758} [2024-11-13 13:36:25,963 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 213 predicate places. [2024-11-13 13:36:25,963 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 758 transitions, 13950 flow [2024-11-13 13:36:25,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 45.93333333333333) internal successors, (1378), 30 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:36:25,964 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:36:25,964 INFO L204 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] [2024-11-13 13:36:25,980 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 13:36:26,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-13 13:36:26,164 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-13 13:36:26,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:36:26,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1428174424, now seen corresponding path program 8 times [2024-11-13 13:36:26,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:36:26,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279610340] [2024-11-13 13:36:26,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:36:26,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:36:26,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:36:26,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:36:26,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:36:26,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279610340] [2024-11-13 13:36:26,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279610340] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:36:26,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743644790] [2024-11-13 13:36:26,781 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 13:36:26,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:36:26,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:36:26,784 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:36:26,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 13:36:26,967 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 13:36:26,967 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:36:26,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-13 13:36:26,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:36:27,082 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 [2024-11-13 13:36:27,160 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:36:27,160 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 [2024-11-13 13:36:27,470 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 [2024-11-13 13:36:27,630 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 [2024-11-13 13:36:27,699 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 [2024-11-13 13:36:27,782 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 [2024-11-13 13:36:27,851 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 [2024-11-13 13:36:27,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:36:27,905 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:36:28,041 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)))))) is different from false [2024-11-13 13:36:28,059 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse3 0)))) (and (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false [2024-11-13 13:36:28,080 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse3)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse3)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4 0) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse3)) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4) 0)))))) is different from false [2024-11-13 13:36:28,161 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse4)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse4)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse4))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) .cse3 0) .cse1 0)))) (and (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2))) (forall ((v_ArrVal_1138 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3))) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse4)) 0)))))) is different from false [2024-11-13 13:36:28,182 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse3)) (.cse4 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse3)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) .cse4 0) .cse1 0)))) (and (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse3)) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= 0 (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4))))))) is different from false [2024-11-13 13:36:28,196 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:36:28,197 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 50 treesize of output 66 [2024-11-13 13:36:28,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:36:28,202 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 81 treesize of output 38 [2024-11-13 13:36:28,206 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 9 treesize of output 3 [2024-11-13 13:36:28,212 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:36:28,212 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 51 treesize of output 1 [2024-11-13 13:36:28,217 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:36:28,218 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 51 treesize of output 1 [2024-11-13 13:36:28,223 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:36:28,223 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 51 treesize of output 1 [2024-11-13 13:36:28,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:36:28,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743644790] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:36:28,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:36:28,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 15] total 42 [2024-11-13 13:36:28,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682812069] [2024-11-13 13:36:28,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:36:28,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-13 13:36:28,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:36:28,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-13 13:36:28,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1257, Unknown=18, NotChecked=380, Total=1806 [2024-11-13 13:36:28,822 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 110 [2024-11-13 13:36:28,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 758 transitions, 13950 flow. Second operand has 43 states, 43 states have (on average 36.674418604651166) internal successors, (1577), 43 states have internal predecessors, (1577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:36:28,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:36:28,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 110 [2024-11-13 13:36:28,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:36:33,694 INFO L124 PetriNetUnfolderBase]: 2560/7377 cut-off events. [2024-11-13 13:36:33,694 INFO L125 PetriNetUnfolderBase]: For 69616/69631 co-relation queries the response was YES. [2024-11-13 13:36:33,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43253 conditions, 7377 events. 2560/7377 cut-off events. For 69616/69631 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 75819 event pairs, 338 based on Foata normal form. 24/7387 useless extension candidates. Maximal degree in co-relation 43028. Up to 2644 conditions per place. [2024-11-13 13:36:33,773 INFO L140 encePairwiseOnDemand]: 84/110 looper letters, 566 selfloop transitions, 350 changer transitions 7/958 dead transitions. [2024-11-13 13:36:33,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 958 transitions, 18775 flow [2024-11-13 13:36:33,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-13 13:36:33,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2024-11-13 13:36:33,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1066 transitions. [2024-11-13 13:36:33,776 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.37272727272727274 [2024-11-13 13:36:33,776 INFO L175 Difference]: Start difference. First operand has 322 places, 758 transitions, 13950 flow. Second operand 26 states and 1066 transitions. [2024-11-13 13:36:33,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 958 transitions, 18775 flow [2024-11-13 13:36:34,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 958 transitions, 18514 flow, removed 54 selfloop flow, removed 14 redundant places. [2024-11-13 13:36:34,500 INFO L231 Difference]: Finished difference. Result has 341 places, 808 transitions, 16223 flow [2024-11-13 13:36:34,501 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=13697, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=758, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=299, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=16223, PETRI_PLACES=341, PETRI_TRANSITIONS=808} [2024-11-13 13:36:34,501 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 232 predicate places. [2024-11-13 13:36:34,502 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 808 transitions, 16223 flow [2024-11-13 13:36:34,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 36.674418604651166) internal successors, (1577), 43 states have internal predecessors, (1577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:36:34,502 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:36:34,503 INFO L204 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] [2024-11-13 13:36:34,528 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 13:36:34,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-13 13:36:34,703 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-13 13:36:34,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:36:34,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1288645168, now seen corresponding path program 9 times [2024-11-13 13:36:34,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:36:34,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901755934] [2024-11-13 13:36:34,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:36:34,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:36:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:36:35,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:36:35,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:36:35,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901755934] [2024-11-13 13:36:35,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901755934] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:36:35,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266714479] [2024-11-13 13:36:35,348 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 13:36:35,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:36:35,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:36:35,352 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:36:35,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 13:36:35,568 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-13 13:36:35,569 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:36:35,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-13 13:36:35,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:36:35,582 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 [2024-11-13 13:36:35,662 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:36:35,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 [2024-11-13 13:36:35,886 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 [2024-11-13 13:36:35,928 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 [2024-11-13 13:36:36,043 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 [2024-11-13 13:36:36,116 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 [2024-11-13 13:36:36,323 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 [2024-11-13 13:36:36,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:36:36,386 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:36:36,420 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)))) is different from false [2024-11-13 13:36:36,593 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) 0)))))) is different from false [2024-11-13 13:36:36,611 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 0) .cse1 0)))) (and (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)))))) is different from false [2024-11-13 13:36:36,630 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) .cse3 0)))) (and (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false [2024-11-13 13:36:36,656 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4 0) .cse3 0) .cse1 0)))) (and (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4) 0)))))) is different from false [2024-11-13 13:36:36,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:36:36,679 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 51 treesize of output 67 [2024-11-13 13:36:36,686 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:36:36,686 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 83 treesize of output 39 [2024-11-13 13:36:36,691 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 10 treesize of output 3 [2024-11-13 13:36:36,699 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:36:36,699 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 51 treesize of output 1 [2024-11-13 13:36:36,708 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:36:36,709 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 51 treesize of output 1 [2024-11-13 13:36:36,719 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:36:36,719 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 50 treesize of output 1 [2024-11-13 13:36:36,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:36:36,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266714479] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:36:36,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:36:36,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 32 [2024-11-13 13:36:36,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374008299] [2024-11-13 13:36:36,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:36:36,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-13 13:36:36,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:36:36,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-13 13:36:36,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=656, Unknown=15, NotChecked=280, Total=1056 [2024-11-13 13:36:36,784 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 110 [2024-11-13 13:36:36,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 808 transitions, 16223 flow. Second operand has 33 states, 33 states have (on average 46.24242424242424) internal successors, (1526), 33 states have internal predecessors, (1526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:36:36,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:36:36,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 110 [2024-11-13 13:36:36,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:36:41,392 INFO L124 PetriNetUnfolderBase]: 2758/7960 cut-off events. [2024-11-13 13:36:41,392 INFO L125 PetriNetUnfolderBase]: For 85438/85459 co-relation queries the response was YES. [2024-11-13 13:36:41,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47864 conditions, 7960 events. 2758/7960 cut-off events. For 85438/85459 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 83296 event pairs, 360 based on Foata normal form. 17/7962 useless extension candidates. Maximal degree in co-relation 47635. Up to 3582 conditions per place. [2024-11-13 13:36:41,505 INFO L140 encePairwiseOnDemand]: 89/110 looper letters, 490 selfloop transitions, 426 changer transitions 7/967 dead transitions. [2024-11-13 13:36:41,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 967 transitions, 20577 flow [2024-11-13 13:36:41,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 13:36:41,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-11-13 13:36:41,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1044 transitions. [2024-11-13 13:36:41,508 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47454545454545455 [2024-11-13 13:36:41,508 INFO L175 Difference]: Start difference. First operand has 341 places, 808 transitions, 16223 flow. Second operand 20 states and 1044 transitions. [2024-11-13 13:36:41,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 967 transitions, 20577 flow [2024-11-13 13:36:42,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 967 transitions, 20228 flow, removed 132 selfloop flow, removed 16 redundant places. [2024-11-13 13:36:42,406 INFO L231 Difference]: Finished difference. Result has 351 places, 854 transitions, 19010 flow [2024-11-13 13:36:42,407 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=15916, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=808, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=387, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=19010, PETRI_PLACES=351, PETRI_TRANSITIONS=854} [2024-11-13 13:36:42,407 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 242 predicate places. [2024-11-13 13:36:42,408 INFO L471 AbstractCegarLoop]: Abstraction has has 351 places, 854 transitions, 19010 flow [2024-11-13 13:36:42,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 46.24242424242424) internal successors, (1526), 33 states have internal predecessors, (1526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:36:42,408 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:36:42,408 INFO L204 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] [2024-11-13 13:36:42,425 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-13 13:36:42,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-13 13:36:42,609 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-13 13:36:42,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:36:42,609 INFO L85 PathProgramCache]: Analyzing trace with hash -437602150, now seen corresponding path program 10 times [2024-11-13 13:36:42,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:36:42,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128125168] [2024-11-13 13:36:42,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:36:42,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:36:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:36:43,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:36:43,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:36:43,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128125168] [2024-11-13 13:36:43,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128125168] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:36:43,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546882554] [2024-11-13 13:36:43,264 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 13:36:43,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:36:43,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:36:43,269 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:36:43,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 13:36:43,585 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 13:36:43,585 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:36:43,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-13 13:36:43,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:36:43,598 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 [2024-11-13 13:36:43,677 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:36:43,677 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 [2024-11-13 13:36:44,025 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 15 treesize of output 11 [2024-11-13 13:36:44,130 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 28 treesize of output 27 [2024-11-13 13:36:44,195 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 40 treesize of output 42 [2024-11-13 13:36:44,396 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 52 treesize of output 57 [2024-11-13 13:36:44,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 60 [2024-11-13 13:36:44,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:36:44,556 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:37:01,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:37:01,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546882554] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:37:01,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:37:01,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 38 [2024-11-13 13:37:01,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164884266] [2024-11-13 13:37:01,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:37:01,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-13 13:37:01,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:37:01,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-13 13:37:01,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1317, Unknown=3, NotChecked=0, Total=1482 [2024-11-13 13:37:05,871 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 [1] [2024-11-13 13:37:07,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 13:37:11,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 13:37:16,428 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 [1] [2024-11-13 13:37:20,655 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 [1] [2024-11-13 13:37:24,729 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 [1] [2024-11-13 13:37:28,781 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 [1] [2024-11-13 13:37:33,570 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 [1] [2024-11-13 13:37:35,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 13:37:39,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 13:37:44,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 13:37:48,180 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 [1] [2024-11-13 13:37:52,925 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 [1] [2024-11-13 13:37:54,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 13:37:58,863 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 [1] [2024-11-13 13:38:03,864 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 [1] [2024-11-13 13:38:08,182 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 [1] [2024-11-13 13:38:12,859 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 [1] [2024-11-13 13:38:18,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 13:38:23,034 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 [1] [2024-11-13 13:38:27,166 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 [1] [2024-11-13 13:38:31,253 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 [1] [2024-11-13 13:38:36,332 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 [1] [2024-11-13 13:38:40,382 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 [1] [2024-11-13 13:38:44,659 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 [1] [2024-11-13 13:38:48,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 13:38:52,169 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 [1] [2024-11-13 13:38:56,564 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 [1] [2024-11-13 13:39:01,187 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 [1] [2024-11-13 13:39:06,314 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 [1] [2024-11-13 13:39:11,201 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 [1] [2024-11-13 13:39:15,465 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 [1] [2024-11-13 13:39:19,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 13:39:23,719 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 [1] [2024-11-13 13:39:28,181 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 [1] [2024-11-13 13:39:29,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 13:39:33,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 13:39:38,231 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 [1] [2024-11-13 13:39:42,757 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 [1] [2024-11-13 13:39:45,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 13:39:49,936 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 [1] [2024-11-13 13:39:54,409 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 [1] [2024-11-13 13:39:54,410 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 110 [2024-11-13 13:39:54,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 854 transitions, 19010 flow. Second operand has 39 states, 39 states have (on average 46.48717948717949) internal successors, (1813), 39 states have internal predecessors, (1813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:39:54,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:39:54,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 110 [2024-11-13 13:39:54,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:40:07,400 INFO L124 PetriNetUnfolderBase]: 2888/8352 cut-off events. [2024-11-13 13:40:07,400 INFO L125 PetriNetUnfolderBase]: For 105791/105813 co-relation queries the response was YES. [2024-11-13 13:40:07,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51570 conditions, 8352 events. 2888/8352 cut-off events. For 105791/105813 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 88353 event pairs, 372 based on Foata normal form. 23/8359 useless extension candidates. Maximal degree in co-relation 51339. Up to 3605 conditions per place. [2024-11-13 13:40:07,558 INFO L140 encePairwiseOnDemand]: 89/110 looper letters, 518 selfloop transitions, 445 changer transitions 8/1015 dead transitions. [2024-11-13 13:40:07,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 1015 transitions, 23360 flow [2024-11-13 13:40:07,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 13:40:07,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-11-13 13:40:07,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1092 transitions. [2024-11-13 13:40:07,562 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4727272727272727 [2024-11-13 13:40:07,562 INFO L175 Difference]: Start difference. First operand has 351 places, 854 transitions, 19010 flow. Second operand 21 states and 1092 transitions. [2024-11-13 13:40:07,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 1015 transitions, 23360 flow [2024-11-13 13:40:08,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 1015 transitions, 23155 flow, removed 65 selfloop flow, removed 11 redundant places. [2024-11-13 13:40:08,961 INFO L231 Difference]: Finished difference. Result has 368 places, 891 transitions, 21743 flow [2024-11-13 13:40:08,962 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=18815, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=854, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=409, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=21743, PETRI_PLACES=368, PETRI_TRANSITIONS=891} [2024-11-13 13:40:08,962 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 259 predicate places. [2024-11-13 13:40:08,962 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 891 transitions, 21743 flow [2024-11-13 13:40:08,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 46.48717948717949) internal successors, (1813), 39 states have internal predecessors, (1813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:40:08,964 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:40:08,964 INFO L204 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] [2024-11-13 13:40:08,993 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-13 13:40:09,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-13 13:40:09,166 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-13 13:40:09,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:40:09,166 INFO L85 PathProgramCache]: Analyzing trace with hash -283165904, now seen corresponding path program 11 times [2024-11-13 13:40:09,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:40:09,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282958434] [2024-11-13 13:40:09,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:40:09,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:40:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:40:10,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:40:10,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:40:10,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282958434] [2024-11-13 13:40:10,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282958434] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:40:10,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317500350] [2024-11-13 13:40:10,173 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-13 13:40:10,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:40:10,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:40:10,175 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:40:10,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 13:40:10,406 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 13:40:10,407 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:40:10,409 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-13 13:40:10,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:40:10,420 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 [2024-11-13 13:40:10,532 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:40:10,532 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 [2024-11-13 13:40:11,022 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 [2024-11-13 13:40:11,106 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 [2024-11-13 13:40:11,407 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 [2024-11-13 13:40:11,517 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 [2024-11-13 13:40:11,655 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 [2024-11-13 13:40:11,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:40:11,737 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:40:12,128 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 0) .cse2 0)))) (and (forall ((v_ArrVal_1455 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1455) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)))) (forall ((v_ArrVal_1455 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1455) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1455 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1455) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1455 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1455) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)))))) is different from false [2024-11-13 13:40:45,992 INFO L349 Elim1Store]: treesize reduction 152, result has 31.5 percent of original size [2024-11-13 13:40:45,993 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 148 treesize of output 121 [2024-11-13 13:40:46,072 INFO L349 Elim1Store]: treesize reduction 12, result has 76.5 percent of original size [2024-11-13 13:40:46,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 171 treesize of output 161 [2024-11-13 13:40:46,089 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 7 treesize of output 3 [2024-11-13 13:40:46,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:40:46,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317500350] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:40:46,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:40:46,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 36 [2024-11-13 13:40:46,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544157998] [2024-11-13 13:40:46,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:40:46,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-13 13:40:46,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:40:46,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-13 13:40:46,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1057, Unknown=66, NotChecked=68, Total=1332 [2024-11-13 13:40:47,406 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 110 [2024-11-13 13:40:47,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 891 transitions, 21743 flow. Second operand has 37 states, 37 states have (on average 46.16216216216216) internal successors, (1708), 37 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:40:47,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:40:47,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 110 [2024-11-13 13:40:47,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:40:55,078 INFO L124 PetriNetUnfolderBase]: 3039/8784 cut-off events. [2024-11-13 13:40:55,078 INFO L125 PetriNetUnfolderBase]: For 133432/133476 co-relation queries the response was YES. [2024-11-13 13:40:55,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56000 conditions, 8784 events. 3039/8784 cut-off events. For 133432/133476 co-relation queries the response was YES. Maximal size of possible extension queue 613. Compared 93733 event pairs, 386 based on Foata normal form. 29/8797 useless extension candidates. Maximal degree in co-relation 55761. Up to 3371 conditions per place. [2024-11-13 13:40:55,211 INFO L140 encePairwiseOnDemand]: 89/110 looper letters, 598 selfloop transitions, 416 changer transitions 8/1066 dead transitions. [2024-11-13 13:40:55,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 1066 transitions, 26359 flow [2024-11-13 13:40:55,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 13:40:55,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-11-13 13:40:55,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1096 transitions. [2024-11-13 13:40:55,214 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47445887445887447 [2024-11-13 13:40:55,214 INFO L175 Difference]: Start difference. First operand has 368 places, 891 transitions, 21743 flow. Second operand 21 states and 1096 transitions. [2024-11-13 13:40:55,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 1066 transitions, 26359 flow [2024-11-13 13:40:56,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 1066 transitions, 25957 flow, removed 118 selfloop flow, removed 13 redundant places. [2024-11-13 13:40:56,662 INFO L231 Difference]: Finished difference. Result has 380 places, 924 transitions, 23629 flow [2024-11-13 13:40:56,662 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=21355, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=891, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=384, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=476, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=23629, PETRI_PLACES=380, PETRI_TRANSITIONS=924} [2024-11-13 13:40:56,663 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 271 predicate places. [2024-11-13 13:40:56,663 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 924 transitions, 23629 flow [2024-11-13 13:40:56,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 46.16216216216216) internal successors, (1708), 37 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:40:56,663 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:40:56,664 INFO L204 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] [2024-11-13 13:40:56,679 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-13 13:40:56,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-13 13:40:56,864 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-13 13:40:56,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:40:56,865 INFO L85 PathProgramCache]: Analyzing trace with hash 187276502, now seen corresponding path program 12 times [2024-11-13 13:40:56,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:40:56,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863916859] [2024-11-13 13:40:56,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:40:56,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:40:56,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:40:57,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:40:57,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:40:57,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863916859] [2024-11-13 13:40:57,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863916859] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:40:57,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253854921] [2024-11-13 13:40:57,576 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-13 13:40:57,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:40:57,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:40:57,578 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:40:57,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-13 13:40:57,776 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-11-13 13:40:57,777 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:40:57,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-13 13:40:57,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:40:57,786 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 [2024-11-13 13:40:57,900 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:40:57,900 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 [2024-11-13 13:40:58,137 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 [2024-11-13 13:40:58,219 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 [2024-11-13 13:40:58,369 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 [2024-11-13 13:40:58,448 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 [2024-11-13 13:40:58,548 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 [2024-11-13 13:40:58,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:40:58,608 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:40:58,637 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1560 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1560) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_1560 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1560) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_1560 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1560) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_1560 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1560) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)))) is different from false [2024-11-13 13:40:58,675 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_1560 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1560) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) 0)) (forall ((v_ArrVal_1560 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1560) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_1560 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1560) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_1560 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1560) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)))))) is different from false [2024-11-13 13:41:03,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:41:03,521 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 51 treesize of output 67 [2024-11-13 13:41:03,530 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:41:03,530 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 83 treesize of output 39 [2024-11-13 13:41:03,537 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 10 treesize of output 3 [2024-11-13 13:41:03,544 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:41:03,544 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 50 treesize of output 1 [2024-11-13 13:41:03,550 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:41:03,550 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 51 treesize of output 1 [2024-11-13 13:41:03,558 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:41:03,559 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 51 treesize of output 1 [2024-11-13 13:41:03,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:41:03,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253854921] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:41:03,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:41:03,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 32 [2024-11-13 13:41:03,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770787169] [2024-11-13 13:41:03,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:41:03,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-13 13:41:03,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:41:03,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-13 13:41:03,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=786, Unknown=42, NotChecked=118, Total=1056 [2024-11-13 13:41:03,947 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 110 [2024-11-13 13:41:03,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 924 transitions, 23629 flow. Second operand has 33 states, 33 states have (on average 46.24242424242424) internal successors, (1526), 33 states have internal predecessors, (1526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:41:03,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:41:03,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 110 [2024-11-13 13:41:03,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:41:11,620 INFO L124 PetriNetUnfolderBase]: 3142/9101 cut-off events. [2024-11-13 13:41:11,620 INFO L125 PetriNetUnfolderBase]: For 148661/148685 co-relation queries the response was YES. [2024-11-13 13:41:11,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58900 conditions, 9101 events. 3142/9101 cut-off events. For 148661/148685 co-relation queries the response was YES. Maximal size of possible extension queue 644. Compared 98149 event pairs, 396 based on Foata normal form. 25/9110 useless extension candidates. Maximal degree in co-relation 58657. Up to 3821 conditions per place. [2024-11-13 13:41:11,751 INFO L140 encePairwiseOnDemand]: 89/110 looper letters, 565 selfloop transitions, 472 changer transitions 11/1092 dead transitions. [2024-11-13 13:41:11,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 1092 transitions, 28274 flow [2024-11-13 13:41:11,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 13:41:11,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-11-13 13:41:11,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1098 transitions. [2024-11-13 13:41:11,755 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4753246753246753 [2024-11-13 13:41:11,755 INFO L175 Difference]: Start difference. First operand has 380 places, 924 transitions, 23629 flow. Second operand 21 states and 1098 transitions. [2024-11-13 13:41:11,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 1092 transitions, 28274 flow [2024-11-13 13:41:13,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 1092 transitions, 27491 flow, removed 66 selfloop flow, removed 14 redundant places. [2024-11-13 13:41:13,456 INFO L231 Difference]: Finished difference. Result has 392 places, 958 transitions, 25527 flow [2024-11-13 13:41:13,457 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=22878, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=924, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=437, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=25527, PETRI_PLACES=392, PETRI_TRANSITIONS=958} [2024-11-13 13:41:13,457 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 283 predicate places. [2024-11-13 13:41:13,458 INFO L471 AbstractCegarLoop]: Abstraction has has 392 places, 958 transitions, 25527 flow [2024-11-13 13:41:13,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 46.24242424242424) internal successors, (1526), 33 states have internal predecessors, (1526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:41:13,459 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:41:13,459 INFO L204 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] [2024-11-13 13:41:13,480 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-13 13:41:13,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:41:13,663 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-13 13:41:13,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:41:13,663 INFO L85 PathProgramCache]: Analyzing trace with hash -907554446, now seen corresponding path program 13 times [2024-11-13 13:41:13,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:41:13,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448140924] [2024-11-13 13:41:13,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:41:13,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:41:13,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:14,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:41:14,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:41:14,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448140924] [2024-11-13 13:41:14,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448140924] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:41:14,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007340657] [2024-11-13 13:41:14,615 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-13 13:41:14,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:41:14,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:41:14,618 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:41:14,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-13 13:41:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:14,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-13 13:41:14,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:41:14,976 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 [2024-11-13 13:41:15,085 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:41:15,085 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 [2024-11-13 13:41:15,231 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 [2024-11-13 13:41:15,282 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 [2024-11-13 13:41:15,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:41:15,408 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 [2024-11-13 13:41:15,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:41:15,634 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 [2024-11-13 13:41:15,731 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 [2024-11-13 13:41:15,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:41:15,816 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:41:15,960 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_1665 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1665) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) 0)) (forall ((v_ArrVal_1665 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1665) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_1665 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1665) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_1665 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1665) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)))))) is different from false [2024-11-13 13:41:16,218 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 0) .cse2 0)))) (and (forall ((v_ArrVal_1665 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1665) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_1665 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1665) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_1665 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1665) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1665 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1665) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false [2024-11-13 13:41:24,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:41:24,669 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 51 treesize of output 67 [2024-11-13 13:41:24,679 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:41:24,679 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 83 treesize of output 39 [2024-11-13 13:41:24,685 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 10 treesize of output 3 [2024-11-13 13:41:24,697 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:41:24,697 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 51 treesize of output 1 [2024-11-13 13:41:24,705 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:41:24,706 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 51 treesize of output 1 [2024-11-13 13:41:24,714 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:41:24,714 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 50 treesize of output 1 [2024-11-13 13:41:24,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:41:24,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007340657] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:41:24,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:41:24,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 29 [2024-11-13 13:41:24,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931192560] [2024-11-13 13:41:24,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:41:24,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-13 13:41:24,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:41:24,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-13 13:41:24,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=622, Unknown=47, NotChecked=106, Total=870 [2024-11-13 13:41:24,963 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 110 [2024-11-13 13:41:24,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 958 transitions, 25527 flow. Second operand has 30 states, 30 states have (on average 45.93333333333333) internal successors, (1378), 30 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:41:24,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:41:24,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 110 [2024-11-13 13:41:24,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:41:32,972 INFO L124 PetriNetUnfolderBase]: 3245/9401 cut-off events. [2024-11-13 13:41:32,972 INFO L125 PetriNetUnfolderBase]: For 158835/158864 co-relation queries the response was YES. [2024-11-13 13:41:33,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61729 conditions, 9401 events. 3245/9401 cut-off events. For 158835/158864 co-relation queries the response was YES. Maximal size of possible extension queue 676. Compared 102229 event pairs, 421 based on Foata normal form. 25/9412 useless extension candidates. Maximal degree in co-relation 61480. Up to 4230 conditions per place. [2024-11-13 13:41:33,126 INFO L140 encePairwiseOnDemand]: 89/110 looper letters, 546 selfloop transitions, 507 changer transitions 10/1106 dead transitions. [2024-11-13 13:41:33,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 1106 transitions, 29842 flow [2024-11-13 13:41:33,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 13:41:33,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-11-13 13:41:33,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1094 transitions. [2024-11-13 13:41:33,129 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47359307359307357 [2024-11-13 13:41:33,129 INFO L175 Difference]: Start difference. First operand has 392 places, 958 transitions, 25527 flow. Second operand 21 states and 1094 transitions. [2024-11-13 13:41:33,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 1106 transitions, 29842 flow [2024-11-13 13:41:34,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 1106 transitions, 29329 flow, removed 84 selfloop flow, removed 26 redundant places. [2024-11-13 13:41:34,726 INFO L231 Difference]: Finished difference. Result has 388 places, 982 transitions, 27493 flow [2024-11-13 13:41:34,727 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=24982, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=957, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=480, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=451, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=27493, PETRI_PLACES=388, PETRI_TRANSITIONS=982} [2024-11-13 13:41:34,728 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 279 predicate places. [2024-11-13 13:41:34,728 INFO L471 AbstractCegarLoop]: Abstraction has has 388 places, 982 transitions, 27493 flow [2024-11-13 13:41:34,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 45.93333333333333) internal successors, (1378), 30 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:41:34,728 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:41:34,729 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-13 13:41:34,742 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-13 13:41:34,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:41:34,929 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-13 13:41:34,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:41:34,929 INFO L85 PathProgramCache]: Analyzing trace with hash 974547575, now seen corresponding path program 1 times [2024-11-13 13:41:34,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:41:34,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992188264] [2024-11-13 13:41:34,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:41:34,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:41:34,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:35,473 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:41:35,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:41:35,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992188264] [2024-11-13 13:41:35,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992188264] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:41:35,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479461917] [2024-11-13 13:41:35,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:41:35,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:41:35,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:41:35,475 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:41:35,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-13 13:41:35,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:35,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-13 13:41:35,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:41:35,668 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 [2024-11-13 13:41:35,706 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:41:35,707 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 [2024-11-13 13:41:35,860 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 15 treesize of output 11 [2024-11-13 13:41:35,878 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 28 treesize of output 27 [2024-11-13 13:41:35,909 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:41:35,909 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 40 treesize of output 42 [2024-11-13 13:41:35,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:41:35,943 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 52 treesize of output 57 [2024-11-13 13:41:36,004 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 56 treesize of output 45 [2024-11-13 13:41:36,026 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:41:36,026 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:41:36,079 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_1785 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1785) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)))) (forall ((v_ArrVal_1785 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1785) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_ArrVal_1785 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1785) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_ArrVal_1785 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1785) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset|)))))) is different from false [2024-11-13 13:41:36,139 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet8#1|)))) (and (forall ((v_ArrVal_1785 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1785) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1))) (forall ((v_ArrVal_1785 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1785) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)))) (forall ((v_ArrVal_1785 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1785) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset|)))) (forall ((v_ArrVal_1785 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1785) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)))))))) is different from false [2024-11-13 13:41:44,561 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-13 13:41:44,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479461917] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:41:44,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:41:44,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2024-11-13 13:41:44,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403483140] [2024-11-13 13:41:44,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:41:44,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 13:41:44,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:41:44,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 13:41:44,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=220, Unknown=9, NotChecked=62, Total=342 [2024-11-13 13:41:44,695 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 110 [2024-11-13 13:41:44,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 982 transitions, 27493 flow. Second operand has 19 states, 19 states have (on average 44.78947368421053) internal successors, (851), 19 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:41:44,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:41:44,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 110 [2024-11-13 13:41:44,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:41:52,232 INFO L124 PetriNetUnfolderBase]: 3283/9580 cut-off events. [2024-11-13 13:41:52,232 INFO L125 PetriNetUnfolderBase]: For 157852/157869 co-relation queries the response was YES. [2024-11-13 13:41:52,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63480 conditions, 9580 events. 3283/9580 cut-off events. For 157852/157869 co-relation queries the response was YES. Maximal size of possible extension queue 715. Compared 104603 event pairs, 518 based on Foata normal form. 27/9588 useless extension candidates. Maximal degree in co-relation 63240. Up to 6961 conditions per place. [2024-11-13 13:41:52,375 INFO L140 encePairwiseOnDemand]: 93/110 looper letters, 964 selfloop transitions, 113 changer transitions 2/1116 dead transitions. [2024-11-13 13:41:52,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 1116 transitions, 30655 flow [2024-11-13 13:41:52,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-13 13:41:52,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2024-11-13 13:41:52,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 1329 transitions. [2024-11-13 13:41:52,378 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.44747474747474747 [2024-11-13 13:41:52,378 INFO L175 Difference]: Start difference. First operand has 388 places, 982 transitions, 27493 flow. Second operand 27 states and 1329 transitions. [2024-11-13 13:41:52,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 1116 transitions, 30655 flow [2024-11-13 13:41:53,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 1116 transitions, 30249 flow, removed 66 selfloop flow, removed 16 redundant places. [2024-11-13 13:41:53,943 INFO L231 Difference]: Finished difference. Result has 403 places, 1011 transitions, 27605 flow [2024-11-13 13:41:53,944 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=27087, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=982, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=877, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=27605, PETRI_PLACES=403, PETRI_TRANSITIONS=1011} [2024-11-13 13:41:53,944 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 294 predicate places. [2024-11-13 13:41:53,944 INFO L471 AbstractCegarLoop]: Abstraction has has 403 places, 1011 transitions, 27605 flow [2024-11-13 13:41:53,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 44.78947368421053) internal successors, (851), 19 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:41:53,945 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:41:53,945 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-13 13:41:53,963 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-13 13:41:54,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:41:54,145 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-13 13:41:54,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:41:54,146 INFO L85 PathProgramCache]: Analyzing trace with hash 978639607, now seen corresponding path program 2 times [2024-11-13 13:41:54,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:41:54,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573925644] [2024-11-13 13:41:54,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:41:54,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:41:54,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:54,741 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:41:54,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:41:54,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573925644] [2024-11-13 13:41:54,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573925644] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:41:54,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759094943] [2024-11-13 13:41:54,742 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 13:41:54,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:41:54,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:41:54,743 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:41:54,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-13 13:41:54,953 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 13:41:54,953 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:41:54,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-13 13:41:54,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:41:54,963 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 [2024-11-13 13:41:54,996 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:41:54,996 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 [2024-11-13 13:41:55,080 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 15 treesize of output 11 [2024-11-13 13:41:55,092 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 28 treesize of output 27 [2024-11-13 13:41:55,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:41:55,111 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 40 treesize of output 42 [2024-11-13 13:41:55,134 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:41:55,134 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 52 treesize of output 57 [2024-11-13 13:41:55,255 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 56 treesize of output 45 [2024-11-13 13:41:55,269 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:41:55,269 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:41:55,301 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_1905 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1905) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset|)))) (forall ((v_ArrVal_1905 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1905) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)))) (forall ((v_ArrVal_1905 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1905) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)))) (forall ((v_ArrVal_1905 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1905) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)) |c_ULTIMATE.start_main_#t~nondet8#1|)))) is different from false [2024-11-13 13:41:55,383 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_1905 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store |c_#race| c_threadThread1of1ForFork0_~arg.base v_ArrVal_1905) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)))) (forall ((v_ArrVal_1905 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store |c_#race| c_threadThread1of1ForFork0_~arg.base v_ArrVal_1905) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)))) (forall ((v_ArrVal_1905 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~arg.base v_ArrVal_1905) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_ArrVal_1905 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~arg.base v_ArrVal_1905) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet8#1|)))) is different from false [2024-11-13 13:41:55,406 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet8#1|)))) (and (forall ((v_ArrVal_1905 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1905) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)))) (forall ((v_ArrVal_1905 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1905) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_ArrVal_1905 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1905) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)))) (forall ((v_ArrVal_1905 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1905) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet8#1|)))))) is different from false [2024-11-13 13:41:55,432 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) (.cse1 (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet8#1|) .cse1 |c_ULTIMATE.start_main_#t~nondet8#1|)))) (and (forall ((v_ArrVal_1905 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1905) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1))) (forall ((v_ArrVal_1905 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1905) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_ArrVal_1905 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1905) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset|)))) (forall ((v_ArrVal_1905 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1905) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet8#1|)))))) is different from false [2024-11-13 13:41:55,458 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse4 (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) (.cse1 (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) (.cse3 (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4 |c_ULTIMATE.start_main_#t~nondet8#1|) .cse1 |c_ULTIMATE.start_main_#t~nondet8#1|) .cse3 |c_ULTIMATE.start_main_#t~nondet8#1|)))) (and (forall ((v_ArrVal_1905 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1905) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1))) (forall ((v_ArrVal_1905 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1905) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_ArrVal_1905 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1905) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3))) (forall ((v_ArrVal_1905 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1905) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4) |c_ULTIMATE.start_main_#t~nondet8#1|)))))) is different from false [2024-11-13 13:41:55,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:41:55,489 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 50 treesize of output 66 [2024-11-13 13:41:55,499 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:41:55,500 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 113 treesize of output 34 [2024-11-13 13:41:55,513 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:41:55,513 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 51 treesize of output 1 [2024-11-13 13:41:55,520 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:41:55,520 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 51 treesize of output 1 [2024-11-13 13:41:55,528 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:41:55,528 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 51 treesize of output 1 [2024-11-13 13:41:55,807 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-13 13:41:55,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759094943] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:41:55,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:41:55,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2024-11-13 13:41:55,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524100989] [2024-11-13 13:41:55,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:41:55,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-13 13:41:55,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:41:55,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-13 13:41:55,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=202, Unknown=5, NotChecked=160, Total=420 [2024-11-13 13:41:55,809 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 110 [2024-11-13 13:41:55,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 1011 transitions, 27605 flow. Second operand has 21 states, 21 states have (on average 44.666666666666664) internal successors, (938), 21 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:41:55,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:41:55,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 110 [2024-11-13 13:41:55,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:42:02,806 INFO L124 PetriNetUnfolderBase]: 3311/9587 cut-off events. [2024-11-13 13:42:02,806 INFO L125 PetriNetUnfolderBase]: For 158132/158148 co-relation queries the response was YES. [2024-11-13 13:42:02,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63893 conditions, 9587 events. 3311/9587 cut-off events. For 158132/158148 co-relation queries the response was YES. Maximal size of possible extension queue 719. Compared 104401 event pairs, 597 based on Foata normal form. 20/9576 useless extension candidates. Maximal degree in co-relation 63643. Up to 7037 conditions per place. [2024-11-13 13:42:02,950 INFO L140 encePairwiseOnDemand]: 89/110 looper letters, 957 selfloop transitions, 96 changer transitions 1/1091 dead transitions. [2024-11-13 13:42:02,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 1091 transitions, 30339 flow [2024-11-13 13:42:02,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-13 13:42:02,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-11-13 13:42:02,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1139 transitions. [2024-11-13 13:42:02,953 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45019762845849803 [2024-11-13 13:42:02,953 INFO L175 Difference]: Start difference. First operand has 403 places, 1011 transitions, 27605 flow. Second operand 23 states and 1139 transitions. [2024-11-13 13:42:02,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 1091 transitions, 30339 flow [2024-11-13 13:42:04,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 1091 transitions, 30192 flow, removed 4 selfloop flow, removed 17 redundant places. [2024-11-13 13:42:04,652 INFO L231 Difference]: Finished difference. Result has 414 places, 1028 transitions, 27978 flow [2024-11-13 13:42:04,653 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=27462, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1011, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=916, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=27978, PETRI_PLACES=414, PETRI_TRANSITIONS=1028} [2024-11-13 13:42:04,654 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 305 predicate places. [2024-11-13 13:42:04,654 INFO L471 AbstractCegarLoop]: Abstraction has has 414 places, 1028 transitions, 27978 flow [2024-11-13 13:42:04,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 44.666666666666664) internal successors, (938), 21 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:42:04,655 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:42:04,655 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-13 13:42:04,681 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-13 13:42:04,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:42:04,856 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-13 13:42:04,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:42:04,856 INFO L85 PathProgramCache]: Analyzing trace with hash 2007251747, now seen corresponding path program 3 times [2024-11-13 13:42:04,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:42:04,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115713299] [2024-11-13 13:42:04,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:42:04,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:42:04,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:42:05,849 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:42:05,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:42:05,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115713299] [2024-11-13 13:42:05,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115713299] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:42:05,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468937546] [2024-11-13 13:42:05,849 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 13:42:05,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:42:05,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:42:05,853 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:42:05,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-13 13:42:06,288 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-13 13:42:06,289 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:42:06,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-13 13:42:06,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:42:06,306 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 [2024-11-13 13:42:06,501 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:42:06,501 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 [2024-11-13 13:42:07,421 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 [2024-11-13 13:42:07,656 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 [2024-11-13 13:42:07,763 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 [2024-11-13 13:42:07,896 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 [2024-11-13 13:42:08,020 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 [2024-11-13 13:42:08,098 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:42:08,098 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:42:08,131 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_2025 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_2025) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_ArrVal_2025 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_2025) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_ArrVal_2025 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_2025) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)))) (forall ((v_ArrVal_2025 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_2025) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet8#1|)))) is different from false [2024-11-13 13:42:08,170 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet8#1|)))) (and (forall ((v_ArrVal_2025 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_2025) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_ArrVal_2025 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_2025) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_ArrVal_2025 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_2025) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset|)))) (forall ((v_ArrVal_2025 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_2025) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2))))))) is different from false [2024-11-13 13:42:08,196 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) (.cse2 (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet8#1|) .cse2 |c_ULTIMATE.start_main_#t~nondet8#1|)))) (and (forall ((v_ArrVal_2025 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_2025) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1))) (forall ((v_ArrVal_2025 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_2025) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2))) (forall ((v_ArrVal_2025 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_2025) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)))) (forall ((v_ArrVal_2025 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_2025) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet8#1|)))))) is different from false [2024-11-13 13:42:08,222 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse4 (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) (.cse1 (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) (.cse2 (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4 |c_ULTIMATE.start_main_#t~nondet8#1|) .cse1 |c_ULTIMATE.start_main_#t~nondet8#1|) .cse2 |c_ULTIMATE.start_main_#t~nondet8#1|)))) (and (forall ((v_ArrVal_2025 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_2025) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1))) (forall ((v_ArrVal_2025 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_2025) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2))) (forall ((v_ArrVal_2025 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_2025) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_ArrVal_2025 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_2025) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4))))))) is different from false [2024-11-13 13:42:08,307 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) (.cse4 (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) (.cse3 (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet8#1|) .cse4 |c_ULTIMATE.start_main_#t~nondet8#1|) .cse3 |c_ULTIMATE.start_main_#t~nondet8#1|)))) (and (forall ((v_ArrVal_2025 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_2025) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_ArrVal_2025 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_2025) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset|)))) (forall ((v_ArrVal_2025 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_2025) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3))) (forall ((v_ArrVal_2025 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_2025) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4))))))) is different from false [2024-11-13 13:42:08,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:42:08,343 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 51 treesize of output 67 [2024-11-13 13:42:08,351 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:42:08,352 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 115 treesize of output 35 [2024-11-13 13:42:08,366 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:42:08,367 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 50 treesize of output 1 [2024-11-13 13:42:08,375 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:42:08,376 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 51 treesize of output 1 [2024-11-13 13:42:08,386 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:42:08,387 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 51 treesize of output 1 [2024-11-13 13:42:08,507 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-13 13:42:08,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468937546] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:42:08,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:42:08,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 13] total 33 [2024-11-13 13:42:08,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503730111] [2024-11-13 13:42:08,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:42:08,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-13 13:42:08,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:42:08,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-13 13:42:08,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=722, Unknown=5, NotChecked=290, Total=1122 [2024-11-13 13:42:08,778 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 110 [2024-11-13 13:42:08,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 1028 transitions, 27978 flow. Second operand has 34 states, 34 states have (on average 43.73529411764706) internal successors, (1487), 34 states have internal predecessors, (1487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:42:08,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:42:08,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 110 [2024-11-13 13:42:08,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:42:19,896 INFO L124 PetriNetUnfolderBase]: 3803/10790 cut-off events. [2024-11-13 13:42:19,896 INFO L125 PetriNetUnfolderBase]: For 165637/165652 co-relation queries the response was YES. [2024-11-13 13:42:20,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70770 conditions, 10790 events. 3803/10790 cut-off events. For 165637/165652 co-relation queries the response was YES. Maximal size of possible extension queue 750. Compared 117700 event pairs, 548 based on Foata normal form. 35/10799 useless extension candidates. Maximal degree in co-relation 70495. Up to 7028 conditions per place. [2024-11-13 13:42:20,061 INFO L140 encePairwiseOnDemand]: 84/110 looper letters, 1233 selfloop transitions, 204 changer transitions 1/1474 dead transitions. [2024-11-13 13:42:20,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 1474 transitions, 35586 flow [2024-11-13 13:42:20,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-13 13:42:20,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2024-11-13 13:42:20,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 2002 transitions. [2024-11-13 13:42:20,066 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.44390243902439025 [2024-11-13 13:42:20,066 INFO L175 Difference]: Start difference. First operand has 414 places, 1028 transitions, 27978 flow. Second operand 41 states and 2002 transitions. [2024-11-13 13:42:20,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 1474 transitions, 35586 flow [2024-11-13 13:42:21,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 1474 transitions, 35460 flow, removed 4 selfloop flow, removed 16 redundant places. [2024-11-13 13:42:21,981 INFO L231 Difference]: Finished difference. Result has 453 places, 1154 transitions, 30108 flow [2024-11-13 13:42:21,982 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=27882, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1028, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=911, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=30108, PETRI_PLACES=453, PETRI_TRANSITIONS=1154} [2024-11-13 13:42:21,982 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 344 predicate places. [2024-11-13 13:42:21,982 INFO L471 AbstractCegarLoop]: Abstraction has has 453 places, 1154 transitions, 30108 flow [2024-11-13 13:42:21,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 43.73529411764706) internal successors, (1487), 34 states have internal predecessors, (1487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:42:21,983 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:42:21,983 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-13 13:42:22,008 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-13 13:42:22,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-13 13:42:22,188 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-13 13:42:22,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:42:22,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1086200379, now seen corresponding path program 4 times [2024-11-13 13:42:22,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:42:22,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373505458] [2024-11-13 13:42:22,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:42:22,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:42:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:42:22,831 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:42:22,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:42:22,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373505458] [2024-11-13 13:42:22,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373505458] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:42:22,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861400646] [2024-11-13 13:42:22,831 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 13:42:22,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:42:22,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:42:22,833 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:42:22,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-13 13:42:23,198 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 13:42:23,198 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:42:23,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-13 13:42:23,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:42:23,208 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 [2024-11-13 13:42:23,349 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:42:23,349 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 [2024-11-13 13:42:24,075 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 [2024-11-13 13:42:24,175 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 [2024-11-13 13:42:24,296 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 [2024-11-13 13:42:24,590 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 [2024-11-13 13:42:24,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2024-11-13 13:42:24,837 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:42:24,838 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:42:28,631 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:42:28,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861400646] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:42:28,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:42:28,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 16] total 42 [2024-11-13 13:42:28,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773336579] [2024-11-13 13:42:28,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:42:28,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-13 13:42:28,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:42:28,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-13 13:42:28,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1606, Unknown=0, NotChecked=0, Total=1806 [2024-11-13 13:42:50,561 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 110 [2024-11-13 13:42:50,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 1154 transitions, 30108 flow. Second operand has 43 states, 43 states have (on average 61.44186046511628) internal successors, (2642), 43 states have internal predecessors, (2642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:42:50,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:42:50,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 110 [2024-11-13 13:42:50,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:43:02,575 INFO L124 PetriNetUnfolderBase]: 2933/9366 cut-off events. [2024-11-13 13:43:02,576 INFO L125 PetriNetUnfolderBase]: For 173717/174782 co-relation queries the response was YES. [2024-11-13 13:43:02,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63471 conditions, 9366 events. 2933/9366 cut-off events. For 173717/174782 co-relation queries the response was YES. Maximal size of possible extension queue 714. Compared 106592 event pairs, 93 based on Foata normal form. 217/9555 useless extension candidates. Maximal degree in co-relation 63187. Up to 4309 conditions per place. [2024-11-13 13:43:02,753 INFO L140 encePairwiseOnDemand]: 84/110 looper letters, 1070 selfloop transitions, 220 changer transitions 0/1382 dead transitions. [2024-11-13 13:43:02,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 493 places, 1382 transitions, 35658 flow [2024-11-13 13:43:02,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-13 13:43:02,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2024-11-13 13:43:02,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 2653 transitions. [2024-11-13 13:43:02,758 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5882483370288248 [2024-11-13 13:43:02,758 INFO L175 Difference]: Start difference. First operand has 453 places, 1154 transitions, 30108 flow. Second operand 41 states and 2653 transitions. [2024-11-13 13:43:02,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 493 places, 1382 transitions, 35658 flow [2024-11-13 13:43:04,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 474 places, 1382 transitions, 35492 flow, removed 48 selfloop flow, removed 19 redundant places. [2024-11-13 13:43:04,912 INFO L231 Difference]: Finished difference. Result has 484 places, 1201 transitions, 31510 flow [2024-11-13 13:43:04,913 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=29942, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=959, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=31510, PETRI_PLACES=484, PETRI_TRANSITIONS=1201} [2024-11-13 13:43:04,913 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 375 predicate places. [2024-11-13 13:43:04,913 INFO L471 AbstractCegarLoop]: Abstraction has has 484 places, 1201 transitions, 31510 flow [2024-11-13 13:43:04,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 61.44186046511628) internal successors, (2642), 43 states have internal predecessors, (2642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:43:04,914 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:43:04,914 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-13 13:43:04,930 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-13 13:43:05,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-13 13:43:05,115 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-13 13:43:05,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:43:05,116 INFO L85 PathProgramCache]: Analyzing trace with hash 548225015, now seen corresponding path program 5 times [2024-11-13 13:43:05,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:43:05,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914873281] [2024-11-13 13:43:05,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:43:05,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:43:05,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:43:05,806 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:43:05,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:43:05,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914873281] [2024-11-13 13:43:05,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914873281] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:43:05,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148378389] [2024-11-13 13:43:05,807 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-13 13:43:05,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:43:05,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:43:05,809 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:43:05,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-13 13:43:06,143 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 13:43:06,143 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:43:06,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-13 13:43:06,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:43:06,151 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 [2024-11-13 13:43:06,231 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:43:06,231 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 [2024-11-13 13:43:06,353 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 15 treesize of output 11 [2024-11-13 13:43:06,367 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 28 treesize of output 27 [2024-11-13 13:43:06,460 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:43:06,460 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 40 treesize of output 42 [2024-11-13 13:43:06,485 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:43:06,485 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 52 treesize of output 57 [2024-11-13 13:43:06,519 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 56 treesize of output 45 [2024-11-13 13:43:06,537 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:43:06,537 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:43:06,870 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) (.cse3 (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet8#1|) .cse3 |c_ULTIMATE.start_main_#t~nondet8#1|)))) (and (forall ((v_ArrVal_2266 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_2266) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1))) (forall ((v_ArrVal_2266 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_2266) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_ArrVal_2266 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_2266) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_ArrVal_2266 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_2266) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)))))))) is different from false [2024-11-13 13:43:11,170 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) (.cse1 (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) (.cse4 (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet8#1|) .cse1 |c_ULTIMATE.start_main_#t~nondet8#1|) .cse4 |c_ULTIMATE.start_main_#t~nondet8#1|)))) (and (forall ((v_ArrVal_2266 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_2266) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1))) (forall ((v_ArrVal_2266 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_2266) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_ArrVal_2266 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_2266) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_ArrVal_2266 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_2266) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4))))))) is different from false [2024-11-13 13:43:11,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:43:11,202 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 50 treesize of output 66 [2024-11-13 13:43:11,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:43:11,210 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 113 treesize of output 34 [2024-11-13 13:43:11,221 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:43:11,222 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 51 treesize of output 1 [2024-11-13 13:43:11,230 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:43:11,230 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 51 treesize of output 1 [2024-11-13 13:43:11,237 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:43:11,238 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 51 treesize of output 1 [2024-11-13 13:43:11,332 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-13 13:43:11,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148378389] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:43:11,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:43:11,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2024-11-13 13:43:11,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441152943] [2024-11-13 13:43:11,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:43:11,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-13 13:43:11,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:43:11,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-13 13:43:11,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=277, Unknown=21, NotChecked=70, Total=420 [2024-11-13 13:43:11,838 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 110 [2024-11-13 13:43:11,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 1201 transitions, 31510 flow. Second operand has 21 states, 21 states have (on average 44.666666666666664) internal successors, (938), 21 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:43:11,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:43:11,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 110 [2024-11-13 13:43:11,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:43:22,476 INFO L124 PetriNetUnfolderBase]: 3876/11045 cut-off events. [2024-11-13 13:43:22,476 INFO L125 PetriNetUnfolderBase]: For 174390/174408 co-relation queries the response was YES. [2024-11-13 13:43:22,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74471 conditions, 11045 events. 3876/11045 cut-off events. For 174390/174408 co-relation queries the response was YES. Maximal size of possible extension queue 760. Compared 121259 event pairs, 660 based on Foata normal form. 37/11047 useless extension candidates. Maximal degree in co-relation 74169. Up to 7097 conditions per place. [2024-11-13 13:43:22,719 INFO L140 encePairwiseOnDemand]: 89/110 looper letters, 1068 selfloop transitions, 216 changer transitions 1/1323 dead transitions. [2024-11-13 13:43:22,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 507 places, 1323 transitions, 35642 flow [2024-11-13 13:43:22,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-13 13:43:22,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-11-13 13:43:22,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1190 transitions. [2024-11-13 13:43:22,723 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45075757575757575 [2024-11-13 13:43:22,723 INFO L175 Difference]: Start difference. First operand has 484 places, 1201 transitions, 31510 flow. Second operand 24 states and 1190 transitions. [2024-11-13 13:43:22,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 507 places, 1323 transitions, 35642 flow [2024-11-13 13:43:25,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 1323 transitions, 35278 flow, removed 82 selfloop flow, removed 28 redundant places. [2024-11-13 13:43:25,280 INFO L231 Difference]: Finished difference. Result has 484 places, 1243 transitions, 32682 flow [2024-11-13 13:43:25,281 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=31194, PETRI_DIFFERENCE_MINUEND_PLACES=456, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=176, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=989, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=32682, PETRI_PLACES=484, PETRI_TRANSITIONS=1243} [2024-11-13 13:43:25,281 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 375 predicate places. [2024-11-13 13:43:25,282 INFO L471 AbstractCegarLoop]: Abstraction has has 484 places, 1243 transitions, 32682 flow [2024-11-13 13:43:25,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 44.666666666666664) internal successors, (938), 21 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:43:25,282 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:43:25,282 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-13 13:43:25,299 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-13 13:43:25,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-13 13:43:25,483 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-13 13:43:25,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:43:25,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1050144135, now seen corresponding path program 6 times [2024-11-13 13:43:25,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:43:25,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541471743] [2024-11-13 13:43:25,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:43:25,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:43:25,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:43:26,447 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:43:26,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:43:26,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541471743] [2024-11-13 13:43:26,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541471743] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:43:26,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477869768] [2024-11-13 13:43:26,447 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-13 13:43:26,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:43:26,448 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:43:26,451 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:43:26,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-13 13:43:26,776 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-11-13 13:43:26,776 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:43:26,779 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-13 13:43:26,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:43:26,788 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 [2024-11-13 13:43:26,827 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:43:26,827 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 [2024-11-13 13:43:26,938 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 15 treesize of output 11 [2024-11-13 13:43:26,953 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 28 treesize of output 27 [2024-11-13 13:43:26,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:43:26,975 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 40 treesize of output 42 [2024-11-13 13:43:27,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:43:27,008 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 52 treesize of output 57 [2024-11-13 13:43:27,177 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 56 treesize of output 45 [2024-11-13 13:43:27,193 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:43:27,194 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:43:27,230 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_2386 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_2386) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)))) (forall ((v_ArrVal_2386 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_2386) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset|)))) (forall ((v_ArrVal_2386 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_2386) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_ArrVal_2386 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_2386) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)))))) is different from false [2024-11-13 13:43:27,316 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_2386 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store |c_#race| c_threadThread1of1ForFork0_~arg.base v_ArrVal_2386) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset|)))) (forall ((v_ArrVal_2386 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~arg.base v_ArrVal_2386) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_ArrVal_2386 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store |c_#race| c_threadThread1of1ForFork0_~arg.base v_ArrVal_2386) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)))) (forall ((v_ArrVal_2386 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store |c_#race| c_threadThread1of1ForFork0_~arg.base v_ArrVal_2386) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)))))) is different from false [2024-11-13 13:43:31,468 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet8#1|)))) (and (forall ((v_ArrVal_2386 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_2386) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset|)))) (forall ((v_ArrVal_2386 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_2386) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2))) (forall ((v_ArrVal_2386 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_2386) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_ArrVal_2386 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_2386) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)))))))) is different from false [2024-11-13 13:43:31,506 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) (.cse1 (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet8#1|) .cse1 |c_ULTIMATE.start_main_#t~nondet8#1|)))) (and (forall ((v_ArrVal_2386 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_2386) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1))) (forall ((v_ArrVal_2386 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_2386) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_ArrVal_2386 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_2386) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_ArrVal_2386 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_2386) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet8#1|)))))) is different from false [2024-11-13 13:43:31,536 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) (.cse4 (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) (.cse3 (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet8#1|) .cse4 |c_ULTIMATE.start_main_#t~nondet8#1|) .cse3 |c_ULTIMATE.start_main_#t~nondet8#1|)))) (and (forall ((v_ArrVal_2386 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_2386) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_ArrVal_2386 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_2386) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_ArrVal_2386 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_2386) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_ArrVal_2386 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_2386) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4) |c_ULTIMATE.start_main_#t~nondet8#1|)))))) is different from false [2024-11-13 13:43:31,562 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:43:31,562 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 51 treesize of output 67 [2024-11-13 13:43:31,570 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:43:31,571 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 93 treesize of output 31 [2024-11-13 13:43:31,587 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:43:31,588 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 50 treesize of output 1 [2024-11-13 13:43:31,598 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:43:31,598 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 51 treesize of output 1 [2024-11-13 13:43:31,606 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:43:31,607 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 51 treesize of output 1 [2024-11-13 13:43:31,788 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-13 13:43:31,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477869768] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:43:31,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:43:31,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2024-11-13 13:43:31,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868141507] [2024-11-13 13:43:31,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:43:31,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-13 13:43:31,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:43:31,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-13 13:43:31,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=221, Unknown=14, NotChecked=170, Total=462 [2024-11-13 13:43:31,791 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 110 [2024-11-13 13:43:31,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 1243 transitions, 32682 flow. Second operand has 22 states, 22 states have (on average 44.59090909090909) internal successors, (981), 22 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:43:31,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:43:31,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 110 [2024-11-13 13:43:31,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:43:41,936 INFO L124 PetriNetUnfolderBase]: 3900/11099 cut-off events. [2024-11-13 13:43:41,936 INFO L125 PetriNetUnfolderBase]: For 177678/177699 co-relation queries the response was YES. [2024-11-13 13:43:42,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75715 conditions, 11099 events. 3900/11099 cut-off events. For 177678/177699 co-relation queries the response was YES. Maximal size of possible extension queue 763. Compared 121915 event pairs, 650 based on Foata normal form. 24/11087 useless extension candidates. Maximal degree in co-relation 75409. Up to 7114 conditions per place. [2024-11-13 13:43:42,186 INFO L140 encePairwiseOnDemand]: 89/110 looper letters, 1027 selfloop transitions, 239 changer transitions 0/1304 dead transitions. [2024-11-13 13:43:42,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 502 places, 1304 transitions, 35920 flow [2024-11-13 13:43:42,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 13:43:42,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-11-13 13:43:42,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 943 transitions. [2024-11-13 13:43:42,189 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4511961722488038 [2024-11-13 13:43:42,189 INFO L175 Difference]: Start difference. First operand has 484 places, 1243 transitions, 32682 flow. Second operand 19 states and 943 transitions. [2024-11-13 13:43:42,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 502 places, 1304 transitions, 35920 flow [2024-11-13 13:43:44,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 485 places, 1304 transitions, 35640 flow, removed 64 selfloop flow, removed 17 redundant places. [2024-11-13 13:43:44,784 INFO L231 Difference]: Finished difference. Result has 492 places, 1261 transitions, 33653 flow [2024-11-13 13:43:44,785 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=32406, PETRI_DIFFERENCE_MINUEND_PLACES=467, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=221, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1007, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=33653, PETRI_PLACES=492, PETRI_TRANSITIONS=1261} [2024-11-13 13:43:44,786 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 383 predicate places. [2024-11-13 13:43:44,786 INFO L471 AbstractCegarLoop]: Abstraction has has 492 places, 1261 transitions, 33653 flow [2024-11-13 13:43:44,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 44.59090909090909) internal successors, (981), 22 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:43:44,786 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:43:44,787 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-13 13:43:44,803 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-11-13 13:43:44,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-13 13:43:44,987 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-13 13:43:44,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:43:44,988 INFO L85 PathProgramCache]: Analyzing trace with hash 426105613, now seen corresponding path program 7 times [2024-11-13 13:43:44,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:43:44,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996408456] [2024-11-13 13:43:44,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:43:44,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:43:45,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:43:45,645 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:43:45,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:43:45,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996408456] [2024-11-13 13:43:45,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996408456] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:43:45,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349703815] [2024-11-13 13:43:45,645 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-13 13:43:45,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:43:45,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:43:45,647 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:43:45,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-13 13:43:45,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:43:45,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-13 13:43:45,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:43:45,909 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 [2024-11-13 13:43:45,988 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:43:45,988 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 [2024-11-13 13:43:46,076 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 15 treesize of output 11 [2024-11-13 13:43:46,130 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 28 treesize of output 27 [2024-11-13 13:43:46,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:43:46,148 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 40 treesize of output 42 [2024-11-13 13:43:46,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:43:46,168 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 52 treesize of output 57 [2024-11-13 13:43:46,215 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 56 treesize of output 45 [2024-11-13 13:43:46,231 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:43:46,231 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:43:46,267 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_2506 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_2506) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_ArrVal_2506 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_2506) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)))) (forall ((v_ArrVal_2506 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_2506) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_ArrVal_2506 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_2506) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)))))) is different from false [2024-11-13 13:43:46,833 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) (.cse4 (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) (.cse1 (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet8#1|) .cse4 |c_ULTIMATE.start_main_#t~nondet8#1|) .cse1 |c_ULTIMATE.start_main_#t~nondet8#1|)))) (and (forall ((v_ArrVal_2506 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_2506) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1))) (forall ((v_ArrVal_2506 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_2506) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset|)))) (forall ((v_ArrVal_2506 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_2506) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_ArrVal_2506 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_2506) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4))))))) is different from false [2024-11-13 13:43:46,859 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse4 (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) (.cse2 (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) (.cse1 (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4 |c_ULTIMATE.start_main_#t~nondet8#1|) .cse2 |c_ULTIMATE.start_main_#t~nondet8#1|) .cse1 |c_ULTIMATE.start_main_#t~nondet8#1|)))) (and (forall ((v_ArrVal_2506 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_2506) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_ArrVal_2506 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_2506) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2))) (forall ((v_ArrVal_2506 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_2506) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset|)))) (forall ((v_ArrVal_2506 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_2506) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4))))))) is different from false [2024-11-13 13:43:46,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:43:46,884 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 51 treesize of output 67 [2024-11-13 13:43:46,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:43:46,891 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 93 treesize of output 31 [2024-11-13 13:43:46,903 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:43:46,903 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 50 treesize of output 1 [2024-11-13 13:43:46,910 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:43:46,910 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 51 treesize of output 1 [2024-11-13 13:43:46,917 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:43:46,918 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 51 treesize of output 1 [2024-11-13 13:43:47,014 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:43:47,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349703815] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:43:47,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:43:47,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2024-11-13 13:43:47,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291556867] [2024-11-13 13:43:47,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:43:47,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-13 13:43:47,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:43:47,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-13 13:43:47,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=257, Unknown=37, NotChecked=108, Total=462 [2024-11-13 13:43:47,370 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 110 [2024-11-13 13:43:47,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 492 places, 1261 transitions, 33653 flow. Second operand has 22 states, 22 states have (on average 44.59090909090909) internal successors, (981), 22 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:43:47,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:43:47,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 110 [2024-11-13 13:43:47,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:43:57,539 INFO L124 PetriNetUnfolderBase]: 3954/11236 cut-off events. [2024-11-13 13:43:57,540 INFO L125 PetriNetUnfolderBase]: For 184097/184121 co-relation queries the response was YES. [2024-11-13 13:43:57,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77710 conditions, 11236 events. 3954/11236 cut-off events. For 184097/184121 co-relation queries the response was YES. Maximal size of possible extension queue 768. Compared 123623 event pairs, 681 based on Foata normal form. 25/11221 useless extension candidates. Maximal degree in co-relation 77393. Up to 7114 conditions per place. [2024-11-13 13:43:57,746 INFO L140 encePairwiseOnDemand]: 89/110 looper letters, 1082 selfloop transitions, 246 changer transitions 0/1366 dead transitions. [2024-11-13 13:43:57,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 512 places, 1366 transitions, 37792 flow [2024-11-13 13:43:57,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 13:43:57,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-11-13 13:43:57,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1039 transitions. [2024-11-13 13:43:57,749 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4497835497835498 [2024-11-13 13:43:57,750 INFO L175 Difference]: Start difference. First operand has 492 places, 1261 transitions, 33653 flow. Second operand 21 states and 1039 transitions. [2024-11-13 13:43:57,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 512 places, 1366 transitions, 37792 flow [2024-11-13 13:44:00,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 501 places, 1366 transitions, 37690 flow, removed 6 selfloop flow, removed 11 redundant places. [2024-11-13 13:44:00,650 INFO L231 Difference]: Finished difference. Result has 509 places, 1296 transitions, 35117 flow [2024-11-13 13:44:00,651 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=33551, PETRI_DIFFERENCE_MINUEND_PLACES=481, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=211, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1022, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=35117, PETRI_PLACES=509, PETRI_TRANSITIONS=1296} [2024-11-13 13:44:00,652 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 400 predicate places. [2024-11-13 13:44:00,652 INFO L471 AbstractCegarLoop]: Abstraction has has 509 places, 1296 transitions, 35117 flow [2024-11-13 13:44:00,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 44.59090909090909) internal successors, (981), 22 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:44:00,653 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:44:00,653 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-13 13:44:00,670 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-11-13 13:44:00,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-13 13:44:00,853 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-13 13:44:00,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:44:00,854 INFO L85 PathProgramCache]: Analyzing trace with hash -305441637, now seen corresponding path program 8 times [2024-11-13 13:44:00,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:44:00,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339808869] [2024-11-13 13:44:00,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:44:00,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:44:00,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:44:01,708 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:44:01,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:44:01,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339808869] [2024-11-13 13:44:01,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339808869] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:44:01,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554932409] [2024-11-13 13:44:01,709 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 13:44:01,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:44:01,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:44:01,712 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:44:01,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-13 13:44:02,002 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 13:44:02,002 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:44:02,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-13 13:44:02,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:44:02,013 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 [2024-11-13 13:44:02,088 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:44:02,089 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 [2024-11-13 13:44:02,172 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 15 treesize of output 11 [2024-11-13 13:44:02,187 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 28 treesize of output 27 [2024-11-13 13:44:02,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:44:02,207 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 40 treesize of output 42 [2024-11-13 13:44:02,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:44:02,245 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 52 treesize of output 57 [2024-11-13 13:44:02,378 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 56 treesize of output 45 [2024-11-13 13:44:02,394 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:44:02,394 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:44:02,431 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_2626 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_2626) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_ArrVal_2626 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_2626) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_ArrVal_2626 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_2626) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset|)))) (forall ((v_ArrVal_2626 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_2626) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)))))) is different from false [2024-11-13 13:44:02,745 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet8#1|)))) (and (forall ((v_ArrVal_2626 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_2626) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_ArrVal_2626 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_2626) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_ArrVal_2626 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_2626) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)))) (forall ((v_ArrVal_2626 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_2626) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet8#1|)))))) is different from false [2024-11-13 13:44:11,128 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:44:11,129 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 51 treesize of output 67 [2024-11-13 13:44:11,142 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:44:11,142 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 115 treesize of output 35 [2024-11-13 13:44:11,158 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:44:11,159 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 51 treesize of output 1 [2024-11-13 13:44:11,168 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:44:11,169 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 50 treesize of output 1 [2024-11-13 13:44:11,177 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:44:11,177 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 51 treesize of output 1 [2024-11-13 13:44:11,269 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:44:11,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554932409] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:44:11,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:44:11,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2024-11-13 13:44:11,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876574770] [2024-11-13 13:44:11,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:44:11,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-13 13:44:11,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:44:11,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-13 13:44:11,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=286, Unknown=42, NotChecked=74, Total=462 [2024-11-13 13:44:11,644 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 110 [2024-11-13 13:44:11,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 509 places, 1296 transitions, 35117 flow. Second operand has 22 states, 22 states have (on average 44.59090909090909) internal successors, (981), 22 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:44:11,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:44:11,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 110 [2024-11-13 13:44:11,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:44:22,058 INFO L124 PetriNetUnfolderBase]: 3985/11319 cut-off events. [2024-11-13 13:44:22,058 INFO L125 PetriNetUnfolderBase]: For 191889/191913 co-relation queries the response was YES. [2024-11-13 13:44:22,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79551 conditions, 11319 events. 3985/11319 cut-off events. For 191889/191913 co-relation queries the response was YES. Maximal size of possible extension queue 772. Compared 124715 event pairs, 674 based on Foata normal form. 20/11302 useless extension candidates. Maximal degree in co-relation 79228. Up to 7114 conditions per place. [2024-11-13 13:44:22,333 INFO L140 encePairwiseOnDemand]: 89/110 looper letters, 1050 selfloop transitions, 271 changer transitions 0/1359 dead transitions. [2024-11-13 13:44:22,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 1359 transitions, 38679 flow [2024-11-13 13:44:22,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 13:44:22,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-11-13 13:44:22,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 991 transitions. [2024-11-13 13:44:22,335 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45045454545454544 [2024-11-13 13:44:22,335 INFO L175 Difference]: Start difference. First operand has 509 places, 1296 transitions, 35117 flow. Second operand 20 states and 991 transitions. [2024-11-13 13:44:22,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 528 places, 1359 transitions, 38679 flow [2024-11-13 13:44:25,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 1359 transitions, 38387 flow, removed 101 selfloop flow, removed 11 redundant places. [2024-11-13 13:44:25,235 INFO L231 Difference]: Finished difference. Result has 522 places, 1315 transitions, 36314 flow [2024-11-13 13:44:25,236 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=34859, PETRI_DIFFERENCE_MINUEND_PLACES=498, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=254, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1033, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=36314, PETRI_PLACES=522, PETRI_TRANSITIONS=1315} [2024-11-13 13:44:25,237 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 413 predicate places. [2024-11-13 13:44:25,237 INFO L471 AbstractCegarLoop]: Abstraction has has 522 places, 1315 transitions, 36314 flow [2024-11-13 13:44:25,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 44.59090909090909) internal successors, (981), 22 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:44:25,237 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:44:25,237 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-13 13:44:25,258 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-11-13 13:44:25,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-13 13:44:25,438 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-13 13:44:25,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:44:25,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1263207607, now seen corresponding path program 9 times [2024-11-13 13:44:25,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:44:25,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751874756] [2024-11-13 13:44:25,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:44:25,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:44:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:44:26,200 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:44:26,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:44:26,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751874756] [2024-11-13 13:44:26,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751874756] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:44:26,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059630957] [2024-11-13 13:44:26,200 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 13:44:26,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:44:26,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:44:26,202 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:44:26,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de459584-62da-477f-a662-202c6b43bac5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-13 13:44:26,532 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-13 13:44:26,532 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:44:26,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-13 13:44:26,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:44:26,545 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 [2024-11-13 13:44:26,657 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:44:26,657 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 [2024-11-13 13:44:26,783 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 15 treesize of output 11 [2024-11-13 13:44:26,802 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 28 treesize of output 27 [2024-11-13 13:44:26,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:44:26,865 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 40 treesize of output 42 [2024-11-13 13:44:26,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:44:26,891 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 52 treesize of output 57 [2024-11-13 13:44:26,933 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 56 treesize of output 45 [2024-11-13 13:44:26,949 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:44:26,950 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:44:26,987 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_2747 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_2747) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)))) (forall ((v_ArrVal_2747 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_2747) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_ArrVal_2747 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_2747) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_ArrVal_2747 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_2747) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)))))) is different from false [2024-11-13 13:44:27,167 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) (.cse1 (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet8#1|) .cse1 |c_ULTIMATE.start_main_#t~nondet8#1|)))) (and (forall ((v_ArrVal_2747 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_2747) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_ArrVal_2747 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_2747) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset|)))) (forall ((v_ArrVal_2747 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_2747) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_ArrVal_2747 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_2747) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)))))))) is different from false [2024-11-13 13:44:27,246 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) (.cse2 (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet8#1|) .cse2 |c_ULTIMATE.start_main_#t~nondet8#1|)))) (and (forall ((v_ArrVal_2747 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_2747) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_ArrVal_2747 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_2747) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_ArrVal_2747 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_2747) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_ArrVal_2747 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_2747) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet8#1|)))))) is different from false [2024-11-13 13:44:27,401 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) (.cse3 (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) (.cse4 (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet8#1|) .cse3 |c_ULTIMATE.start_main_#t~nondet8#1|) .cse4 |c_ULTIMATE.start_main_#t~nondet8#1|)))) (and (forall ((v_ArrVal_2747 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_2747) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet8#1|)) (forall ((v_ArrVal_2747 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_2747) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset|)))) (forall ((v_ArrVal_2747 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_2747) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3))) (forall ((v_ArrVal_2747 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet8#1| (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_2747) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4))))))) is different from false [2024-11-13 13:44:31,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:44:31,597 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 50 treesize of output 66 [2024-11-13 13:44:31,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:44:31,605 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 113 treesize of output 34 [2024-11-13 13:44:31,616 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:44:31,617 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 51 treesize of output 1 [2024-11-13 13:44:31,624 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:44:31,624 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 51 treesize of output 1 [2024-11-13 13:44:31,632 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-13 13:44:31,633 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 51 treesize of output 1 [2024-11-13 13:44:31,729 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-13 13:44:31,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059630957] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:44:31,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:44:31,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2024-11-13 13:44:31,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127849247] [2024-11-13 13:44:31,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:44:31,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-13 13:44:31,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:44:31,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-13 13:44:31,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=249, Unknown=21, NotChecked=140, Total=462 [2024-11-13 13:44:32,173 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 110 [2024-11-13 13:44:32,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 522 places, 1315 transitions, 36314 flow. Second operand has 22 states, 22 states have (on average 44.59090909090909) internal successors, (981), 22 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:44:32,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:44:32,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 110 [2024-11-13 13:44:32,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand