./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/06-symbeq_04-funloop_hard1.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/06-symbeq_04-funloop_hard1.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 4d853145e48ada6aa212af657ef21b1dd6bc82cb156511f71c23f87b45f2510e --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:26:33,702 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:26:33,761 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:33,764 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:26:33,766 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:26:33,780 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:26:33,780 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:26:33,780 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:26:33,781 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:26:33,781 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:26:33,782 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:26:33,782 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:26:33,782 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:26:33,782 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:26:33,782 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:26:33,782 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:26:33,782 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:26:33,782 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:26:33,783 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:26:33,783 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:26:33,783 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:26:33,783 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:26:33,783 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-30 10:26:33,783 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:26:33,783 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:26:33,783 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:26:33,783 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:26:33,783 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:26:33,783 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:26:33,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:26:33,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:26:33,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:26:33,783 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:26:33,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:26:33,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:26:33,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:26:33,783 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:26:33,783 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:26:33,783 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:26:33,783 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:26:33,783 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:26:33,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:26:33,784 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:26:33,784 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:26:33,784 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:26:33,784 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 -> 4d853145e48ada6aa212af657ef21b1dd6bc82cb156511f71c23f87b45f2510e [2025-04-30 10:26:34,011 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:26:34,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:26:34,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:26:34,022 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:26:34,023 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:26:34,025 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_04-funloop_hard1.i [2025-04-30 10:26:35,364 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/822025b41/3fcb3ac5d41e4d878e0782ad582f0c6c/FLAGd18b9b9b8 [2025-04-30 10:26:35,634 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:26:35,635 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_04-funloop_hard1.i [2025-04-30 10:26:35,651 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/822025b41/3fcb3ac5d41e4d878e0782ad582f0c6c/FLAGd18b9b9b8 [2025-04-30 10:26:36,414 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/822025b41/3fcb3ac5d41e4d878e0782ad582f0c6c [2025-04-30 10:26:36,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:26:36,417 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:26:36,418 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:26:36,418 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:26:36,421 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:26:36,421 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:26:36" (1/1) ... [2025-04-30 10:26:36,422 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e504230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:36, skipping insertion in model container [2025-04-30 10:26:36,422 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:26:36" (1/1) ... [2025-04-30 10:26:36,451 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:26:36,795 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:26:36,819 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:26:36,865 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:26:36,900 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:26:36,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:36 WrapperNode [2025-04-30 10:26:36,901 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:26:36,902 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:26:36,903 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:26:36,903 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:26:36,907 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:26:36" (1/1) ... [2025-04-30 10:26:36,919 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:26:36" (1/1) ... [2025-04-30 10:26:36,937 INFO L138 Inliner]: procedures = 263, calls = 74, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 170 [2025-04-30 10:26:36,937 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:26:36,938 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:26:36,938 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:26:36,938 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:26:36,949 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:36" (1/1) ... [2025-04-30 10:26:36,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:36" (1/1) ... [2025-04-30 10:26:36,957 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:36" (1/1) ... [2025-04-30 10:26:36,958 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:36" (1/1) ... [2025-04-30 10:26:36,972 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:36" (1/1) ... [2025-04-30 10:26:36,973 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:36" (1/1) ... [2025-04-30 10:26:36,978 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:36" (1/1) ... [2025-04-30 10:26:36,980 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:36" (1/1) ... [2025-04-30 10:26:36,980 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:36" (1/1) ... [2025-04-30 10:26:36,987 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:26:36,987 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:26:36,987 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:26:36,987 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:26:36,991 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:36" (1/1) ... [2025-04-30 10:26:36,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:26:37,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:26:37,018 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:26:37,023 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:26:37,037 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:26:37,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-30 10:26:37,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-30 10:26:37,038 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:26:37,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:26:37,038 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-30 10:26:37,040 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-30 10:26:37,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-30 10:26:37,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:26:37,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:26:37,041 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:26:37,150 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:26:37,152 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:26:37,430 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:26:37,430 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:26:37,452 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:26:37,452 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:26:37,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:26:37 BoogieIcfgContainer [2025-04-30 10:26:37,453 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:26:37,454 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:26:37,454 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:26:37,459 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:26:37,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:26:36" (1/3) ... [2025-04-30 10:26:37,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1467c08b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:26:37, skipping insertion in model container [2025-04-30 10:26:37,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:36" (2/3) ... [2025-04-30 10:26:37,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1467c08b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:26:37, skipping insertion in model container [2025-04-30 10:26:37,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:26:37" (3/3) ... [2025-04-30 10:26:37,461 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_04-funloop_hard1.i [2025-04-30 10:26:37,471 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:26:37,474 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_04-funloop_hard1.i that has 2 procedures, 180 locations, 181 edges, 1 initial locations, 3 loop locations, and 6 error locations. [2025-04-30 10:26:37,476 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:26:37,546 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-30 10:26:37,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 183 places, 182 transitions, 368 flow [2025-04-30 10:26:37,669 INFO L116 PetriNetUnfolderBase]: 3/181 cut-off events. [2025-04-30 10:26:37,673 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:26:37,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 181 events. 3/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 224 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2025-04-30 10:26:37,678 INFO L82 GeneralOperation]: Start removeDead. Operand has 183 places, 182 transitions, 368 flow [2025-04-30 10:26:37,684 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 182 places, 181 transitions, 365 flow [2025-04-30 10:26:37,689 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:26:37,698 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;@477f5ba3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:26:37,699 INFO L341 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-04-30 10:26:37,727 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:26:37,727 INFO L116 PetriNetUnfolderBase]: 1/114 cut-off events. [2025-04-30 10:26:37,727 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:26:37,727 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:37,728 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] [2025-04-30 10:26:37,728 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:26:37,734 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:37,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1948885187, now seen corresponding path program 1 times [2025-04-30 10:26:37,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:37,741 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087182565] [2025-04-30 10:26:37,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:37,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:37,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-04-30 10:26:37,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-04-30 10:26:37,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:37,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:38,061 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:26:38,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:38,063 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087182565] [2025-04-30 10:26:38,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087182565] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:38,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:38,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:26:38,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711930327] [2025-04-30 10:26:38,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:38,070 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:26:38,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:38,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:26:38,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:26:38,121 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 182 [2025-04-30 10:26:38,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 181 transitions, 365 flow. Second operand has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:38,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:38,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 182 [2025-04-30 10:26:38,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:38,200 INFO L116 PetriNetUnfolderBase]: 17/319 cut-off events. [2025-04-30 10:26:38,200 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:26:38,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 319 events. 17/319 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 883 event pairs, 10 based on Foata normal form. 1/299 useless extension candidates. Maximal degree in co-relation 266. Up to 38 conditions per place. [2025-04-30 10:26:38,203 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 12 selfloop transitions, 2 changer transitions 0/182 dead transitions. [2025-04-30 10:26:38,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 182 transitions, 395 flow [2025-04-30 10:26:38,204 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:26:38,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:26:38,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 522 transitions. [2025-04-30 10:26:38,215 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9560439560439561 [2025-04-30 10:26:38,217 INFO L175 Difference]: Start difference. First operand has 182 places, 181 transitions, 365 flow. Second operand 3 states and 522 transitions. [2025-04-30 10:26:38,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 182 transitions, 395 flow [2025-04-30 10:26:38,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 182 transitions, 394 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:26:38,226 INFO L231 Difference]: Finished difference. Result has 184 places, 182 transitions, 376 flow [2025-04-30 10:26:38,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=376, PETRI_PLACES=184, PETRI_TRANSITIONS=182} [2025-04-30 10:26:38,230 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 2 predicate places. [2025-04-30 10:26:38,230 INFO L485 AbstractCegarLoop]: Abstraction has has 184 places, 182 transitions, 376 flow [2025-04-30 10:26:38,231 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:38,231 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:38,231 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] [2025-04-30 10:26:38,231 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:26:38,231 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:26:38,234 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:38,235 INFO L85 PathProgramCache]: Analyzing trace with hash 740691328, now seen corresponding path program 1 times [2025-04-30 10:26:38,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:38,235 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922128323] [2025-04-30 10:26:38,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:38,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:38,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-04-30 10:26:38,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-04-30 10:26:38,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:38,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:38,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:38,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:38,436 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922128323] [2025-04-30 10:26:38,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922128323] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:26:38,436 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445482022] [2025-04-30 10:26:38,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:38,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:38,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:26:38,443 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:26:38,446 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:26:38,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-04-30 10:26:38,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-04-30 10:26:38,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:38,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:38,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-30 10:26:38,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:26:38,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:26:38,566 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:26:38,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445482022] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:38,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:26:38,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-04-30 10:26:38,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793787531] [2025-04-30 10:26:38,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:38,568 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:26:38,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:38,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:26:38,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:38,579 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 182 [2025-04-30 10:26:38,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 182 transitions, 376 flow. Second operand has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:38,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:38,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 182 [2025-04-30 10:26:38,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:38,681 INFO L116 PetriNetUnfolderBase]: 35/478 cut-off events. [2025-04-30 10:26:38,681 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:26:38,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 557 conditions, 478 events. 35/478 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1731 event pairs, 10 based on Foata normal form. 3/452 useless extension candidates. Maximal degree in co-relation 478. Up to 51 conditions per place. [2025-04-30 10:26:38,686 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 16 selfloop transitions, 2 changer transitions 0/187 dead transitions. [2025-04-30 10:26:38,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 187 transitions, 422 flow [2025-04-30 10:26:38,687 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:26:38,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:26:38,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 526 transitions. [2025-04-30 10:26:38,691 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9633699633699634 [2025-04-30 10:26:38,691 INFO L175 Difference]: Start difference. First operand has 184 places, 182 transitions, 376 flow. Second operand 3 states and 526 transitions. [2025-04-30 10:26:38,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 187 transitions, 422 flow [2025-04-30 10:26:38,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 187 transitions, 420 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:26:38,695 INFO L231 Difference]: Finished difference. Result has 186 places, 183 transitions, 386 flow [2025-04-30 10:26:38,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=386, PETRI_PLACES=186, PETRI_TRANSITIONS=183} [2025-04-30 10:26:38,697 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 4 predicate places. [2025-04-30 10:26:38,697 INFO L485 AbstractCegarLoop]: Abstraction has has 186 places, 183 transitions, 386 flow [2025-04-30 10:26:38,697 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:38,698 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:38,698 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] [2025-04-30 10:26:38,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-30 10:26:38,899 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:38,899 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:26:38,900 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:38,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1488243323, now seen corresponding path program 1 times [2025-04-30 10:26:38,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:38,900 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359810344] [2025-04-30 10:26:38,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:38,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:38,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-04-30 10:26:38,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-04-30 10:26:38,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:38,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:39,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:39,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:39,039 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359810344] [2025-04-30 10:26:39,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359810344] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:26:39,039 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581914476] [2025-04-30 10:26:39,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:39,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:39,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:26:39,042 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:26:39,044 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:26:39,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-04-30 10:26:39,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-04-30 10:26:39,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:39,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:39,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:26:39,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:26:39,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:39,173 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:26:39,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:39,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581914476] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:26:39,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:26:39,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-04-30 10:26:39,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661903506] [2025-04-30 10:26:39,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:26:39,208 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:26:39,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:39,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:26:39,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:26:39,233 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 182 [2025-04-30 10:26:39,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 183 transitions, 386 flow. Second operand has 10 states, 10 states have (on average 168.0) internal successors, (1680), 10 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:39,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:39,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 182 [2025-04-30 10:26:39,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:39,375 INFO L116 PetriNetUnfolderBase]: 19/411 cut-off events. [2025-04-30 10:26:39,375 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:26:39,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 411 events. 19/411 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1291 event pairs, 14 based on Foata normal form. 2/391 useless extension candidates. Maximal degree in co-relation 381. Up to 44 conditions per place. [2025-04-30 10:26:39,379 INFO L140 encePairwiseOnDemand]: 176/182 looper letters, 16 selfloop transitions, 9 changer transitions 0/191 dead transitions. [2025-04-30 10:26:39,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 191 transitions, 454 flow [2025-04-30 10:26:39,379 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:26:39,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-30 10:26:39,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1521 transitions. [2025-04-30 10:26:39,383 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9285714285714286 [2025-04-30 10:26:39,384 INFO L175 Difference]: Start difference. First operand has 186 places, 183 transitions, 386 flow. Second operand 9 states and 1521 transitions. [2025-04-30 10:26:39,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 191 transitions, 454 flow [2025-04-30 10:26:39,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 191 transitions, 452 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:26:39,390 INFO L231 Difference]: Finished difference. Result has 196 places, 189 transitions, 434 flow [2025-04-30 10:26:39,390 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=434, PETRI_PLACES=196, PETRI_TRANSITIONS=189} [2025-04-30 10:26:39,391 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 14 predicate places. [2025-04-30 10:26:39,391 INFO L485 AbstractCegarLoop]: Abstraction has has 196 places, 189 transitions, 434 flow [2025-04-30 10:26:39,392 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 168.0) internal successors, (1680), 10 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:39,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:39,392 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:39,407 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:26:39,592 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,SelfDestructingSolverStorable2 [2025-04-30 10:26:39,593 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:26:39,593 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:39,593 INFO L85 PathProgramCache]: Analyzing trace with hash 492574875, now seen corresponding path program 2 times [2025-04-30 10:26:39,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:39,593 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839300128] [2025-04-30 10:26:39,595 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:26:39,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:39,610 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 105 statements into 2 equivalence classes. [2025-04-30 10:26:39,622 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 90 of 105 statements. [2025-04-30 10:26:39,623 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:26:39,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:39,985 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-30 10:26:39,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:39,985 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839300128] [2025-04-30 10:26:39,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839300128] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:39,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:39,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:26:39,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463660343] [2025-04-30 10:26:39,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:39,986 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:26:39,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:39,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:26:39,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:40,177 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-04-30 10:26:40,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 189 transitions, 434 flow. Second operand has 6 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 0 states have call successors, (0), 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:26:40,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:40,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-04-30 10:26:40,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:40,522 INFO L116 PetriNetUnfolderBase]: 399/1948 cut-off events. [2025-04-30 10:26:40,522 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-30 10:26:40,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2812 conditions, 1948 events. 399/1948 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 13910 event pairs, 194 based on Foata normal form. 0/1811 useless extension candidates. Maximal degree in co-relation 2700. Up to 649 conditions per place. [2025-04-30 10:26:40,530 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 44 selfloop transitions, 38 changer transitions 0/242 dead transitions. [2025-04-30 10:26:40,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 242 transitions, 704 flow [2025-04-30 10:26:40,531 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:26:40,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:26:40,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1001 transitions. [2025-04-30 10:26:40,533 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2025-04-30 10:26:40,533 INFO L175 Difference]: Start difference. First operand has 196 places, 189 transitions, 434 flow. Second operand 6 states and 1001 transitions. [2025-04-30 10:26:40,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 242 transitions, 704 flow [2025-04-30 10:26:40,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 242 transitions, 698 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-30 10:26:40,537 INFO L231 Difference]: Finished difference. Result has 205 places, 226 transitions, 682 flow [2025-04-30 10:26:40,538 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=682, PETRI_PLACES=205, PETRI_TRANSITIONS=226} [2025-04-30 10:26:40,538 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 23 predicate places. [2025-04-30 10:26:40,538 INFO L485 AbstractCegarLoop]: Abstraction has has 205 places, 226 transitions, 682 flow [2025-04-30 10:26:40,539 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 0 states have call successors, (0), 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:26:40,539 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:40,539 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:40,539 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:26:40,539 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:26:40,540 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:40,540 INFO L85 PathProgramCache]: Analyzing trace with hash 852912326, now seen corresponding path program 1 times [2025-04-30 10:26:40,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:40,540 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941821534] [2025-04-30 10:26:40,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:40,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:40,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-04-30 10:26:40,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-04-30 10:26:40,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:40,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:40,682 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:40,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:40,682 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941821534] [2025-04-30 10:26:40,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941821534] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:26:40,682 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395852769] [2025-04-30 10:26:40,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:40,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:40,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:26:40,684 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:26:40,686 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:26:40,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-04-30 10:26:40,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-04-30 10:26:40,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:40,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:40,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:26:40,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:26:40,822 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:40,822 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:26:40,903 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:40,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395852769] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:26:40,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:26:40,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-04-30 10:26:40,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773844024] [2025-04-30 10:26:40,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:26:40,904 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-30 10:26:40,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:40,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-30 10:26:40,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-04-30 10:26:40,937 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 182 [2025-04-30 10:26:40,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 226 transitions, 682 flow. Second operand has 18 states, 18 states have (on average 168.0) internal successors, (3024), 18 states have internal predecessors, (3024), 0 states have call successors, (0), 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:26:40,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:40,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 182 [2025-04-30 10:26:40,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:41,212 INFO L116 PetriNetUnfolderBase]: 137/1104 cut-off events. [2025-04-30 10:26:41,213 INFO L117 PetriNetUnfolderBase]: For 104/117 co-relation queries the response was YES. [2025-04-30 10:26:41,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1730 conditions, 1104 events. 137/1104 cut-off events. For 104/117 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 6343 event pairs, 32 based on Foata normal form. 4/1052 useless extension candidates. Maximal degree in co-relation 1541. Up to 177 conditions per place. [2025-04-30 10:26:41,219 INFO L140 encePairwiseOnDemand]: 176/182 looper letters, 20 selfloop transitions, 21 changer transitions 0/244 dead transitions. [2025-04-30 10:26:41,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 244 transitions, 852 flow [2025-04-30 10:26:41,219 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-30 10:26:41,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-30 10:26:41,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3531 transitions. [2025-04-30 10:26:41,224 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.923861852433281 [2025-04-30 10:26:41,225 INFO L175 Difference]: Start difference. First operand has 205 places, 226 transitions, 682 flow. Second operand 21 states and 3531 transitions. [2025-04-30 10:26:41,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 244 transitions, 852 flow [2025-04-30 10:26:41,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 244 transitions, 852 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:26:41,233 INFO L231 Difference]: Finished difference. Result has 230 places, 239 transitions, 812 flow [2025-04-30 10:26:41,233 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=812, PETRI_PLACES=230, PETRI_TRANSITIONS=239} [2025-04-30 10:26:41,235 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 48 predicate places. [2025-04-30 10:26:41,235 INFO L485 AbstractCegarLoop]: Abstraction has has 230 places, 239 transitions, 812 flow [2025-04-30 10:26:41,237 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 168.0) internal successors, (3024), 18 states have internal predecessors, (3024), 0 states have call successors, (0), 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:26:41,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:41,237 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 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:26:41,244 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:26:41,442 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:41,443 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:26:41,444 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:41,444 INFO L85 PathProgramCache]: Analyzing trace with hash -153252602, now seen corresponding path program 2 times [2025-04-30 10:26:41,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:41,444 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103091285] [2025-04-30 10:26:41,444 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:26:41,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:41,453 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 125 statements into 2 equivalence classes. [2025-04-30 10:26:41,460 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 90 of 125 statements. [2025-04-30 10:26:41,460 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:26:41,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:41,691 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-04-30 10:26:41,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:41,692 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103091285] [2025-04-30 10:26:41,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103091285] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:41,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:41,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:26:41,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338374348] [2025-04-30 10:26:41,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:41,692 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:26:41,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:41,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:26:41,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:41,846 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-04-30 10:26:41,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 239 transitions, 812 flow. Second operand has 6 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 0 states have call successors, (0), 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:26:41,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:41,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-04-30 10:26:41,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:42,082 INFO L116 PetriNetUnfolderBase]: 467/2141 cut-off events. [2025-04-30 10:26:42,082 INFO L117 PetriNetUnfolderBase]: For 495/549 co-relation queries the response was YES. [2025-04-30 10:26:42,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3848 conditions, 2141 events. 467/2141 cut-off events. For 495/549 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 15209 event pairs, 165 based on Foata normal form. 14/2056 useless extension candidates. Maximal degree in co-relation 3652. Up to 752 conditions per place. [2025-04-30 10:26:42,090 INFO L140 encePairwiseOnDemand]: 171/182 looper letters, 69 selfloop transitions, 30 changer transitions 0/276 dead transitions. [2025-04-30 10:26:42,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 276 transitions, 1126 flow [2025-04-30 10:26:42,091 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:26:42,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:26:42,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 977 transitions. [2025-04-30 10:26:42,093 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8946886446886447 [2025-04-30 10:26:42,093 INFO L175 Difference]: Start difference. First operand has 230 places, 239 transitions, 812 flow. Second operand 6 states and 977 transitions. [2025-04-30 10:26:42,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 276 transitions, 1126 flow [2025-04-30 10:26:42,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 276 transitions, 1102 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-30 10:26:42,099 INFO L231 Difference]: Finished difference. Result has 234 places, 268 transitions, 1038 flow [2025-04-30 10:26:42,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=788, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1038, PETRI_PLACES=234, PETRI_TRANSITIONS=268} [2025-04-30 10:26:42,099 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 52 predicate places. [2025-04-30 10:26:42,099 INFO L485 AbstractCegarLoop]: Abstraction has has 234 places, 268 transitions, 1038 flow [2025-04-30 10:26:42,100 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 0 states have call successors, (0), 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:26:42,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:42,100 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 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:26:42,100 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:26:42,100 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:26:42,101 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:42,101 INFO L85 PathProgramCache]: Analyzing trace with hash 905681760, now seen corresponding path program 1 times [2025-04-30 10:26:42,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:42,101 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170694992] [2025-04-30 10:26:42,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:42,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:42,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-04-30 10:26:42,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-04-30 10:26:42,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:42,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:42,368 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:42,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:42,368 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170694992] [2025-04-30 10:26:42,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170694992] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:26:42,368 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896062206] [2025-04-30 10:26:42,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:42,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:42,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:26:42,370 INFO L229 MonitoredProcess]: Starting monitored process 5 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:26:42,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-30 10:26:42,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-04-30 10:26:42,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-04-30 10:26:42,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:42,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:42,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-30 10:26:42,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:26:42,535 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:42,535 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:26:42,699 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:42,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896062206] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:26:42,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:26:42,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-04-30 10:26:42,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851579614] [2025-04-30 10:26:42,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:26:42,701 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-30 10:26:42,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:42,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-30 10:26:42,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-04-30 10:26:42,727 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 182 [2025-04-30 10:26:42,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 268 transitions, 1038 flow. Second operand has 23 states, 23 states have (on average 168.08695652173913) internal successors, (3866), 23 states have internal predecessors, (3866), 0 states have call successors, (0), 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:26:42,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:42,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 182 [2025-04-30 10:26:42,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:43,138 INFO L116 PetriNetUnfolderBase]: 240/1622 cut-off events. [2025-04-30 10:26:43,138 INFO L117 PetriNetUnfolderBase]: For 562/595 co-relation queries the response was YES. [2025-04-30 10:26:43,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2975 conditions, 1622 events. 240/1622 cut-off events. For 562/595 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 10588 event pairs, 39 based on Foata normal form. 13/1568 useless extension candidates. Maximal degree in co-relation 2698. Up to 221 conditions per place. [2025-04-30 10:26:43,145 INFO L140 encePairwiseOnDemand]: 176/182 looper letters, 23 selfloop transitions, 30 changer transitions 0/285 dead transitions. [2025-04-30 10:26:43,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 285 transitions, 1266 flow [2025-04-30 10:26:43,146 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-30 10:26:43,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-30 10:26:43,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 5036 transitions. [2025-04-30 10:26:43,155 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9223443223443224 [2025-04-30 10:26:43,155 INFO L175 Difference]: Start difference. First operand has 234 places, 268 transitions, 1038 flow. Second operand 30 states and 5036 transitions. [2025-04-30 10:26:43,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 285 transitions, 1266 flow [2025-04-30 10:26:43,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 285 transitions, 1266 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:26:43,163 INFO L231 Difference]: Finished difference. Result has 267 places, 278 transitions, 1190 flow [2025-04-30 10:26:43,164 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=1038, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1190, PETRI_PLACES=267, PETRI_TRANSITIONS=278} [2025-04-30 10:26:43,164 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 85 predicate places. [2025-04-30 10:26:43,165 INFO L485 AbstractCegarLoop]: Abstraction has has 267 places, 278 transitions, 1190 flow [2025-04-30 10:26:43,166 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 168.08695652173913) internal successors, (3866), 23 states have internal predecessors, (3866), 0 states have call successors, (0), 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:26:43,166 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:43,166 INFO L206 CegarLoopForPetriNet]: trace histogram [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:26:43,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-30 10:26:43,371 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:43,371 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:26:43,371 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:43,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1995072317, now seen corresponding path program 2 times [2025-04-30 10:26:43,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:43,372 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746289095] [2025-04-30 10:26:43,372 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:26:43,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:43,385 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 148 statements into 2 equivalence classes. [2025-04-30 10:26:43,391 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 98 of 148 statements. [2025-04-30 10:26:43,391 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:26:43,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:43,639 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-30 10:26:43,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:43,639 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746289095] [2025-04-30 10:26:43,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746289095] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:43,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:43,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:26:43,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030262191] [2025-04-30 10:26:43,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:43,640 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:26:43,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:43,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:26:43,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:43,730 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 182 [2025-04-30 10:26:43,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 278 transitions, 1190 flow. Second operand has 6 states, 6 states have (on average 145.5) internal successors, (873), 6 states have internal predecessors, (873), 0 states have call successors, (0), 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:26:43,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:43,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 182 [2025-04-30 10:26:43,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:44,311 INFO L116 PetriNetUnfolderBase]: 1060/3733 cut-off events. [2025-04-30 10:26:44,311 INFO L117 PetriNetUnfolderBase]: For 1895/1966 co-relation queries the response was YES. [2025-04-30 10:26:44,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8283 conditions, 3733 events. 1060/3733 cut-off events. For 1895/1966 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 28473 event pairs, 332 based on Foata normal form. 18/3543 useless extension candidates. Maximal degree in co-relation 8005. Up to 1828 conditions per place. [2025-04-30 10:26:44,329 INFO L140 encePairwiseOnDemand]: 159/182 looper letters, 106 selfloop transitions, 89 changer transitions 4/373 dead transitions. [2025-04-30 10:26:44,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 373 transitions, 1944 flow [2025-04-30 10:26:44,330 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:26:44,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:26:44,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 983 transitions. [2025-04-30 10:26:44,332 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9001831501831502 [2025-04-30 10:26:44,332 INFO L175 Difference]: Start difference. First operand has 267 places, 278 transitions, 1190 flow. Second operand 6 states and 983 transitions. [2025-04-30 10:26:44,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 373 transitions, 1944 flow [2025-04-30 10:26:44,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 373 transitions, 1898 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-04-30 10:26:44,342 INFO L231 Difference]: Finished difference. Result has 259 places, 357 transitions, 1882 flow [2025-04-30 10:26:44,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=1144, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1882, PETRI_PLACES=259, PETRI_TRANSITIONS=357} [2025-04-30 10:26:44,343 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 77 predicate places. [2025-04-30 10:26:44,343 INFO L485 AbstractCegarLoop]: Abstraction has has 259 places, 357 transitions, 1882 flow [2025-04-30 10:26:44,343 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 145.5) internal successors, (873), 6 states have internal predecessors, (873), 0 states have call successors, (0), 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:26:44,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:44,343 INFO L206 CegarLoopForPetriNet]: trace histogram [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:26:44,343 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:26:44,344 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:26:44,344 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:44,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1782521812, now seen corresponding path program 1 times [2025-04-30 10:26:44,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:44,344 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748096231] [2025-04-30 10:26:44,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:44,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:44,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-04-30 10:26:44,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-04-30 10:26:44,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:44,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:44,679 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-30 10:26:44,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:44,679 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748096231] [2025-04-30 10:26:44,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748096231] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:44,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:44,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:26:44,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800011515] [2025-04-30 10:26:44,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:44,680 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:26:44,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:44,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:26:44,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:44,767 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 182 [2025-04-30 10:26:44,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 357 transitions, 1882 flow. Second operand has 6 states, 6 states have (on average 145.5) internal successors, (873), 6 states have internal predecessors, (873), 0 states have call successors, (0), 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:26:44,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:44,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 182 [2025-04-30 10:26:44,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:45,336 INFO L116 PetriNetUnfolderBase]: 1241/4215 cut-off events. [2025-04-30 10:26:45,336 INFO L117 PetriNetUnfolderBase]: For 4915/5041 co-relation queries the response was YES. [2025-04-30 10:26:45,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11217 conditions, 4215 events. 1241/4215 cut-off events. For 4915/5041 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 32061 event pairs, 297 based on Foata normal form. 22/4088 useless extension candidates. Maximal degree in co-relation 10956. Up to 2056 conditions per place. [2025-04-30 10:26:45,361 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 171 selfloop transitions, 71 changer transitions 0/418 dead transitions. [2025-04-30 10:26:45,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 418 transitions, 2720 flow [2025-04-30 10:26:45,362 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:26:45,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:26:45,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 943 transitions. [2025-04-30 10:26:45,364 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8635531135531136 [2025-04-30 10:26:45,364 INFO L175 Difference]: Start difference. First operand has 259 places, 357 transitions, 1882 flow. Second operand 6 states and 943 transitions. [2025-04-30 10:26:45,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 418 transitions, 2720 flow [2025-04-30 10:26:45,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 418 transitions, 2624 flow, removed 48 selfloop flow, removed 0 redundant places. [2025-04-30 10:26:45,384 INFO L231 Difference]: Finished difference. Result has 269 places, 410 transitions, 2462 flow [2025-04-30 10:26:45,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=1792, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2462, PETRI_PLACES=269, PETRI_TRANSITIONS=410} [2025-04-30 10:26:45,385 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 87 predicate places. [2025-04-30 10:26:45,385 INFO L485 AbstractCegarLoop]: Abstraction has has 269 places, 410 transitions, 2462 flow [2025-04-30 10:26:45,385 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 145.5) internal successors, (873), 6 states have internal predecessors, (873), 0 states have call successors, (0), 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:26:45,385 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:45,385 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-30 10:26:45,386 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:26:45,386 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:26:45,386 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:45,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1396099910, now seen corresponding path program 1 times [2025-04-30 10:26:45,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:45,387 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19983881] [2025-04-30 10:26:45,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:45,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:45,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-04-30 10:26:45,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-04-30 10:26:45,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:45,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:45,873 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-30 10:26:45,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:45,874 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19983881] [2025-04-30 10:26:45,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19983881] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:45,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:45,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:26:45,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6256297] [2025-04-30 10:26:45,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:45,874 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:26:45,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:45,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:26:45,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:26:46,941 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-04-30 10:26:46,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 410 transitions, 2462 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 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:26:46,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:46,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-04-30 10:26:46,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:48,161 INFO L116 PetriNetUnfolderBase]: 2197/8404 cut-off events. [2025-04-30 10:26:48,161 INFO L117 PetriNetUnfolderBase]: For 10540/10768 co-relation queries the response was YES. [2025-04-30 10:26:48,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22757 conditions, 8404 events. 2197/8404 cut-off events. For 10540/10768 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 77777 event pairs, 317 based on Foata normal form. 75/8346 useless extension candidates. Maximal degree in co-relation 22479. Up to 1360 conditions per place. [2025-04-30 10:26:48,219 INFO L140 encePairwiseOnDemand]: 168/182 looper letters, 82 selfloop transitions, 15 changer transitions 4/481 dead transitions. [2025-04-30 10:26:48,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 481 transitions, 2838 flow [2025-04-30 10:26:48,223 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:26:48,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-30 10:26:48,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1475 transitions. [2025-04-30 10:26:48,225 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9004884004884005 [2025-04-30 10:26:48,225 INFO L175 Difference]: Start difference. First operand has 269 places, 410 transitions, 2462 flow. Second operand 9 states and 1475 transitions. [2025-04-30 10:26:48,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 481 transitions, 2838 flow [2025-04-30 10:26:48,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 481 transitions, 2756 flow, removed 41 selfloop flow, removed 0 redundant places. [2025-04-30 10:26:48,283 INFO L231 Difference]: Finished difference. Result has 284 places, 425 transitions, 2498 flow [2025-04-30 10:26:48,284 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=2380, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2498, PETRI_PLACES=284, PETRI_TRANSITIONS=425} [2025-04-30 10:26:48,284 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 102 predicate places. [2025-04-30 10:26:48,285 INFO L485 AbstractCegarLoop]: Abstraction has has 284 places, 425 transitions, 2498 flow [2025-04-30 10:26:48,285 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 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:26:48,285 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:48,285 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-30 10:26:48,285 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:26:48,285 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:26:48,286 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:48,286 INFO L85 PathProgramCache]: Analyzing trace with hash -2131381598, now seen corresponding path program 2 times [2025-04-30 10:26:48,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:48,286 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074978354] [2025-04-30 10:26:48,286 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:26:48,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:48,299 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 159 statements into 2 equivalence classes. [2025-04-30 10:26:48,311 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-04-30 10:26:48,312 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:26:48,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:48,560 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-30 10:26:48,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:48,560 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074978354] [2025-04-30 10:26:48,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074978354] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:48,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:48,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:26:48,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45743796] [2025-04-30 10:26:48,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:48,562 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:26:48,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:48,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:26:48,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:26:49,710 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-04-30 10:26:49,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 425 transitions, 2498 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 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:26:49,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:49,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-04-30 10:26:49,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:51,155 INFO L116 PetriNetUnfolderBase]: 2481/9476 cut-off events. [2025-04-30 10:26:51,156 INFO L117 PetriNetUnfolderBase]: For 12464/12762 co-relation queries the response was YES. [2025-04-30 10:26:51,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26718 conditions, 9476 events. 2481/9476 cut-off events. For 12464/12762 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 90818 event pairs, 342 based on Foata normal form. 80/9395 useless extension candidates. Maximal degree in co-relation 26432. Up to 1705 conditions per place. [2025-04-30 10:26:51,217 INFO L140 encePairwiseOnDemand]: 169/182 looper letters, 115 selfloop transitions, 20 changer transitions 0/515 dead transitions. [2025-04-30 10:26:51,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 515 transitions, 3166 flow [2025-04-30 10:26:51,217 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:26:51,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-30 10:26:51,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1466 transitions. [2025-04-30 10:26:51,219 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.894993894993895 [2025-04-30 10:26:51,219 INFO L175 Difference]: Start difference. First operand has 284 places, 425 transitions, 2498 flow. Second operand 9 states and 1466 transitions. [2025-04-30 10:26:51,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 515 transitions, 3166 flow [2025-04-30 10:26:51,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 515 transitions, 3166 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:26:51,272 INFO L231 Difference]: Finished difference. Result has 299 places, 441 transitions, 2672 flow [2025-04-30 10:26:51,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=2498, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2672, PETRI_PLACES=299, PETRI_TRANSITIONS=441} [2025-04-30 10:26:51,272 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 117 predicate places. [2025-04-30 10:26:51,273 INFO L485 AbstractCegarLoop]: Abstraction has has 299 places, 441 transitions, 2672 flow [2025-04-30 10:26:51,273 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 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:26:51,273 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:51,273 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-30 10:26:51,273 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:26:51,274 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:26:51,274 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:51,274 INFO L85 PathProgramCache]: Analyzing trace with hash 2093326266, now seen corresponding path program 3 times [2025-04-30 10:26:51,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:51,274 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017498227] [2025-04-30 10:26:51,275 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:26:51,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:51,286 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 159 statements into 11 equivalence classes. [2025-04-30 10:26:51,293 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-04-30 10:26:51,293 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-30 10:26:51,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:51,529 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-30 10:26:51,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:51,530 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017498227] [2025-04-30 10:26:51,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017498227] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:51,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:51,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:26:51,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907705629] [2025-04-30 10:26:51,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:51,531 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:26:51,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:51,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:26:51,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:26:52,584 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-04-30 10:26:52,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 441 transitions, 2672 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 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:26:52,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:52,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-04-30 10:26:52,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:54,017 INFO L116 PetriNetUnfolderBase]: 2776/10367 cut-off events. [2025-04-30 10:26:54,017 INFO L117 PetriNetUnfolderBase]: For 16369/16814 co-relation queries the response was YES. [2025-04-30 10:26:54,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30906 conditions, 10367 events. 2776/10367 cut-off events. For 16369/16814 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 99752 event pairs, 335 based on Foata normal form. 104/10320 useless extension candidates. Maximal degree in co-relation 30612. Up to 1750 conditions per place. [2025-04-30 10:26:54,090 INFO L140 encePairwiseOnDemand]: 168/182 looper letters, 125 selfloop transitions, 22 changer transitions 4/531 dead transitions. [2025-04-30 10:26:54,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 531 transitions, 3494 flow [2025-04-30 10:26:54,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:26:54,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-30 10:26:54,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1478 transitions. [2025-04-30 10:26:54,092 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9023199023199023 [2025-04-30 10:26:54,092 INFO L175 Difference]: Start difference. First operand has 299 places, 441 transitions, 2672 flow. Second operand 9 states and 1478 transitions. [2025-04-30 10:26:54,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 531 transitions, 3494 flow [2025-04-30 10:26:54,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 531 transitions, 3453 flow, removed 15 selfloop flow, removed 1 redundant places. [2025-04-30 10:26:54,166 INFO L231 Difference]: Finished difference. Result has 311 places, 453 transitions, 2843 flow [2025-04-30 10:26:54,166 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=2657, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2843, PETRI_PLACES=311, PETRI_TRANSITIONS=453} [2025-04-30 10:26:54,167 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 129 predicate places. [2025-04-30 10:26:54,168 INFO L485 AbstractCegarLoop]: Abstraction has has 311 places, 453 transitions, 2843 flow [2025-04-30 10:26:54,168 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 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:26:54,169 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:54,169 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-30 10:26:54,169 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:26:54,169 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:26:54,170 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:54,170 INFO L85 PathProgramCache]: Analyzing trace with hash -2012923896, now seen corresponding path program 4 times [2025-04-30 10:26:54,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:54,170 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025272324] [2025-04-30 10:26:54,170 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:26:54,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:54,184 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 159 statements into 2 equivalence classes. [2025-04-30 10:26:54,210 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 159 of 159 statements. [2025-04-30 10:26:54,214 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:26:54,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:55,068 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-30 10:26:55,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:55,068 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025272324] [2025-04-30 10:26:55,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025272324] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:55,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:55,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-30 10:26:55,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816137186] [2025-04-30 10:26:55,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:55,069 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:26:55,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:55,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:26:55,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:26:56,153 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-04-30 10:26:56,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 453 transitions, 2843 flow. Second operand has 10 states, 10 states have (on average 154.6) internal successors, (1546), 10 states have internal predecessors, (1546), 0 states have call successors, (0), 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:26:56,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:56,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-04-30 10:26:56,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:57,662 INFO L116 PetriNetUnfolderBase]: 3075/11552 cut-off events. [2025-04-30 10:26:57,662 INFO L117 PetriNetUnfolderBase]: For 20121/20577 co-relation queries the response was YES. [2025-04-30 10:26:57,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34975 conditions, 11552 events. 3075/11552 cut-off events. For 20121/20577 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 113388 event pairs, 351 based on Foata normal form. 119/11495 useless extension candidates. Maximal degree in co-relation 34675. Up to 2091 conditions per place. [2025-04-30 10:26:57,748 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 135 selfloop transitions, 28 changer transitions 0/543 dead transitions. [2025-04-30 10:26:57,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 543 transitions, 3796 flow [2025-04-30 10:26:57,749 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:26:57,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-30 10:26:57,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1625 transitions. [2025-04-30 10:26:57,750 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8928571428571429 [2025-04-30 10:26:57,751 INFO L175 Difference]: Start difference. First operand has 311 places, 453 transitions, 2843 flow. Second operand 10 states and 1625 transitions. [2025-04-30 10:26:57,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 543 transitions, 3796 flow [2025-04-30 10:26:57,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 543 transitions, 3717 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-04-30 10:26:57,838 INFO L231 Difference]: Finished difference. Result has 322 places, 465 transitions, 3021 flow [2025-04-30 10:26:57,839 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=2817, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3021, PETRI_PLACES=322, PETRI_TRANSITIONS=465} [2025-04-30 10:26:57,840 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 140 predicate places. [2025-04-30 10:26:57,840 INFO L485 AbstractCegarLoop]: Abstraction has has 322 places, 465 transitions, 3021 flow [2025-04-30 10:26:57,841 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 154.6) internal successors, (1546), 10 states have internal predecessors, (1546), 0 states have call successors, (0), 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:26:57,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:57,841 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-30 10:26:57,841 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-30 10:26:57,841 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:26:57,842 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:57,842 INFO L85 PathProgramCache]: Analyzing trace with hash -99128252, now seen corresponding path program 5 times [2025-04-30 10:26:57,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:57,843 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796754875] [2025-04-30 10:26:57,843 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:26:57,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:57,854 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 159 statements into 11 equivalence classes. [2025-04-30 10:26:57,869 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 159 of 159 statements. [2025-04-30 10:26:57,870 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-04-30 10:26:57,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:58,309 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-04-30 10:26:58,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:58,309 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796754875] [2025-04-30 10:26:58,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796754875] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:26:58,309 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837714876] [2025-04-30 10:26:58,310 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:26:58,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:58,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:26:58,311 INFO L229 MonitoredProcess]: Starting monitored process 6 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:26:58,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-30 10:26:58,375 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 159 statements into 11 equivalence classes. [2025-04-30 10:26:58,430 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 159 of 159 statements. [2025-04-30 10:26:58,430 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-04-30 10:26:58,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:58,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-30 10:26:58,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:26:58,649 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:26:58,706 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-30 10:26:58,706 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:26:58,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837714876] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:58,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:26:58,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2025-04-30 10:26:58,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930810229] [2025-04-30 10:26:58,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:58,707 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:26:58,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:58,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:26:58,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-04-30 10:26:59,647 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-04-30 10:26:59,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 465 transitions, 3021 flow. Second operand has 10 states, 10 states have (on average 154.6) internal successors, (1546), 10 states have internal predecessors, (1546), 0 states have call successors, (0), 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:26:59,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:59,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-04-30 10:26:59,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:01,385 INFO L116 PetriNetUnfolderBase]: 3403/12558 cut-off events. [2025-04-30 10:27:01,385 INFO L117 PetriNetUnfolderBase]: For 25244/25827 co-relation queries the response was YES. [2025-04-30 10:27:01,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39306 conditions, 12558 events. 3403/12558 cut-off events. For 25244/25827 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 124727 event pairs, 365 based on Foata normal form. 113/12497 useless extension candidates. Maximal degree in co-relation 39000. Up to 2142 conditions per place. [2025-04-30 10:27:01,471 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 138 selfloop transitions, 30 changer transitions 2/550 dead transitions. [2025-04-30 10:27:01,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 550 transitions, 4027 flow [2025-04-30 10:27:01,471 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:27:01,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-30 10:27:01,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1632 transitions. [2025-04-30 10:27:01,472 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8967032967032967 [2025-04-30 10:27:01,472 INFO L175 Difference]: Start difference. First operand has 322 places, 465 transitions, 3021 flow. Second operand 10 states and 1632 transitions. [2025-04-30 10:27:01,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 550 transitions, 4027 flow [2025-04-30 10:27:01,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 550 transitions, 3934 flow, removed 10 selfloop flow, removed 4 redundant places. [2025-04-30 10:27:01,566 INFO L231 Difference]: Finished difference. Result has 333 places, 480 transitions, 3263 flow [2025-04-30 10:27:01,567 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=2978, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=465, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3263, PETRI_PLACES=333, PETRI_TRANSITIONS=480} [2025-04-30 10:27:01,567 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 151 predicate places. [2025-04-30 10:27:01,568 INFO L485 AbstractCegarLoop]: Abstraction has has 333 places, 480 transitions, 3263 flow [2025-04-30 10:27:01,568 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 154.6) internal successors, (1546), 10 states have internal predecessors, (1546), 0 states have call successors, (0), 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:01,568 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:01,568 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-30 10:27:01,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-30 10:27:01,769 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-30 10:27:01,769 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:27:01,770 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:01,770 INFO L85 PathProgramCache]: Analyzing trace with hash 2036624418, now seen corresponding path program 6 times [2025-04-30 10:27:01,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:01,770 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968595016] [2025-04-30 10:27:01,770 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-30 10:27:01,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:01,780 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 159 statements into 11 equivalence classes. [2025-04-30 10:27:01,784 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-04-30 10:27:01,784 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-30 10:27:01,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:02,010 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-30 10:27:02,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:02,011 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968595016] [2025-04-30 10:27:02,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968595016] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:02,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:02,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:27:02,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123842214] [2025-04-30 10:27:02,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:02,011 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:27:02,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:02,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:27:02,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:27:02,871 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-04-30 10:27:02,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 480 transitions, 3263 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 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:02,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:02,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-04-30 10:27:02,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:04,742 INFO L116 PetriNetUnfolderBase]: 3728/13872 cut-off events. [2025-04-30 10:27:04,742 INFO L117 PetriNetUnfolderBase]: For 31399/32002 co-relation queries the response was YES. [2025-04-30 10:27:04,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44052 conditions, 13872 events. 3728/13872 cut-off events. For 31399/32002 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 140942 event pairs, 402 based on Foata normal form. 120/13792 useless extension candidates. Maximal degree in co-relation 43740. Up to 2468 conditions per place. [2025-04-30 10:27:04,832 INFO L140 encePairwiseOnDemand]: 168/182 looper letters, 152 selfloop transitions, 34 changer transitions 0/566 dead transitions. [2025-04-30 10:27:04,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 566 transitions, 4391 flow [2025-04-30 10:27:04,832 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:27:04,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-30 10:27:04,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1475 transitions. [2025-04-30 10:27:04,833 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9004884004884005 [2025-04-30 10:27:04,833 INFO L175 Difference]: Start difference. First operand has 333 places, 480 transitions, 3263 flow. Second operand 9 states and 1475 transitions. [2025-04-30 10:27:04,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 566 transitions, 4391 flow [2025-04-30 10:27:04,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 566 transitions, 4293 flow, removed 27 selfloop flow, removed 3 redundant places. [2025-04-30 10:27:04,948 INFO L231 Difference]: Finished difference. Result has 344 places, 495 transitions, 3504 flow [2025-04-30 10:27:04,948 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=3202, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=480, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=451, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3504, PETRI_PLACES=344, PETRI_TRANSITIONS=495} [2025-04-30 10:27:04,949 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 162 predicate places. [2025-04-30 10:27:04,949 INFO L485 AbstractCegarLoop]: Abstraction has has 344 places, 495 transitions, 3504 flow [2025-04-30 10:27:04,949 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 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,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:04,949 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-30 10:27:04,949 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-30 10:27:04,949 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:27:04,950 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:04,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1491223334, now seen corresponding path program 7 times [2025-04-30 10:27:04,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:04,950 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521181567] [2025-04-30 10:27:04,950 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-30 10:27:04,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:04,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-04-30 10:27:04,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-04-30 10:27:04,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:04,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:05,173 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-30 10:27:05,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:05,174 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521181567] [2025-04-30 10:27:05,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521181567] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:05,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:05,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:27:05,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118176729] [2025-04-30 10:27:05,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:05,175 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:27:05,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:05,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:27:05,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:27:05,912 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-04-30 10:27:05,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 495 transitions, 3504 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 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,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:05,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-04-30 10:27:05,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:08,566 INFO L116 PetriNetUnfolderBase]: 4076/14949 cut-off events. [2025-04-30 10:27:08,566 INFO L117 PetriNetUnfolderBase]: For 39945/40601 co-relation queries the response was YES. [2025-04-30 10:27:08,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49208 conditions, 14949 events. 4076/14949 cut-off events. For 39945/40601 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 154210 event pairs, 461 based on Foata normal form. 108/14849 useless extension candidates. Maximal degree in co-relation 48891. Up to 2547 conditions per place. [2025-04-30 10:27:08,769 INFO L140 encePairwiseOnDemand]: 168/182 looper letters, 152 selfloop transitions, 36 changer transitions 0/568 dead transitions. [2025-04-30 10:27:08,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 568 transitions, 4619 flow [2025-04-30 10:27:08,769 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:27:08,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-30 10:27:08,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1479 transitions. [2025-04-30 10:27:08,770 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9029304029304029 [2025-04-30 10:27:08,770 INFO L175 Difference]: Start difference. First operand has 344 places, 495 transitions, 3504 flow. Second operand 9 states and 1479 transitions. [2025-04-30 10:27:08,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 568 transitions, 4619 flow [2025-04-30 10:27:08,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 568 transitions, 4519 flow, removed 26 selfloop flow, removed 2 redundant places. [2025-04-30 10:27:08,939 INFO L231 Difference]: Finished difference. Result has 357 places, 514 transitions, 3860 flow [2025-04-30 10:27:08,939 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=3426, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=495, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=465, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3860, PETRI_PLACES=357, PETRI_TRANSITIONS=514} [2025-04-30 10:27:08,939 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 175 predicate places. [2025-04-30 10:27:08,939 INFO L485 AbstractCegarLoop]: Abstraction has has 357 places, 514 transitions, 3860 flow [2025-04-30 10:27:08,940 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 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,940 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:08,940 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-30 10:27:08,940 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-30 10:27:08,940 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:27:08,941 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:08,941 INFO L85 PathProgramCache]: Analyzing trace with hash -217444488, now seen corresponding path program 8 times [2025-04-30 10:27:08,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:08,941 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521810519] [2025-04-30 10:27:08,941 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:27:08,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:08,951 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 159 statements into 2 equivalence classes. [2025-04-30 10:27:08,955 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-04-30 10:27:08,956 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:27:08,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:09,086 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-30 10:27:09,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:09,086 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521810519] [2025-04-30 10:27:09,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521810519] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:09,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:09,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:27:09,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475704850] [2025-04-30 10:27:09,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:09,087 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:27:09,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:09,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:27:09,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:27:09,577 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-04-30 10:27:09,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 514 transitions, 3860 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 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,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:09,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-04-30 10:27:09,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:12,043 INFO L116 PetriNetUnfolderBase]: 4665/17093 cut-off events. [2025-04-30 10:27:12,043 INFO L117 PetriNetUnfolderBase]: For 50984/51856 co-relation queries the response was YES. [2025-04-30 10:27:12,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57174 conditions, 17093 events. 4665/17093 cut-off events. For 50984/51856 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 181965 event pairs, 486 based on Foata normal form. 139/17011 useless extension candidates. Maximal degree in co-relation 56850. Up to 3015 conditions per place. [2025-04-30 10:27:12,149 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 171 selfloop transitions, 45 changer transitions 0/596 dead transitions. [2025-04-30 10:27:12,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 596 transitions, 5168 flow [2025-04-30 10:27:12,149 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:27:12,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-30 10:27:12,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1479 transitions. [2025-04-30 10:27:12,150 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9029304029304029 [2025-04-30 10:27:12,150 INFO L175 Difference]: Start difference. First operand has 357 places, 514 transitions, 3860 flow. Second operand 9 states and 1479 transitions. [2025-04-30 10:27:12,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 596 transitions, 5168 flow [2025-04-30 10:27:12,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 596 transitions, 5064 flow, removed 52 selfloop flow, removed 0 redundant places. [2025-04-30 10:27:12,330 INFO L231 Difference]: Finished difference. Result has 372 places, 532 transitions, 4213 flow [2025-04-30 10:27:12,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=3756, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=474, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4213, PETRI_PLACES=372, PETRI_TRANSITIONS=532} [2025-04-30 10:27:12,331 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 190 predicate places. [2025-04-30 10:27:12,331 INFO L485 AbstractCegarLoop]: Abstraction has has 372 places, 532 transitions, 4213 flow [2025-04-30 10:27:12,331 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 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,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:12,331 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-30 10:27:12,332 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-30 10:27:12,332 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:27:12,333 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:12,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1908590844, now seen corresponding path program 9 times [2025-04-30 10:27:12,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:12,333 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980291983] [2025-04-30 10:27:12,333 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:27:12,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:12,340 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 159 statements into 11 equivalence classes. [2025-04-30 10:27:12,344 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-04-30 10:27:12,344 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-30 10:27:12,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:12,472 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-30 10:27:12,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:12,472 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980291983] [2025-04-30 10:27:12,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980291983] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:12,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:12,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:27:12,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193985620] [2025-04-30 10:27:12,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:12,473 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:27:12,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:12,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:27:12,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:27:12,963 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-04-30 10:27:12,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 532 transitions, 4213 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 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,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:12,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-04-30 10:27:12,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:15,932 INFO L116 PetriNetUnfolderBase]: 5254/18963 cut-off events. [2025-04-30 10:27:15,932 INFO L117 PetriNetUnfolderBase]: For 62977/63952 co-relation queries the response was YES. [2025-04-30 10:27:16,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65256 conditions, 18963 events. 5254/18963 cut-off events. For 62977/63952 co-relation queries the response was YES. Maximal size of possible extension queue 663. Compared 206990 event pairs, 521 based on Foata normal form. 152/18891 useless extension candidates. Maximal degree in co-relation 64924. Up to 3289 conditions per place. [2025-04-30 10:27:16,062 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 188 selfloop transitions, 46 changer transitions 0/614 dead transitions. [2025-04-30 10:27:16,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 614 transitions, 5483 flow [2025-04-30 10:27:16,062 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:27:16,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-30 10:27:16,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1481 transitions. [2025-04-30 10:27:16,063 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9041514041514042 [2025-04-30 10:27:16,063 INFO L175 Difference]: Start difference. First operand has 372 places, 532 transitions, 4213 flow. Second operand 9 states and 1481 transitions. [2025-04-30 10:27:16,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 614 transitions, 5483 flow [2025-04-30 10:27:16,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 614 transitions, 5397 flow, removed 43 selfloop flow, removed 0 redundant places. [2025-04-30 10:27:16,301 INFO L231 Difference]: Finished difference. Result has 386 places, 549 transitions, 4536 flow [2025-04-30 10:27:16,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=4127, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=491, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4536, PETRI_PLACES=386, PETRI_TRANSITIONS=549} [2025-04-30 10:27:16,301 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 204 predicate places. [2025-04-30 10:27:16,301 INFO L485 AbstractCegarLoop]: Abstraction has has 386 places, 549 transitions, 4536 flow [2025-04-30 10:27:16,302 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 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:16,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:16,302 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-30 10:27:16,302 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-30 10:27:16,302 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:27:16,303 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:16,303 INFO L85 PathProgramCache]: Analyzing trace with hash 828554844, now seen corresponding path program 10 times [2025-04-30 10:27:16,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:16,303 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680952890] [2025-04-30 10:27:16,303 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:27:16,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:16,311 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 159 statements into 2 equivalence classes. [2025-04-30 10:27:16,318 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 159 of 159 statements. [2025-04-30 10:27:16,319 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:27:16,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:16,825 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-30 10:27:16,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:16,826 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680952890] [2025-04-30 10:27:16,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680952890] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:16,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:16,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-30 10:27:16,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439158900] [2025-04-30 10:27:16,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:16,826 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:27:16,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:16,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:27:16,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:27:17,714 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-04-30 10:27:17,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 549 transitions, 4536 flow. Second operand has 10 states, 10 states have (on average 154.6) internal successors, (1546), 10 states have internal predecessors, (1546), 0 states have call successors, (0), 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:17,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:17,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-04-30 10:27:17,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:21,550 INFO L116 PetriNetUnfolderBase]: 5542/19890 cut-off events. [2025-04-30 10:27:21,550 INFO L117 PetriNetUnfolderBase]: For 71334/72401 co-relation queries the response was YES. [2025-04-30 10:27:21,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69451 conditions, 19890 events. 5542/19890 cut-off events. For 71334/72401 co-relation queries the response was YES. Maximal size of possible extension queue 726. Compared 219502 event pairs, 553 based on Foata normal form. 174/19836 useless extension candidates. Maximal degree in co-relation 69112. Up to 3462 conditions per place. [2025-04-30 10:27:21,721 INFO L140 encePairwiseOnDemand]: 165/182 looper letters, 186 selfloop transitions, 54 changer transitions 0/620 dead transitions. [2025-04-30 10:27:21,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 620 transitions, 5850 flow [2025-04-30 10:27:21,722 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:27:21,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-30 10:27:21,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1636 transitions. [2025-04-30 10:27:21,723 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8989010989010989 [2025-04-30 10:27:21,723 INFO L175 Difference]: Start difference. First operand has 386 places, 549 transitions, 4536 flow. Second operand 10 states and 1636 transitions. [2025-04-30 10:27:21,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 620 transitions, 5850 flow [2025-04-30 10:27:22,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 620 transitions, 5697 flow, removed 57 selfloop flow, removed 2 redundant places. [2025-04-30 10:27:22,020 INFO L231 Difference]: Finished difference. Result has 397 places, 563 transitions, 4817 flow [2025-04-30 10:27:22,021 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=4439, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=499, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4817, PETRI_PLACES=397, PETRI_TRANSITIONS=563} [2025-04-30 10:27:22,021 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 215 predicate places. [2025-04-30 10:27:22,021 INFO L485 AbstractCegarLoop]: Abstraction has has 397 places, 563 transitions, 4817 flow [2025-04-30 10:27:22,021 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 154.6) internal successors, (1546), 10 states have internal predecessors, (1546), 0 states have call successors, (0), 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:22,021 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:22,022 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-30 10:27:22,022 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-30 10:27:22,022 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:27:22,023 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:22,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1060158014, now seen corresponding path program 11 times [2025-04-30 10:27:22,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:22,023 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168287855] [2025-04-30 10:27:22,023 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:27:22,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:22,032 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 159 statements into 11 equivalence classes. [2025-04-30 10:27:22,039 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 159 of 159 statements. [2025-04-30 10:27:22,039 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-04-30 10:27:22,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:22,535 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-04-30 10:27:22,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:22,536 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168287855] [2025-04-30 10:27:22,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168287855] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:27:22,536 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100379429] [2025-04-30 10:27:22,536 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:27:22,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:27:22,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:27:22,538 INFO L229 MonitoredProcess]: Starting monitored process 7 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:22,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-30 10:27:22,607 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 159 statements into 11 equivalence classes. [2025-04-30 10:27:22,664 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 159 of 159 statements. [2025-04-30 10:27:22,664 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-04-30 10:27:22,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:22,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-30 10:27:22,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:27:22,946 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:27:22,989 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-30 10:27:22,989 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:27:22,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100379429] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:22,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:27:22,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2025-04-30 10:27:22,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925806392] [2025-04-30 10:27:22,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:22,990 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:27:22,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:22,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:27:22,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2025-04-30 10:27:23,688 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-04-30 10:27:23,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 563 transitions, 4817 flow. Second operand has 10 states, 10 states have (on average 154.6) internal successors, (1546), 10 states have internal predecessors, (1546), 0 states have call successors, (0), 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,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:23,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-04-30 10:27:23,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:27,066 INFO L116 PetriNetUnfolderBase]: 5554/19916 cut-off events. [2025-04-30 10:27:27,066 INFO L117 PetriNetUnfolderBase]: For 76204/77250 co-relation queries the response was YES. [2025-04-30 10:27:27,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70235 conditions, 19916 events. 5554/19916 cut-off events. For 76204/77250 co-relation queries the response was YES. Maximal size of possible extension queue 726. Compared 219704 event pairs, 558 based on Foata normal form. 177/19854 useless extension candidates. Maximal degree in co-relation 69891. Up to 3480 conditions per place. [2025-04-30 10:27:27,255 INFO L140 encePairwiseOnDemand]: 166/182 looper letters, 189 selfloop transitions, 58 changer transitions 0/627 dead transitions. [2025-04-30 10:27:27,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 627 transitions, 6055 flow [2025-04-30 10:27:27,256 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:27:27,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-30 10:27:27,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1637 transitions. [2025-04-30 10:27:27,257 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8994505494505495 [2025-04-30 10:27:27,257 INFO L175 Difference]: Start difference. First operand has 397 places, 563 transitions, 4817 flow. Second operand 10 states and 1637 transitions. [2025-04-30 10:27:27,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 627 transitions, 6055 flow [2025-04-30 10:27:27,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 627 transitions, 5893 flow, removed 39 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:27,783 INFO L231 Difference]: Finished difference. Result has 406 places, 575 transitions, 5087 flow [2025-04-30 10:27:27,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=4679, PETRI_DIFFERENCE_MINUEND_PLACES=392, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=508, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5087, PETRI_PLACES=406, PETRI_TRANSITIONS=575} [2025-04-30 10:27:27,783 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 224 predicate places. [2025-04-30 10:27:27,784 INFO L485 AbstractCegarLoop]: Abstraction has has 406 places, 575 transitions, 5087 flow [2025-04-30 10:27:27,784 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 154.6) internal successors, (1546), 10 states have internal predecessors, (1546), 0 states have call successors, (0), 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:27,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:27,784 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-30 10:27:27,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-30 10:27:27,984 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:27:27,985 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:27:27,986 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:27,986 INFO L85 PathProgramCache]: Analyzing trace with hash -570115028, now seen corresponding path program 12 times [2025-04-30 10:27:27,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:27,986 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592321438] [2025-04-30 10:27:27,986 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-30 10:27:27,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:27,994 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 159 statements into 11 equivalence classes. [2025-04-30 10:27:27,998 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-04-30 10:27:27,998 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-30 10:27:27,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:28,159 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-30 10:27:28,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:28,159 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592321438] [2025-04-30 10:27:28,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592321438] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:28,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:28,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:27:28,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207969150] [2025-04-30 10:27:28,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:28,161 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:27:28,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:28,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:27:28,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:27:28,630 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-04-30 10:27:28,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 575 transitions, 5087 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 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:28,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:28,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-04-30 10:27:28,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:32,003 INFO L116 PetriNetUnfolderBase]: 5542/19903 cut-off events. [2025-04-30 10:27:32,004 INFO L117 PetriNetUnfolderBase]: For 80319/81520 co-relation queries the response was YES. [2025-04-30 10:27:32,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70630 conditions, 19903 events. 5542/19903 cut-off events. For 80319/81520 co-relation queries the response was YES. Maximal size of possible extension queue 726. Compared 219585 event pairs, 546 based on Foata normal form. 173/19840 useless extension candidates. Maximal degree in co-relation 70281. Up to 3475 conditions per place. [2025-04-30 10:27:32,193 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 202 selfloop transitions, 52 changer transitions 0/634 dead transitions. [2025-04-30 10:27:32,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 634 transitions, 6303 flow [2025-04-30 10:27:32,193 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:27:32,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-30 10:27:32,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1487 transitions. [2025-04-30 10:27:32,194 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9078144078144078 [2025-04-30 10:27:32,194 INFO L175 Difference]: Start difference. First operand has 406 places, 575 transitions, 5087 flow. Second operand 9 states and 1487 transitions. [2025-04-30 10:27:32,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 634 transitions, 6303 flow [2025-04-30 10:27:32,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 634 transitions, 6091 flow, removed 75 selfloop flow, removed 4 redundant places. [2025-04-30 10:27:32,661 INFO L231 Difference]: Finished difference. Result has 414 places, 583 transitions, 5223 flow [2025-04-30 10:27:32,662 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=4949, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=526, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5223, PETRI_PLACES=414, PETRI_TRANSITIONS=583} [2025-04-30 10:27:32,662 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 232 predicate places. [2025-04-30 10:27:32,662 INFO L485 AbstractCegarLoop]: Abstraction has has 414 places, 583 transitions, 5223 flow [2025-04-30 10:27:32,662 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 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,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:32,662 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-30 10:27:32,662 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-30 10:27:32,663 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:27:32,663 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:32,664 INFO L85 PathProgramCache]: Analyzing trace with hash -971018924, now seen corresponding path program 13 times [2025-04-30 10:27:32,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:32,664 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643184947] [2025-04-30 10:27:32,664 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-30 10:27:32,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:32,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-04-30 10:27:32,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-04-30 10:27:32,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:32,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:32,839 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-30 10:27:32,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:32,839 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643184947] [2025-04-30 10:27:32,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643184947] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:32,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:32,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:27:32,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726799583] [2025-04-30 10:27:32,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:32,840 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:27:32,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:32,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:27:32,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:27:33,338 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-04-30 10:27:33,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 583 transitions, 5223 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 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:33,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:33,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-04-30 10:27:33,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15