./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/09-regions_01-list_rc.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/09-regions_01-list_rc.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 917c3a4e5c7c37037968095aaa6025089873d587c341a7db88ad7132ea30a543 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:08:33,548 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:08:33,583 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-29 11:08:33,587 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:08:33,590 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:08:33,613 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:08:33,613 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:08:33,613 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:08:33,613 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:08:33,614 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:08:33,614 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:08:33,614 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:08:33,614 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:08:33,614 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:08:33,614 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:08:33,614 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:08:33,614 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:08:33,614 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:08:33,615 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:08:33,615 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:08:33,615 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:08:33,615 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:08:33,615 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:08:33,615 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:08:33,615 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:08:33,615 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:08:33,615 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:08:33,615 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:08:33,615 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:08:33,615 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:08:33,616 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:08:33,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:33,616 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:08:33,616 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:08:33,616 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:08:33,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:33,616 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:08:33,616 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:08:33,616 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:08:33,616 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:08:33,616 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:08:33,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:08:33,617 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:08:33,617 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:08:33,617 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:08:33,617 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 917c3a4e5c7c37037968095aaa6025089873d587c341a7db88ad7132ea30a543 [2025-04-29 11:08:33,834 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:08:33,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:08:33,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:08:33,846 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:08:33,846 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:08:33,847 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_01-list_rc.c [2025-04-29 11:08:35,171 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd4234e86/c5ffd812b59e4793a566de179e9a5aa4/FLAGbe9181d64 [2025-04-29 11:08:35,371 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:08:35,377 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_01-list_rc.c [2025-04-29 11:08:35,378 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:08:35,379 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:08:35,379 WARN L117 ultiparseSymbolTable]: System include stdio.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:08:35,393 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd4234e86/c5ffd812b59e4793a566de179e9a5aa4/FLAGbe9181d64 [2025-04-29 11:08:36,171 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd4234e86/c5ffd812b59e4793a566de179e9a5aa4 [2025-04-29 11:08:36,173 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:08:36,174 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:08:36,175 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:08:36,175 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:08:36,178 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:08:36,179 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:08:36" (1/1) ... [2025-04-29 11:08:36,180 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a784c85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:36, skipping insertion in model container [2025-04-29 11:08:36,180 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:08:36" (1/1) ... [2025-04-29 11:08:36,190 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:08:36,361 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:08:36,372 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:08:36,406 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:08:36,421 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:08:36,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:36 WrapperNode [2025-04-29 11:08:36,422 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:08:36,423 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:08:36,423 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:08:36,423 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:08:36,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:36" (1/1) ... [2025-04-29 11:08:36,438 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:36" (1/1) ... [2025-04-29 11:08:36,473 INFO L138 Inliner]: procedures = 15, calls = 25, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 165 [2025-04-29 11:08:36,473 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:08:36,474 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:08:36,474 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:08:36,474 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:08:36,479 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:36" (1/1) ... [2025-04-29 11:08:36,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:36" (1/1) ... [2025-04-29 11:08:36,483 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:36" (1/1) ... [2025-04-29 11:08:36,485 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:36" (1/1) ... [2025-04-29 11:08:36,500 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:36" (1/1) ... [2025-04-29 11:08:36,501 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:36" (1/1) ... [2025-04-29 11:08:36,503 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:36" (1/1) ... [2025-04-29 11:08:36,505 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:36" (1/1) ... [2025-04-29 11:08:36,505 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:36" (1/1) ... [2025-04-29 11:08:36,509 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:08:36,510 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:08:36,510 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:08:36,510 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:08:36,511 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:36" (1/1) ... [2025-04-29 11:08:36,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:36,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:36,544 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:08:36,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:08:36,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-04-29 11:08:36,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:08:36,562 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:08:36,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-29 11:08:36,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-04-29 11:08:36,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-29 11:08:36,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:08:36,562 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:08:36,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:08:36,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:08:36,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-29 11:08:36,563 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:08:36,563 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:08:36,564 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:08:36,650 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:08:36,651 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:08:36,950 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:08:36,950 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:08:36,972 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:08:36,973 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:08:36,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:08:36 BoogieIcfgContainer [2025-04-29 11:08:36,973 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:08:36,975 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:08:36,975 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:08:36,980 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:08:36,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:08:36" (1/3) ... [2025-04-29 11:08:36,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41cae995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:08:36, skipping insertion in model container [2025-04-29 11:08:36,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:36" (2/3) ... [2025-04-29 11:08:36,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41cae995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:08:36, skipping insertion in model container [2025-04-29 11:08:36,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:08:36" (3/3) ... [2025-04-29 11:08:36,982 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_01-list_rc.c [2025-04-29 11:08:36,992 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:08:36,994 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_01-list_rc.c that has 2 procedures, 192 locations, 190 edges, 1 initial locations, 0 loop locations, and 18 error locations. [2025-04-29 11:08:36,994 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:08:37,061 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:08:37,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 195 places, 191 transitions, 386 flow [2025-04-29 11:08:37,163 INFO L116 PetriNetUnfolderBase]: 0/190 cut-off events. [2025-04-29 11:08:37,164 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:37,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 190 events. 0/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 85 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-29 11:08:37,166 INFO L82 GeneralOperation]: Start removeDead. Operand has 195 places, 191 transitions, 386 flow [2025-04-29 11:08:37,169 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 194 places, 190 transitions, 383 flow [2025-04-29 11:08:37,177 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:08:37,186 INFO L340 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;@1d524284, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:08:37,189 INFO L341 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-04-29 11:08:37,197 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:08:37,198 INFO L116 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-04-29 11:08:37,198 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:37,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:37,199 INFO L206 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] [2025-04-29 11:08:37,199 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-04-29 11:08:37,203 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:37,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1066529220, now seen corresponding path program 1 times [2025-04-29 11:08:37,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:37,209 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244968157] [2025-04-29 11:08:37,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:37,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:37,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:08:37,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:08:37,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:37,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:37,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:37,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:37,708 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244968157] [2025-04-29 11:08:37,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244968157] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:37,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:37,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:37,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650791052] [2025-04-29 11:08:37,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:37,714 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:37,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:37,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:37,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:38,059 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 191 [2025-04-29 11:08:38,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 190 transitions, 383 flow. Second operand has 6 states, 6 states have (on average 133.33333333333334) internal successors, (800), 6 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:38,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:38,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 191 [2025-04-29 11:08:38,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:38,271 INFO L116 PetriNetUnfolderBase]: 220/1014 cut-off events. [2025-04-29 11:08:38,271 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:08:38,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1516 conditions, 1014 events. 220/1014 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5344 event pairs, 220 based on Foata normal form. 0/909 useless extension candidates. Maximal degree in co-relation 1398. Up to 488 conditions per place. [2025-04-29 11:08:38,279 INFO L140 encePairwiseOnDemand]: 179/191 looper letters, 47 selfloop transitions, 10 changer transitions 0/188 dead transitions. [2025-04-29 11:08:38,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 188 transitions, 493 flow [2025-04-29 11:08:38,280 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:38,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:38,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 851 transitions. [2025-04-29 11:08:38,290 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7425828970331588 [2025-04-29 11:08:38,291 INFO L175 Difference]: Start difference. First operand has 194 places, 190 transitions, 383 flow. Second operand 6 states and 851 transitions. [2025-04-29 11:08:38,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 188 transitions, 493 flow [2025-04-29 11:08:38,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 188 transitions, 492 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:38,317 INFO L231 Difference]: Finished difference. Result has 196 places, 188 transitions, 398 flow [2025-04-29 11:08:38,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=398, PETRI_PLACES=196, PETRI_TRANSITIONS=188} [2025-04-29 11:08:38,322 INFO L279 CegarLoopForPetriNet]: 194 programPoint places, 2 predicate places. [2025-04-29 11:08:38,322 INFO L485 AbstractCegarLoop]: Abstraction has has 196 places, 188 transitions, 398 flow [2025-04-29 11:08:38,322 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.33333333333334) internal successors, (800), 6 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:38,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:38,323 INFO L206 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] [2025-04-29 11:08:38,323 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:08:38,323 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-04-29 11:08:38,324 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:38,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1901656793, now seen corresponding path program 1 times [2025-04-29 11:08:38,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:38,324 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194454754] [2025-04-29 11:08:38,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:38,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:38,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 11:08:38,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:08:38,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:38,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:38,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:38,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:38,613 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194454754] [2025-04-29 11:08:38,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194454754] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:38,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:38,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:38,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520307223] [2025-04-29 11:08:38,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:38,614 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:38,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:38,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:38,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:38,911 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 191 [2025-04-29 11:08:38,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 188 transitions, 398 flow. Second operand has 6 states, 6 states have (on average 133.33333333333334) internal successors, (800), 6 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:38,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:38,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 191 [2025-04-29 11:08:38,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:39,089 INFO L116 PetriNetUnfolderBase]: 220/1012 cut-off events. [2025-04-29 11:08:39,090 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:39,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1524 conditions, 1012 events. 220/1012 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5352 event pairs, 220 based on Foata normal form. 0/909 useless extension candidates. Maximal degree in co-relation 1439. Up to 488 conditions per place. [2025-04-29 11:08:39,097 INFO L140 encePairwiseOnDemand]: 179/191 looper letters, 47 selfloop transitions, 10 changer transitions 0/186 dead transitions. [2025-04-29 11:08:39,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 186 transitions, 508 flow [2025-04-29 11:08:39,098 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:39,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:39,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 851 transitions. [2025-04-29 11:08:39,100 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7425828970331588 [2025-04-29 11:08:39,100 INFO L175 Difference]: Start difference. First operand has 196 places, 188 transitions, 398 flow. Second operand 6 states and 851 transitions. [2025-04-29 11:08:39,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 186 transitions, 508 flow [2025-04-29 11:08:39,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 186 transitions, 488 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:08:39,105 INFO L231 Difference]: Finished difference. Result has 194 places, 186 transitions, 394 flow [2025-04-29 11:08:39,105 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=394, PETRI_PLACES=194, PETRI_TRANSITIONS=186} [2025-04-29 11:08:39,105 INFO L279 CegarLoopForPetriNet]: 194 programPoint places, 0 predicate places. [2025-04-29 11:08:39,106 INFO L485 AbstractCegarLoop]: Abstraction has has 194 places, 186 transitions, 394 flow [2025-04-29 11:08:39,106 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.33333333333334) internal successors, (800), 6 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:39,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:39,106 INFO L206 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] [2025-04-29 11:08:39,106 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:08:39,107 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-04-29 11:08:39,107 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:39,107 INFO L85 PathProgramCache]: Analyzing trace with hash 767736806, now seen corresponding path program 1 times [2025-04-29 11:08:39,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:39,107 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174819279] [2025-04-29 11:08:39,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:39,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:39,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 11:08:39,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:08:39,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:39,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:39,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:39,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:39,157 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174819279] [2025-04-29 11:08:39,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174819279] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:39,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:39,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:08:39,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157934393] [2025-04-29 11:08:39,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:39,158 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:08:39,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:39,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:08:39,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:08:39,189 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 191 [2025-04-29 11:08:39,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 186 transitions, 394 flow. Second operand has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:39,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:39,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 191 [2025-04-29 11:08:39,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:39,242 INFO L116 PetriNetUnfolderBase]: 16/321 cut-off events. [2025-04-29 11:08:39,242 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:39,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 384 conditions, 321 events. 16/321 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 752 event pairs, 16 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 298. Up to 47 conditions per place. [2025-04-29 11:08:39,245 INFO L140 encePairwiseOnDemand]: 188/191 looper letters, 14 selfloop transitions, 2 changer transitions 0/185 dead transitions. [2025-04-29 11:08:39,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 185 transitions, 424 flow [2025-04-29 11:08:39,245 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:08:39,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:08:39,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 539 transitions. [2025-04-29 11:08:39,248 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9406631762652705 [2025-04-29 11:08:39,248 INFO L175 Difference]: Start difference. First operand has 194 places, 186 transitions, 394 flow. Second operand 3 states and 539 transitions. [2025-04-29 11:08:39,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 185 transitions, 424 flow [2025-04-29 11:08:39,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 185 transitions, 404 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:08:39,252 INFO L231 Difference]: Finished difference. Result has 190 places, 185 transitions, 376 flow [2025-04-29 11:08:39,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=376, PETRI_PLACES=190, PETRI_TRANSITIONS=185} [2025-04-29 11:08:39,253 INFO L279 CegarLoopForPetriNet]: 194 programPoint places, -4 predicate places. [2025-04-29 11:08:39,253 INFO L485 AbstractCegarLoop]: Abstraction has has 190 places, 185 transitions, 376 flow [2025-04-29 11:08:39,253 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:39,253 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:39,254 INFO L206 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] [2025-04-29 11:08:39,254 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:08:39,254 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-04-29 11:08:39,254 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:39,254 INFO L85 PathProgramCache]: Analyzing trace with hash -717505349, now seen corresponding path program 1 times [2025-04-29 11:08:39,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:39,254 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220261586] [2025-04-29 11:08:39,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:39,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:39,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-29 11:08:39,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:08:39,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:39,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:39,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:39,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:39,297 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220261586] [2025-04-29 11:08:39,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220261586] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:39,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:39,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:08:39,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068754428] [2025-04-29 11:08:39,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:39,298 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:08:39,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:39,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:08:39,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:08:39,318 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 191 [2025-04-29 11:08:39,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 185 transitions, 376 flow. Second operand has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:39,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:39,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 191 [2025-04-29 11:08:39,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:39,370 INFO L116 PetriNetUnfolderBase]: 24/398 cut-off events. [2025-04-29 11:08:39,370 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:08:39,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 469 conditions, 398 events. 24/398 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1206 event pairs, 24 based on Foata normal form. 0/367 useless extension candidates. Maximal degree in co-relation 419. Up to 63 conditions per place. [2025-04-29 11:08:39,372 INFO L140 encePairwiseOnDemand]: 185/191 looper letters, 15 selfloop transitions, 1 changer transitions 0/180 dead transitions. [2025-04-29 11:08:39,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 180 transitions, 398 flow [2025-04-29 11:08:39,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:08:39,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:08:39,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 531 transitions. [2025-04-29 11:08:39,376 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9267015706806283 [2025-04-29 11:08:39,376 INFO L175 Difference]: Start difference. First operand has 190 places, 185 transitions, 376 flow. Second operand 3 states and 531 transitions. [2025-04-29 11:08:39,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 180 transitions, 398 flow [2025-04-29 11:08:39,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 180 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:08:39,379 INFO L231 Difference]: Finished difference. Result has 185 places, 180 transitions, 364 flow [2025-04-29 11:08:39,380 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=364, PETRI_PLACES=185, PETRI_TRANSITIONS=180} [2025-04-29 11:08:39,380 INFO L279 CegarLoopForPetriNet]: 194 programPoint places, -9 predicate places. [2025-04-29 11:08:39,381 INFO L485 AbstractCegarLoop]: Abstraction has has 185 places, 180 transitions, 364 flow [2025-04-29 11:08:39,381 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:39,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:39,381 INFO L206 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] [2025-04-29 11:08:39,381 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:08:39,382 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-04-29 11:08:39,382 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:39,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1346607255, now seen corresponding path program 1 times [2025-04-29 11:08:39,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:39,382 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439152118] [2025-04-29 11:08:39,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:39,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:39,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-04-29 11:08:39,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-04-29 11:08:39,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:39,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:39,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:39,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:39,734 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439152118] [2025-04-29 11:08:39,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439152118] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:39,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:39,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:39,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666723034] [2025-04-29 11:08:39,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:39,735 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:39,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:39,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:39,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:39,908 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 191 [2025-04-29 11:08:39,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 180 transitions, 364 flow. Second operand has 6 states, 6 states have (on average 131.16666666666666) internal successors, (787), 6 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:39,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:39,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 191 [2025-04-29 11:08:39,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:40,046 INFO L116 PetriNetUnfolderBase]: 288/1151 cut-off events. [2025-04-29 11:08:40,047 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:40,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1796 conditions, 1151 events. 288/1151 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6252 event pairs, 288 based on Foata normal form. 0/1092 useless extension candidates. Maximal degree in co-relation 1736. Up to 635 conditions per place. [2025-04-29 11:08:40,050 INFO L140 encePairwiseOnDemand]: 185/191 looper letters, 58 selfloop transitions, 5 changer transitions 0/179 dead transitions. [2025-04-29 11:08:40,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 179 transitions, 488 flow [2025-04-29 11:08:40,051 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:40,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:40,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 826 transitions. [2025-04-29 11:08:40,052 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7207678883071553 [2025-04-29 11:08:40,052 INFO L175 Difference]: Start difference. First operand has 185 places, 180 transitions, 364 flow. Second operand 6 states and 826 transitions. [2025-04-29 11:08:40,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 179 transitions, 488 flow [2025-04-29 11:08:40,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 179 transitions, 487 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:40,055 INFO L231 Difference]: Finished difference. Result has 188 places, 179 transitions, 371 flow [2025-04-29 11:08:40,055 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=371, PETRI_PLACES=188, PETRI_TRANSITIONS=179} [2025-04-29 11:08:40,056 INFO L279 CegarLoopForPetriNet]: 194 programPoint places, -6 predicate places. [2025-04-29 11:08:40,056 INFO L485 AbstractCegarLoop]: Abstraction has has 188 places, 179 transitions, 371 flow [2025-04-29 11:08:40,056 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 131.16666666666666) internal successors, (787), 6 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:40,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:40,056 INFO L206 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] [2025-04-29 11:08:40,057 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:08:40,057 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-04-29 11:08:40,057 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:40,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1589449251, now seen corresponding path program 1 times [2025-04-29 11:08:40,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:40,057 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481723021] [2025-04-29 11:08:40,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:40,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:40,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-04-29 11:08:40,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-04-29 11:08:40,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:40,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:40,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:40,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:40,391 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481723021] [2025-04-29 11:08:40,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481723021] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:40,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:40,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:40,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123767930] [2025-04-29 11:08:40,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:40,393 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:40,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:40,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:40,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:40,598 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 191 [2025-04-29 11:08:40,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 179 transitions, 371 flow. Second operand has 6 states, 6 states have (on average 139.0) internal successors, (834), 6 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:40,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:40,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 191 [2025-04-29 11:08:40,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:40,915 INFO L116 PetriNetUnfolderBase]: 316/1477 cut-off events. [2025-04-29 11:08:40,916 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:08:40,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2213 conditions, 1477 events. 316/1477 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 9174 event pairs, 36 based on Foata normal form. 0/1387 useless extension candidates. Maximal degree in co-relation 2154. Up to 380 conditions per place. [2025-04-29 11:08:40,923 INFO L140 encePairwiseOnDemand]: 163/191 looper letters, 99 selfloop transitions, 70 changer transitions 0/291 dead transitions. [2025-04-29 11:08:40,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 291 transitions, 933 flow [2025-04-29 11:08:40,924 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:40,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:40,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 975 transitions. [2025-04-29 11:08:40,927 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8507853403141361 [2025-04-29 11:08:40,928 INFO L175 Difference]: Start difference. First operand has 188 places, 179 transitions, 371 flow. Second operand 6 states and 975 transitions. [2025-04-29 11:08:40,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 291 transitions, 933 flow [2025-04-29 11:08:40,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 291 transitions, 923 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:08:40,935 INFO L231 Difference]: Finished difference. Result has 192 places, 249 transitions, 839 flow [2025-04-29 11:08:40,935 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=839, PETRI_PLACES=192, PETRI_TRANSITIONS=249} [2025-04-29 11:08:40,936 INFO L279 CegarLoopForPetriNet]: 194 programPoint places, -2 predicate places. [2025-04-29 11:08:40,937 INFO L485 AbstractCegarLoop]: Abstraction has has 192 places, 249 transitions, 839 flow [2025-04-29 11:08:40,937 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 139.0) internal successors, (834), 6 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:40,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:40,937 INFO L206 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] [2025-04-29 11:08:40,937 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:08:40,937 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-04-29 11:08:40,938 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:40,938 INFO L85 PathProgramCache]: Analyzing trace with hash -545119382, now seen corresponding path program 1 times [2025-04-29 11:08:40,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:40,938 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466698194] [2025-04-29 11:08:40,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:40,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:40,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-04-29 11:08:40,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-04-29 11:08:40,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:40,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:41,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:41,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:41,251 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466698194] [2025-04-29 11:08:41,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466698194] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:41,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:41,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:41,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279401789] [2025-04-29 11:08:41,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:41,252 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:41,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:41,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:41,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:41,415 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 191 [2025-04-29 11:08:41,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 249 transitions, 839 flow. Second operand has 6 states, 6 states have (on average 139.83333333333334) internal successors, (839), 6 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:41,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:41,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 191 [2025-04-29 11:08:41,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:41,673 INFO L116 PetriNetUnfolderBase]: 588/2248 cut-off events. [2025-04-29 11:08:41,673 INFO L117 PetriNetUnfolderBase]: For 602/608 co-relation queries the response was YES. [2025-04-29 11:08:41,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4637 conditions, 2248 events. 588/2248 cut-off events. For 602/608 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 15140 event pairs, 222 based on Foata normal form. 0/2137 useless extension candidates. Maximal degree in co-relation 4576. Up to 1082 conditions per place. [2025-04-29 11:08:41,682 INFO L140 encePairwiseOnDemand]: 176/191 looper letters, 106 selfloop transitions, 48 changer transitions 0/300 dead transitions. [2025-04-29 11:08:41,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 300 transitions, 1319 flow [2025-04-29 11:08:41,682 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:41,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:41,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 912 transitions. [2025-04-29 11:08:41,684 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7958115183246073 [2025-04-29 11:08:41,684 INFO L175 Difference]: Start difference. First operand has 192 places, 249 transitions, 839 flow. Second operand 6 states and 912 transitions. [2025-04-29 11:08:41,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 300 transitions, 1319 flow [2025-04-29 11:08:41,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 300 transitions, 1319 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:41,692 INFO L231 Difference]: Finished difference. Result has 202 places, 292 transitions, 1227 flow [2025-04-29 11:08:41,693 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=839, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1227, PETRI_PLACES=202, PETRI_TRANSITIONS=292} [2025-04-29 11:08:41,694 INFO L279 CegarLoopForPetriNet]: 194 programPoint places, 8 predicate places. [2025-04-29 11:08:41,694 INFO L485 AbstractCegarLoop]: Abstraction has has 202 places, 292 transitions, 1227 flow [2025-04-29 11:08:41,694 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 139.83333333333334) internal successors, (839), 6 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:41,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:41,694 INFO L206 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] [2025-04-29 11:08:41,694 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:08:41,695 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-04-29 11:08:41,695 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:41,695 INFO L85 PathProgramCache]: Analyzing trace with hash 512101982, now seen corresponding path program 1 times [2025-04-29 11:08:41,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:41,695 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983108474] [2025-04-29 11:08:41,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:41,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:41,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-04-29 11:08:41,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-04-29 11:08:41,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:41,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:41,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:41,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:41,965 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983108474] [2025-04-29 11:08:41,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983108474] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:41,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:41,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:41,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023154798] [2025-04-29 11:08:41,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:41,967 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:41,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:41,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:41,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:42,169 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 191 [2025-04-29 11:08:42,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 292 transitions, 1227 flow. Second operand has 6 states, 6 states have (on average 145.0) internal successors, (870), 6 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:42,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:42,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 191 [2025-04-29 11:08:42,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:42,649 INFO L116 PetriNetUnfolderBase]: 738/2821 cut-off events. [2025-04-29 11:08:42,649 INFO L117 PetriNetUnfolderBase]: For 1652/1710 co-relation queries the response was YES. [2025-04-29 11:08:42,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6608 conditions, 2821 events. 738/2821 cut-off events. For 1652/1710 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 20434 event pairs, 86 based on Foata normal form. 0/2725 useless extension candidates. Maximal degree in co-relation 6540. Up to 1024 conditions per place. [2025-04-29 11:08:42,665 INFO L140 encePairwiseOnDemand]: 168/191 looper letters, 128 selfloop transitions, 136 changer transitions 4/432 dead transitions. [2025-04-29 11:08:42,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 432 transitions, 2519 flow [2025-04-29 11:08:42,666 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:42,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:42,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 970 transitions. [2025-04-29 11:08:42,667 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8464223385689355 [2025-04-29 11:08:42,667 INFO L175 Difference]: Start difference. First operand has 202 places, 292 transitions, 1227 flow. Second operand 6 states and 970 transitions. [2025-04-29 11:08:42,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 432 transitions, 2519 flow [2025-04-29 11:08:42,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 432 transitions, 2501 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:42,683 INFO L231 Difference]: Finished difference. Result has 212 places, 423 transitions, 2575 flow [2025-04-29 11:08:42,684 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=1209, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2575, PETRI_PLACES=212, PETRI_TRANSITIONS=423} [2025-04-29 11:08:42,686 INFO L279 CegarLoopForPetriNet]: 194 programPoint places, 18 predicate places. [2025-04-29 11:08:42,686 INFO L485 AbstractCegarLoop]: Abstraction has has 212 places, 423 transitions, 2575 flow [2025-04-29 11:08:42,687 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 145.0) internal successors, (870), 6 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:42,687 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:42,687 INFO L206 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] [2025-04-29 11:08:42,687 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:08:42,687 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-04-29 11:08:42,688 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:42,688 INFO L85 PathProgramCache]: Analyzing trace with hash 681618077, now seen corresponding path program 1 times [2025-04-29 11:08:42,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:42,688 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263941569] [2025-04-29 11:08:42,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:42,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:42,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-04-29 11:08:42,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-04-29 11:08:42,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:42,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:43,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:43,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:43,183 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263941569] [2025-04-29 11:08:43,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263941569] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:43,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:43,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-29 11:08:43,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049253291] [2025-04-29 11:08:43,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:43,183 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:08:43,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:43,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:08:43,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:08:44,149 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 191 [2025-04-29 11:08:44,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 423 transitions, 2575 flow. Second operand has 13 states, 13 states have (on average 125.07692307692308) internal successors, (1626), 13 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:44,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:44,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 191 [2025-04-29 11:08:44,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:45,258 INFO L116 PetriNetUnfolderBase]: 1151/4131 cut-off events. [2025-04-29 11:08:45,258 INFO L117 PetriNetUnfolderBase]: For 5497/5613 co-relation queries the response was YES. [2025-04-29 11:08:45,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11897 conditions, 4131 events. 1151/4131 cut-off events. For 5497/5613 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 33147 event pairs, 87 based on Foata normal form. 35/4067 useless extension candidates. Maximal degree in co-relation 11821. Up to 880 conditions per place. [2025-04-29 11:08:45,285 INFO L140 encePairwiseOnDemand]: 154/191 looper letters, 349 selfloop transitions, 159 changer transitions 4/647 dead transitions. [2025-04-29 11:08:45,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 647 transitions, 5015 flow [2025-04-29 11:08:45,286 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 11:08:45,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-29 11:08:45,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1965 transitions. [2025-04-29 11:08:45,289 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7348541510845176 [2025-04-29 11:08:45,289 INFO L175 Difference]: Start difference. First operand has 212 places, 423 transitions, 2575 flow. Second operand 14 states and 1965 transitions. [2025-04-29 11:08:45,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 647 transitions, 5015 flow [2025-04-29 11:08:45,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 647 transitions, 4943 flow, removed 36 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:45,317 INFO L231 Difference]: Finished difference. Result has 235 places, 486 transitions, 3848 flow [2025-04-29 11:08:45,317 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=2539, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3848, PETRI_PLACES=235, PETRI_TRANSITIONS=486} [2025-04-29 11:08:45,318 INFO L279 CegarLoopForPetriNet]: 194 programPoint places, 41 predicate places. [2025-04-29 11:08:45,318 INFO L485 AbstractCegarLoop]: Abstraction has has 235 places, 486 transitions, 3848 flow [2025-04-29 11:08:45,319 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 125.07692307692308) internal successors, (1626), 13 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:45,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:45,319 INFO L206 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] [2025-04-29 11:08:45,319 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:08:45,319 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-04-29 11:08:45,319 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:45,319 INFO L85 PathProgramCache]: Analyzing trace with hash -639291491, now seen corresponding path program 2 times [2025-04-29 11:08:45,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:45,319 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503572645] [2025-04-29 11:08:45,319 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:08:45,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:45,337 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 106 statements into 1 equivalence classes. [2025-04-29 11:08:45,345 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-04-29 11:08:45,346 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:08:45,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:45,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:45,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:45,731 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503572645] [2025-04-29 11:08:45,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503572645] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:45,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:45,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-29 11:08:45,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340136329] [2025-04-29 11:08:45,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:45,732 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:08:45,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:45,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:08:45,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:08:46,572 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 191 [2025-04-29 11:08:46,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 486 transitions, 3848 flow. Second operand has 13 states, 13 states have (on average 125.07692307692308) internal successors, (1626), 13 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:46,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:46,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 191 [2025-04-29 11:08:46,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:47,544 INFO L116 PetriNetUnfolderBase]: 1253/4564 cut-off events. [2025-04-29 11:08:47,544 INFO L117 PetriNetUnfolderBase]: For 9605/9709 co-relation queries the response was YES. [2025-04-29 11:08:47,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14511 conditions, 4564 events. 1253/4564 cut-off events. For 9605/9709 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 37179 event pairs, 125 based on Foata normal form. 37/4485 useless extension candidates. Maximal degree in co-relation 14421. Up to 891 conditions per place. [2025-04-29 11:08:47,573 INFO L140 encePairwiseOnDemand]: 170/191 looper letters, 440 selfloop transitions, 103 changer transitions 0/678 dead transitions. [2025-04-29 11:08:47,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 678 transitions, 6392 flow [2025-04-29 11:08:47,573 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-29 11:08:47,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-29 11:08:47,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2502 transitions. [2025-04-29 11:08:47,577 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6894461284100303 [2025-04-29 11:08:47,578 INFO L175 Difference]: Start difference. First operand has 235 places, 486 transitions, 3848 flow. Second operand 19 states and 2502 transitions. [2025-04-29 11:08:47,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 678 transitions, 6392 flow [2025-04-29 11:08:47,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 678 transitions, 6387 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-29 11:08:47,612 INFO L231 Difference]: Finished difference. Result has 259 places, 541 transitions, 4663 flow [2025-04-29 11:08:47,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=3843, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=486, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4663, PETRI_PLACES=259, PETRI_TRANSITIONS=541} [2025-04-29 11:08:47,614 INFO L279 CegarLoopForPetriNet]: 194 programPoint places, 65 predicate places. [2025-04-29 11:08:47,614 INFO L485 AbstractCegarLoop]: Abstraction has has 259 places, 541 transitions, 4663 flow [2025-04-29 11:08:47,614 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 125.07692307692308) internal successors, (1626), 13 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:47,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:47,614 INFO L206 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] [2025-04-29 11:08:47,614 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:08:47,615 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-04-29 11:08:47,615 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:47,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1343336897, now seen corresponding path program 3 times [2025-04-29 11:08:47,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:47,615 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679150070] [2025-04-29 11:08:47,615 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:08:47,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:47,630 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 106 statements into 1 equivalence classes. [2025-04-29 11:08:47,639 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-04-29 11:08:47,639 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-29 11:08:47,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:48,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:48,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:48,017 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679150070] [2025-04-29 11:08:48,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679150070] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:48,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:48,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-29 11:08:48,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087398197] [2025-04-29 11:08:48,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:48,018 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:08:48,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:48,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:08:48,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:08:48,739 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 191 [2025-04-29 11:08:48,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 541 transitions, 4663 flow. Second operand has 13 states, 13 states have (on average 125.07692307692308) internal successors, (1626), 13 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:48,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:48,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 191 [2025-04-29 11:08:48,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:50,095 INFO L116 PetriNetUnfolderBase]: 1782/6423 cut-off events. [2025-04-29 11:08:50,095 INFO L117 PetriNetUnfolderBase]: For 17966/18171 co-relation queries the response was YES. [2025-04-29 11:08:50,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21732 conditions, 6423 events. 1782/6423 cut-off events. For 17966/18171 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 58258 event pairs, 149 based on Foata normal form. 51/6300 useless extension candidates. Maximal degree in co-relation 21632. Up to 1298 conditions per place. [2025-04-29 11:08:50,128 INFO L140 encePairwiseOnDemand]: 158/191 looper letters, 450 selfloop transitions, 226 changer transitions 3/814 dead transitions. [2025-04-29 11:08:50,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 814 transitions, 8471 flow [2025-04-29 11:08:50,132 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-29 11:08:50,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-29 11:08:50,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2700 transitions. [2025-04-29 11:08:50,137 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7068062827225131 [2025-04-29 11:08:50,137 INFO L175 Difference]: Start difference. First operand has 259 places, 541 transitions, 4663 flow. Second operand 20 states and 2700 transitions. [2025-04-29 11:08:50,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 814 transitions, 8471 flow [2025-04-29 11:08:50,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 814 transitions, 8435 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-04-29 11:08:50,195 INFO L231 Difference]: Finished difference. Result has 284 places, 635 transitions, 6870 flow [2025-04-29 11:08:50,196 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=4637, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=6870, PETRI_PLACES=284, PETRI_TRANSITIONS=635} [2025-04-29 11:08:50,197 INFO L279 CegarLoopForPetriNet]: 194 programPoint places, 90 predicate places. [2025-04-29 11:08:50,197 INFO L485 AbstractCegarLoop]: Abstraction has has 284 places, 635 transitions, 6870 flow [2025-04-29 11:08:50,197 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 125.07692307692308) internal successors, (1626), 13 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:50,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:50,197 INFO L206 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] [2025-04-29 11:08:50,198 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:08:50,198 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-04-29 11:08:50,198 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:50,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1539206781, now seen corresponding path program 4 times [2025-04-29 11:08:50,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:50,198 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394397757] [2025-04-29 11:08:50,198 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:08:50,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:50,215 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 106 statements into 2 equivalence classes. [2025-04-29 11:08:50,222 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-04-29 11:08:50,223 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-29 11:08:50,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:50,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:50,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:50,704 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394397757] [2025-04-29 11:08:50,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394397757] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:50,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:50,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-29 11:08:50,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355028017] [2025-04-29 11:08:50,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:50,705 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:08:50,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:50,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:08:50,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:08:51,551 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 191 [2025-04-29 11:08:51,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 635 transitions, 6870 flow. Second operand has 13 states, 13 states have (on average 125.07692307692308) internal successors, (1626), 13 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:51,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:51,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 191 [2025-04-29 11:08:51,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:53,323 INFO L116 PetriNetUnfolderBase]: 2274/8156 cut-off events. [2025-04-29 11:08:53,323 INFO L117 PetriNetUnfolderBase]: For 33847/34168 co-relation queries the response was YES. [2025-04-29 11:08:53,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29684 conditions, 8156 events. 2274/8156 cut-off events. For 33847/34168 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 79096 event pairs, 169 based on Foata normal form. 108/8050 useless extension candidates. Maximal degree in co-relation 29572. Up to 1654 conditions per place. [2025-04-29 11:08:53,370 INFO L140 encePairwiseOnDemand]: 154/191 looper letters, 478 selfloop transitions, 271 changer transitions 4/888 dead transitions. [2025-04-29 11:08:53,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 888 transitions, 10973 flow [2025-04-29 11:08:53,371 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 11:08:53,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-29 11:08:53,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2091 transitions. [2025-04-29 11:08:53,374 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7298429319371728 [2025-04-29 11:08:53,374 INFO L175 Difference]: Start difference. First operand has 284 places, 635 transitions, 6870 flow. Second operand 15 states and 2091 transitions. [2025-04-29 11:08:53,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 888 transitions, 10973 flow [2025-04-29 11:08:53,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 888 transitions, 10916 flow, removed 11 selfloop flow, removed 7 redundant places. [2025-04-29 11:08:53,470 INFO L231 Difference]: Finished difference. Result has 302 places, 722 transitions, 9481 flow [2025-04-29 11:08:53,471 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=6828, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=635, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=185, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=9481, PETRI_PLACES=302, PETRI_TRANSITIONS=722} [2025-04-29 11:08:53,471 INFO L279 CegarLoopForPetriNet]: 194 programPoint places, 108 predicate places. [2025-04-29 11:08:53,472 INFO L485 AbstractCegarLoop]: Abstraction has has 302 places, 722 transitions, 9481 flow [2025-04-29 11:08:53,472 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 125.07692307692308) internal successors, (1626), 13 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:53,472 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:53,472 INFO L206 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] [2025-04-29 11:08:53,472 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:08:53,473 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-04-29 11:08:53,473 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:53,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1237205951, now seen corresponding path program 1 times [2025-04-29 11:08:53,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:53,473 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875688268] [2025-04-29 11:08:53,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:53,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:53,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-04-29 11:08:53,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-04-29 11:08:53,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:53,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:53,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:53,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:53,917 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875688268] [2025-04-29 11:08:53,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875688268] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:53,917 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564102056] [2025-04-29 11:08:53,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:53,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:53,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:53,919 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:08:53,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:08:54,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-04-29 11:08:54,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-04-29 11:08:54,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:54,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:54,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-29 11:08:54,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:08:54,094 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:08:54,163 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:08:54,163 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:08:54,182 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:08:54,190 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-04-29 11:08:54,206 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:08:54,206 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-04-29 11:08:54,226 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:08:54,227 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-04-29 11:08:54,290 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2025-04-29 11:08:54,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:54,299 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:08:56,137 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1 |c_t_funThread1of1ForFork0_init_#t~nondet0#1|)))) (and (forall ((v_ArrVal_1022 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet0#1| (select (select (store .cse0 c_~A~0.base v_ArrVal_1022) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 1)))) (forall ((v_ArrVal_1022 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1022) |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1) |c_t_funThread1of1ForFork0_init_#t~nondet0#1|)) (forall ((v_ArrVal_1022 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1022) |c_t_funThread1of1ForFork0_init_~p#1.base|) |c_t_funThread1of1ForFork0_init_~p#1.offset|) |c_t_funThread1of1ForFork0_init_#t~nondet0#1|)) (forall ((v_ArrVal_1022 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet0#1| (select (select (store .cse0 c_~A~0.base v_ArrVal_1022) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 2))))))) is different from false [2025-04-29 11:08:59,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:59,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564102056] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:08:59,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:08:59,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 17 [2025-04-29 11:08:59,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798722873] [2025-04-29 11:08:59,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:08:59,708 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-29 11:08:59,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:59,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-29 11:08:59,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=201, Unknown=25, NotChecked=30, Total=306 [2025-04-29 11:08:59,840 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 191 [2025-04-29 11:08:59,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 722 transitions, 9481 flow. Second operand has 18 states, 18 states have (on average 90.5) internal successors, (1629), 18 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:59,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:59,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 191 [2025-04-29 11:08:59,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:02,826 INFO L116 PetriNetUnfolderBase]: 4384/12172 cut-off events. [2025-04-29 11:09:02,826 INFO L117 PetriNetUnfolderBase]: For 59160/59353 co-relation queries the response was YES. [2025-04-29 11:09:02,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48415 conditions, 12172 events. 4384/12172 cut-off events. For 59160/59353 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 113706 event pairs, 1067 based on Foata normal form. 49/11868 useless extension candidates. Maximal degree in co-relation 48286. Up to 3840 conditions per place. [2025-04-29 11:09:02,893 INFO L140 encePairwiseOnDemand]: 170/191 looper letters, 672 selfloop transitions, 162 changer transitions 0/913 dead transitions. [2025-04-29 11:09:02,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 913 transitions, 13407 flow [2025-04-29 11:09:02,893 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 11:09:02,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-29 11:09:02,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1447 transitions. [2025-04-29 11:09:02,895 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5411368735976065 [2025-04-29 11:09:02,895 INFO L175 Difference]: Start difference. First operand has 302 places, 722 transitions, 9481 flow. Second operand 14 states and 1447 transitions. [2025-04-29 11:09:02,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 913 transitions, 13407 flow [2025-04-29 11:09:03,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 913 transitions, 13374 flow, removed 14 selfloop flow, removed 3 redundant places. [2025-04-29 11:09:03,063 INFO L231 Difference]: Finished difference. Result has 317 places, 734 transitions, 10153 flow [2025-04-29 11:09:03,063 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=9456, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=722, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=563, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=10153, PETRI_PLACES=317, PETRI_TRANSITIONS=734} [2025-04-29 11:09:03,063 INFO L279 CegarLoopForPetriNet]: 194 programPoint places, 123 predicate places. [2025-04-29 11:09:03,064 INFO L485 AbstractCegarLoop]: Abstraction has has 317 places, 734 transitions, 10153 flow [2025-04-29 11:09:03,064 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 90.5) internal successors, (1629), 18 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:03,064 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:03,064 INFO L206 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] [2025-04-29 11:09:03,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 11:09:03,265 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-29 11:09:03,265 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-04-29 11:09:03,266 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:03,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1448039665, now seen corresponding path program 5 times [2025-04-29 11:09:03,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:03,266 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899217690] [2025-04-29 11:09:03,266 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:09:03,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:03,280 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 106 statements into 2 equivalence classes. [2025-04-29 11:09:03,292 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 106 of 106 statements. [2025-04-29 11:09:03,292 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:09:03,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:03,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:09:03,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:03,728 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899217690] [2025-04-29 11:09:03,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899217690] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:09:03,728 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925595290] [2025-04-29 11:09:03,728 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:09:03,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:03,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:03,730 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:09:03,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 11:09:03,810 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 106 statements into 2 equivalence classes. [2025-04-29 11:09:03,930 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 106 of 106 statements. [2025-04-29 11:09:03,931 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:09:03,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:03,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-29 11:09:03,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:09:04,064 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 11:09:04,086 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-04-29 11:09:04,112 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:04,113 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2025-04-29 11:09:04,179 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:04,179 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2025-04-29 11:09:04,275 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:09:04,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:09:04,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:09:04,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:09:04,281 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:04,281 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 49 [2025-04-29 11:09:04,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:09:04,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:09:11,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:09:11,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925595290] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:09:11,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:09:11,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2025-04-29 11:09:11,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861816070] [2025-04-29 11:09:11,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:09:11,434 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-29 11:09:11,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:11,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-29 11:09:11,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=992, Unknown=1, NotChecked=0, Total=1122 [2025-04-29 11:09:17,187 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-29 11:09:22,101 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-29 11:09:26,740 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-29 11:09:31,915 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-29 11:09:36,026 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-29 11:09:39,317 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Killed by 15