./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-deagle/circular_buffer_bad.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_b6f11af7-265e-453c-a8a4-aa6fc3297441/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f11af7-265e-453c-a8a4-aa6fc3297441/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_b6f11af7-265e-453c-a8a4-aa6fc3297441/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f11af7-265e-453c-a8a4-aa6fc3297441/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f11af7-265e-453c-a8a4-aa6fc3297441/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_b6f11af7-265e-453c-a8a4-aa6fc3297441/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 a5ee9b9286f55973fff2cea9c449f3602c5be2a48fed2e7e6cce6beebc18d9bc --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:33:29,029 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:33:29,125 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f11af7-265e-453c-a8a4-aa6fc3297441/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-13 14:33:29,132 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:33:29,132 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:33:29,162 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:33:29,163 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:33:29,163 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:33:29,164 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:33:29,164 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:33:29,164 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:33:29,164 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:33:29,164 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:33:29,165 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:33:29,165 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:33:29,165 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:33:29,165 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:33:29,165 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:33:29,166 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:33:29,166 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:33:29,166 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:33:29,166 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:33:29,167 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-13 14:33:29,167 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:33:29,167 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 14:33:29,167 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:33:29,167 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:33:29,167 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:33:29,168 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:33:29,168 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:33:29,168 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:33:29,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:33:29,169 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:33:29,169 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:33:29,169 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:33:29,169 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:33:29,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:33:29,170 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:33:29,170 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:33:29,170 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:33:29,170 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:33:29,170 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_b6f11af7-265e-453c-a8a4-aa6fc3297441/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 -> a5ee9b9286f55973fff2cea9c449f3602c5be2a48fed2e7e6cce6beebc18d9bc [2024-11-13 14:33:29,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:33:29,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:33:29,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:33:29,619 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:33:29,620 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:33:29,623 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f11af7-265e-453c-a8a4-aa6fc3297441/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i Unable to find full path for "g++" [2024-11-13 14:33:32,138 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:33:32,559 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:33:32,560 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f11af7-265e-453c-a8a4-aa6fc3297441/sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2024-11-13 14:33:32,577 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f11af7-265e-453c-a8a4-aa6fc3297441/bin/uautomizer-verify-qhAvR1uOyd/data/aa2dee41f/b9d8c417bf49445d962457c8c074bf92/FLAG5231354d8 [2024-11-13 14:33:32,595 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f11af7-265e-453c-a8a4-aa6fc3297441/bin/uautomizer-verify-qhAvR1uOyd/data/aa2dee41f/b9d8c417bf49445d962457c8c074bf92 [2024-11-13 14:33:32,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:33:32,601 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:33:32,603 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:33:32,603 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:33:32,609 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:33:32,610 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:33:32" (1/1) ... [2024-11-13 14:33:32,612 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69cea8cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:33:32, skipping insertion in model container [2024-11-13 14:33:32,612 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:33:32" (1/1) ... [2024-11-13 14:33:32,661 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:33:33,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:33:33,299 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:33:33,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:33:33,429 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:33:33,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:33:33 WrapperNode [2024-11-13 14:33:33,430 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:33:33,431 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:33:33,431 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:33:33,431 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:33:33,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:33:33" (1/1) ... [2024-11-13 14:33:33,452 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:33:33" (1/1) ... [2024-11-13 14:33:33,486 INFO L138 Inliner]: procedures = 168, calls = 40, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 232 [2024-11-13 14:33:33,487 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:33:33,487 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:33:33,488 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:33:33,488 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:33:33,497 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:33:33" (1/1) ... [2024-11-13 14:33:33,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:33:33" (1/1) ... [2024-11-13 14:33:33,506 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:33:33" (1/1) ... [2024-11-13 14:33:33,507 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:33:33" (1/1) ... [2024-11-13 14:33:33,528 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:33:33" (1/1) ... [2024-11-13 14:33:33,538 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:33:33" (1/1) ... [2024-11-13 14:33:33,544 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:33:33" (1/1) ... [2024-11-13 14:33:33,547 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:33:33" (1/1) ... [2024-11-13 14:33:33,554 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:33:33,558 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:33:33,558 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:33:33,559 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:33:33,560 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:33:33" (1/1) ... [2024-11-13 14:33:33,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:33:33,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f11af7-265e-453c-a8a4-aa6fc3297441/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:33:33,611 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f11af7-265e-453c-a8a4-aa6fc3297441/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:33:33,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f11af7-265e-453c-a8a4-aa6fc3297441/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:33:33,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 14:33:33,651 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-13 14:33:33,651 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-13 14:33:33,651 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-13 14:33:33,651 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-13 14:33:33,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 14:33:33,652 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-13 14:33:33,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:33:33,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-13 14:33:33,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 14:33:33,652 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-13 14:33:33,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:33:33,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:33:33,657 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 14:33:33,859 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:33:33,861 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:33:34,464 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 14:33:34,465 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:33:34,500 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:33:34,500 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-13 14:33:34,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:33:34 BoogieIcfgContainer [2024-11-13 14:33:34,501 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:33:34,503 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:33:34,503 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:33:34,509 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:33:34,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:33:32" (1/3) ... [2024-11-13 14:33:34,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72c458b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:33:34, skipping insertion in model container [2024-11-13 14:33:34,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:33:33" (2/3) ... [2024-11-13 14:33:34,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72c458b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:33:34, skipping insertion in model container [2024-11-13 14:33:34,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:33:34" (3/3) ... [2024-11-13 14:33:34,516 INFO L112 eAbstractionObserver]: Analyzing ICFG circular_buffer_bad.i [2024-11-13 14:33:34,538 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:33:34,540 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG circular_buffer_bad.i that has 3 procedures, 264 locations, 1 initial locations, 2 loop locations, and 29 error locations. [2024-11-13 14:33:34,541 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 14:33:34,770 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-13 14:33:34,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 270 places, 277 transitions, 568 flow [2024-11-13 14:33:35,071 INFO L124 PetriNetUnfolderBase]: 14/275 cut-off events. [2024-11-13 14:33:35,076 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-13 14:33:35,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284 conditions, 275 events. 14/275 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 645 event pairs, 0 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 190. Up to 2 conditions per place. [2024-11-13 14:33:35,090 INFO L82 GeneralOperation]: Start removeDead. Operand has 270 places, 277 transitions, 568 flow [2024-11-13 14:33:35,100 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 263 places, 270 transitions, 549 flow [2024-11-13 14:33:35,113 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:33:35,133 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;@7fbfa576, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:33:35,133 INFO L334 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2024-11-13 14:33:35,150 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-13 14:33:35,150 INFO L124 PetriNetUnfolderBase]: 0/45 cut-off events. [2024-11-13 14:33:35,150 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 14:33:35,155 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:33:35,155 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] [2024-11-13 14:33:35,156 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-13 14:33:35,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:35,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1921908295, now seen corresponding path program 1 times [2024-11-13 14:33:35,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:35,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953848585] [2024-11-13 14:33:35,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:35,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:35,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:35,512 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 14:33:35,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:35,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953848585] [2024-11-13 14:33:35,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953848585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:33:35,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:33:35,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:33:35,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574056283] [2024-11-13 14:33:35,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:33:35,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:33:35,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:35,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:33:35,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:33:35,626 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 277 [2024-11-13 14:33:35,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 270 transitions, 549 flow. Second operand has 3 states, 3 states have (on average 250.33333333333334) internal successors, (751), 3 states have internal predecessors, (751), 0 states have call successors, (0), 0 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 14:33:35,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:33:35,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 277 [2024-11-13 14:33:35,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:33:35,980 INFO L124 PetriNetUnfolderBase]: 55/645 cut-off events. [2024-11-13 14:33:35,981 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-11-13 14:33:35,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 753 conditions, 645 events. 55/645 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3346 event pairs, 27 based on Foata normal form. 34/565 useless extension candidates. Maximal degree in co-relation 630. Up to 79 conditions per place. [2024-11-13 14:33:35,997 INFO L140 encePairwiseOnDemand]: 268/277 looper letters, 16 selfloop transitions, 2 changer transitions 0/259 dead transitions. [2024-11-13 14:33:35,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 259 transitions, 563 flow [2024-11-13 14:33:36,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:33:36,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:33:36,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 772 transitions. [2024-11-13 14:33:36,030 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9290012033694344 [2024-11-13 14:33:36,036 INFO L175 Difference]: Start difference. First operand has 263 places, 270 transitions, 549 flow. Second operand 3 states and 772 transitions. [2024-11-13 14:33:36,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 259 transitions, 563 flow [2024-11-13 14:33:36,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 259 transitions, 558 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-13 14:33:36,060 INFO L231 Difference]: Finished difference. Result has 257 places, 259 transitions, 526 flow [2024-11-13 14:33:36,065 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=526, PETRI_PLACES=257, PETRI_TRANSITIONS=259} [2024-11-13 14:33:36,072 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, -6 predicate places. [2024-11-13 14:33:36,073 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 259 transitions, 526 flow [2024-11-13 14:33:36,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 250.33333333333334) internal successors, (751), 3 states have internal predecessors, (751), 0 states have call successors, (0), 0 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 14:33:36,075 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:33:36,075 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 14:33:36,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 14:33:36,076 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-13 14:33:36,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:36,078 INFO L85 PathProgramCache]: Analyzing trace with hash 642316086, now seen corresponding path program 1 times [2024-11-13 14:33:36,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:36,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861539563] [2024-11-13 14:33:36,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:36,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:36,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:36,260 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 14:33:36,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:36,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861539563] [2024-11-13 14:33:36,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861539563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:33:36,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:33:36,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:33:36,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273768799] [2024-11-13 14:33:36,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:33:36,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:33:36,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:36,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:33:36,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:33:36,356 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 277 [2024-11-13 14:33:36,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 259 transitions, 526 flow. Second operand has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 0 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 14:33:36,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:33:36,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 277 [2024-11-13 14:33:36,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:33:36,562 INFO L124 PetriNetUnfolderBase]: 59/648 cut-off events. [2024-11-13 14:33:36,563 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-13 14:33:36,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 760 conditions, 648 events. 59/648 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3423 event pairs, 31 based on Foata normal form. 0/537 useless extension candidates. Maximal degree in co-relation 707. Up to 89 conditions per place. [2024-11-13 14:33:36,570 INFO L140 encePairwiseOnDemand]: 274/277 looper letters, 18 selfloop transitions, 2 changer transitions 0/258 dead transitions. [2024-11-13 14:33:36,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 258 transitions, 564 flow [2024-11-13 14:33:36,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:33:36,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:33:36,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 762 transitions. [2024-11-13 14:33:36,577 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9169675090252708 [2024-11-13 14:33:36,577 INFO L175 Difference]: Start difference. First operand has 257 places, 259 transitions, 526 flow. Second operand 3 states and 762 transitions. [2024-11-13 14:33:36,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 258 transitions, 564 flow [2024-11-13 14:33:36,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 258 transitions, 560 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 14:33:36,592 INFO L231 Difference]: Finished difference. Result has 256 places, 258 transitions, 524 flow [2024-11-13 14:33:36,593 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=524, PETRI_PLACES=256, PETRI_TRANSITIONS=258} [2024-11-13 14:33:36,596 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, -7 predicate places. [2024-11-13 14:33:36,596 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 258 transitions, 524 flow [2024-11-13 14:33:36,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 0 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 14:33:36,597 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:33:36,598 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] [2024-11-13 14:33:36,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 14:33:36,598 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-13 14:33:36,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:36,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1209516066, now seen corresponding path program 1 times [2024-11-13 14:33:36,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:36,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79298729] [2024-11-13 14:33:36,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:36,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:36,721 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 14:33:36,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:36,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79298729] [2024-11-13 14:33:36,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79298729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:33:36,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:33:36,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:33:36,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101453675] [2024-11-13 14:33:36,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:33:36,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:33:36,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:36,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:33:36,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:33:36,794 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 277 [2024-11-13 14:33:36,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 258 transitions, 524 flow. Second operand has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 0 states have call successors, (0), 0 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 14:33:36,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:33:36,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 277 [2024-11-13 14:33:36,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:33:37,204 INFO L124 PetriNetUnfolderBase]: 125/1218 cut-off events. [2024-11-13 14:33:37,205 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-11-13 14:33:37,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1431 conditions, 1218 events. 125/1218 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 7634 event pairs, 54 based on Foata normal form. 0/1017 useless extension candidates. Maximal degree in co-relation 1372. Up to 170 conditions per place. [2024-11-13 14:33:37,220 INFO L140 encePairwiseOnDemand]: 266/277 looper letters, 23 selfloop transitions, 5 changer transitions 0/259 dead transitions. [2024-11-13 14:33:37,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 259 transitions, 584 flow [2024-11-13 14:33:37,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:33:37,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:33:37,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 757 transitions. [2024-11-13 14:33:37,226 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.910950661853189 [2024-11-13 14:33:37,227 INFO L175 Difference]: Start difference. First operand has 256 places, 258 transitions, 524 flow. Second operand 3 states and 757 transitions. [2024-11-13 14:33:37,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 259 transitions, 584 flow [2024-11-13 14:33:37,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 259 transitions, 580 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 14:33:37,239 INFO L231 Difference]: Finished difference. Result has 253 places, 256 transitions, 544 flow [2024-11-13 14:33:37,240 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=544, PETRI_PLACES=253, PETRI_TRANSITIONS=256} [2024-11-13 14:33:37,242 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, -10 predicate places. [2024-11-13 14:33:37,242 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 256 transitions, 544 flow [2024-11-13 14:33:37,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 0 states have call successors, (0), 0 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 14:33:37,243 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:33:37,243 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 14:33:37,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 14:33:37,244 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-13 14:33:37,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:37,245 INFO L85 PathProgramCache]: Analyzing trace with hash 151856007, now seen corresponding path program 1 times [2024-11-13 14:33:37,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:37,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611398179] [2024-11-13 14:33:37,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:37,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:37,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:37,373 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 14:33:37,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:37,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611398179] [2024-11-13 14:33:37,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611398179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:33:37,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:33:37,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:33:37,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427806742] [2024-11-13 14:33:37,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:33:37,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:33:37,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:37,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:33:37,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:33:37,422 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 277 [2024-11-13 14:33:37,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 256 transitions, 544 flow. Second operand has 3 states, 3 states have (on average 251.33333333333334) internal successors, (754), 3 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:33:37,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:33:37,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 277 [2024-11-13 14:33:37,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:33:37,717 INFO L124 PetriNetUnfolderBase]: 79/1078 cut-off events. [2024-11-13 14:33:37,717 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-11-13 14:33:37,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1231 conditions, 1078 events. 79/1078 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 6039 event pairs, 24 based on Foata normal form. 0/906 useless extension candidates. Maximal degree in co-relation 1038. Up to 82 conditions per place. [2024-11-13 14:33:37,729 INFO L140 encePairwiseOnDemand]: 274/277 looper letters, 15 selfloop transitions, 2 changer transitions 0/255 dead transitions. [2024-11-13 14:33:37,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 255 transitions, 576 flow [2024-11-13 14:33:37,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:33:37,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:33:37,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 768 transitions. [2024-11-13 14:33:37,737 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.924187725631769 [2024-11-13 14:33:37,737 INFO L175 Difference]: Start difference. First operand has 253 places, 256 transitions, 544 flow. Second operand 3 states and 768 transitions. [2024-11-13 14:33:37,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 255 transitions, 576 flow [2024-11-13 14:33:37,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 255 transitions, 566 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 14:33:37,748 INFO L231 Difference]: Finished difference. Result has 252 places, 255 transitions, 536 flow [2024-11-13 14:33:37,748 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=536, PETRI_PLACES=252, PETRI_TRANSITIONS=255} [2024-11-13 14:33:37,750 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, -11 predicate places. [2024-11-13 14:33:37,750 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 255 transitions, 536 flow [2024-11-13 14:33:37,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 251.33333333333334) internal successors, (754), 3 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:33:37,751 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:33:37,751 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, 1] [2024-11-13 14:33:37,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 14:33:37,752 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-13 14:33:37,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:37,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1624715478, now seen corresponding path program 1 times [2024-11-13 14:33:37,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:37,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982145543] [2024-11-13 14:33:37,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:37,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:37,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:37,894 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 14:33:37,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:37,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982145543] [2024-11-13 14:33:37,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982145543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:33:37,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:33:37,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:33:37,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302445263] [2024-11-13 14:33:37,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:33:37,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:33:37,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:37,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:33:37,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:33:37,959 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 277 [2024-11-13 14:33:37,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 255 transitions, 536 flow. Second operand has 3 states, 3 states have (on average 252.33333333333334) internal successors, (757), 3 states have internal predecessors, (757), 0 states have call successors, (0), 0 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 14:33:37,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:33:37,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 277 [2024-11-13 14:33:37,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:33:38,180 INFO L124 PetriNetUnfolderBase]: 63/839 cut-off events. [2024-11-13 14:33:38,180 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-13 14:33:38,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 954 conditions, 839 events. 63/839 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4004 event pairs, 22 based on Foata normal form. 0/706 useless extension candidates. Maximal degree in co-relation 887. Up to 69 conditions per place. [2024-11-13 14:33:38,188 INFO L140 encePairwiseOnDemand]: 274/277 looper letters, 13 selfloop transitions, 2 changer transitions 0/254 dead transitions. [2024-11-13 14:33:38,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 254 transitions, 564 flow [2024-11-13 14:33:38,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:33:38,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:33:38,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 769 transitions. [2024-11-13 14:33:38,192 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9253910950661853 [2024-11-13 14:33:38,192 INFO L175 Difference]: Start difference. First operand has 252 places, 255 transitions, 536 flow. Second operand 3 states and 769 transitions. [2024-11-13 14:33:38,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 254 transitions, 564 flow [2024-11-13 14:33:38,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 254 transitions, 560 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 14:33:38,202 INFO L231 Difference]: Finished difference. Result has 251 places, 254 transitions, 534 flow [2024-11-13 14:33:38,202 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=534, PETRI_PLACES=251, PETRI_TRANSITIONS=254} [2024-11-13 14:33:38,204 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, -12 predicate places. [2024-11-13 14:33:38,204 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 254 transitions, 534 flow [2024-11-13 14:33:38,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 252.33333333333334) internal successors, (757), 3 states have internal predecessors, (757), 0 states have call successors, (0), 0 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 14:33:38,205 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:33:38,205 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, 1, 1, 1, 1, 1, 1] [2024-11-13 14:33:38,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 14:33:38,207 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-13 14:33:38,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:38,208 INFO L85 PathProgramCache]: Analyzing trace with hash 936035422, now seen corresponding path program 1 times [2024-11-13 14:33:38,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:38,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687462035] [2024-11-13 14:33:38,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:38,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:38,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:38,298 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 14:33:38,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:38,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687462035] [2024-11-13 14:33:38,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687462035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:33:38,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:33:38,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:33:38,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071848506] [2024-11-13 14:33:38,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:33:38,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:33:38,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:38,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:33:38,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:33:38,345 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 277 [2024-11-13 14:33:38,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 254 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 252.33333333333334) internal successors, (757), 3 states have internal predecessors, (757), 0 states have call successors, (0), 0 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 14:33:38,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:33:38,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 277 [2024-11-13 14:33:38,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:33:38,575 INFO L124 PetriNetUnfolderBase]: 68/918 cut-off events. [2024-11-13 14:33:38,575 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-13 14:33:38,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1035 conditions, 918 events. 68/918 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4605 event pairs, 22 based on Foata normal form. 0/774 useless extension candidates. Maximal degree in co-relation 961. Up to 71 conditions per place. [2024-11-13 14:33:38,583 INFO L140 encePairwiseOnDemand]: 274/277 looper letters, 13 selfloop transitions, 2 changer transitions 0/253 dead transitions. [2024-11-13 14:33:38,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 253 transitions, 562 flow [2024-11-13 14:33:38,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:33:38,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:33:38,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 769 transitions. [2024-11-13 14:33:38,587 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9253910950661853 [2024-11-13 14:33:38,587 INFO L175 Difference]: Start difference. First operand has 251 places, 254 transitions, 534 flow. Second operand 3 states and 769 transitions. [2024-11-13 14:33:38,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 253 transitions, 562 flow [2024-11-13 14:33:38,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 253 transitions, 558 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 14:33:38,594 INFO L231 Difference]: Finished difference. Result has 250 places, 253 transitions, 532 flow [2024-11-13 14:33:38,594 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=532, PETRI_PLACES=250, PETRI_TRANSITIONS=253} [2024-11-13 14:33:38,597 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, -13 predicate places. [2024-11-13 14:33:38,597 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 253 transitions, 532 flow [2024-11-13 14:33:38,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 252.33333333333334) internal successors, (757), 3 states have internal predecessors, (757), 0 states have call successors, (0), 0 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 14:33:38,598 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:33:38,598 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:33:38,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 14:33:38,598 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-13 14:33:38,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:38,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1005057268, now seen corresponding path program 1 times [2024-11-13 14:33:38,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:38,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029557836] [2024-11-13 14:33:38,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:38,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:38,707 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 14:33:38,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:38,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029557836] [2024-11-13 14:33:38,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029557836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:33:38,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:33:38,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:33:38,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752973888] [2024-11-13 14:33:38,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:33:38,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:33:38,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:38,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:33:38,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:33:38,739 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 277 [2024-11-13 14:33:38,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 253 transitions, 532 flow. Second operand has 3 states, 3 states have (on average 256.6666666666667) internal successors, (770), 3 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:33:38,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:33:38,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 277 [2024-11-13 14:33:38,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:33:39,044 INFO L124 PetriNetUnfolderBase]: 110/1251 cut-off events. [2024-11-13 14:33:39,044 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-13 14:33:39,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1457 conditions, 1251 events. 110/1251 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 7194 event pairs, 20 based on Foata normal form. 0/1053 useless extension candidates. Maximal degree in co-relation 1378. Up to 87 conditions per place. [2024-11-13 14:33:39,054 INFO L140 encePairwiseOnDemand]: 272/277 looper letters, 19 selfloop transitions, 4 changer transitions 0/263 dead transitions. [2024-11-13 14:33:39,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 263 transitions, 601 flow [2024-11-13 14:33:39,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:33:39,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:33:39,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 789 transitions. [2024-11-13 14:33:39,057 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9494584837545126 [2024-11-13 14:33:39,057 INFO L175 Difference]: Start difference. First operand has 250 places, 253 transitions, 532 flow. Second operand 3 states and 789 transitions. [2024-11-13 14:33:39,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 263 transitions, 601 flow [2024-11-13 14:33:39,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 263 transitions, 597 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 14:33:39,063 INFO L231 Difference]: Finished difference. Result has 252 places, 257 transitions, 562 flow [2024-11-13 14:33:39,064 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=562, PETRI_PLACES=252, PETRI_TRANSITIONS=257} [2024-11-13 14:33:39,064 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, -11 predicate places. [2024-11-13 14:33:39,064 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 257 transitions, 562 flow [2024-11-13 14:33:39,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 256.6666666666667) internal successors, (770), 3 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:33:39,065 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:33:39,065 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, 1, 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 14:33:39,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 14:33:39,066 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-13 14:33:39,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:39,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1568858487, now seen corresponding path program 1 times [2024-11-13 14:33:39,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:39,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621128603] [2024-11-13 14:33:39,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:39,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:39,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:39,187 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 14:33:39,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:39,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621128603] [2024-11-13 14:33:39,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621128603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:33:39,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:33:39,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:33:39,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057484687] [2024-11-13 14:33:39,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:33:39,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:33:39,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:39,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:33:39,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:33:39,225 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 277 [2024-11-13 14:33:39,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 257 transitions, 562 flow. Second operand has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 0 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 14:33:39,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:33:39,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 277 [2024-11-13 14:33:39,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:33:39,557 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([739] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][247], [298#true, 76#L762-4true, 269#true, Black: 295#(= |#race~send~0| 0), Black: 279#true, 215#L726-3true, 293#true, 258#L750-2true]) [2024-11-13 14:33:39,557 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2024-11-13 14:33:39,558 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-11-13 14:33:39,558 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-11-13 14:33:39,558 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-11-13 14:33:39,567 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([739] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][247], [136#L763-1true, 298#true, 269#true, Black: 295#(= |#race~send~0| 0), Black: 279#true, 293#true, 258#L750-2true]) [2024-11-13 14:33:39,567 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is cut-off event [2024-11-13 14:33:39,567 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-11-13 14:33:39,567 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-11-13 14:33:39,567 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-11-13 14:33:39,646 INFO L124 PetriNetUnfolderBase]: 217/2261 cut-off events. [2024-11-13 14:33:39,647 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2024-11-13 14:33:39,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2699 conditions, 2261 events. 217/2261 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 16421 event pairs, 41 based on Foata normal form. 0/1899 useless extension candidates. Maximal degree in co-relation 2483. Up to 161 conditions per place. [2024-11-13 14:33:39,666 INFO L140 encePairwiseOnDemand]: 272/277 looper letters, 18 selfloop transitions, 4 changer transitions 0/266 dead transitions. [2024-11-13 14:33:39,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 266 transitions, 625 flow [2024-11-13 14:33:39,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:33:39,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:33:39,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 788 transitions. [2024-11-13 14:33:39,670 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9482551143200962 [2024-11-13 14:33:39,671 INFO L175 Difference]: Start difference. First operand has 252 places, 257 transitions, 562 flow. Second operand 3 states and 788 transitions. [2024-11-13 14:33:39,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 266 transitions, 625 flow [2024-11-13 14:33:39,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 266 transitions, 617 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 14:33:39,683 INFO L231 Difference]: Finished difference. Result has 254 places, 261 transitions, 588 flow [2024-11-13 14:33:39,684 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=588, PETRI_PLACES=254, PETRI_TRANSITIONS=261} [2024-11-13 14:33:39,684 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, -9 predicate places. [2024-11-13 14:33:39,685 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 261 transitions, 588 flow [2024-11-13 14:33:39,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 0 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 14:33:39,685 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:33:39,687 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, 1, 1, 1, 1, 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 14:33:39,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 14:33:39,690 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-13 14:33:39,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:39,691 INFO L85 PathProgramCache]: Analyzing trace with hash -384850572, now seen corresponding path program 1 times [2024-11-13 14:33:39,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:39,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660337170] [2024-11-13 14:33:39,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:39,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:39,777 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 14:33:39,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:39,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660337170] [2024-11-13 14:33:39,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660337170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:33:39,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:33:39,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:33:39,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945060872] [2024-11-13 14:33:39,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:33:39,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:33:39,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:39,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:33:39,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:33:39,821 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 277 [2024-11-13 14:33:39,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 261 transitions, 588 flow. Second operand has 3 states, 3 states have (on average 246.66666666666666) internal successors, (740), 3 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:33:39,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:33:39,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 277 [2024-11-13 14:33:39,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:33:40,566 INFO L124 PetriNetUnfolderBase]: 464/4095 cut-off events. [2024-11-13 14:33:40,567 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2024-11-13 14:33:40,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5082 conditions, 4095 events. 464/4095 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 38327 event pairs, 115 based on Foata normal form. 0/3529 useless extension candidates. Maximal degree in co-relation 4787. Up to 523 conditions per place. [2024-11-13 14:33:40,602 INFO L140 encePairwiseOnDemand]: 270/277 looper letters, 24 selfloop transitions, 2 changer transitions 0/264 dead transitions. [2024-11-13 14:33:40,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 264 transitions, 649 flow [2024-11-13 14:33:40,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:33:40,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:33:40,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 766 transitions. [2024-11-13 14:33:40,605 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9217809867629362 [2024-11-13 14:33:40,606 INFO L175 Difference]: Start difference. First operand has 254 places, 261 transitions, 588 flow. Second operand 3 states and 766 transitions. [2024-11-13 14:33:40,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 264 transitions, 649 flow [2024-11-13 14:33:40,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 264 transitions, 641 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 14:33:40,619 INFO L231 Difference]: Finished difference. Result has 250 places, 258 transitions, 584 flow [2024-11-13 14:33:40,620 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=584, PETRI_PLACES=250, PETRI_TRANSITIONS=258} [2024-11-13 14:33:40,621 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, -13 predicate places. [2024-11-13 14:33:40,621 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 258 transitions, 584 flow [2024-11-13 14:33:40,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.66666666666666) internal successors, (740), 3 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:33:40,621 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:33:40,621 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:33:40,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 14:33:40,622 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-13 14:33:40,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:40,622 INFO L85 PathProgramCache]: Analyzing trace with hash -2054538958, now seen corresponding path program 1 times [2024-11-13 14:33:40,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:40,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784145650] [2024-11-13 14:33:40,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:40,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:40,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:40,737 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 14:33:40,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:40,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784145650] [2024-11-13 14:33:40,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784145650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:33:40,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:33:40,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:33:40,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844714553] [2024-11-13 14:33:40,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:33:40,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:33:40,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:40,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:33:40,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:33:40,773 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 277 [2024-11-13 14:33:40,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 258 transitions, 584 flow. Second operand has 3 states, 3 states have (on average 252.0) internal successors, (756), 3 states have internal predecessors, (756), 0 states have call successors, (0), 0 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 14:33:40,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:33:40,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 277 [2024-11-13 14:33:40,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:33:41,784 INFO L124 PetriNetUnfolderBase]: 668/5213 cut-off events. [2024-11-13 14:33:41,784 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2024-11-13 14:33:41,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6686 conditions, 5213 events. 668/5213 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 49686 event pairs, 119 based on Foata normal form. 0/4602 useless extension candidates. Maximal degree in co-relation 6429. Up to 598 conditions per place. [2024-11-13 14:33:41,840 INFO L140 encePairwiseOnDemand]: 270/277 looper letters, 18 selfloop transitions, 4 changer transitions 0/262 dead transitions. [2024-11-13 14:33:41,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 262 transitions, 637 flow [2024-11-13 14:33:41,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:33:41,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:33:41,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 775 transitions. [2024-11-13 14:33:41,844 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9326113116726835 [2024-11-13 14:33:41,844 INFO L175 Difference]: Start difference. First operand has 250 places, 258 transitions, 584 flow. Second operand 3 states and 775 transitions. [2024-11-13 14:33:41,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 262 transitions, 637 flow [2024-11-13 14:33:41,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 262 transitions, 637 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-13 14:33:41,850 INFO L231 Difference]: Finished difference. Result has 250 places, 257 transitions, 598 flow [2024-11-13 14:33:41,851 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=598, PETRI_PLACES=250, PETRI_TRANSITIONS=257} [2024-11-13 14:33:41,852 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, -13 predicate places. [2024-11-13 14:33:41,852 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 257 transitions, 598 flow [2024-11-13 14:33:41,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 252.0) internal successors, (756), 3 states have internal predecessors, (756), 0 states have call successors, (0), 0 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 14:33:41,853 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:33:41,853 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:33:41,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 14:33:41,854 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-13 14:33:41,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:41,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1772969502, now seen corresponding path program 1 times [2024-11-13 14:33:41,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:41,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883109639] [2024-11-13 14:33:41,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:41,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:41,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:41,973 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 14:33:41,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:41,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883109639] [2024-11-13 14:33:41,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883109639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:33:41,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:33:41,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:33:41,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300225340] [2024-11-13 14:33:41,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:33:41,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:33:41,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:41,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:33:41,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:33:41,993 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 277 [2024-11-13 14:33:41,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 257 transitions, 598 flow. Second operand has 3 states, 3 states have (on average 253.33333333333334) internal successors, (760), 3 states have internal predecessors, (760), 0 states have call successors, (0), 0 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 14:33:41,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:33:41,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 277 [2024-11-13 14:33:41,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:33:42,896 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([739] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][122], [Black: 303#true, Black: 307#true, 309#(= |#race~first~0| 0), 76#L762-4true, 269#true, Black: 295#(= |#race~send~0| 0), Black: 279#true, 215#L726-3true, Black: 300#(= |#race~receive~0| 0), 305#(= |#race~buffer_size~0| 0), 311#true, 258#L750-2true]) [2024-11-13 14:33:42,897 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2024-11-13 14:33:42,897 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-13 14:33:42,897 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-13 14:33:42,897 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-13 14:33:42,941 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([739] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][122], [136#L763-1true, Black: 303#true, Black: 307#true, 309#(= |#race~first~0| 0), 269#true, Black: 295#(= |#race~send~0| 0), Black: 279#true, 311#true, Black: 300#(= |#race~receive~0| 0), 305#(= |#race~buffer_size~0| 0), 258#L750-2true]) [2024-11-13 14:33:42,941 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2024-11-13 14:33:42,941 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-13 14:33:42,941 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-13 14:33:42,941 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2024-11-13 14:33:43,109 INFO L124 PetriNetUnfolderBase]: 685/4850 cut-off events. [2024-11-13 14:33:43,109 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2024-11-13 14:33:43,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6512 conditions, 4850 events. 685/4850 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 45029 event pairs, 291 based on Foata normal form. 0/4248 useless extension candidates. Maximal degree in co-relation 6198. Up to 816 conditions per place. [2024-11-13 14:33:43,159 INFO L140 encePairwiseOnDemand]: 273/277 looper letters, 18 selfloop transitions, 3 changer transitions 0/261 dead transitions. [2024-11-13 14:33:43,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 261 transitions, 650 flow [2024-11-13 14:33:43,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:33:43,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:33:43,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 775 transitions. [2024-11-13 14:33:43,163 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9326113116726835 [2024-11-13 14:33:43,163 INFO L175 Difference]: Start difference. First operand has 250 places, 257 transitions, 598 flow. Second operand 3 states and 775 transitions. [2024-11-13 14:33:43,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 261 transitions, 650 flow [2024-11-13 14:33:43,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 261 transitions, 646 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 14:33:43,172 INFO L231 Difference]: Finished difference. Result has 253 places, 258 transitions, 612 flow [2024-11-13 14:33:43,173 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=612, PETRI_PLACES=253, PETRI_TRANSITIONS=258} [2024-11-13 14:33:43,174 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, -10 predicate places. [2024-11-13 14:33:43,174 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 258 transitions, 612 flow [2024-11-13 14:33:43,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 253.33333333333334) internal successors, (760), 3 states have internal predecessors, (760), 0 states have call successors, (0), 0 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 14:33:43,174 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:33:43,175 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:33:43,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 14:33:43,175 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-13 14:33:43,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:43,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1386459821, now seen corresponding path program 1 times [2024-11-13 14:33:43,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:43,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219948874] [2024-11-13 14:33:43,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:43,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:43,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:43,532 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 14:33:43,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:43,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219948874] [2024-11-13 14:33:43,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219948874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:33:43,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:33:43,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:33:43,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177793] [2024-11-13 14:33:43,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:33:43,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:33:43,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:43,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:33:43,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:33:43,679 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 277 [2024-11-13 14:33:43,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 258 transitions, 612 flow. Second operand has 3 states, 3 states have (on average 252.0) internal successors, (756), 3 states have internal predecessors, (756), 0 states have call successors, (0), 0 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 14:33:43,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:33:43,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 277 [2024-11-13 14:33:43,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:33:44,541 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([739] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][122], [316#true, 269#true, Black: 295#(= |#race~send~0| 0), 215#L726-3true, Black: 300#(= |#race~receive~0| 0), 305#(= |#race~buffer_size~0| 0), 311#true, Black: 303#true, Black: 307#true, 76#L762-4true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 279#true, 258#L750-2true]) [2024-11-13 14:33:44,542 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2024-11-13 14:33:44,542 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-13 14:33:44,542 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-13 14:33:44,542 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-13 14:33:44,584 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([739] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][122], [136#L763-1true, Black: 303#true, 316#true, Black: 307#true, 269#true, Black: 295#(= |#race~send~0| 0), Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 279#true, Black: 300#(= |#race~receive~0| 0), 305#(= |#race~buffer_size~0| 0), 311#true, 258#L750-2true]) [2024-11-13 14:33:44,584 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2024-11-13 14:33:44,584 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-13 14:33:44,584 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-13 14:33:44,584 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2024-11-13 14:33:44,738 INFO L124 PetriNetUnfolderBase]: 750/5301 cut-off events. [2024-11-13 14:33:44,738 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2024-11-13 14:33:44,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7199 conditions, 5301 events. 750/5301 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 51255 event pairs, 284 based on Foata normal form. 0/4692 useless extension candidates. Maximal degree in co-relation 6889. Up to 853 conditions per place. [2024-11-13 14:33:44,787 INFO L140 encePairwiseOnDemand]: 272/277 looper letters, 21 selfloop transitions, 4 changer transitions 0/264 dead transitions. [2024-11-13 14:33:44,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 264 transitions, 676 flow [2024-11-13 14:33:44,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:33:44,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:33:44,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 773 transitions. [2024-11-13 14:33:44,790 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9302045728038508 [2024-11-13 14:33:44,790 INFO L175 Difference]: Start difference. First operand has 253 places, 258 transitions, 612 flow. Second operand 3 states and 773 transitions. [2024-11-13 14:33:44,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 264 transitions, 676 flow [2024-11-13 14:33:44,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 264 transitions, 670 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 14:33:44,801 INFO L231 Difference]: Finished difference. Result has 255 places, 261 transitions, 636 flow [2024-11-13 14:33:44,802 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=636, PETRI_PLACES=255, PETRI_TRANSITIONS=261} [2024-11-13 14:33:44,803 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, -8 predicate places. [2024-11-13 14:33:44,805 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 261 transitions, 636 flow [2024-11-13 14:33:44,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 252.0) internal successors, (756), 3 states have internal predecessors, (756), 0 states have call successors, (0), 0 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 14:33:44,806 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:33:44,806 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:33:44,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 14:33:44,807 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-13 14:33:44,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:44,807 INFO L85 PathProgramCache]: Analyzing trace with hash -361727861, now seen corresponding path program 1 times [2024-11-13 14:33:44,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:44,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016921238] [2024-11-13 14:33:44,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:44,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:44,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:33:44,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:44,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016921238] [2024-11-13 14:33:44,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016921238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:33:44,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:33:44,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:33:44,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837915017] [2024-11-13 14:33:44,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:33:44,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:33:44,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:44,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:33:44,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:33:44,916 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 277 [2024-11-13 14:33:44,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 261 transitions, 636 flow. Second operand has 3 states, 3 states have (on average 253.66666666666666) internal successors, (761), 3 states have internal predecessors, (761), 0 states have call successors, (0), 0 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 14:33:44,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:33:44,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 277 [2024-11-13 14:33:44,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:33:45,968 INFO L124 PetriNetUnfolderBase]: 759/5667 cut-off events. [2024-11-13 14:33:45,968 INFO L125 PetriNetUnfolderBase]: For 182/182 co-relation queries the response was YES. [2024-11-13 14:33:46,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7851 conditions, 5667 events. 759/5667 cut-off events. For 182/182 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 54598 event pairs, 306 based on Foata normal form. 0/5018 useless extension candidates. Maximal degree in co-relation 7581. Up to 945 conditions per place. [2024-11-13 14:33:46,018 INFO L140 encePairwiseOnDemand]: 273/277 looper letters, 18 selfloop transitions, 3 changer transitions 0/264 dead transitions. [2024-11-13 14:33:46,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 264 transitions, 683 flow [2024-11-13 14:33:46,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:33:46,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:33:46,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 775 transitions. [2024-11-13 14:33:46,021 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9326113116726835 [2024-11-13 14:33:46,021 INFO L175 Difference]: Start difference. First operand has 255 places, 261 transitions, 636 flow. Second operand 3 states and 775 transitions. [2024-11-13 14:33:46,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 264 transitions, 683 flow [2024-11-13 14:33:46,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 264 transitions, 673 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-13 14:33:46,033 INFO L231 Difference]: Finished difference. Result has 257 places, 261 transitions, 640 flow [2024-11-13 14:33:46,034 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=640, PETRI_PLACES=257, PETRI_TRANSITIONS=261} [2024-11-13 14:33:46,035 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, -6 predicate places. [2024-11-13 14:33:46,035 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 261 transitions, 640 flow [2024-11-13 14:33:46,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 253.66666666666666) internal successors, (761), 3 states have internal predecessors, (761), 0 states have call successors, (0), 0 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 14:33:46,036 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:33:46,037 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:33:46,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 14:33:46,037 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-13 14:33:46,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:46,037 INFO L85 PathProgramCache]: Analyzing trace with hash -880223225, now seen corresponding path program 1 times [2024-11-13 14:33:46,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:46,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174661234] [2024-11-13 14:33:46,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:46,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:46,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:46,123 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 14:33:46,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:46,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174661234] [2024-11-13 14:33:46,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174661234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:33:46,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:33:46,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:33:46,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989489201] [2024-11-13 14:33:46,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:33:46,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:33:46,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:46,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:33:46,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:33:46,158 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 277 [2024-11-13 14:33:46,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 261 transitions, 640 flow. Second operand has 3 states, 3 states have (on average 255.33333333333334) internal successors, (766), 3 states have internal predecessors, (766), 0 states have call successors, (0), 0 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 14:33:46,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:33:46,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 277 [2024-11-13 14:33:46,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:33:47,041 INFO L124 PetriNetUnfolderBase]: 521/4516 cut-off events. [2024-11-13 14:33:47,041 INFO L125 PetriNetUnfolderBase]: For 231/295 co-relation queries the response was YES. [2024-11-13 14:33:47,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6263 conditions, 4516 events. 521/4516 cut-off events. For 231/295 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 41178 event pairs, 169 based on Foata normal form. 1/4058 useless extension candidates. Maximal degree in co-relation 5962. Up to 614 conditions per place. [2024-11-13 14:33:47,078 INFO L140 encePairwiseOnDemand]: 272/277 looper letters, 19 selfloop transitions, 5 changer transitions 0/267 dead transitions. [2024-11-13 14:33:47,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 267 transitions, 704 flow [2024-11-13 14:33:47,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:33:47,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:33:47,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 781 transitions. [2024-11-13 14:33:47,082 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9398315282791817 [2024-11-13 14:33:47,082 INFO L175 Difference]: Start difference. First operand has 257 places, 261 transitions, 640 flow. Second operand 3 states and 781 transitions. [2024-11-13 14:33:47,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 267 transitions, 704 flow [2024-11-13 14:33:47,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 267 transitions, 698 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 14:33:47,091 INFO L231 Difference]: Finished difference. Result has 259 places, 264 transitions, 670 flow [2024-11-13 14:33:47,091 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=670, PETRI_PLACES=259, PETRI_TRANSITIONS=264} [2024-11-13 14:33:47,092 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, -4 predicate places. [2024-11-13 14:33:47,092 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 264 transitions, 670 flow [2024-11-13 14:33:47,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.33333333333334) internal successors, (766), 3 states have internal predecessors, (766), 0 states have call successors, (0), 0 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 14:33:47,093 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:33:47,093 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:33:47,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 14:33:47,093 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-13 14:33:47,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:47,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1172895067, now seen corresponding path program 1 times [2024-11-13 14:33:47,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:47,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135597940] [2024-11-13 14:33:47,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:47,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:47,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:47,172 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 14:33:47,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:47,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135597940] [2024-11-13 14:33:47,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135597940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:33:47,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:33:47,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:33:47,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305376792] [2024-11-13 14:33:47,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:33:47,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:33:47,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:47,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:33:47,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:33:47,208 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 277 [2024-11-13 14:33:47,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 264 transitions, 670 flow. Second operand has 3 states, 3 states have (on average 255.66666666666666) internal successors, (767), 3 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:33:47,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:33:47,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 277 [2024-11-13 14:33:47,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:33:48,356 INFO L124 PetriNetUnfolderBase]: 666/5678 cut-off events. [2024-11-13 14:33:48,357 INFO L125 PetriNetUnfolderBase]: For 377/382 co-relation queries the response was YES. [2024-11-13 14:33:48,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8004 conditions, 5678 events. 666/5678 cut-off events. For 377/382 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 55416 event pairs, 200 based on Foata normal form. 1/5116 useless extension candidates. Maximal degree in co-relation 7724. Up to 765 conditions per place. [2024-11-13 14:33:48,405 INFO L140 encePairwiseOnDemand]: 272/277 looper letters, 19 selfloop transitions, 5 changer transitions 0/270 dead transitions. [2024-11-13 14:33:48,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 270 transitions, 733 flow [2024-11-13 14:33:48,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:33:48,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:33:48,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 781 transitions. [2024-11-13 14:33:48,409 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9398315282791817 [2024-11-13 14:33:48,409 INFO L175 Difference]: Start difference. First operand has 259 places, 264 transitions, 670 flow. Second operand 3 states and 781 transitions. [2024-11-13 14:33:48,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 270 transitions, 733 flow [2024-11-13 14:33:48,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 270 transitions, 721 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-13 14:33:48,425 INFO L231 Difference]: Finished difference. Result has 261 places, 267 transitions, 694 flow [2024-11-13 14:33:48,427 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=694, PETRI_PLACES=261, PETRI_TRANSITIONS=267} [2024-11-13 14:33:48,428 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, -2 predicate places. [2024-11-13 14:33:48,428 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 267 transitions, 694 flow [2024-11-13 14:33:48,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.66666666666666) internal successors, (767), 3 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:33:48,429 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:33:48,429 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:33:48,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 14:33:48,430 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-13 14:33:48,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:48,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1954307372, now seen corresponding path program 1 times [2024-11-13 14:33:48,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:48,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107974049] [2024-11-13 14:33:48,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:48,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:48,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:48,542 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 14:33:48,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:48,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107974049] [2024-11-13 14:33:48,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107974049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:33:48,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:33:48,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:33:48,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182735057] [2024-11-13 14:33:48,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:33:48,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:33:48,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:48,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:33:48,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:33:48,617 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 277 [2024-11-13 14:33:48,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 267 transitions, 694 flow. Second operand has 3 states, 3 states have (on average 253.33333333333334) internal successors, (760), 3 states have internal predecessors, (760), 0 states have call successors, (0), 0 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 14:33:48,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:33:48,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 277 [2024-11-13 14:33:48,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:33:49,604 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([739] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][122], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 336#true, Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 269#true, Black: 295#(= |#race~send~0| 0), Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 215#L726-3true, 331#true, 305#(= |#race~buffer_size~0| 0), Black: 300#(= |#race~receive~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), Black: 303#true, Black: 307#true, 76#L762-4true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 279#true, 258#L750-2true]) [2024-11-13 14:33:49,604 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2024-11-13 14:33:49,604 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-13 14:33:49,605 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-13 14:33:49,605 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-13 14:33:49,672 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([739] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][122], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 336#true, Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 269#true, Black: 295#(= |#race~send~0| 0), Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 331#true, 305#(= |#race~buffer_size~0| 0), Black: 300#(= |#race~receive~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 136#L763-1true, Black: 303#true, Black: 307#true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 279#true, 258#L750-2true]) [2024-11-13 14:33:49,673 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2024-11-13 14:33:49,673 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-13 14:33:49,673 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-13 14:33:49,673 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2024-11-13 14:33:49,832 INFO L124 PetriNetUnfolderBase]: 707/6116 cut-off events. [2024-11-13 14:33:49,832 INFO L125 PetriNetUnfolderBase]: For 433/437 co-relation queries the response was YES. [2024-11-13 14:33:49,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8704 conditions, 6116 events. 707/6116 cut-off events. For 433/437 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 61220 event pairs, 243 based on Foata normal form. 0/5564 useless extension candidates. Maximal degree in co-relation 8429. Up to 869 conditions per place. [2024-11-13 14:33:49,894 INFO L140 encePairwiseOnDemand]: 274/277 looper letters, 19 selfloop transitions, 2 changer transitions 0/269 dead transitions. [2024-11-13 14:33:49,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 269 transitions, 741 flow [2024-11-13 14:33:49,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:33:49,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:33:49,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 771 transitions. [2024-11-13 14:33:49,898 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.927797833935018 [2024-11-13 14:33:49,898 INFO L175 Difference]: Start difference. First operand has 261 places, 267 transitions, 694 flow. Second operand 3 states and 771 transitions. [2024-11-13 14:33:49,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 269 transitions, 741 flow [2024-11-13 14:33:49,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 269 transitions, 729 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-13 14:33:49,911 INFO L231 Difference]: Finished difference. Result has 260 places, 266 transitions, 684 flow [2024-11-13 14:33:49,911 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=684, PETRI_PLACES=260, PETRI_TRANSITIONS=266} [2024-11-13 14:33:49,912 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, -3 predicate places. [2024-11-13 14:33:49,912 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 266 transitions, 684 flow [2024-11-13 14:33:49,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 253.33333333333334) internal successors, (760), 3 states have internal predecessors, (760), 0 states have call successors, (0), 0 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 14:33:49,913 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:33:49,913 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:33:49,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 14:33:49,914 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-13 14:33:49,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:49,914 INFO L85 PathProgramCache]: Analyzing trace with hash -925849996, now seen corresponding path program 1 times [2024-11-13 14:33:49,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:49,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574474502] [2024-11-13 14:33:49,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:49,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:49,985 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 14:33:49,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:49,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574474502] [2024-11-13 14:33:49,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574474502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:33:49,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:33:49,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:33:49,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784565553] [2024-11-13 14:33:49,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:33:49,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:33:49,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:49,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:33:49,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:33:50,023 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 277 [2024-11-13 14:33:50,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 266 transitions, 684 flow. Second operand has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 0 states have call successors, (0), 0 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 14:33:50,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:33:50,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 277 [2024-11-13 14:33:50,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:33:50,809 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([739] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][122], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 336#true, Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 269#true, Black: 295#(= |#race~send~0| 0), Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 339#true, 215#L726-3true, 305#(= |#race~buffer_size~0| 0), Black: 300#(= |#race~receive~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), Black: 303#true, Black: 307#true, 76#L762-4true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 279#true, 258#L750-2true]) [2024-11-13 14:33:50,809 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2024-11-13 14:33:50,810 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-13 14:33:50,810 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-13 14:33:50,810 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-13 14:33:50,853 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([739] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][122], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 336#true, Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 269#true, Black: 295#(= |#race~send~0| 0), Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 339#true, 305#(= |#race~buffer_size~0| 0), Black: 300#(= |#race~receive~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 136#L763-1true, Black: 303#true, Black: 307#true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 279#true, 258#L750-2true]) [2024-11-13 14:33:50,853 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2024-11-13 14:33:50,853 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-13 14:33:50,853 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-13 14:33:50,853 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2024-11-13 14:33:51,002 INFO L124 PetriNetUnfolderBase]: 721/6192 cut-off events. [2024-11-13 14:33:51,002 INFO L125 PetriNetUnfolderBase]: For 694/719 co-relation queries the response was YES. [2024-11-13 14:33:51,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8906 conditions, 6192 events. 721/6192 cut-off events. For 694/719 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 61616 event pairs, 185 based on Foata normal form. 5/5618 useless extension candidates. Maximal degree in co-relation 8612. Up to 804 conditions per place. [2024-11-13 14:33:51,049 INFO L140 encePairwiseOnDemand]: 271/277 looper letters, 19 selfloop transitions, 9 changer transitions 0/275 dead transitions. [2024-11-13 14:33:51,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 275 transitions, 772 flow [2024-11-13 14:33:51,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:33:51,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:33:51,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 782 transitions. [2024-11-13 14:33:51,052 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.941034897713598 [2024-11-13 14:33:51,053 INFO L175 Difference]: Start difference. First operand has 260 places, 266 transitions, 684 flow. Second operand 3 states and 782 transitions. [2024-11-13 14:33:51,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 275 transitions, 772 flow [2024-11-13 14:33:51,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 275 transitions, 768 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 14:33:51,065 INFO L231 Difference]: Finished difference. Result has 262 places, 272 transitions, 754 flow [2024-11-13 14:33:51,066 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=754, PETRI_PLACES=262, PETRI_TRANSITIONS=272} [2024-11-13 14:33:51,067 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, -1 predicate places. [2024-11-13 14:33:51,067 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 272 transitions, 754 flow [2024-11-13 14:33:51,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 0 states have call successors, (0), 0 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 14:33:51,068 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:33:51,068 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:33:51,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 14:33:51,068 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-13 14:33:51,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:51,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1430065689, now seen corresponding path program 1 times [2024-11-13 14:33:51,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:51,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97317905] [2024-11-13 14:33:51,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:51,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:51,142 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 14:33:51,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:51,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97317905] [2024-11-13 14:33:51,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97317905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:33:51,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:33:51,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:33:51,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252070168] [2024-11-13 14:33:51,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:33:51,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:33:51,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:51,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:33:51,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:33:51,175 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 277 [2024-11-13 14:33:51,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 272 transitions, 754 flow. Second operand has 3 states, 3 states have (on average 255.33333333333334) internal successors, (766), 3 states have internal predecessors, (766), 0 states have call successors, (0), 0 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 14:33:51,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:33:51,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 277 [2024-11-13 14:33:51,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:33:51,575 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([655] L707-2-->L707-3: Formula: (= |v_#race~buffer_size~0_4| 0) InVars {} OutVars{#race~buffer_size~0=|v_#race~buffer_size~0_4|} AuxVars[] AssignedVars[#race~buffer_size~0][165], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 293#true, 269#true, Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 344#true, 339#true, Black: 298#true, 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 253#L707-3true, Black: 303#true, 195#L695-7true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), 76#L762-4true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 279#true]) [2024-11-13 14:33:51,575 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-11-13 14:33:51,575 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2024-11-13 14:33:51,576 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-13 14:33:51,576 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-13 14:33:51,652 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([758] L695-6-->L695-7: Formula: (= |v_#race~buffer_size~0_16| 0) InVars {} OutVars{#race~buffer_size~0=|v_#race~buffer_size~0_16|} AuxVars[] AssignedVars[#race~buffer_size~0][171], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 293#true, 269#true, Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 344#true, 339#true, Black: 298#true, 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 253#L707-3true, Black: 303#true, 195#L695-7true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), 76#L762-4true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 279#true]) [2024-11-13 14:33:51,652 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2024-11-13 14:33:51,653 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2024-11-13 14:33:51,653 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-13 14:33:51,653 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-13 14:33:51,653 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([758] L695-6-->L695-7: Formula: (= |v_#race~buffer_size~0_16| 0) InVars {} OutVars{#race~buffer_size~0=|v_#race~buffer_size~0_16|} AuxVars[] AssignedVars[#race~buffer_size~0][171], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 293#true, 269#true, Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 339#true, 344#true, Black: 298#true, 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 253#L707-3true, Black: 303#true, 195#L695-7true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), 76#L762-4true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 279#true]) [2024-11-13 14:33:51,653 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2024-11-13 14:33:51,654 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-11-13 14:33:51,654 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2024-11-13 14:33:51,654 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-13 14:33:51,654 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-13 14:33:51,675 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([655] L707-2-->L707-3: Formula: (= |v_#race~buffer_size~0_4| 0) InVars {} OutVars{#race~buffer_size~0=|v_#race~buffer_size~0_4|} AuxVars[] AssignedVars[#race~buffer_size~0][165], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 293#true, 269#true, Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 344#true, 339#true, Black: 298#true, 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 253#L707-3true, Black: 303#true, 195#L695-7true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), 76#L762-4true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 279#true]) [2024-11-13 14:33:51,675 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2024-11-13 14:33:51,675 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2024-11-13 14:33:51,676 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-13 14:33:51,676 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-13 14:33:51,676 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-13 14:33:52,335 INFO L124 PetriNetUnfolderBase]: 835/6437 cut-off events. [2024-11-13 14:33:52,335 INFO L125 PetriNetUnfolderBase]: For 1027/1063 co-relation queries the response was YES. [2024-11-13 14:33:52,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9613 conditions, 6437 events. 835/6437 cut-off events. For 1027/1063 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 64361 event pairs, 194 based on Foata normal form. 6/5832 useless extension candidates. Maximal degree in co-relation 9316. Up to 870 conditions per place. [2024-11-13 14:33:52,388 INFO L140 encePairwiseOnDemand]: 271/277 looper letters, 19 selfloop transitions, 9 changer transitions 0/281 dead transitions. [2024-11-13 14:33:52,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 281 transitions, 841 flow [2024-11-13 14:33:52,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:33:52,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:33:52,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 782 transitions. [2024-11-13 14:33:52,391 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.941034897713598 [2024-11-13 14:33:52,392 INFO L175 Difference]: Start difference. First operand has 262 places, 272 transitions, 754 flow. Second operand 3 states and 782 transitions. [2024-11-13 14:33:52,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 281 transitions, 841 flow [2024-11-13 14:33:52,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 281 transitions, 823 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 14:33:52,408 INFO L231 Difference]: Finished difference. Result has 264 places, 278 transitions, 810 flow [2024-11-13 14:33:52,409 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=810, PETRI_PLACES=264, PETRI_TRANSITIONS=278} [2024-11-13 14:33:52,409 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 1 predicate places. [2024-11-13 14:33:52,410 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 278 transitions, 810 flow [2024-11-13 14:33:52,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.33333333333334) internal successors, (766), 3 states have internal predecessors, (766), 0 states have call successors, (0), 0 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 14:33:52,411 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:33:52,411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:33:52,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 14:33:52,412 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-13 14:33:52,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:52,413 INFO L85 PathProgramCache]: Analyzing trace with hash -2095943064, now seen corresponding path program 1 times [2024-11-13 14:33:52,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:52,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308416203] [2024-11-13 14:33:52,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:52,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:52,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:52,542 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 14:33:52,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:52,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308416203] [2024-11-13 14:33:52,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308416203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:33:52,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:33:52,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:33:52,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826678643] [2024-11-13 14:33:52,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:33:52,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:33:52,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:52,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:33:52,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:33:52,619 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 277 [2024-11-13 14:33:52,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 278 transitions, 810 flow. Second operand has 3 states, 3 states have (on average 250.66666666666666) internal successors, (752), 3 states have internal predecessors, (752), 0 states have call successors, (0), 0 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 14:33:52,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:33:52,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 277 [2024-11-13 14:33:52,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:33:53,553 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([638] L727-->L727-1: Formula: (= |v_#race~send~0_4| 0) InVars {} OutVars{#race~send~0=|v_#race~send~0_4|} AuxVars[] AssignedVars[#race~send~0][219], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 248#L748-4true, Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 293#true, 269#true, 349#true, Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 344#true, 263#L727-1true, 305#(= |#race~buffer_size~0| 0), Black: 300#(= |#race~receive~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), Black: 303#true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), 76#L762-4true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 346#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), Black: 279#true]) [2024-11-13 14:33:53,554 INFO L294 olderBase$Statistics]: this new event has 164 ancestors and is cut-off event [2024-11-13 14:33:53,554 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-13 14:33:53,554 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-13 14:33:53,554 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-13 14:33:53,820 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([739] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][122], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 295#(= |#race~send~0| 0), 349#true, 269#true, Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 344#true, 215#L726-3true, Black: 300#(= |#race~receive~0| 0), 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), Black: 303#true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), 76#L762-4true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 346#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), Black: 279#true, 258#L750-2true]) [2024-11-13 14:33:53,820 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2024-11-13 14:33:53,821 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-13 14:33:53,821 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-13 14:33:53,821 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-13 14:33:53,913 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([739] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][122], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 295#(= |#race~send~0| 0), 349#true, 269#true, Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 344#true, Black: 300#(= |#race~receive~0| 0), 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 136#L763-1true, Black: 303#true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 346#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), Black: 279#true, 258#L750-2true]) [2024-11-13 14:33:53,914 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2024-11-13 14:33:53,914 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-13 14:33:53,914 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2024-11-13 14:33:53,914 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-13 14:33:54,420 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([701] L731-2-->L731-3: Formula: (= |v_#race~receive~0_4| |v_t1Thread1of1ForFork0_#t~nondet14#1_3|) InVars {t1Thread1of1ForFork0_#t~nondet14#1=|v_t1Thread1of1ForFork0_#t~nondet14#1_3|} OutVars{#race~receive~0=|v_#race~receive~0_4|, t1Thread1of1ForFork0_#t~nondet14#1=|v_t1Thread1of1ForFork0_#t~nondet14#1_3|} AuxVars[] AssignedVars[#race~receive~0][260], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 72#L731-3true, Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 295#(= |#race~send~0| 0), 269#true, 349#true, Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 344#true, 305#(= |#race~buffer_size~0| 0), Black: 300#(= |#race~receive~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), Black: 303#true, Black: 307#true, Black: 339#true, 76#L762-4true, 168#L747-3true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 279#true, Black: 346#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|)]) [2024-11-13 14:33:54,420 INFO L294 olderBase$Statistics]: this new event has 222 ancestors and is cut-off event [2024-11-13 14:33:54,420 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2024-11-13 14:33:54,420 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-11-13 14:33:54,420 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-11-13 14:33:54,438 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([802] L748-2-->L748-3: Formula: (= |v_#race~send~0_10| |v_t2Thread1of1ForFork1_#t~nondet20#1_3|) InVars {t2Thread1of1ForFork1_#t~nondet20#1=|v_t2Thread1of1ForFork1_#t~nondet20#1_3|} OutVars{t2Thread1of1ForFork1_#t~nondet20#1=|v_t2Thread1of1ForFork1_#t~nondet20#1_3|, #race~send~0=|v_#race~send~0_10|} AuxVars[] AssignedVars[#race~send~0][251], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 88#L730-4true, Black: 295#(= |#race~send~0| 0), 269#true, 349#true, Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 305#(= |#race~buffer_size~0| 0), Black: 300#(= |#race~receive~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), Black: 303#true, 346#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), Black: 307#true, Black: 341#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), 21#L748-3true, 76#L762-4true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 279#true, Black: 344#true]) [2024-11-13 14:33:54,438 INFO L294 olderBase$Statistics]: this new event has 222 ancestors and is cut-off event [2024-11-13 14:33:54,438 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2024-11-13 14:33:54,438 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2024-11-13 14:33:54,439 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-11-13 14:33:54,476 INFO L124 PetriNetUnfolderBase]: 1225/8602 cut-off events. [2024-11-13 14:33:54,476 INFO L125 PetriNetUnfolderBase]: For 1486/1546 co-relation queries the response was YES. [2024-11-13 14:33:54,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13466 conditions, 8602 events. 1225/8602 cut-off events. For 1486/1546 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 90297 event pairs, 360 based on Foata normal form. 6/7945 useless extension candidates. Maximal degree in co-relation 13122. Up to 1437 conditions per place. [2024-11-13 14:33:54,554 INFO L140 encePairwiseOnDemand]: 272/277 looper letters, 25 selfloop transitions, 5 changer transitions 0/285 dead transitions. [2024-11-13 14:33:54,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 285 transitions, 890 flow [2024-11-13 14:33:54,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:33:54,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:33:54,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 769 transitions. [2024-11-13 14:33:54,557 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9253910950661853 [2024-11-13 14:33:54,558 INFO L175 Difference]: Start difference. First operand has 264 places, 278 transitions, 810 flow. Second operand 3 states and 769 transitions. [2024-11-13 14:33:54,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 285 transitions, 890 flow [2024-11-13 14:33:54,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 285 transitions, 872 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 14:33:54,575 INFO L231 Difference]: Finished difference. Result has 266 places, 282 transitions, 834 flow [2024-11-13 14:33:54,576 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=834, PETRI_PLACES=266, PETRI_TRANSITIONS=282} [2024-11-13 14:33:54,577 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 3 predicate places. [2024-11-13 14:33:54,577 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 282 transitions, 834 flow [2024-11-13 14:33:54,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 250.66666666666666) internal successors, (752), 3 states have internal predecessors, (752), 0 states have call successors, (0), 0 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 14:33:54,578 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:33:54,578 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:33:54,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 14:33:54,579 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-13 14:33:54,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:54,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1028724864, now seen corresponding path program 1 times [2024-11-13 14:33:54,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:54,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889828667] [2024-11-13 14:33:54,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:54,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:54,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:54,874 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 14:33:54,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:54,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889828667] [2024-11-13 14:33:54,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889828667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:33:54,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:33:54,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:33:54,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560998851] [2024-11-13 14:33:54,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:33:54,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:33:54,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:54,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:33:54,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:33:54,986 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 277 [2024-11-13 14:33:54,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 282 transitions, 834 flow. Second operand has 3 states, 3 states have (on average 256.0) internal successors, (768), 3 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:33:54,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:33:54,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 277 [2024-11-13 14:33:54,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:33:55,373 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([655] L707-2-->L707-3: Formula: (= |v_#race~buffer_size~0_4| 0) InVars {} OutVars{#race~buffer_size~0=|v_#race~buffer_size~0_4|} AuxVars[] AssignedVars[#race~buffer_size~0][165], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 351#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 293#true, 349#true, 269#true, Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), Black: 298#true, 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 253#L707-3true, Black: 303#true, 195#L695-7true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), 354#true, 76#L762-4true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 346#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), Black: 279#true]) [2024-11-13 14:33:55,373 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-11-13 14:33:55,373 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2024-11-13 14:33:55,374 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-13 14:33:55,374 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-13 14:33:55,397 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([758] L695-6-->L695-7: Formula: (= |v_#race~buffer_size~0_16| 0) InVars {} OutVars{#race~buffer_size~0=|v_#race~buffer_size~0_16|} AuxVars[] AssignedVars[#race~buffer_size~0][171], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 351#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 293#true, 349#true, 269#true, Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), Black: 298#true, 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 253#L707-3true, Black: 303#true, 195#L695-7true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), 354#true, 76#L762-4true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 346#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), Black: 279#true]) [2024-11-13 14:33:55,397 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-11-13 14:33:55,397 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2024-11-13 14:33:55,397 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-13 14:33:55,398 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-11-13 14:33:55,467 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([758] L695-6-->L695-7: Formula: (= |v_#race~buffer_size~0_16| 0) InVars {} OutVars{#race~buffer_size~0=|v_#race~buffer_size~0_16|} AuxVars[] AssignedVars[#race~buffer_size~0][171], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 351#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 293#true, 349#true, 269#true, Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), Black: 298#true, 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 253#L707-3true, Black: 303#true, 195#L695-7true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), 76#L762-4true, 354#true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 279#true, Black: 346#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|)]) [2024-11-13 14:33:55,467 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2024-11-13 14:33:55,467 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2024-11-13 14:33:55,467 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-13 14:33:55,467 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-11-13 14:33:55,467 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-13 14:33:56,129 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([638] L727-->L727-1: Formula: (= |v_#race~send~0_4| 0) InVars {} OutVars{#race~send~0=|v_#race~send~0_4|} AuxVars[] AssignedVars[#race~send~0][219], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 351#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), 248#L748-4true, Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 293#true, 349#true, 269#true, Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 263#L727-1true, Black: 300#(= |#race~receive~0| 0), 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), Black: 303#true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), 354#true, 76#L762-4true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 346#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), Black: 279#true]) [2024-11-13 14:33:56,130 INFO L294 olderBase$Statistics]: this new event has 164 ancestors and is cut-off event [2024-11-13 14:33:56,130 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-13 14:33:56,130 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-13 14:33:56,131 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-13 14:33:56,466 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([739] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][122], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 351#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 349#true, Black: 295#(= |#race~send~0| 0), 269#true, Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 215#L726-3true, Black: 300#(= |#race~receive~0| 0), 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), Black: 303#true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), 76#L762-4true, 354#true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 279#true, Black: 346#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), 258#L750-2true]) [2024-11-13 14:33:56,466 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2024-11-13 14:33:56,467 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-13 14:33:56,467 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-13 14:33:56,467 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-13 14:33:56,661 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([739] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][122], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 351#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 349#true, Black: 295#(= |#race~send~0| 0), 269#true, Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), Black: 300#(= |#race~receive~0| 0), 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 136#L763-1true, Black: 303#true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), 354#true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 279#true, Black: 346#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), 258#L750-2true]) [2024-11-13 14:33:56,661 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2024-11-13 14:33:56,661 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-13 14:33:56,661 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2024-11-13 14:33:56,661 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-13 14:33:56,751 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([802] L748-2-->L748-3: Formula: (= |v_#race~send~0_10| |v_t2Thread1of1ForFork1_#t~nondet20#1_3|) InVars {t2Thread1of1ForFork1_#t~nondet20#1=|v_t2Thread1of1ForFork1_#t~nondet20#1_3|} OutVars{t2Thread1of1ForFork1_#t~nondet20#1=|v_t2Thread1of1ForFork1_#t~nondet20#1_3|, #race~send~0=|v_#race~send~0_10|} AuxVars[] AssignedVars[#race~send~0][228], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 351#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 88#L730-4true, 349#true, Black: 295#(= |#race~send~0| 0), 269#true, Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), Black: 300#(= |#race~receive~0| 0), 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), Black: 303#true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), 354#true, 76#L762-4true, 21#L748-3true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 279#true, Black: 344#true]) [2024-11-13 14:33:56,751 INFO L294 olderBase$Statistics]: this new event has 183 ancestors and is cut-off event [2024-11-13 14:33:56,751 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-11-13 14:33:56,752 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-11-13 14:33:56,752 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2024-11-13 14:33:56,847 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([701] L731-2-->L731-3: Formula: (= |v_#race~receive~0_4| |v_t1Thread1of1ForFork0_#t~nondet14#1_3|) InVars {t1Thread1of1ForFork0_#t~nondet14#1=|v_t1Thread1of1ForFork0_#t~nondet14#1_3|} OutVars{#race~receive~0=|v_#race~receive~0_4|, t1Thread1of1ForFork0_#t~nondet14#1=|v_t1Thread1of1ForFork0_#t~nondet14#1_3|} AuxVars[] AssignedVars[#race~receive~0][243], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 351#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), 72#L731-3true, Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 349#true, Black: 295#(= |#race~send~0| 0), 269#true, Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 305#(= |#race~buffer_size~0| 0), Black: 300#(= |#race~receive~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), Black: 303#true, Black: 307#true, Black: 339#true, 354#true, 76#L762-4true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), 168#L747-3true, Black: 346#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), Black: 279#true]) [2024-11-13 14:33:56,847 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is cut-off event [2024-11-13 14:33:56,847 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-11-13 14:33:56,847 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-11-13 14:33:56,847 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2024-11-13 14:33:57,080 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([701] L731-2-->L731-3: Formula: (= |v_#race~receive~0_4| |v_t1Thread1of1ForFork0_#t~nondet14#1_3|) InVars {t1Thread1of1ForFork0_#t~nondet14#1=|v_t1Thread1of1ForFork0_#t~nondet14#1_3|} OutVars{#race~receive~0=|v_#race~receive~0_4|, t1Thread1of1ForFork0_#t~nondet14#1=|v_t1Thread1of1ForFork0_#t~nondet14#1_3|} AuxVars[] AssignedVars[#race~receive~0][243], [Black: 351#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 72#L731-3true, Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 349#true, Black: 295#(= |#race~send~0| 0), 269#true, Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), Black: 300#(= |#race~receive~0| 0), 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), Black: 303#true, Black: 339#true, Black: 307#true, 76#L762-4true, 168#L747-3true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 346#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), 356#(or (and (<= 2147483648 (mod (+ ~first~0 4294967295) 4294967296)) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (- 1) ~first~0 (* (div (+ ~first~0 4294967295) 4294967296) (- 4294967296)))) 0)) (and (<= (mod (+ ~first~0 4294967295) 4294967296) 2147483647) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| ~first~0 4294967295 (* (div (+ ~first~0 4294967295) 4294967296) (- 4294967296)))) 0))), Black: 279#true]) [2024-11-13 14:33:57,080 INFO L294 olderBase$Statistics]: this new event has 202 ancestors and is cut-off event [2024-11-13 14:33:57,081 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-11-13 14:33:57,081 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2024-11-13 14:33:57,081 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2024-11-13 14:33:57,166 INFO L124 PetriNetUnfolderBase]: 1164/10054 cut-off events. [2024-11-13 14:33:57,166 INFO L125 PetriNetUnfolderBase]: For 1892/2017 co-relation queries the response was YES. [2024-11-13 14:33:57,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15364 conditions, 10054 events. 1164/10054 cut-off events. For 1892/2017 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 112906 event pairs, 192 based on Foata normal form. 10/9264 useless extension candidates. Maximal degree in co-relation 15068. Up to 745 conditions per place. [2024-11-13 14:33:57,234 INFO L140 encePairwiseOnDemand]: 272/277 looper letters, 19 selfloop transitions, 5 changer transitions 0/290 dead transitions. [2024-11-13 14:33:57,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 290 transitions, 901 flow [2024-11-13 14:33:57,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:33:57,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:33:57,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 783 transitions. [2024-11-13 14:33:57,237 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9422382671480144 [2024-11-13 14:33:57,237 INFO L175 Difference]: Start difference. First operand has 266 places, 282 transitions, 834 flow. Second operand 3 states and 783 transitions. [2024-11-13 14:33:57,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 290 transitions, 901 flow [2024-11-13 14:33:57,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 290 transitions, 891 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 14:33:57,258 INFO L231 Difference]: Finished difference. Result has 268 places, 285 transitions, 860 flow [2024-11-13 14:33:57,259 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=860, PETRI_PLACES=268, PETRI_TRANSITIONS=285} [2024-11-13 14:33:57,260 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 5 predicate places. [2024-11-13 14:33:57,260 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 285 transitions, 860 flow [2024-11-13 14:33:57,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 256.0) internal successors, (768), 3 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:33:57,261 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:33:57,261 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:33:57,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-13 14:33:57,261 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-13 14:33:57,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:57,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1950335648, now seen corresponding path program 1 times [2024-11-13 14:33:57,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:57,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837400987] [2024-11-13 14:33:57,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:57,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:57,507 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 14:33:57,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:57,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837400987] [2024-11-13 14:33:57,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837400987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:33:57,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:33:57,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:33:57,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565975374] [2024-11-13 14:33:57,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:33:57,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:33:57,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:57,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:33:57,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:33:57,540 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 277 [2024-11-13 14:33:57,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 285 transitions, 860 flow. Second operand has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 0 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 14:33:57,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:33:57,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 277 [2024-11-13 14:33:57,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:33:57,972 INFO L124 PetriNetUnfolderBase]: 151/1883 cut-off events. [2024-11-13 14:33:57,972 INFO L125 PetriNetUnfolderBase]: For 295/295 co-relation queries the response was YES. [2024-11-13 14:33:57,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2785 conditions, 1883 events. 151/1883 cut-off events. For 295/295 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 13723 event pairs, 17 based on Foata normal form. 40/1816 useless extension candidates. Maximal degree in co-relation 2100. Up to 98 conditions per place. [2024-11-13 14:33:57,982 INFO L140 encePairwiseOnDemand]: 273/277 looper letters, 0 selfloop transitions, 0 changer transitions 244/244 dead transitions. [2024-11-13 14:33:57,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 244 transitions, 669 flow [2024-11-13 14:33:57,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:33:57,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:33:57,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 790 transitions. [2024-11-13 14:33:57,986 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.950661853188929 [2024-11-13 14:33:57,986 INFO L175 Difference]: Start difference. First operand has 268 places, 285 transitions, 860 flow. Second operand 3 states and 790 transitions. [2024-11-13 14:33:57,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 244 transitions, 669 flow [2024-11-13 14:33:57,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 244 transitions, 585 flow, removed 21 selfloop flow, removed 16 redundant places. [2024-11-13 14:33:57,996 INFO L231 Difference]: Finished difference. Result has 244 places, 0 transitions, 0 flow [2024-11-13 14:33:57,996 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=244, PETRI_TRANSITIONS=0} [2024-11-13 14:33:57,997 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, -19 predicate places. [2024-11-13 14:33:57,998 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 0 transitions, 0 flow [2024-11-13 14:33:57,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 0 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 14:33:58,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (53 of 54 remaining) [2024-11-13 14:33:58,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (52 of 54 remaining) [2024-11-13 14:33:58,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (51 of 54 remaining) [2024-11-13 14:33:58,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (50 of 54 remaining) [2024-11-13 14:33:58,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (49 of 54 remaining) [2024-11-13 14:33:58,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (48 of 54 remaining) [2024-11-13 14:33:58,005 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (47 of 54 remaining) [2024-11-13 14:33:58,005 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (46 of 54 remaining) [2024-11-13 14:33:58,005 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONDATA_RACE (45 of 54 remaining) [2024-11-13 14:33:58,005 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONDATA_RACE (44 of 54 remaining) [2024-11-13 14:33:58,005 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (43 of 54 remaining) [2024-11-13 14:33:58,005 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (42 of 54 remaining) [2024-11-13 14:33:58,005 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (41 of 54 remaining) [2024-11-13 14:33:58,006 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err5ASSERT_VIOLATIONDATA_RACE (40 of 54 remaining) [2024-11-13 14:33:58,006 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err6ASSERT_VIOLATIONDATA_RACE (39 of 54 remaining) [2024-11-13 14:33:58,006 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err11ASSERT_VIOLATIONDATA_RACE (38 of 54 remaining) [2024-11-13 14:33:58,006 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err7ASSERT_VIOLATIONDATA_RACE (37 of 54 remaining) [2024-11-13 14:33:58,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err8ASSERT_VIOLATIONDATA_RACE (36 of 54 remaining) [2024-11-13 14:33:58,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err12ASSERT_VIOLATIONDATA_RACE (35 of 54 remaining) [2024-11-13 14:33:58,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err9ASSERT_VIOLATIONDATA_RACE (34 of 54 remaining) [2024-11-13 14:33:58,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err10ASSERT_VIOLATIONDATA_RACE (33 of 54 remaining) [2024-11-13 14:33:58,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONDATA_RACE (32 of 54 remaining) [2024-11-13 14:33:58,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (31 of 54 remaining) [2024-11-13 14:33:58,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (30 of 54 remaining) [2024-11-13 14:33:58,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (29 of 54 remaining) [2024-11-13 14:33:58,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (28 of 54 remaining) [2024-11-13 14:33:58,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (27 of 54 remaining) [2024-11-13 14:33:58,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err8ASSERT_VIOLATIONDATA_RACE (26 of 54 remaining) [2024-11-13 14:33:58,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err6ASSERT_VIOLATIONDATA_RACE (25 of 54 remaining) [2024-11-13 14:33:58,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err7ASSERT_VIOLATIONDATA_RACE (24 of 54 remaining) [2024-11-13 14:33:58,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err9ASSERT_VIOLATIONDATA_RACE (23 of 54 remaining) [2024-11-13 14:33:58,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONDATA_RACE (22 of 54 remaining) [2024-11-13 14:33:58,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONDATA_RACE (21 of 54 remaining) [2024-11-13 14:33:58,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (20 of 54 remaining) [2024-11-13 14:33:58,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (19 of 54 remaining) [2024-11-13 14:33:58,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (18 of 54 remaining) [2024-11-13 14:33:58,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err5ASSERT_VIOLATIONDATA_RACE (17 of 54 remaining) [2024-11-13 14:33:58,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err6ASSERT_VIOLATIONDATA_RACE (16 of 54 remaining) [2024-11-13 14:33:58,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err11ASSERT_VIOLATIONDATA_RACE (15 of 54 remaining) [2024-11-13 14:33:58,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err7ASSERT_VIOLATIONDATA_RACE (14 of 54 remaining) [2024-11-13 14:33:58,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err8ASSERT_VIOLATIONDATA_RACE (13 of 54 remaining) [2024-11-13 14:33:58,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err12ASSERT_VIOLATIONDATA_RACE (12 of 54 remaining) [2024-11-13 14:33:58,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err9ASSERT_VIOLATIONDATA_RACE (11 of 54 remaining) [2024-11-13 14:33:58,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err10ASSERT_VIOLATIONDATA_RACE (10 of 54 remaining) [2024-11-13 14:33:58,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONDATA_RACE (9 of 54 remaining) [2024-11-13 14:33:58,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (8 of 54 remaining) [2024-11-13 14:33:58,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (7 of 54 remaining) [2024-11-13 14:33:58,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (6 of 54 remaining) [2024-11-13 14:33:58,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (5 of 54 remaining) [2024-11-13 14:33:58,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (4 of 54 remaining) [2024-11-13 14:33:58,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err8ASSERT_VIOLATIONDATA_RACE (3 of 54 remaining) [2024-11-13 14:33:58,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err6ASSERT_VIOLATIONDATA_RACE (2 of 54 remaining) [2024-11-13 14:33:58,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err7ASSERT_VIOLATIONDATA_RACE (1 of 54 remaining) [2024-11-13 14:33:58,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err9ASSERT_VIOLATIONDATA_RACE (0 of 54 remaining) [2024-11-13 14:33:58,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-13 14:33:58,012 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:33:58,022 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-13 14:33:58,022 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 14:33:58,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 02:33:58 BasicIcfg [2024-11-13 14:33:58,032 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 14:33:58,033 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 14:33:58,033 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 14:33:58,034 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 14:33:58,035 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:33:34" (3/4) ... [2024-11-13 14:33:58,037 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 14:33:58,043 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure t1 [2024-11-13 14:33:58,044 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure t2 [2024-11-13 14:33:58,049 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-13 14:33:58,050 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-13 14:33:58,050 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-13 14:33:58,050 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 14:33:58,170 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f11af7-265e-453c-a8a4-aa6fc3297441/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 14:33:58,171 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f11af7-265e-453c-a8a4-aa6fc3297441/bin/uautomizer-verify-qhAvR1uOyd/witness.yml [2024-11-13 14:33:58,171 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 14:33:58,172 INFO L158 Benchmark]: Toolchain (without parser) took 25571.25ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 118.1MB in the beginning and 851.2MB in the end (delta: -733.1MB). Peak memory consumption was 352.2MB. Max. memory is 16.1GB. [2024-11-13 14:33:58,173 INFO L158 Benchmark]: CDTParser took 1.39ms. Allocated memory is still 142.6MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:33:58,174 INFO L158 Benchmark]: CACSL2BoogieTranslator took 827.50ms. Allocated memory is still 142.6MB. Free memory was 117.9MB in the beginning and 97.1MB in the end (delta: 20.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 14:33:58,174 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.18ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 94.5MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:33:58,175 INFO L158 Benchmark]: Boogie Preprocessor took 69.90ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 93.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:33:58,175 INFO L158 Benchmark]: RCFGBuilder took 942.73ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 68.9MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 14:33:58,175 INFO L158 Benchmark]: TraceAbstraction took 23529.46ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 68.3MB in the beginning and 855.4MB in the end (delta: -787.1MB). Peak memory consumption was 301.9MB. Max. memory is 16.1GB. [2024-11-13 14:33:58,176 INFO L158 Benchmark]: Witness Printer took 137.52ms. Allocated memory is still 1.2GB. Free memory was 855.4MB in the beginning and 851.2MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:33:58,179 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.39ms. Allocated memory is still 142.6MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 827.50ms. Allocated memory is still 142.6MB. Free memory was 117.9MB in the beginning and 97.1MB in the end (delta: 20.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.18ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 94.5MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.90ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 93.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 942.73ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 68.9MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 23529.46ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 68.3MB in the beginning and 855.4MB in the end (delta: -787.1MB). Peak memory consumption was 301.9MB. Max. memory is 16.1GB. * Witness Printer took 137.52ms. Allocated memory is still 1.2GB. Free memory was 855.4MB in the beginning and 851.2MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 690]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 691]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 691]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 691]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 759]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 760]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 727]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 707]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 707]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 707]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 709]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 709]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 710]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 730]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 710]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 710]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 731]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 712]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 712]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 743]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 695]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 695]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 695]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 697]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 697]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 747]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 698]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 698]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 748]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 434 locations, 54 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 23.2s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 19.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 705 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 248 mSDsluCounter, 172 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 885 IncrementalHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 172 mSDtfsCounter, 885 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=860occurred in iteration=20, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1915 NumberOfCodeBlocks, 1915 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1894 ConstructedInterpolants, 0 QuantifiedInterpolants, 2199 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 29 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-13 14:33:58,228 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f11af7-265e-453c-a8a4-aa6fc3297441/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE