./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/09-regions_09-arraylist.i --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_09-arraylist.i -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 bbb47797d2c6a4d5e961c4dfd7a8e6f4ff79c632e04c289068b1b9e8cca736fa --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:26:58,041 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:26:58,098 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-30 10:26:58,101 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:26:58,101 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:26:58,119 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:26:58,120 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:26:58,120 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:26:58,121 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:26:58,121 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:26:58,121 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:26:58,122 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:26:58,122 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:26:58,122 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:26:58,122 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:26:58,122 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:26:58,122 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:26:58,123 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:26:58,123 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:26:58,123 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:26:58,123 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:26:58,123 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:26:58,123 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-30 10:26:58,123 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:26:58,123 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:26:58,123 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:26:58,123 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:26:58,124 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:26:58,124 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:26:58,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:26:58,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:26:58,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:26:58,124 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:26:58,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:26:58,125 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:26:58,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:26:58,125 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:26:58,125 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:26:58,125 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:26:58,125 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:26:58,125 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:26:58,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:26:58,125 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:26:58,125 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:26:58,125 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:26:58,125 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 -> bbb47797d2c6a4d5e961c4dfd7a8e6f4ff79c632e04c289068b1b9e8cca736fa [2025-04-30 10:26:58,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:26:58,355 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:26:58,357 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:26:58,358 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:26:58,358 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:26:58,359 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_09-arraylist.i [2025-04-30 10:26:59,607 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c15ce429c/1928f04e778f45baa6b9eff33ad133d8/FLAG2ba2c3526 [2025-04-30 10:26:59,851 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:26:59,852 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_09-arraylist.i [2025-04-30 10:26:59,869 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c15ce429c/1928f04e778f45baa6b9eff33ad133d8/FLAG2ba2c3526 [2025-04-30 10:27:00,758 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c15ce429c/1928f04e778f45baa6b9eff33ad133d8 [2025-04-30 10:27:00,760 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:27:00,761 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:27:00,762 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:27:00,762 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:27:00,766 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:27:00,766 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:27:00" (1/1) ... [2025-04-30 10:27:00,767 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d3afb93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:00, skipping insertion in model container [2025-04-30 10:27:00,768 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:27:00" (1/1) ... [2025-04-30 10:27:00,799 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:27:01,234 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:27:01,247 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:27:01,336 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:27:01,396 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:27:01,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:01 WrapperNode [2025-04-30 10:27:01,397 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:27:01,398 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:27:01,398 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:27:01,398 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:27:01,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:01" (1/1) ... [2025-04-30 10:27:01,422 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:01" (1/1) ... [2025-04-30 10:27:01,452 INFO L138 Inliner]: procedures = 372, calls = 43, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 242 [2025-04-30 10:27:01,453 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:27:01,453 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:27:01,453 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:27:01,453 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:27:01,458 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:01" (1/1) ... [2025-04-30 10:27:01,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:01" (1/1) ... [2025-04-30 10:27:01,467 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:01" (1/1) ... [2025-04-30 10:27:01,467 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:01" (1/1) ... [2025-04-30 10:27:01,489 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:01" (1/1) ... [2025-04-30 10:27:01,490 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:01" (1/1) ... [2025-04-30 10:27:01,492 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:01" (1/1) ... [2025-04-30 10:27:01,496 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:01" (1/1) ... [2025-04-30 10:27:01,499 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:01" (1/1) ... [2025-04-30 10:27:01,508 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:27:01,509 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:27:01,509 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:27:01,509 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:27:01,513 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:01" (1/1) ... [2025-04-30 10:27:01,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:27:01,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:27:01,542 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-30 10:27:01,544 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-30 10:27:01,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-04-30 10:27:01,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-04-30 10:27:01,561 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:27:01,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-30 10:27:01,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-30 10:27:01,561 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:27:01,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:27:01,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:27:01,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-04-30 10:27:01,562 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-30 10:27:01,562 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-30 10:27:01,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-30 10:27:01,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:27:01,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:27:01,563 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:27:01,672 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:27:01,674 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:27:02,038 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:27:02,038 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:27:02,052 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:27:02,053 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:27:02,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:27:02 BoogieIcfgContainer [2025-04-30 10:27:02,053 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:27:02,054 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:27:02,054 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:27:02,058 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:27:02,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:27:00" (1/3) ... [2025-04-30 10:27:02,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e75945f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:27:02, skipping insertion in model container [2025-04-30 10:27:02,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:01" (2/3) ... [2025-04-30 10:27:02,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e75945f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:27:02, skipping insertion in model container [2025-04-30 10:27:02,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:27:02" (3/3) ... [2025-04-30 10:27:02,060 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_09-arraylist.i [2025-04-30 10:27:02,070 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:27:02,071 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_09-arraylist.i that has 2 procedures, 284 locations, 285 edges, 1 initial locations, 1 loop locations, and 18 error locations. [2025-04-30 10:27:02,072 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:27:02,148 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-30 10:27:02,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 287 places, 286 transitions, 576 flow [2025-04-30 10:27:02,278 INFO L116 PetriNetUnfolderBase]: 3/285 cut-off events. [2025-04-30 10:27:02,281 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:27:02,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289 conditions, 285 events. 3/285 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 389 event pairs, 0 based on Foata normal form. 0/264 useless extension candidates. Maximal degree in co-relation 157. Up to 2 conditions per place. [2025-04-30 10:27:02,286 INFO L82 GeneralOperation]: Start removeDead. Operand has 287 places, 286 transitions, 576 flow [2025-04-30 10:27:02,294 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 286 places, 285 transitions, 573 flow [2025-04-30 10:27:02,304 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:27:02,313 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;@4b73fc3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:27:02,315 INFO L341 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-04-30 10:27:02,329 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:27:02,330 INFO L116 PetriNetUnfolderBase]: 2/78 cut-off events. [2025-04-30 10:27:02,330 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:27:02,330 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:02,331 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] [2025-04-30 10:27:02,331 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:02,335 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:02,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1492461495, now seen corresponding path program 1 times [2025-04-30 10:27:02,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:02,342 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784132448] [2025-04-30 10:27:02,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:02,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:02,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-30 10:27:02,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-30 10:27:02,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:02,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:02,981 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-30 10:27:02,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:02,984 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784132448] [2025-04-30 10:27:02,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784132448] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:02,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:02,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:02,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17630209] [2025-04-30 10:27:02,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:02,991 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:02,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:03,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:03,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:03,417 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 286 [2025-04-30 10:27:03,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 285 transitions, 573 flow. Second operand has 6 states, 6 states have (on average 202.33333333333334) internal successors, (1214), 6 states have internal predecessors, (1214), 0 states have call successors, (0), 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-30 10:27:03,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:03,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 286 [2025-04-30 10:27:03,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:03,629 INFO L116 PetriNetUnfolderBase]: 365/1634 cut-off events. [2025-04-30 10:27:03,629 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:27:03,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2448 conditions, 1634 events. 365/1634 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10003 event pairs, 364 based on Foata normal form. 11/1518 useless extension candidates. Maximal degree in co-relation 2247. Up to 800 conditions per place. [2025-04-30 10:27:03,639 INFO L140 encePairwiseOnDemand]: 272/286 looper letters, 71 selfloop transitions, 10 changer transitions 1/281 dead transitions. [2025-04-30 10:27:03,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 281 transitions, 727 flow [2025-04-30 10:27:03,640 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:03,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:03,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1291 transitions. [2025-04-30 10:27:03,657 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7523310023310024 [2025-04-30 10:27:03,659 INFO L175 Difference]: Start difference. First operand has 286 places, 285 transitions, 573 flow. Second operand 6 states and 1291 transitions. [2025-04-30 10:27:03,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 281 transitions, 727 flow [2025-04-30 10:27:03,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 281 transitions, 726 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:27:03,669 INFO L231 Difference]: Finished difference. Result has 288 places, 280 transitions, 582 flow [2025-04-30 10:27:03,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=582, PETRI_PLACES=288, PETRI_TRANSITIONS=280} [2025-04-30 10:27:03,674 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 2 predicate places. [2025-04-30 10:27:03,674 INFO L485 AbstractCegarLoop]: Abstraction has has 288 places, 280 transitions, 582 flow [2025-04-30 10:27:03,675 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 202.33333333333334) internal successors, (1214), 6 states have internal predecessors, (1214), 0 states have call successors, (0), 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-30 10:27:03,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:03,675 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] [2025-04-30 10:27:03,676 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:27:03,676 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:03,677 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:03,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1159030418, now seen corresponding path program 1 times [2025-04-30 10:27:03,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:03,677 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670372515] [2025-04-30 10:27:03,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:03,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:03,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-30 10:27:03,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-30 10:27:03,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:03,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:03,746 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-30 10:27:03,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:03,746 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670372515] [2025-04-30 10:27:03,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670372515] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:03,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:03,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:27:03,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264234244] [2025-04-30 10:27:03,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:03,747 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:27:03,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:03,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:27:03,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:27:03,779 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 286 [2025-04-30 10:27:03,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 280 transitions, 582 flow. Second operand has 3 states, 3 states have (on average 275.0) internal successors, (825), 3 states have internal predecessors, (825), 0 states have call successors, (0), 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-30 10:27:03,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:03,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 286 [2025-04-30 10:27:03,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:03,844 INFO L116 PetriNetUnfolderBase]: 7/467 cut-off events. [2025-04-30 10:27:03,845 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:27:03,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 467 events. 7/467 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 860 event pairs, 6 based on Foata normal form. 1/434 useless extension candidates. Maximal degree in co-relation 299. Up to 24 conditions per place. [2025-04-30 10:27:03,846 INFO L140 encePairwiseOnDemand]: 283/286 looper letters, 10 selfloop transitions, 2 changer transitions 0/281 dead transitions. [2025-04-30 10:27:03,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 281 transitions, 608 flow [2025-04-30 10:27:03,847 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:27:03,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:27:03,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 832 transitions. [2025-04-30 10:27:03,848 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9696969696969697 [2025-04-30 10:27:03,848 INFO L175 Difference]: Start difference. First operand has 288 places, 280 transitions, 582 flow. Second operand 3 states and 832 transitions. [2025-04-30 10:27:03,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 281 transitions, 608 flow [2025-04-30 10:27:03,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 281 transitions, 588 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:03,855 INFO L231 Difference]: Finished difference. Result has 285 places, 281 transitions, 574 flow [2025-04-30 10:27:03,856 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=574, PETRI_PLACES=285, PETRI_TRANSITIONS=281} [2025-04-30 10:27:03,857 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, -1 predicate places. [2025-04-30 10:27:03,857 INFO L485 AbstractCegarLoop]: Abstraction has has 285 places, 281 transitions, 574 flow [2025-04-30 10:27:03,857 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 275.0) internal successors, (825), 3 states have internal predecessors, (825), 0 states have call successors, (0), 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-30 10:27:03,857 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:03,858 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] [2025-04-30 10:27:03,858 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:27:03,858 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:03,858 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:03,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1228454811, now seen corresponding path program 1 times [2025-04-30 10:27:03,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:03,861 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011922944] [2025-04-30 10:27:03,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:03,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:03,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-30 10:27:03,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-30 10:27:03,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:03,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:04,180 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-30 10:27:04,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:04,181 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011922944] [2025-04-30 10:27:04,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011922944] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:04,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:04,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:04,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119832355] [2025-04-30 10:27:04,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:04,181 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:04,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:04,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:04,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:04,557 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 286 [2025-04-30 10:27:04,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 281 transitions, 574 flow. Second operand has 6 states, 6 states have (on average 202.33333333333334) internal successors, (1214), 6 states have internal predecessors, (1214), 0 states have call successors, (0), 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-30 10:27:04,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:04,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 286 [2025-04-30 10:27:04,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:04,797 INFO L116 PetriNetUnfolderBase]: 365/1740 cut-off events. [2025-04-30 10:27:04,798 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:27:04,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2600 conditions, 1740 events. 365/1740 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10007 event pairs, 364 based on Foata normal form. 0/1612 useless extension candidates. Maximal degree in co-relation 2408. Up to 830 conditions per place. [2025-04-30 10:27:04,806 INFO L140 encePairwiseOnDemand]: 274/286 looper letters, 71 selfloop transitions, 10 changer transitions 0/279 dead transitions. [2025-04-30 10:27:04,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 279 transitions, 732 flow [2025-04-30 10:27:04,807 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:04,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:04,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1289 transitions. [2025-04-30 10:27:04,811 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7511655011655012 [2025-04-30 10:27:04,811 INFO L175 Difference]: Start difference. First operand has 285 places, 281 transitions, 574 flow. Second operand 6 states and 1289 transitions. [2025-04-30 10:27:04,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 279 transitions, 732 flow [2025-04-30 10:27:04,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 279 transitions, 730 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:27:04,815 INFO L231 Difference]: Finished difference. Result has 287 places, 279 transitions, 588 flow [2025-04-30 10:27:04,816 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=588, PETRI_PLACES=287, PETRI_TRANSITIONS=279} [2025-04-30 10:27:04,816 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 1 predicate places. [2025-04-30 10:27:04,816 INFO L485 AbstractCegarLoop]: Abstraction has has 287 places, 279 transitions, 588 flow [2025-04-30 10:27:04,817 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 202.33333333333334) internal successors, (1214), 6 states have internal predecessors, (1214), 0 states have call successors, (0), 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-30 10:27:04,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:04,817 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] [2025-04-30 10:27:04,817 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:27:04,817 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:04,818 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:04,818 INFO L85 PathProgramCache]: Analyzing trace with hash 274527529, now seen corresponding path program 1 times [2025-04-30 10:27:04,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:04,818 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324235308] [2025-04-30 10:27:04,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:04,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:04,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-04-30 10:27:04,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-04-30 10:27:04,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:04,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:05,194 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-30 10:27:05,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:05,196 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324235308] [2025-04-30 10:27:05,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324235308] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:05,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:05,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:05,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793210926] [2025-04-30 10:27:05,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:05,197 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:05,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:05,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:05,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:05,525 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 286 [2025-04-30 10:27:05,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 279 transitions, 588 flow. Second operand has 6 states, 6 states have (on average 198.83333333333334) internal successors, (1193), 6 states have internal predecessors, (1193), 0 states have call successors, (0), 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-30 10:27:05,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:05,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 286 [2025-04-30 10:27:05,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:05,759 INFO L116 PetriNetUnfolderBase]: 391/1828 cut-off events. [2025-04-30 10:27:05,759 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-30 10:27:05,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2766 conditions, 1828 events. 391/1828 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 10748 event pairs, 390 based on Foata normal form. 0/1696 useless extension candidates. Maximal degree in co-relation 2491. Up to 899 conditions per place. [2025-04-30 10:27:05,765 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 83 selfloop transitions, 5 changer transitions 0/278 dead transitions. [2025-04-30 10:27:05,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 278 transitions, 762 flow [2025-04-30 10:27:05,765 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:05,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:05,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1264 transitions. [2025-04-30 10:27:05,767 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7365967365967366 [2025-04-30 10:27:05,767 INFO L175 Difference]: Start difference. First operand has 287 places, 279 transitions, 588 flow. Second operand 6 states and 1264 transitions. [2025-04-30 10:27:05,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 278 transitions, 762 flow [2025-04-30 10:27:05,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 278 transitions, 742 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:05,770 INFO L231 Difference]: Finished difference. Result has 286 places, 278 transitions, 576 flow [2025-04-30 10:27:05,771 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=576, PETRI_PLACES=286, PETRI_TRANSITIONS=278} [2025-04-30 10:27:05,771 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 0 predicate places. [2025-04-30 10:27:05,771 INFO L485 AbstractCegarLoop]: Abstraction has has 286 places, 278 transitions, 576 flow [2025-04-30 10:27:05,772 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 198.83333333333334) internal successors, (1193), 6 states have internal predecessors, (1193), 0 states have call successors, (0), 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-30 10:27:05,772 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:05,772 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-30 10:27:05,772 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:27:05,773 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:05,773 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:05,773 INFO L85 PathProgramCache]: Analyzing trace with hash 237275780, now seen corresponding path program 1 times [2025-04-30 10:27:05,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:05,773 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526278168] [2025-04-30 10:27:05,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:05,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:05,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-04-30 10:27:05,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-04-30 10:27:05,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:05,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:06,174 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-30 10:27:06,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:06,174 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526278168] [2025-04-30 10:27:06,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526278168] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:06,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:06,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:06,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117615960] [2025-04-30 10:27:06,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:06,175 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:06,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:06,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:06,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:06,665 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 286 [2025-04-30 10:27:06,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 278 transitions, 576 flow. Second operand has 6 states, 6 states have (on average 226.83333333333334) internal successors, (1361), 6 states have internal predecessors, (1361), 0 states have call successors, (0), 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-30 10:27:06,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:06,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 286 [2025-04-30 10:27:06,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:06,770 INFO L116 PetriNetUnfolderBase]: 55/702 cut-off events. [2025-04-30 10:27:06,770 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-30 10:27:06,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 926 conditions, 702 events. 55/702 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2611 event pairs, 54 based on Foata normal form. 0/650 useless extension candidates. Maximal degree in co-relation 717. Up to 195 conditions per place. [2025-04-30 10:27:06,773 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 57 selfloop transitions, 5 changer transitions 0/277 dead transitions. [2025-04-30 10:27:06,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 277 transitions, 698 flow [2025-04-30 10:27:06,773 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:06,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:06,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1394 transitions. [2025-04-30 10:27:06,776 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8123543123543123 [2025-04-30 10:27:06,776 INFO L175 Difference]: Start difference. First operand has 286 places, 278 transitions, 576 flow. Second operand 6 states and 1394 transitions. [2025-04-30 10:27:06,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 277 transitions, 698 flow [2025-04-30 10:27:06,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 277 transitions, 688 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:06,779 INFO L231 Difference]: Finished difference. Result has 285 places, 277 transitions, 574 flow [2025-04-30 10:27:06,779 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=574, PETRI_PLACES=285, PETRI_TRANSITIONS=277} [2025-04-30 10:27:06,780 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, -1 predicate places. [2025-04-30 10:27:06,780 INFO L485 AbstractCegarLoop]: Abstraction has has 285 places, 277 transitions, 574 flow [2025-04-30 10:27:06,781 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 226.83333333333334) internal successors, (1361), 6 states have internal predecessors, (1361), 0 states have call successors, (0), 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-30 10:27:06,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:06,781 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:27:06,781 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:27:06,781 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:06,781 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:06,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1682705097, now seen corresponding path program 1 times [2025-04-30 10:27:06,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:06,782 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495593221] [2025-04-30 10:27:06,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:06,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:06,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-04-30 10:27:06,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-04-30 10:27:06,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:06,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:07,196 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-30 10:27:07,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:07,197 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495593221] [2025-04-30 10:27:07,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495593221] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:07,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:07,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:07,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060869171] [2025-04-30 10:27:07,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:07,198 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:07,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:07,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:07,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:07,553 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 286 [2025-04-30 10:27:07,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 277 transitions, 574 flow. Second operand has 6 states, 6 states have (on average 229.5) internal successors, (1377), 6 states have internal predecessors, (1377), 0 states have call successors, (0), 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-30 10:27:07,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:07,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 286 [2025-04-30 10:27:07,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:07,648 INFO L116 PetriNetUnfolderBase]: 37/617 cut-off events. [2025-04-30 10:27:07,648 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-30 10:27:07,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 617 events. 37/617 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2081 event pairs, 36 based on Foata normal form. 0/578 useless extension candidates. Maximal degree in co-relation 581. Up to 158 conditions per place. [2025-04-30 10:27:07,650 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 53 selfloop transitions, 5 changer transitions 0/276 dead transitions. [2025-04-30 10:27:07,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 276 transitions, 688 flow [2025-04-30 10:27:07,651 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:07,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:07,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1409 transitions. [2025-04-30 10:27:07,653 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8210955710955711 [2025-04-30 10:27:07,653 INFO L175 Difference]: Start difference. First operand has 285 places, 277 transitions, 574 flow. Second operand 6 states and 1409 transitions. [2025-04-30 10:27:07,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 276 transitions, 688 flow [2025-04-30 10:27:07,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 276 transitions, 678 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:07,656 INFO L231 Difference]: Finished difference. Result has 284 places, 276 transitions, 572 flow [2025-04-30 10:27:07,657 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=572, PETRI_PLACES=284, PETRI_TRANSITIONS=276} [2025-04-30 10:27:07,657 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, -2 predicate places. [2025-04-30 10:27:07,657 INFO L485 AbstractCegarLoop]: Abstraction has has 284 places, 276 transitions, 572 flow [2025-04-30 10:27:07,658 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 229.5) internal successors, (1377), 6 states have internal predecessors, (1377), 0 states have call successors, (0), 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-30 10:27:07,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:07,658 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:27:07,658 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:27:07,658 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:07,659 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:07,659 INFO L85 PathProgramCache]: Analyzing trace with hash -47842359, now seen corresponding path program 1 times [2025-04-30 10:27:07,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:07,659 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127738635] [2025-04-30 10:27:07,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:07,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:07,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-04-30 10:27:07,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-04-30 10:27:07,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:07,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:07,960 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-30 10:27:07,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:07,960 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127738635] [2025-04-30 10:27:07,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127738635] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:07,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:07,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:07,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205564341] [2025-04-30 10:27:07,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:07,961 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:07,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:07,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:07,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:08,189 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 286 [2025-04-30 10:27:08,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 276 transitions, 572 flow. Second operand has 6 states, 6 states have (on average 205.16666666666666) internal successors, (1231), 6 states have internal predecessors, (1231), 0 states have call successors, (0), 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-30 10:27:08,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:08,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 286 [2025-04-30 10:27:08,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:08,327 INFO L116 PetriNetUnfolderBase]: 365/1732 cut-off events. [2025-04-30 10:27:08,327 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-30 10:27:08,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2607 conditions, 1732 events. 365/1732 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10007 event pairs, 364 based on Foata normal form. 0/1612 useless extension candidates. Maximal degree in co-relation 2390. Up to 846 conditions per place. [2025-04-30 10:27:08,332 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 79 selfloop transitions, 5 changer transitions 0/275 dead transitions. [2025-04-30 10:27:08,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 275 transitions, 738 flow [2025-04-30 10:27:08,333 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:08,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:08,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1279 transitions. [2025-04-30 10:27:08,335 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7453379953379954 [2025-04-30 10:27:08,335 INFO L175 Difference]: Start difference. First operand has 284 places, 276 transitions, 572 flow. Second operand 6 states and 1279 transitions. [2025-04-30 10:27:08,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 275 transitions, 738 flow [2025-04-30 10:27:08,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 275 transitions, 728 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:08,338 INFO L231 Difference]: Finished difference. Result has 283 places, 275 transitions, 570 flow [2025-04-30 10:27:08,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=570, PETRI_PLACES=283, PETRI_TRANSITIONS=275} [2025-04-30 10:27:08,339 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, -3 predicate places. [2025-04-30 10:27:08,339 INFO L485 AbstractCegarLoop]: Abstraction has has 283 places, 275 transitions, 570 flow [2025-04-30 10:27:08,340 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 205.16666666666666) internal successors, (1231), 6 states have internal predecessors, (1231), 0 states have call successors, (0), 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-30 10:27:08,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:08,340 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, 1, 1, 1, 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-30 10:27:08,340 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:27:08,340 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:08,340 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:08,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1447733978, now seen corresponding path program 1 times [2025-04-30 10:27:08,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:08,341 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103568269] [2025-04-30 10:27:08,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:08,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:08,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-04-30 10:27:08,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-04-30 10:27:08,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:08,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:08,698 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-30 10:27:08,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:08,698 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103568269] [2025-04-30 10:27:08,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103568269] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:08,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:08,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:08,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622967552] [2025-04-30 10:27:08,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:08,699 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:08,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:08,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:08,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:08,936 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 286 [2025-04-30 10:27:08,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 275 transitions, 570 flow. Second operand has 6 states, 6 states have (on average 206.66666666666666) internal successors, (1240), 6 states have internal predecessors, (1240), 0 states have call successors, (0), 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-30 10:27:08,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:08,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 286 [2025-04-30 10:27:08,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:09,153 INFO L116 PetriNetUnfolderBase]: 365/1730 cut-off events. [2025-04-30 10:27:09,153 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-30 10:27:09,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2603 conditions, 1730 events. 365/1730 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 9928 event pairs, 364 based on Foata normal form. 0/1612 useless extension candidates. Maximal degree in co-relation 2395. Up to 844 conditions per place. [2025-04-30 10:27:09,159 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 78 selfloop transitions, 5 changer transitions 0/274 dead transitions. [2025-04-30 10:27:09,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 274 transitions, 734 flow [2025-04-30 10:27:09,159 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:09,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:09,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1284 transitions. [2025-04-30 10:27:09,161 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7482517482517482 [2025-04-30 10:27:09,161 INFO L175 Difference]: Start difference. First operand has 283 places, 275 transitions, 570 flow. Second operand 6 states and 1284 transitions. [2025-04-30 10:27:09,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 274 transitions, 734 flow [2025-04-30 10:27:09,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 274 transitions, 724 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:09,164 INFO L231 Difference]: Finished difference. Result has 282 places, 274 transitions, 568 flow [2025-04-30 10:27:09,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=568, PETRI_PLACES=282, PETRI_TRANSITIONS=274} [2025-04-30 10:27:09,165 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, -4 predicate places. [2025-04-30 10:27:09,165 INFO L485 AbstractCegarLoop]: Abstraction has has 282 places, 274 transitions, 568 flow [2025-04-30 10:27:09,166 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 206.66666666666666) internal successors, (1240), 6 states have internal predecessors, (1240), 0 states have call successors, (0), 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-30 10:27:09,166 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:09,166 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:27:09,166 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:27:09,166 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:09,167 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:09,167 INFO L85 PathProgramCache]: Analyzing trace with hash -482020515, now seen corresponding path program 1 times [2025-04-30 10:27:09,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:09,167 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335628723] [2025-04-30 10:27:09,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:09,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:09,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-04-30 10:27:09,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-04-30 10:27:09,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:09,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:09,284 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:27:09,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:09,285 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335628723] [2025-04-30 10:27:09,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335628723] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:27:09,285 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317940927] [2025-04-30 10:27:09,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:09,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:27:09,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:27:09,287 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-30 10:27:09,289 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-30 10:27:09,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-04-30 10:27:09,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-04-30 10:27:09,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:09,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:09,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:27:09,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:27:09,623 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:27:09,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:27:09,752 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:27:09,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317940927] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:27:09,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:27:09,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-04-30 10:27:09,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030915582] [2025-04-30 10:27:09,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:27:09,753 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:27:09,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:09,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:27:09,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:27:09,880 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 286 [2025-04-30 10:27:09,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 274 transitions, 568 flow. Second operand has 10 states, 10 states have (on average 272.0) internal successors, (2720), 10 states have internal predecessors, (2720), 0 states have call successors, (0), 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-30 10:27:09,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:09,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 286 [2025-04-30 10:27:09,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:09,974 INFO L116 PetriNetUnfolderBase]: 7/560 cut-off events. [2025-04-30 10:27:09,974 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:27:09,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 621 conditions, 560 events. 7/560 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 393 event pairs, 6 based on Foata normal form. 2/542 useless extension candidates. Maximal degree in co-relation 244. Up to 24 conditions per place. [2025-04-30 10:27:09,976 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 14 selfloop transitions, 9 changer transitions 0/282 dead transitions. [2025-04-30 10:27:09,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 282 transitions, 632 flow [2025-04-30 10:27:09,976 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:27:09,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-30 10:27:09,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2455 transitions. [2025-04-30 10:27:09,980 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9537684537684538 [2025-04-30 10:27:09,980 INFO L175 Difference]: Start difference. First operand has 282 places, 274 transitions, 568 flow. Second operand 9 states and 2455 transitions. [2025-04-30 10:27:09,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 282 transitions, 632 flow [2025-04-30 10:27:09,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 282 transitions, 622 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:09,985 INFO L231 Difference]: Finished difference. Result has 288 places, 280 transitions, 608 flow [2025-04-30 10:27:09,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=608, PETRI_PLACES=288, PETRI_TRANSITIONS=280} [2025-04-30 10:27:09,986 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 2 predicate places. [2025-04-30 10:27:09,987 INFO L485 AbstractCegarLoop]: Abstraction has has 288 places, 280 transitions, 608 flow [2025-04-30 10:27:09,988 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 272.0) internal successors, (2720), 10 states have internal predecessors, (2720), 0 states have call successors, (0), 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-30 10:27:09,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:09,989 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:27:09,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-30 10:27:10,189 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:27:10,189 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:10,194 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:10,194 INFO L85 PathProgramCache]: Analyzing trace with hash -714359171, now seen corresponding path program 2 times [2025-04-30 10:27:10,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:10,194 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843967105] [2025-04-30 10:27:10,194 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:27:10,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:10,249 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 367 statements into 2 equivalence classes. [2025-04-30 10:27:10,252 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 52 of 367 statements. [2025-04-30 10:27:10,253 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:27:10,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:10,380 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2025-04-30 10:27:10,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:10,381 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843967105] [2025-04-30 10:27:10,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843967105] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:10,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:10,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:10,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727412497] [2025-04-30 10:27:10,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:10,382 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:10,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:10,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:10,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:10,860 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 286 [2025-04-30 10:27:10,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 280 transitions, 608 flow. Second operand has 6 states, 6 states have (on average 231.33333333333334) internal successors, (1388), 6 states have internal predecessors, (1388), 0 states have call successors, (0), 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-30 10:27:10,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:10,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 286 [2025-04-30 10:27:10,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:11,238 INFO L116 PetriNetUnfolderBase]: 257/1877 cut-off events. [2025-04-30 10:27:11,239 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-30 10:27:11,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2543 conditions, 1877 events. 257/1877 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 10128 event pairs, 36 based on Foata normal form. 0/1751 useless extension candidates. Maximal degree in co-relation 2076. Up to 491 conditions per place. [2025-04-30 10:27:11,245 INFO L140 encePairwiseOnDemand]: 263/286 looper letters, 67 selfloop transitions, 70 changer transitions 0/358 dead transitions. [2025-04-30 10:27:11,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 358 transitions, 1038 flow [2025-04-30 10:27:11,246 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:11,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:11,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1488 transitions. [2025-04-30 10:27:11,248 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8671328671328671 [2025-04-30 10:27:11,248 INFO L175 Difference]: Start difference. First operand has 288 places, 280 transitions, 608 flow. Second operand 6 states and 1488 transitions. [2025-04-30 10:27:11,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 358 transitions, 1038 flow [2025-04-30 10:27:11,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 358 transitions, 1032 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-30 10:27:11,253 INFO L231 Difference]: Finished difference. Result has 297 places, 349 transitions, 1064 flow [2025-04-30 10:27:11,254 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1064, PETRI_PLACES=297, PETRI_TRANSITIONS=349} [2025-04-30 10:27:11,254 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 11 predicate places. [2025-04-30 10:27:11,254 INFO L485 AbstractCegarLoop]: Abstraction has has 297 places, 349 transitions, 1064 flow [2025-04-30 10:27:11,255 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 231.33333333333334) internal successors, (1388), 6 states have internal predecessors, (1388), 0 states have call successors, (0), 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-30 10:27:11,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:11,256 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:27:11,256 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:27:11,256 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:11,257 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:11,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1879300258, now seen corresponding path program 1 times [2025-04-30 10:27:11,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:11,257 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30801296] [2025-04-30 10:27:11,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:11,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:11,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-04-30 10:27:11,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-04-30 10:27:11,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:11,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:11,645 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-30 10:27:11,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:11,645 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30801296] [2025-04-30 10:27:11,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30801296] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:27:11,646 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085837787] [2025-04-30 10:27:11,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:11,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:27:11,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:27:11,648 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-30 10:27:11,649 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-30 10:27:11,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-04-30 10:27:11,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-04-30 10:27:11,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:11,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:11,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 1430 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:27:11,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:27:12,340 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-30 10:27:12,341 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:27:12,702 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-30 10:27:12,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085837787] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:27:12,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:27:12,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-04-30 10:27:12,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175271305] [2025-04-30 10:27:12,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:27:12,703 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-30 10:27:12,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:12,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-30 10:27:12,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-04-30 10:27:12,867 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 286 [2025-04-30 10:27:12,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 349 transitions, 1064 flow. Second operand has 18 states, 18 states have (on average 272.0) internal successors, (4896), 18 states have internal predecessors, (4896), 0 states have call successors, (0), 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-30 10:27:12,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:12,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 286 [2025-04-30 10:27:12,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:13,275 INFO L116 PetriNetUnfolderBase]: 165/2012 cut-off events. [2025-04-30 10:27:13,275 INFO L117 PetriNetUnfolderBase]: For 184/191 co-relation queries the response was YES. [2025-04-30 10:27:13,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2752 conditions, 2012 events. 165/2012 cut-off events. For 184/191 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7517 event pairs, 23 based on Foata normal form. 4/1930 useless extension candidates. Maximal degree in co-relation 1895. Up to 207 conditions per place. [2025-04-30 10:27:13,281 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 19 selfloop transitions, 21 changer transitions 0/367 dead transitions. [2025-04-30 10:27:13,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 367 transitions, 1232 flow [2025-04-30 10:27:13,281 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-30 10:27:13,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-30 10:27:13,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 5713 transitions. [2025-04-30 10:27:13,288 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9512154512154513 [2025-04-30 10:27:13,288 INFO L175 Difference]: Start difference. First operand has 297 places, 349 transitions, 1064 flow. Second operand 21 states and 5713 transitions. [2025-04-30 10:27:13,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 367 transitions, 1232 flow [2025-04-30 10:27:13,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 367 transitions, 1232 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:27:13,294 INFO L231 Difference]: Finished difference. Result has 322 places, 362 transitions, 1194 flow [2025-04-30 10:27:13,294 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=1064, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1194, PETRI_PLACES=322, PETRI_TRANSITIONS=362} [2025-04-30 10:27:13,295 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 36 predicate places. [2025-04-30 10:27:13,295 INFO L485 AbstractCegarLoop]: Abstraction has has 322 places, 362 transitions, 1194 flow [2025-04-30 10:27:13,296 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 272.0) internal successors, (4896), 18 states have internal predecessors, (4896), 0 states have call successors, (0), 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-30 10:27:13,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:13,297 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:27:13,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-30 10:27:13,497 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-30 10:27:13,497 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:13,498 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:13,499 INFO L85 PathProgramCache]: Analyzing trace with hash -231639650, now seen corresponding path program 2 times [2025-04-30 10:27:13,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:13,499 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765068063] [2025-04-30 10:27:13,499 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:27:13,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:13,587 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 793 statements into 2 equivalence classes. [2025-04-30 10:27:13,589 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 58 of 793 statements. [2025-04-30 10:27:13,590 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:27:13,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:13,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2947 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2947 trivial. 0 not checked. [2025-04-30 10:27:13,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:13,697 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765068063] [2025-04-30 10:27:13,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765068063] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:13,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:13,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:13,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935675708] [2025-04-30 10:27:13,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:13,698 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:13,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:13,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:13,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:14,070 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 286 [2025-04-30 10:27:14,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 362 transitions, 1194 flow. Second operand has 6 states, 6 states have (on average 231.16666666666666) internal successors, (1387), 6 states have internal predecessors, (1387), 0 states have call successors, (0), 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-30 10:27:14,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:14,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 286 [2025-04-30 10:27:14,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:14,770 INFO L116 PetriNetUnfolderBase]: 530/3081 cut-off events. [2025-04-30 10:27:14,770 INFO L117 PetriNetUnfolderBase]: For 850/943 co-relation queries the response was YES. [2025-04-30 10:27:14,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5390 conditions, 3081 events. 530/3081 cut-off events. For 850/943 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 16083 event pairs, 93 based on Foata normal form. 16/2932 useless extension candidates. Maximal degree in co-relation 4329. Up to 981 conditions per place. [2025-04-30 10:27:14,781 INFO L140 encePairwiseOnDemand]: 263/286 looper letters, 131 selfloop transitions, 130 changer transitions 0/499 dead transitions. [2025-04-30 10:27:14,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 499 transitions, 2366 flow [2025-04-30 10:27:14,782 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:14,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:14,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1487 transitions. [2025-04-30 10:27:14,784 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8665501165501166 [2025-04-30 10:27:14,784 INFO L175 Difference]: Start difference. First operand has 322 places, 362 transitions, 1194 flow. Second operand 6 states and 1487 transitions. [2025-04-30 10:27:14,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 499 transitions, 2366 flow [2025-04-30 10:27:14,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 499 transitions, 2342 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-30 10:27:14,792 INFO L231 Difference]: Finished difference. Result has 326 places, 491 transitions, 2398 flow [2025-04-30 10:27:14,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=1170, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2398, PETRI_PLACES=326, PETRI_TRANSITIONS=491} [2025-04-30 10:27:14,793 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 40 predicate places. [2025-04-30 10:27:14,793 INFO L485 AbstractCegarLoop]: Abstraction has has 326 places, 491 transitions, 2398 flow [2025-04-30 10:27:14,793 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 231.16666666666666) internal successors, (1387), 6 states have internal predecessors, (1387), 0 states have call successors, (0), 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-30 10:27:14,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:14,794 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:27:14,794 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:27:14,794 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:14,795 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:14,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1607674040, now seen corresponding path program 1 times [2025-04-30 10:27:14,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:14,795 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13052371] [2025-04-30 10:27:14,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:14,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:14,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 803 statements into 1 equivalence classes. [2025-04-30 10:27:14,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 803 of 803 statements. [2025-04-30 10:27:14,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:14,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:16,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2947 backedges. 0 proven. 2842 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-04-30 10:27:16,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:16,024 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13052371] [2025-04-30 10:27:16,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13052371] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:27:16,024 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491564020] [2025-04-30 10:27:16,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:16,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:27:16,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:27:16,026 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:27:16,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-30 10:27:16,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 803 statements into 1 equivalence classes. [2025-04-30 10:27:16,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 803 of 803 statements. [2025-04-30 10:27:16,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:16,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:16,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 3147 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-30 10:27:16,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:27:17,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2947 backedges. 0 proven. 2842 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-04-30 10:27:17,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:27:17,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2947 backedges. 0 proven. 2842 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-04-30 10:27:17,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491564020] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:27:17,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:27:17,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-04-30 10:27:17,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160846478] [2025-04-30 10:27:17,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:27:17,869 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-30 10:27:17,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:17,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-30 10:27:17,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-04-30 10:27:18,074 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 286 [2025-04-30 10:27:18,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 491 transitions, 2398 flow. Second operand has 23 states, 23 states have (on average 272.0869565217391) internal successors, (6258), 23 states have internal predecessors, (6258), 0 states have call successors, (0), 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-30 10:27:18,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:18,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 286 [2025-04-30 10:27:18,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:18,902 INFO L116 PetriNetUnfolderBase]: 404/3056 cut-off events. [2025-04-30 10:27:18,902 INFO L117 PetriNetUnfolderBase]: For 1167/1209 co-relation queries the response was YES. [2025-04-30 10:27:18,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5237 conditions, 3056 events. 404/3056 cut-off events. For 1167/1209 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 13239 event pairs, 37 based on Foata normal form. 7/2955 useless extension candidates. Maximal degree in co-relation 3992. Up to 467 conditions per place. [2025-04-30 10:27:18,914 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 22 selfloop transitions, 30 changer transitions 0/508 dead transitions. [2025-04-30 10:27:18,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 508 transitions, 2624 flow [2025-04-30 10:27:18,914 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-30 10:27:18,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-30 10:27:18,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 8154 transitions. [2025-04-30 10:27:18,920 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9503496503496504 [2025-04-30 10:27:18,920 INFO L175 Difference]: Start difference. First operand has 326 places, 491 transitions, 2398 flow. Second operand 30 states and 8154 transitions. [2025-04-30 10:27:18,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 508 transitions, 2624 flow [2025-04-30 10:27:18,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 508 transitions, 2624 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:27:18,933 INFO L231 Difference]: Finished difference. Result has 359 places, 501 transitions, 2550 flow [2025-04-30 10:27:18,934 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=2398, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=491, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=2550, PETRI_PLACES=359, PETRI_TRANSITIONS=501} [2025-04-30 10:27:18,935 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 73 predicate places. [2025-04-30 10:27:18,935 INFO L485 AbstractCegarLoop]: Abstraction has has 359 places, 501 transitions, 2550 flow [2025-04-30 10:27:18,937 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 272.0869565217391) internal successors, (6258), 23 states have internal predecessors, (6258), 0 states have call successors, (0), 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-30 10:27:18,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:18,937 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:27:18,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-30 10:27:19,137 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:27:19,138 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:19,140 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:19,140 INFO L85 PathProgramCache]: Analyzing trace with hash 2063939161, now seen corresponding path program 2 times [2025-04-30 10:27:19,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:19,140 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843610298] [2025-04-30 10:27:19,140 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:27:19,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:19,263 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1118 statements into 2 equivalence classes. [2025-04-30 10:27:19,268 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 68 of 1118 statements. [2025-04-30 10:27:19,268 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:27:19,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:19,402 INFO L134 CoverageAnalysis]: Checked inductivity of 6235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6235 trivial. 0 not checked. [2025-04-30 10:27:19,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:19,403 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843610298] [2025-04-30 10:27:19,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843610298] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:19,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:19,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:19,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045919609] [2025-04-30 10:27:19,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:19,404 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:19,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:19,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:19,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:19,676 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 286 [2025-04-30 10:27:19,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 501 transitions, 2550 flow. Second operand has 6 states, 6 states have (on average 231.33333333333334) internal successors, (1388), 6 states have internal predecessors, (1388), 0 states have call successors, (0), 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-30 10:27:19,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:19,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 286 [2025-04-30 10:27:19,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:20,668 INFO L116 PetriNetUnfolderBase]: 806/4138 cut-off events. [2025-04-30 10:27:20,668 INFO L117 PetriNetUnfolderBase]: For 3330/3563 co-relation queries the response was YES. [2025-04-30 10:27:20,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8698 conditions, 4138 events. 806/4138 cut-off events. For 3330/3563 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 22215 event pairs, 65 based on Foata normal form. 52/4025 useless extension candidates. Maximal degree in co-relation 7170. Up to 1323 conditions per place. [2025-04-30 10:27:20,684 INFO L140 encePairwiseOnDemand]: 263/286 looper letters, 251 selfloop transitions, 131 changer transitions 5/639 dead transitions. [2025-04-30 10:27:20,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 639 transitions, 4224 flow [2025-04-30 10:27:20,684 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:20,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:20,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1488 transitions. [2025-04-30 10:27:20,685 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8671328671328671 [2025-04-30 10:27:20,685 INFO L175 Difference]: Start difference. First operand has 359 places, 501 transitions, 2550 flow. Second operand 6 states and 1488 transitions. [2025-04-30 10:27:20,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 639 transitions, 4224 flow [2025-04-30 10:27:20,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 639 transitions, 4178 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-04-30 10:27:20,698 INFO L231 Difference]: Finished difference. Result has 351 places, 629 transitions, 3984 flow [2025-04-30 10:27:20,699 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=2504, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3984, PETRI_PLACES=351, PETRI_TRANSITIONS=629} [2025-04-30 10:27:20,699 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 65 predicate places. [2025-04-30 10:27:20,699 INFO L485 AbstractCegarLoop]: Abstraction has has 351 places, 629 transitions, 3984 flow [2025-04-30 10:27:20,700 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 231.33333333333334) internal successors, (1388), 6 states have internal predecessors, (1388), 0 states have call successors, (0), 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-30 10:27:20,700 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:20,700 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:27:20,700 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:27:20,700 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:20,703 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:20,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1371550194, now seen corresponding path program 1 times [2025-04-30 10:27:20,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:20,703 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462611789] [2025-04-30 10:27:20,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:20,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:20,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1119 statements into 1 equivalence classes. [2025-04-30 10:27:20,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1119 of 1119 statements. [2025-04-30 10:27:20,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:20,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:23,426 INFO L134 CoverageAnalysis]: Checked inductivity of 6235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6235 trivial. 0 not checked. [2025-04-30 10:27:23,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:23,426 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462611789] [2025-04-30 10:27:23,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462611789] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:23,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:23,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:23,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717585094] [2025-04-30 10:27:23,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:23,427 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:23,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:23,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:23,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:23,752 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 286 [2025-04-30 10:27:23,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 629 transitions, 3984 flow. Second operand has 6 states, 6 states have (on average 211.66666666666666) internal successors, (1270), 6 states have internal predecessors, (1270), 0 states have call successors, (0), 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-30 10:27:23,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:23,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 286 [2025-04-30 10:27:23,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:25,210 INFO L116 PetriNetUnfolderBase]: 1308/5506 cut-off events. [2025-04-30 10:27:25,210 INFO L117 PetriNetUnfolderBase]: For 4890/4947 co-relation queries the response was YES. [2025-04-30 10:27:25,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13385 conditions, 5506 events. 1308/5506 cut-off events. For 4890/4947 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 33839 event pairs, 369 based on Foata normal form. 11/5272 useless extension candidates. Maximal degree in co-relation 11796. Up to 2549 conditions per place. [2025-04-30 10:27:25,234 INFO L140 encePairwiseOnDemand]: 267/286 looper letters, 316 selfloop transitions, 84 changer transitions 0/708 dead transitions. [2025-04-30 10:27:25,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 708 transitions, 5182 flow [2025-04-30 10:27:25,235 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:25,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:25,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1366 transitions. [2025-04-30 10:27:25,236 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.796037296037296 [2025-04-30 10:27:25,236 INFO L175 Difference]: Start difference. First operand has 351 places, 629 transitions, 3984 flow. Second operand 6 states and 1366 transitions. [2025-04-30 10:27:25,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 708 transitions, 5182 flow [2025-04-30 10:27:25,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 708 transitions, 4928 flow, removed 127 selfloop flow, removed 0 redundant places. [2025-04-30 10:27:25,260 INFO L231 Difference]: Finished difference. Result has 360 places, 700 transitions, 4520 flow [2025-04-30 10:27:25,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=3736, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=629, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4520, PETRI_PLACES=360, PETRI_TRANSITIONS=700} [2025-04-30 10:27:25,261 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 74 predicate places. [2025-04-30 10:27:25,261 INFO L485 AbstractCegarLoop]: Abstraction has has 360 places, 700 transitions, 4520 flow [2025-04-30 10:27:25,262 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 211.66666666666666) internal successors, (1270), 6 states have internal predecessors, (1270), 0 states have call successors, (0), 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-30 10:27:25,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:25,262 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:27:25,262 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-30 10:27:25,262 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:25,265 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:25,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1943203997, now seen corresponding path program 1 times [2025-04-30 10:27:25,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:25,265 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776022225] [2025-04-30 10:27:25,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:25,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:25,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1125 statements into 1 equivalence classes. [2025-04-30 10:27:25,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1125 of 1125 statements. [2025-04-30 10:27:25,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:25,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:26,295 INFO L134 CoverageAnalysis]: Checked inductivity of 6235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6235 trivial. 0 not checked. [2025-04-30 10:27:26,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:26,296 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776022225] [2025-04-30 10:27:26,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776022225] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:26,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:26,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:27:26,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693726212] [2025-04-30 10:27:26,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:26,297 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:27:26,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:26,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:27:26,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:27:26,304 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 286 [2025-04-30 10:27:26,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 700 transitions, 4520 flow. Second operand has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 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-30 10:27:26,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:26,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 286 [2025-04-30 10:27:26,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:26,504 INFO L116 PetriNetUnfolderBase]: 3/1385 cut-off events. [2025-04-30 10:27:26,504 INFO L117 PetriNetUnfolderBase]: For 221/222 co-relation queries the response was YES. [2025-04-30 10:27:26,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1823 conditions, 1385 events. 3/1385 cut-off events. For 221/222 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 559 event pairs, 1 based on Foata normal form. 3/1373 useless extension candidates. Maximal degree in co-relation 1489. Up to 51 conditions per place. [2025-04-30 10:27:26,508 INFO L140 encePairwiseOnDemand]: 282/286 looper letters, 2 selfloop transitions, 4 changer transitions 0/300 dead transitions. [2025-04-30 10:27:26,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 300 transitions, 1040 flow [2025-04-30 10:27:26,508 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:27:26,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:27:26,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 842 transitions. [2025-04-30 10:27:26,509 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9813519813519813 [2025-04-30 10:27:26,509 INFO L175 Difference]: Start difference. First operand has 360 places, 700 transitions, 4520 flow. Second operand 3 states and 842 transitions. [2025-04-30 10:27:26,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 300 transitions, 1040 flow [2025-04-30 10:27:26,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 300 transitions, 836 flow, removed 62 selfloop flow, removed 36 redundant places. [2025-04-30 10:27:26,514 INFO L231 Difference]: Finished difference. Result has 322 places, 300 transitions, 832 flow [2025-04-30 10:27:26,514 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=832, PETRI_PLACES=322, PETRI_TRANSITIONS=300} [2025-04-30 10:27:26,515 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 36 predicate places. [2025-04-30 10:27:26,515 INFO L485 AbstractCegarLoop]: Abstraction has has 322 places, 300 transitions, 832 flow [2025-04-30 10:27:26,515 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 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-30 10:27:26,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:26,516 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:27:26,516 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-30 10:27:26,516 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:26,519 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:26,519 INFO L85 PathProgramCache]: Analyzing trace with hash -490482569, now seen corresponding path program 1 times [2025-04-30 10:27:26,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:26,519 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474428421] [2025-04-30 10:27:26,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:26,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:26,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1127 statements into 1 equivalence classes. [2025-04-30 10:27:26,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1127 of 1127 statements. [2025-04-30 10:27:26,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:26,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:29,252 INFO L134 CoverageAnalysis]: Checked inductivity of 6235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6235 trivial. 0 not checked. [2025-04-30 10:27:29,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:29,252 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474428421] [2025-04-30 10:27:29,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474428421] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:29,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:29,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:29,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509544247] [2025-04-30 10:27:29,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:29,253 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:29,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:29,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:29,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:29,474 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 286 [2025-04-30 10:27:29,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 300 transitions, 832 flow. Second operand has 6 states, 6 states have (on average 211.66666666666666) internal successors, (1270), 6 states have internal predecessors, (1270), 0 states have call successors, (0), 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-30 10:27:29,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:29,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 286 [2025-04-30 10:27:29,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:29,803 INFO L116 PetriNetUnfolderBase]: 3/1382 cut-off events. [2025-04-30 10:27:29,803 INFO L117 PetriNetUnfolderBase]: For 137/142 co-relation queries the response was YES. [2025-04-30 10:27:29,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2018 conditions, 1382 events. 3/1382 cut-off events. For 137/142 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 544 event pairs, 1 based on Foata normal form. 0/1370 useless extension candidates. Maximal degree in co-relation 1721. Up to 456 conditions per place. [2025-04-30 10:27:29,805 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 74 selfloop transitions, 5 changer transitions 0/299 dead transitions. [2025-04-30 10:27:29,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 299 transitions, 988 flow [2025-04-30 10:27:29,806 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:29,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:29,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1304 transitions. [2025-04-30 10:27:29,807 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7599067599067599 [2025-04-30 10:27:29,807 INFO L175 Difference]: Start difference. First operand has 322 places, 300 transitions, 832 flow. Second operand 6 states and 1304 transitions. [2025-04-30 10:27:29,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 299 transitions, 988 flow [2025-04-30 10:27:29,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 299 transitions, 981 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:27:29,812 INFO L231 Difference]: Finished difference. Result has 324 places, 299 transitions, 833 flow [2025-04-30 10:27:29,812 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=823, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=833, PETRI_PLACES=324, PETRI_TRANSITIONS=299} [2025-04-30 10:27:29,812 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 38 predicate places. [2025-04-30 10:27:29,812 INFO L485 AbstractCegarLoop]: Abstraction has has 324 places, 299 transitions, 833 flow [2025-04-30 10:27:29,817 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 211.66666666666666) internal successors, (1270), 6 states have internal predecessors, (1270), 0 states have call successors, (0), 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-30 10:27:29,818 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:29,818 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:27:29,818 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-30 10:27:29,818 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:29,821 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:29,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1477310159, now seen corresponding path program 1 times [2025-04-30 10:27:29,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:29,821 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807715848] [2025-04-30 10:27:29,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:29,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:29,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1138 statements into 1 equivalence classes. [2025-04-30 10:27:30,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1138 of 1138 statements. [2025-04-30 10:27:30,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:30,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:32,343 INFO L134 CoverageAnalysis]: Checked inductivity of 6235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6235 trivial. 0 not checked. [2025-04-30 10:27:32,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:32,343 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807715848] [2025-04-30 10:27:32,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807715848] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:32,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:32,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:32,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035414016] [2025-04-30 10:27:32,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:32,343 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:32,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:32,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:32,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:32,663 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 286 [2025-04-30 10:27:32,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 299 transitions, 833 flow. Second operand has 6 states, 6 states have (on average 234.5) internal successors, (1407), 6 states have internal predecessors, (1407), 0 states have call successors, (0), 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-30 10:27:32,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:32,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 286 [2025-04-30 10:27:32,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:32,924 INFO L116 PetriNetUnfolderBase]: 5/1413 cut-off events. [2025-04-30 10:27:32,925 INFO L117 PetriNetUnfolderBase]: For 134/135 co-relation queries the response was YES. [2025-04-30 10:27:32,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1952 conditions, 1413 events. 5/1413 cut-off events. For 134/135 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 669 event pairs, 3 based on Foata normal form. 0/1403 useless extension candidates. Maximal degree in co-relation 1661. Up to 345 conditions per place. [2025-04-30 10:27:32,927 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 52 selfloop transitions, 5 changer transitions 0/298 dead transitions. [2025-04-30 10:27:32,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 298 transitions, 945 flow [2025-04-30 10:27:32,927 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:32,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:32,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1419 transitions. [2025-04-30 10:27:32,928 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8269230769230769 [2025-04-30 10:27:32,928 INFO L175 Difference]: Start difference. First operand has 324 places, 299 transitions, 833 flow. Second operand 6 states and 1419 transitions. [2025-04-30 10:27:32,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 298 transitions, 945 flow [2025-04-30 10:27:32,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 298 transitions, 935 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:32,932 INFO L231 Difference]: Finished difference. Result has 323 places, 298 transitions, 831 flow [2025-04-30 10:27:32,932 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=831, PETRI_PLACES=323, PETRI_TRANSITIONS=298} [2025-04-30 10:27:32,932 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 37 predicate places. [2025-04-30 10:27:32,932 INFO L485 AbstractCegarLoop]: Abstraction has has 323 places, 298 transitions, 831 flow [2025-04-30 10:27:32,933 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 234.5) internal successors, (1407), 6 states have internal predecessors, (1407), 0 states have call successors, (0), 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-30 10:27:32,933 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:32,933 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:27:32,933 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-30 10:27:32,933 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:32,936 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:32,936 INFO L85 PathProgramCache]: Analyzing trace with hash 964719799, now seen corresponding path program 1 times [2025-04-30 10:27:32,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:32,936 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100903928] [2025-04-30 10:27:32,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:32,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:33,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1148 statements into 1 equivalence classes. [2025-04-30 10:27:33,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1148 of 1148 statements. [2025-04-30 10:27:33,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:33,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:35,530 INFO L134 CoverageAnalysis]: Checked inductivity of 6235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6235 trivial. 0 not checked. [2025-04-30 10:27:35,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:35,530 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100903928] [2025-04-30 10:27:35,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100903928] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:35,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:35,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:35,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516974634] [2025-04-30 10:27:35,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:35,532 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:35,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:35,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:35,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:35,829 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 286 [2025-04-30 10:27:35,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 298 transitions, 831 flow. Second operand has 6 states, 6 states have (on average 232.5) internal successors, (1395), 6 states have internal predecessors, (1395), 0 states have call successors, (0), 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-30 10:27:35,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:35,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 286 [2025-04-30 10:27:35,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:36,050 INFO L116 PetriNetUnfolderBase]: 3/1376 cut-off events. [2025-04-30 10:27:36,050 INFO L117 PetriNetUnfolderBase]: For 133/134 co-relation queries the response was YES. [2025-04-30 10:27:36,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1917 conditions, 1376 events. 3/1376 cut-off events. For 133/134 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 507 event pairs, 1 based on Foata normal form. 0/1373 useless extension candidates. Maximal degree in co-relation 1662. Up to 351 conditions per place. [2025-04-30 10:27:36,053 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 54 selfloop transitions, 5 changer transitions 0/297 dead transitions. [2025-04-30 10:27:36,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 297 transitions, 947 flow [2025-04-30 10:27:36,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:36,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:36,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1409 transitions. [2025-04-30 10:27:36,054 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8210955710955711 [2025-04-30 10:27:36,054 INFO L175 Difference]: Start difference. First operand has 323 places, 298 transitions, 831 flow. Second operand 6 states and 1409 transitions. [2025-04-30 10:27:36,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 297 transitions, 947 flow [2025-04-30 10:27:36,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 297 transitions, 937 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:36,058 INFO L231 Difference]: Finished difference. Result has 322 places, 297 transitions, 829 flow [2025-04-30 10:27:36,058 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=819, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=829, PETRI_PLACES=322, PETRI_TRANSITIONS=297} [2025-04-30 10:27:36,059 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 36 predicate places. [2025-04-30 10:27:36,059 INFO L485 AbstractCegarLoop]: Abstraction has has 322 places, 297 transitions, 829 flow [2025-04-30 10:27:36,059 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 232.5) internal successors, (1395), 6 states have internal predecessors, (1395), 0 states have call successors, (0), 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-30 10:27:36,059 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:36,059 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:27:36,059 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-30 10:27:36,059 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:36,061 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:36,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1953712153, now seen corresponding path program 1 times [2025-04-30 10:27:36,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:36,062 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967484787] [2025-04-30 10:27:36,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:36,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:36,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1157 statements into 1 equivalence classes. [2025-04-30 10:27:36,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1157 of 1157 statements. [2025-04-30 10:27:36,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:36,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:38,621 INFO L134 CoverageAnalysis]: Checked inductivity of 6236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6236 trivial. 0 not checked. [2025-04-30 10:27:38,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:38,621 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967484787] [2025-04-30 10:27:38,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967484787] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:38,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:38,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:38,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811228851] [2025-04-30 10:27:38,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:38,622 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:38,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:38,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:38,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:38,768 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 286 [2025-04-30 10:27:38,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 297 transitions, 829 flow. Second operand has 6 states, 6 states have (on average 209.5) internal successors, (1257), 6 states have internal predecessors, (1257), 0 states have call successors, (0), 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-30 10:27:38,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:38,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 286 [2025-04-30 10:27:38,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:38,954 INFO L116 PetriNetUnfolderBase]: 3/1373 cut-off events. [2025-04-30 10:27:38,955 INFO L117 PetriNetUnfolderBase]: For 135/140 co-relation queries the response was YES. [2025-04-30 10:27:38,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2036 conditions, 1373 events. 3/1373 cut-off events. For 135/140 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 492 event pairs, 1 based on Foata normal form. 0/1370 useless extension candidates. Maximal degree in co-relation 1802. Up to 473 conditions per place. [2025-04-30 10:27:38,957 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 80 selfloop transitions, 5 changer transitions 0/296 dead transitions. [2025-04-30 10:27:38,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 296 transitions, 997 flow [2025-04-30 10:27:38,957 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:38,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:38,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1279 transitions. [2025-04-30 10:27:38,958 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7453379953379954 [2025-04-30 10:27:38,958 INFO L175 Difference]: Start difference. First operand has 322 places, 297 transitions, 829 flow. Second operand 6 states and 1279 transitions. [2025-04-30 10:27:38,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 296 transitions, 997 flow [2025-04-30 10:27:38,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 296 transitions, 987 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:38,962 INFO L231 Difference]: Finished difference. Result has 321 places, 296 transitions, 827 flow [2025-04-30 10:27:38,962 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=827, PETRI_PLACES=321, PETRI_TRANSITIONS=296} [2025-04-30 10:27:38,962 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 35 predicate places. [2025-04-30 10:27:38,962 INFO L485 AbstractCegarLoop]: Abstraction has has 321 places, 296 transitions, 827 flow [2025-04-30 10:27:38,963 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 209.5) internal successors, (1257), 6 states have internal predecessors, (1257), 0 states have call successors, (0), 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-30 10:27:38,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:38,963 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:27:38,963 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-30 10:27:38,963 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:38,965 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:38,965 INFO L85 PathProgramCache]: Analyzing trace with hash 109038188, now seen corresponding path program 1 times [2025-04-30 10:27:38,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:38,965 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327562619] [2025-04-30 10:27:38,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:38,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:39,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1165 statements into 1 equivalence classes. [2025-04-30 10:27:39,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1165 of 1165 statements. [2025-04-30 10:27:39,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:39,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:41,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6236 trivial. 0 not checked. [2025-04-30 10:27:41,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:41,551 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327562619] [2025-04-30 10:27:41,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327562619] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:41,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:41,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:41,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786999688] [2025-04-30 10:27:41,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:41,551 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:41,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:41,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:41,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:41,749 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 286 [2025-04-30 10:27:41,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 296 transitions, 827 flow. Second operand has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 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-30 10:27:41,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:41,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 286 [2025-04-30 10:27:41,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:41,955 INFO L116 PetriNetUnfolderBase]: 3/1370 cut-off events. [2025-04-30 10:27:41,956 INFO L117 PetriNetUnfolderBase]: For 135/140 co-relation queries the response was YES. [2025-04-30 10:27:41,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2030 conditions, 1370 events. 3/1370 cut-off events. For 135/140 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 475 event pairs, 1 based on Foata normal form. 0/1370 useless extension candidates. Maximal degree in co-relation 1841. Up to 470 conditions per place. [2025-04-30 10:27:41,957 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 0 selfloop transitions, 0 changer transitions 295/295 dead transitions. [2025-04-30 10:27:41,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 295 transitions, 993 flow [2025-04-30 10:27:41,958 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:41,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:41,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1284 transitions. [2025-04-30 10:27:41,958 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7482517482517482 [2025-04-30 10:27:41,958 INFO L175 Difference]: Start difference. First operand has 321 places, 296 transitions, 827 flow. Second operand 6 states and 1284 transitions. [2025-04-30 10:27:41,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 295 transitions, 993 flow [2025-04-30 10:27:41,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 295 transitions, 983 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:41,961 INFO L231 Difference]: Finished difference. Result has 320 places, 0 transitions, 0 flow [2025-04-30 10:27:41,961 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=815, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=320, PETRI_TRANSITIONS=0} [2025-04-30 10:27:41,962 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 34 predicate places. [2025-04-30 10:27:41,962 INFO L485 AbstractCegarLoop]: Abstraction has has 320 places, 0 transitions, 0 flow [2025-04-30 10:27:41,962 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 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-30 10:27:41,964 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (24 of 25 remaining) [2025-04-30 10:27:41,964 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (23 of 25 remaining) [2025-04-30 10:27:41,964 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (22 of 25 remaining) [2025-04-30 10:27:41,964 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (21 of 25 remaining) [2025-04-30 10:27:41,964 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (20 of 25 remaining) [2025-04-30 10:27:41,964 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (19 of 25 remaining) [2025-04-30 10:27:41,964 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (18 of 25 remaining) [2025-04-30 10:27:41,964 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (17 of 25 remaining) [2025-04-30 10:27:41,964 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (16 of 25 remaining) [2025-04-30 10:27:41,964 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (15 of 25 remaining) [2025-04-30 10:27:41,964 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (14 of 25 remaining) [2025-04-30 10:27:41,964 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (13 of 25 remaining) [2025-04-30 10:27:41,964 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 25 remaining) [2025-04-30 10:27:41,964 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 25 remaining) [2025-04-30 10:27:41,964 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 25 remaining) [2025-04-30 10:27:41,964 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 25 remaining) [2025-04-30 10:27:41,964 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 25 remaining) [2025-04-30 10:27:41,964 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (7 of 25 remaining) [2025-04-30 10:27:41,964 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONDATA_RACE (6 of 25 remaining) [2025-04-30 10:27:41,964 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 25 remaining) [2025-04-30 10:27:41,964 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (4 of 25 remaining) [2025-04-30 10:27:41,964 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 25 remaining) [2025-04-30 10:27:41,964 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 25 remaining) [2025-04-30 10:27:41,964 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (1 of 25 remaining) [2025-04-30 10:27:41,965 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONDATA_RACE (0 of 25 remaining) [2025-04-30 10:27:41,965 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-30 10:27:41,965 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:27:41,970 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-30 10:27:41,970 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:27:41,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:27:41 BasicIcfg [2025-04-30 10:27:41,974 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:27:41,974 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:27:41,974 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:27:41,974 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:27:41,975 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:27:02" (3/4) ... [2025-04-30 10:27:41,976 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-30 10:27:41,977 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-04-30 10:27:41,982 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-04-30 10:27:41,982 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-04-30 10:27:41,983 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-04-30 10:27:42,042 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-30 10:27:42,042 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-30 10:27:42,042 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:27:42,043 INFO L158 Benchmark]: Toolchain (without parser) took 41281.38ms. Allocated memory was 201.3MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 157.2MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 600.0MB. Max. memory is 16.1GB. [2025-04-30 10:27:42,043 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 117.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:27:42,043 INFO L158 Benchmark]: CACSL2BoogieTranslator took 635.02ms. Allocated memory is still 201.3MB. Free memory was 156.8MB in the beginning and 114.7MB in the end (delta: 42.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-04-30 10:27:42,043 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.16ms. Allocated memory is still 201.3MB. Free memory was 114.7MB in the beginning and 110.4MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:27:42,043 INFO L158 Benchmark]: Boogie Preprocessor took 55.20ms. Allocated memory is still 201.3MB. Free memory was 110.4MB in the beginning and 107.1MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:27:42,043 INFO L158 Benchmark]: RCFGBuilder took 544.19ms. Allocated memory is still 201.3MB. Free memory was 107.1MB in the beginning and 73.2MB in the end (delta: 34.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-04-30 10:27:42,044 INFO L158 Benchmark]: TraceAbstraction took 39919.25ms. Allocated memory was 201.3MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 72.8MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 516.1MB. Max. memory is 16.1GB. [2025-04-30 10:27:42,045 INFO L158 Benchmark]: Witness Printer took 68.06ms. Allocated memory is still 2.2GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:27:42,046 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 117.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 635.02ms. Allocated memory is still 201.3MB. Free memory was 156.8MB in the beginning and 114.7MB in the end (delta: 42.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.16ms. Allocated memory is still 201.3MB. Free memory was 114.7MB in the beginning and 110.4MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.20ms. Allocated memory is still 201.3MB. Free memory was 110.4MB in the beginning and 107.1MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 544.19ms. Allocated memory is still 201.3MB. Free memory was 107.1MB in the beginning and 73.2MB in the end (delta: 34.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 39919.25ms. Allocated memory was 201.3MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 72.8MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 516.1MB. Max. memory is 16.1GB. * Witness Printer took 68.06ms. Allocated memory is still 2.2GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1234]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1264]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1264]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1235]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1265]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1259]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1234]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1235]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1260]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1239]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1240]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1241]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1234]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1235]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1249]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1239]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1240]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1241]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 375 locations, 377 edges, 25 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 39.8s, OverallIterations: 21, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 13.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4836 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3108 mSDsluCounter, 463 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 429 mSDsCounter, 931 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9760 IncrementalHoareTripleChecker+Invalid, 10691 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 931 mSolverCounterUnsat, 34 mSDtfsCounter, 9760 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2827 GetRequests, 2671 SyntacticMatches, 11 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4520occurred in iteration=15, InterpolantAutomatonStates: 162, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 22.2s InterpolantComputationTime, 13636 NumberOfCodeBlocks, 11536 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 14942 ConstructedInterpolants, 0 QuantifiedInterpolants, 23474 SizeOfPredicates, 22 NumberOfNonLiveVariables, 5137 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 27 InterpolantComputations, 18 PerfectInterpolantSequences, 53696/63449 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-30 10:27:42,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE