./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_19-nested_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 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 ../sv-benchmarks/c/goblint-regression/09-regions_19-nested_nr.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 e4a3fff277216174585e9d802eee36c2b619da26d56e48ed5261f2ab62942b7a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:06:05,247 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:06:05,300 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:06:05,305 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:06:05,307 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:06:05,327 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:06:05,328 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:06:05,328 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:06:05,328 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:06:05,329 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:06:05,329 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:06:05,330 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:06:05,330 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:06:05,330 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:06:05,330 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:06:05,330 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:06:05,330 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:06:05,330 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:06:05,331 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:06:05,331 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:06:05,331 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:06:05,331 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:06:05,331 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:06:05,331 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:06:05,331 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:06:05,331 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:06:05,331 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:06:05,331 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:06:05,331 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:06:05,331 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:06:05,331 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:06:05,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:06:05,332 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:06:05,332 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:06:05,332 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:06:05,332 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:06:05,332 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:06:05,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:06:05,332 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:06:05,332 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:06:05,332 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:06:05,332 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:06:05,332 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 -> e4a3fff277216174585e9d802eee36c2b619da26d56e48ed5261f2ab62942b7a [2025-03-17 11:06:05,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:06:05,551 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:06:05,554 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:06:05,555 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:06:05,555 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:06:05,557 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_19-nested_nr.i [2025-03-17 11:06:06,695 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0d752f5a/0c05e9c8ad164913843bfca3b562711c/FLAG96bb5b8ea [2025-03-17 11:06:06,983 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:06:06,984 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_19-nested_nr.i [2025-03-17 11:06:07,001 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0d752f5a/0c05e9c8ad164913843bfca3b562711c/FLAG96bb5b8ea [2025-03-17 11:06:07,251 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0d752f5a/0c05e9c8ad164913843bfca3b562711c [2025-03-17 11:06:07,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:06:07,253 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:06:07,255 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:06:07,255 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:06:07,258 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:06:07,259 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:06:07" (1/1) ... [2025-03-17 11:06:07,259 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fa19333 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:07, skipping insertion in model container [2025-03-17 11:06:07,259 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:06:07" (1/1) ... [2025-03-17 11:06:07,299 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:06:07,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:06:07,755 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:06:07,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:06:07,845 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:06:07,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:07 WrapperNode [2025-03-17 11:06:07,845 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:06:07,846 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:06:07,846 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:06:07,846 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:06:07,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:07" (1/1) ... [2025-03-17 11:06:07,862 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:07" (1/1) ... [2025-03-17 11:06:07,886 INFO L138 Inliner]: procedures = 372, calls = 87, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 292 [2025-03-17 11:06:07,886 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:06:07,886 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:06:07,887 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:06:07,887 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:06:07,893 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:07" (1/1) ... [2025-03-17 11:06:07,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:07" (1/1) ... [2025-03-17 11:06:07,898 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:07" (1/1) ... [2025-03-17 11:06:07,898 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:07" (1/1) ... [2025-03-17 11:06:07,914 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:07" (1/1) ... [2025-03-17 11:06:07,920 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:07" (1/1) ... [2025-03-17 11:06:07,926 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:07" (1/1) ... [2025-03-17 11:06:07,927 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:07" (1/1) ... [2025-03-17 11:06:07,929 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:06:07,933 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:06:07,933 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:06:07,933 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:06:07,934 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:07" (1/1) ... [2025-03-17 11:06:07,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:06:07,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:06:07,962 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-03-17 11:06:07,965 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-03-17 11:06:07,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-17 11:06:07,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-17 11:06:07,984 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 11:06:07,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:06:07,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:06:07,984 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 11:06:07,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:06:07,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:06:07,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-17 11:06:07,984 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-17 11:06:07,984 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-17 11:06:07,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:06:07,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:06:07,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:06:07,986 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:06:08,098 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:06:08,099 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:06:08,526 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:06:08,526 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:06:08,546 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:06:08,546 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:06:08,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:06:08 BoogieIcfgContainer [2025-03-17 11:06:08,546 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:06:08,565 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:06:08,565 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:06:08,570 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:06:08,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:06:07" (1/3) ... [2025-03-17 11:06:08,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14981dc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:06:08, skipping insertion in model container [2025-03-17 11:06:08,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:07" (2/3) ... [2025-03-17 11:06:08,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14981dc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:06:08, skipping insertion in model container [2025-03-17 11:06:08,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:06:08" (3/3) ... [2025-03-17 11:06:08,572 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_19-nested_nr.i [2025-03-17 11:06:08,584 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:06:08,586 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_19-nested_nr.i that has 2 procedures, 334 locations, 1 initial locations, 2 loop locations, and 18 error locations. [2025-03-17 11:06:08,586 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:06:08,664 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 11:06:08,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 337 places, 337 transitions, 678 flow [2025-03-17 11:06:08,789 INFO L124 PetriNetUnfolderBase]: 4/336 cut-off events. [2025-03-17 11:06:08,791 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:06:08,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 340 conditions, 336 events. 4/336 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 414 event pairs, 0 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 208. Up to 2 conditions per place. [2025-03-17 11:06:08,795 INFO L82 GeneralOperation]: Start removeDead. Operand has 337 places, 337 transitions, 678 flow [2025-03-17 11:06:08,802 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 336 places, 336 transitions, 675 flow [2025-03-17 11:06:08,811 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:06:08,824 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@248c79d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:06:08,824 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-03-17 11:06:08,844 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:06:08,844 INFO L124 PetriNetUnfolderBase]: 2/126 cut-off events. [2025-03-17 11:06:08,844 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:06:08,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:08,846 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:06:08,846 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-17 11:06:08,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:08,850 INFO L85 PathProgramCache]: Analyzing trace with hash -2080055654, now seen corresponding path program 1 times [2025-03-17 11:06:08,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:08,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015828263] [2025-03-17 11:06:08,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:08,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:08,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 11:06:08,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 11:06:08,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:08,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:09,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:06:09,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:09,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015828263] [2025-03-17 11:06:09,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015828263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:09,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:09,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:06:09,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653190044] [2025-03-17 11:06:09,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:09,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:06:09,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:09,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:06:09,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:06:09,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 337 [2025-03-17 11:06:09,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 336 transitions, 675 flow. Second operand has 3 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 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-03-17 11:06:09,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:09,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 337 [2025-03-17 11:06:09,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:09,433 INFO L124 PetriNetUnfolderBase]: 8/414 cut-off events. [2025-03-17 11:06:09,434 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:06:09,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 414 events. 8/414 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 900 event pairs, 6 based on Foata normal form. 5/388 useless extension candidates. Maximal degree in co-relation 219. Up to 24 conditions per place. [2025-03-17 11:06:09,437 INFO L140 encePairwiseOnDemand]: 332/337 looper letters, 10 selfloop transitions, 2 changer transitions 1/335 dead transitions. [2025-03-17 11:06:09,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 335 transitions, 697 flow [2025-03-17 11:06:09,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:06:09,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:06:09,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 987 transitions. [2025-03-17 11:06:09,457 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9762611275964391 [2025-03-17 11:06:09,458 INFO L175 Difference]: Start difference. First operand has 336 places, 336 transitions, 675 flow. Second operand 3 states and 987 transitions. [2025-03-17 11:06:09,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 335 transitions, 697 flow [2025-03-17 11:06:09,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 335 transitions, 696 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:06:09,470 INFO L231 Difference]: Finished difference. Result has 338 places, 334 transitions, 680 flow [2025-03-17 11:06:09,473 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=680, PETRI_PLACES=338, PETRI_TRANSITIONS=334} [2025-03-17 11:06:09,477 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 2 predicate places. [2025-03-17 11:06:09,478 INFO L471 AbstractCegarLoop]: Abstraction has has 338 places, 334 transitions, 680 flow [2025-03-17 11:06:09,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 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-03-17 11:06:09,478 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:09,479 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:06:09,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:06:09,479 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-17 11:06:09,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:09,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1173772546, now seen corresponding path program 1 times [2025-03-17 11:06:09,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:09,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224139500] [2025-03-17 11:06:09,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:09,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:09,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 11:06:09,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 11:06:09,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:09,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:09,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:06:09,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:09,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224139500] [2025-03-17 11:06:09,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224139500] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:06:09,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593810153] [2025-03-17 11:06:09,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:09,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:06:09,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:06:09,666 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-03-17 11:06:09,666 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-03-17 11:06:09,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 11:06:09,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 11:06:09,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:09,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:09,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 11:06:09,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:06:09,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:06:09,821 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:06:09,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:06:09,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593810153] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:06:09,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:06:09,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-17 11:06:09,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493688157] [2025-03-17 11:06:09,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:06:09,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:06:09,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:09,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:06:09,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:06:09,891 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 337 [2025-03-17 11:06:09,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 334 transitions, 680 flow. Second operand has 10 states, 10 states have (on average 322.8) internal successors, (3228), 10 states have internal predecessors, (3228), 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-03-17 11:06:09,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:09,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 337 [2025-03-17 11:06:09,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:10,014 INFO L124 PetriNetUnfolderBase]: 8/420 cut-off events. [2025-03-17 11:06:10,015 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:06:10,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 420 events. 8/420 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 879 event pairs, 6 based on Foata normal form. 2/392 useless extension candidates. Maximal degree in co-relation 384. Up to 24 conditions per place. [2025-03-17 11:06:10,017 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 14 selfloop transitions, 9 changer transitions 0/342 dead transitions. [2025-03-17 11:06:10,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 342 transitions, 744 flow [2025-03-17 11:06:10,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:06:10,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 11:06:10,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2914 transitions. [2025-03-17 11:06:10,024 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9607649192218926 [2025-03-17 11:06:10,025 INFO L175 Difference]: Start difference. First operand has 338 places, 334 transitions, 680 flow. Second operand 9 states and 2914 transitions. [2025-03-17 11:06:10,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 342 transitions, 744 flow [2025-03-17 11:06:10,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 342 transitions, 742 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:06:10,031 INFO L231 Difference]: Finished difference. Result has 347 places, 340 transitions, 728 flow [2025-03-17 11:06:10,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=728, PETRI_PLACES=347, PETRI_TRANSITIONS=340} [2025-03-17 11:06:10,032 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 11 predicate places. [2025-03-17 11:06:10,032 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 340 transitions, 728 flow [2025-03-17 11:06:10,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 322.8) internal successors, (3228), 10 states have internal predecessors, (3228), 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-03-17 11:06:10,034 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:10,034 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:06:10,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 11:06:10,234 WARN L453 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-03-17 11:06:10,235 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-17 11:06:10,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:10,236 INFO L85 PathProgramCache]: Analyzing trace with hash 908244994, now seen corresponding path program 2 times [2025-03-17 11:06:10,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:10,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712346973] [2025-03-17 11:06:10,236 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:06:10,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:10,252 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 112 statements into 2 equivalence classes. [2025-03-17 11:06:10,264 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 97 of 112 statements. [2025-03-17 11:06:10,265 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:06:10,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:10,697 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 11:06:10,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:10,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712346973] [2025-03-17 11:06:10,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712346973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:10,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:10,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:06:10,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038406392] [2025-03-17 11:06:10,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:10,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:06:10,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:10,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:06:10,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:06:11,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 337 [2025-03-17 11:06:11,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 340 transitions, 728 flow. Second operand has 6 states, 6 states have (on average 253.33333333333334) internal successors, (1520), 6 states have internal predecessors, (1520), 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-03-17 11:06:11,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:11,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 337 [2025-03-17 11:06:11,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:11,406 INFO L124 PetriNetUnfolderBase]: 366/1695 cut-off events. [2025-03-17 11:06:11,406 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-17 11:06:11,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2537 conditions, 1695 events. 366/1695 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10111 event pairs, 364 based on Foata normal form. 0/1569 useless extension candidates. Maximal degree in co-relation 2426. Up to 800 conditions per place. [2025-03-17 11:06:11,415 INFO L140 encePairwiseOnDemand]: 325/337 looper letters, 71 selfloop transitions, 10 changer transitions 0/338 dead transitions. [2025-03-17 11:06:11,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 338 transitions, 886 flow [2025-03-17 11:06:11,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:06:11,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:06:11,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1595 transitions. [2025-03-17 11:06:11,420 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7888229475766568 [2025-03-17 11:06:11,420 INFO L175 Difference]: Start difference. First operand has 347 places, 340 transitions, 728 flow. Second operand 6 states and 1595 transitions. [2025-03-17 11:06:11,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 338 transitions, 886 flow [2025-03-17 11:06:11,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 338 transitions, 880 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-17 11:06:11,426 INFO L231 Difference]: Finished difference. Result has 349 places, 338 transitions, 738 flow [2025-03-17 11:06:11,426 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=738, PETRI_PLACES=349, PETRI_TRANSITIONS=338} [2025-03-17 11:06:11,427 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 13 predicate places. [2025-03-17 11:06:11,427 INFO L471 AbstractCegarLoop]: Abstraction has has 349 places, 338 transitions, 738 flow [2025-03-17 11:06:11,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 253.33333333333334) internal successors, (1520), 6 states have internal predecessors, (1520), 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-03-17 11:06:11,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:11,428 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:06:11,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:06:11,428 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-17 11:06:11,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:11,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1547417472, now seen corresponding path program 1 times [2025-03-17 11:06:11,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:11,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803590448] [2025-03-17 11:06:11,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:11,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:11,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 11:06:11,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 11:06:11,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:11,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:11,506 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 11:06:11,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:11,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803590448] [2025-03-17 11:06:11,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803590448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:11,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:11,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:06:11,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972816306] [2025-03-17 11:06:11,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:11,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:06:11,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:11,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:06:11,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:06:11,535 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 337 [2025-03-17 11:06:11,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 338 transitions, 738 flow. Second operand has 3 states, 3 states have (on average 326.0) internal successors, (978), 3 states have internal predecessors, (978), 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-03-17 11:06:11,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:11,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 337 [2025-03-17 11:06:11,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:11,598 INFO L124 PetriNetUnfolderBase]: 8/529 cut-off events. [2025-03-17 11:06:11,598 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 11:06:11,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 604 conditions, 529 events. 8/529 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 871 event pairs, 6 based on Foata normal form. 1/496 useless extension candidates. Maximal degree in co-relation 494. Up to 24 conditions per place. [2025-03-17 11:06:11,600 INFO L140 encePairwiseOnDemand]: 334/337 looper letters, 10 selfloop transitions, 2 changer transitions 0/339 dead transitions. [2025-03-17 11:06:11,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 339 transitions, 764 flow [2025-03-17 11:06:11,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:06:11,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:06:11,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 985 transitions. [2025-03-17 11:06:11,602 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9742828882294757 [2025-03-17 11:06:11,602 INFO L175 Difference]: Start difference. First operand has 349 places, 338 transitions, 738 flow. Second operand 3 states and 985 transitions. [2025-03-17 11:06:11,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 339 transitions, 764 flow [2025-03-17 11:06:11,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 339 transitions, 744 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:06:11,607 INFO L231 Difference]: Finished difference. Result has 347 places, 339 transitions, 730 flow [2025-03-17 11:06:11,607 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=730, PETRI_PLACES=347, PETRI_TRANSITIONS=339} [2025-03-17 11:06:11,608 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 11 predicate places. [2025-03-17 11:06:11,608 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 339 transitions, 730 flow [2025-03-17 11:06:11,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 326.0) internal successors, (978), 3 states have internal predecessors, (978), 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-03-17 11:06:11,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:11,609 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:06:11,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:06:11,609 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-17 11:06:11,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:11,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1466057278, now seen corresponding path program 1 times [2025-03-17 11:06:11,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:11,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510829181] [2025-03-17 11:06:11,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:11,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:11,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 11:06:11,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 11:06:11,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:11,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:11,782 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:06:11,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:11,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510829181] [2025-03-17 11:06:11,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510829181] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:06:11,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424077825] [2025-03-17 11:06:11,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:11,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:06:11,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:06:11,785 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-03-17 11:06:11,786 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-03-17 11:06:11,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 11:06:11,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 11:06:11,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:11,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:11,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 11:06:11,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:06:11,924 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:06:11,925 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:06:12,009 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:06:12,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424077825] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:06:12,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:06:12,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-17 11:06:12,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390558113] [2025-03-17 11:06:12,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:06:12,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 11:06:12,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:12,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 11:06:12,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-17 11:06:12,042 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 337 [2025-03-17 11:06:12,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 339 transitions, 730 flow. Second operand has 18 states, 18 states have (on average 322.8888888888889) internal successors, (5812), 18 states have internal predecessors, (5812), 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-03-17 11:06:12,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:12,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 337 [2025-03-17 11:06:12,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:12,250 INFO L124 PetriNetUnfolderBase]: 8/549 cut-off events. [2025-03-17 11:06:12,250 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-17 11:06:12,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 661 conditions, 549 events. 8/549 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 868 event pairs, 6 based on Foata normal form. 4/519 useless extension candidates. Maximal degree in co-relation 476. Up to 24 conditions per place. [2025-03-17 11:06:12,252 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 18 selfloop transitions, 21 changer transitions 0/357 dead transitions. [2025-03-17 11:06:12,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 357 transitions, 896 flow [2025-03-17 11:06:12,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 11:06:12,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-17 11:06:12,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6784 transitions. [2025-03-17 11:06:12,262 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9585982761056945 [2025-03-17 11:06:12,262 INFO L175 Difference]: Start difference. First operand has 347 places, 339 transitions, 730 flow. Second operand 21 states and 6784 transitions. [2025-03-17 11:06:12,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 357 transitions, 896 flow [2025-03-17 11:06:12,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 357 transitions, 894 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:06:12,269 INFO L231 Difference]: Finished difference. Result has 371 places, 352 transitions, 858 flow [2025-03-17 11:06:12,269 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=858, PETRI_PLACES=371, PETRI_TRANSITIONS=352} [2025-03-17 11:06:12,270 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 35 predicate places. [2025-03-17 11:06:12,270 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 352 transitions, 858 flow [2025-03-17 11:06:12,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 322.8888888888889) internal successors, (5812), 18 states have internal predecessors, (5812), 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-03-17 11:06:12,273 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:12,273 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:06:12,280 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-03-17 11:06:12,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:06:12,474 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-17 11:06:12,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:12,475 INFO L85 PathProgramCache]: Analyzing trace with hash 718061630, now seen corresponding path program 2 times [2025-03-17 11:06:12,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:12,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007779925] [2025-03-17 11:06:12,475 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:06:12,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:12,488 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 140 statements into 2 equivalence classes. [2025-03-17 11:06:12,497 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 105 of 140 statements. [2025-03-17 11:06:12,497 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:06:12,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:12,768 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 11:06:12,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:12,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007779925] [2025-03-17 11:06:12,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007779925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:12,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:12,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:06:12,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290983473] [2025-03-17 11:06:12,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:12,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:06:12,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:12,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:06:12,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:06:13,110 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 337 [2025-03-17 11:06:13,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 352 transitions, 858 flow. Second operand has 6 states, 6 states have (on average 253.33333333333334) internal successors, (1520), 6 states have internal predecessors, (1520), 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-03-17 11:06:13,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:13,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 337 [2025-03-17 11:06:13,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:13,423 INFO L124 PetriNetUnfolderBase]: 366/1822 cut-off events. [2025-03-17 11:06:13,424 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-17 11:06:13,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2772 conditions, 1822 events. 366/1822 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10048 event pairs, 364 based on Foata normal form. 0/1694 useless extension candidates. Maximal degree in co-relation 2581. Up to 830 conditions per place. [2025-03-17 11:06:13,432 INFO L140 encePairwiseOnDemand]: 325/337 looper letters, 71 selfloop transitions, 10 changer transitions 0/350 dead transitions. [2025-03-17 11:06:13,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 350 transitions, 1016 flow [2025-03-17 11:06:13,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:06:13,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:06:13,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1595 transitions. [2025-03-17 11:06:13,435 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7888229475766568 [2025-03-17 11:06:13,435 INFO L175 Difference]: Start difference. First operand has 371 places, 352 transitions, 858 flow. Second operand 6 states and 1595 transitions. [2025-03-17 11:06:13,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 350 transitions, 1016 flow [2025-03-17 11:06:13,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 350 transitions, 992 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-17 11:06:13,441 INFO L231 Difference]: Finished difference. Result has 368 places, 350 transitions, 850 flow [2025-03-17 11:06:13,442 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=850, PETRI_PLACES=368, PETRI_TRANSITIONS=350} [2025-03-17 11:06:13,444 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 32 predicate places. [2025-03-17 11:06:13,444 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 350 transitions, 850 flow [2025-03-17 11:06:13,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 253.33333333333334) internal successors, (1520), 6 states have internal predecessors, (1520), 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-03-17 11:06:13,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:13,445 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:06:13,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:06:13,445 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-17 11:06:13,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:13,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1130154414, now seen corresponding path program 1 times [2025-03-17 11:06:13,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:13,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852779313] [2025-03-17 11:06:13,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:13,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:13,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 11:06:13,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 11:06:13,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:13,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:13,721 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:06:13,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:13,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852779313] [2025-03-17 11:06:13,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852779313] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:06:13,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157209477] [2025-03-17 11:06:13,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:13,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:06:13,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:06:13,724 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-03-17 11:06:13,726 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-03-17 11:06:13,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 11:06:13,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 11:06:13,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:13,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:13,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 11:06:13,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:06:13,925 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:06:13,925 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:06:14,076 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:06:14,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157209477] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:06:14,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:06:14,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-17 11:06:14,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271877214] [2025-03-17 11:06:14,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:06:14,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 11:06:14,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:14,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 11:06:14,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-17 11:06:14,106 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 337 [2025-03-17 11:06:14,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 350 transitions, 850 flow. Second operand has 23 states, 23 states have (on average 323.0) internal successors, (7429), 23 states have internal predecessors, (7429), 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-03-17 11:06:14,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:14,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 337 [2025-03-17 11:06:14,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:14,383 INFO L124 PetriNetUnfolderBase]: 8/560 cut-off events. [2025-03-17 11:06:14,383 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2025-03-17 11:06:14,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 766 conditions, 560 events. 8/560 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 863 event pairs, 6 based on Foata normal form. 3/533 useless extension candidates. Maximal degree in co-relation 498. Up to 24 conditions per place. [2025-03-17 11:06:14,385 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 21 selfloop transitions, 30 changer transitions 0/367 dead transitions. [2025-03-17 11:06:14,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 367 transitions, 1074 flow [2025-03-17 11:06:14,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-17 11:06:14,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-17 11:06:14,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 9684 transitions. [2025-03-17 11:06:14,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9578635014836795 [2025-03-17 11:06:14,398 INFO L175 Difference]: Start difference. First operand has 368 places, 350 transitions, 850 flow. Second operand 30 states and 9684 transitions. [2025-03-17 11:06:14,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 367 transitions, 1074 flow [2025-03-17 11:06:14,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 367 transitions, 1054 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:06:14,403 INFO L231 Difference]: Finished difference. Result has 396 places, 360 transitions, 982 flow [2025-03-17 11:06:14,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=982, PETRI_PLACES=396, PETRI_TRANSITIONS=360} [2025-03-17 11:06:14,404 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 60 predicate places. [2025-03-17 11:06:14,404 INFO L471 AbstractCegarLoop]: Abstraction has has 396 places, 360 transitions, 982 flow [2025-03-17 11:06:14,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 323.0) internal successors, (7429), 23 states have internal predecessors, (7429), 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-03-17 11:06:14,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:14,407 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:06:14,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 11:06:14,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:06:14,611 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-17 11:06:14,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:14,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1204361238, now seen corresponding path program 2 times [2025-03-17 11:06:14,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:14,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779068229] [2025-03-17 11:06:14,612 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:06:14,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:14,627 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 167 statements into 2 equivalence classes. [2025-03-17 11:06:14,638 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 117 of 167 statements. [2025-03-17 11:06:14,638 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:06:14,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:14,940 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-17 11:06:14,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:14,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779068229] [2025-03-17 11:06:14,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779068229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:14,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:14,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:06:14,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502083570] [2025-03-17 11:06:14,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:14,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:06:14,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:14,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:06:14,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:06:15,464 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 337 [2025-03-17 11:06:15,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 360 transitions, 982 flow. Second operand has 6 states, 6 states have (on average 249.83333333333334) internal successors, (1499), 6 states have internal predecessors, (1499), 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-03-17 11:06:15,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:15,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 337 [2025-03-17 11:06:15,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:15,695 INFO L124 PetriNetUnfolderBase]: 392/1925 cut-off events. [2025-03-17 11:06:15,695 INFO L125 PetriNetUnfolderBase]: For 121/121 co-relation queries the response was YES. [2025-03-17 11:06:15,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3002 conditions, 1925 events. 392/1925 cut-off events. For 121/121 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 10752 event pairs, 390 based on Foata normal form. 0/1793 useless extension candidates. Maximal degree in co-relation 2732. Up to 899 conditions per place. [2025-03-17 11:06:15,702 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 83 selfloop transitions, 5 changer transitions 0/359 dead transitions. [2025-03-17 11:06:15,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 359 transitions, 1156 flow [2025-03-17 11:06:15,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:06:15,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:06:15,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1570 transitions. [2025-03-17 11:06:15,704 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7764589515331355 [2025-03-17 11:06:15,704 INFO L175 Difference]: Start difference. First operand has 396 places, 360 transitions, 982 flow. Second operand 6 states and 1570 transitions. [2025-03-17 11:06:15,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 359 transitions, 1156 flow [2025-03-17 11:06:15,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 359 transitions, 1110 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-03-17 11:06:15,709 INFO L231 Difference]: Finished difference. Result has 382 places, 359 transitions, 944 flow [2025-03-17 11:06:15,710 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=934, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=944, PETRI_PLACES=382, PETRI_TRANSITIONS=359} [2025-03-17 11:06:15,710 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 46 predicate places. [2025-03-17 11:06:15,710 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 359 transitions, 944 flow [2025-03-17 11:06:15,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 249.83333333333334) internal successors, (1499), 6 states have internal predecessors, (1499), 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-03-17 11:06:15,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:15,711 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 11:06:15,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:06:15,711 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-17 11:06:15,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:15,712 INFO L85 PathProgramCache]: Analyzing trace with hash -476948313, now seen corresponding path program 1 times [2025-03-17 11:06:15,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:15,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229500422] [2025-03-17 11:06:15,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:15,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:15,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-17 11:06:15,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-17 11:06:15,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:15,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:16,117 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-17 11:06:16,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:16,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229500422] [2025-03-17 11:06:16,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229500422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:16,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:16,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:06:16,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141205358] [2025-03-17 11:06:16,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:16,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:06:16,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:16,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:06:16,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:06:16,699 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 337 [2025-03-17 11:06:16,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 359 transitions, 944 flow. Second operand has 6 states, 6 states have (on average 277.8333333333333) internal successors, (1667), 6 states have internal predecessors, (1667), 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-03-17 11:06:16,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:16,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 337 [2025-03-17 11:06:16,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:16,836 INFO L124 PetriNetUnfolderBase]: 56/799 cut-off events. [2025-03-17 11:06:16,836 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2025-03-17 11:06:16,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1160 conditions, 799 events. 56/799 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2629 event pairs, 54 based on Foata normal form. 0/747 useless extension candidates. Maximal degree in co-relation 911. Up to 195 conditions per place. [2025-03-17 11:06:16,839 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 57 selfloop transitions, 5 changer transitions 0/358 dead transitions. [2025-03-17 11:06:16,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 358 transitions, 1066 flow [2025-03-17 11:06:16,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:06:16,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:06:16,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1700 transitions. [2025-03-17 11:06:16,842 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8407517309594461 [2025-03-17 11:06:16,842 INFO L175 Difference]: Start difference. First operand has 382 places, 359 transitions, 944 flow. Second operand 6 states and 1700 transitions. [2025-03-17 11:06:16,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 358 transitions, 1066 flow [2025-03-17 11:06:16,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 358 transitions, 1056 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:06:16,849 INFO L231 Difference]: Finished difference. Result has 381 places, 358 transitions, 942 flow [2025-03-17 11:06:16,849 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=942, PETRI_PLACES=381, PETRI_TRANSITIONS=358} [2025-03-17 11:06:16,850 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 45 predicate places. [2025-03-17 11:06:16,850 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 358 transitions, 942 flow [2025-03-17 11:06:16,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 277.8333333333333) internal successors, (1667), 6 states have internal predecessors, (1667), 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-03-17 11:06:16,850 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:16,850 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 11:06:16,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:06:16,851 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-17 11:06:16,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:16,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1872234224, now seen corresponding path program 1 times [2025-03-17 11:06:16,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:16,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594572423] [2025-03-17 11:06:16,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:16,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:16,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-17 11:06:16,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-17 11:06:16,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:16,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:17,228 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-17 11:06:17,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:17,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594572423] [2025-03-17 11:06:17,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594572423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:17,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:17,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:06:17,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499289198] [2025-03-17 11:06:17,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:17,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:06:17,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:17,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:06:17,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:06:17,598 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 337 [2025-03-17 11:06:17,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 358 transitions, 942 flow. Second operand has 6 states, 6 states have (on average 280.5) internal successors, (1683), 6 states have internal predecessors, (1683), 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-03-17 11:06:17,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:17,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 337 [2025-03-17 11:06:17,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:17,669 INFO L124 PetriNetUnfolderBase]: 38/714 cut-off events. [2025-03-17 11:06:17,669 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2025-03-17 11:06:17,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1038 conditions, 714 events. 38/714 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2077 event pairs, 36 based on Foata normal form. 0/675 useless extension candidates. Maximal degree in co-relation 791. Up to 158 conditions per place. [2025-03-17 11:06:17,672 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 53 selfloop transitions, 5 changer transitions 0/357 dead transitions. [2025-03-17 11:06:17,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 357 transitions, 1056 flow [2025-03-17 11:06:17,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:06:17,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:06:17,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1715 transitions. [2025-03-17 11:06:17,674 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8481701285855588 [2025-03-17 11:06:17,674 INFO L175 Difference]: Start difference. First operand has 381 places, 358 transitions, 942 flow. Second operand 6 states and 1715 transitions. [2025-03-17 11:06:17,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 357 transitions, 1056 flow [2025-03-17 11:06:17,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 357 transitions, 1046 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:06:17,679 INFO L231 Difference]: Finished difference. Result has 380 places, 357 transitions, 940 flow [2025-03-17 11:06:17,679 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=930, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=940, PETRI_PLACES=380, PETRI_TRANSITIONS=357} [2025-03-17 11:06:17,679 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 44 predicate places. [2025-03-17 11:06:17,679 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 357 transitions, 940 flow [2025-03-17 11:06:17,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 280.5) internal successors, (1683), 6 states have internal predecessors, (1683), 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-03-17 11:06:17,680 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:17,680 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 11:06:17,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:06:17,681 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-17 11:06:17,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:17,681 INFO L85 PathProgramCache]: Analyzing trace with hash -2044696535, now seen corresponding path program 1 times [2025-03-17 11:06:17,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:17,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607969252] [2025-03-17 11:06:17,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:17,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:17,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-17 11:06:17,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-17 11:06:17,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:17,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:18,096 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-17 11:06:18,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:18,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607969252] [2025-03-17 11:06:18,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607969252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:18,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:18,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:06:18,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943660331] [2025-03-17 11:06:18,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:18,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:06:18,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:18,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:06:18,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:06:18,314 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 337 [2025-03-17 11:06:18,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 357 transitions, 940 flow. Second operand has 6 states, 6 states have (on average 256.1666666666667) internal successors, (1537), 6 states have internal predecessors, (1537), 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-03-17 11:06:18,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:18,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 337 [2025-03-17 11:06:18,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:18,485 INFO L124 PetriNetUnfolderBase]: 366/1829 cut-off events. [2025-03-17 11:06:18,486 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2025-03-17 11:06:18,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2841 conditions, 1829 events. 366/1829 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10064 event pairs, 364 based on Foata normal form. 0/1709 useless extension candidates. Maximal degree in co-relation 2594. Up to 846 conditions per place. [2025-03-17 11:06:18,493 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 79 selfloop transitions, 5 changer transitions 0/356 dead transitions. [2025-03-17 11:06:18,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 356 transitions, 1106 flow [2025-03-17 11:06:18,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:06:18,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:06:18,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1585 transitions. [2025-03-17 11:06:18,495 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7838773491592482 [2025-03-17 11:06:18,495 INFO L175 Difference]: Start difference. First operand has 380 places, 357 transitions, 940 flow. Second operand 6 states and 1585 transitions. [2025-03-17 11:06:18,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 356 transitions, 1106 flow [2025-03-17 11:06:18,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 356 transitions, 1096 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:06:18,500 INFO L231 Difference]: Finished difference. Result has 379 places, 356 transitions, 938 flow [2025-03-17 11:06:18,501 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=928, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=938, PETRI_PLACES=379, PETRI_TRANSITIONS=356} [2025-03-17 11:06:18,501 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 43 predicate places. [2025-03-17 11:06:18,501 INFO L471 AbstractCegarLoop]: Abstraction has has 379 places, 356 transitions, 938 flow [2025-03-17 11:06:18,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 256.1666666666667) internal successors, (1537), 6 states have internal predecessors, (1537), 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-03-17 11:06:18,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:18,503 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 11:06:18,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:06:18,503 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-17 11:06:18,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:18,504 INFO L85 PathProgramCache]: Analyzing trace with hash 363038316, now seen corresponding path program 1 times [2025-03-17 11:06:18,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:18,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948650034] [2025-03-17 11:06:18,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:18,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:18,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-17 11:06:18,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-17 11:06:18,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:18,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:18,949 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2025-03-17 11:06:18,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:18,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948650034] [2025-03-17 11:06:18,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948650034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:18,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:18,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:06:18,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372014608] [2025-03-17 11:06:18,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:18,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:06:18,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:18,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:06:18,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:06:19,153 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 337 [2025-03-17 11:06:19,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 356 transitions, 938 flow. Second operand has 6 states, 6 states have (on average 257.6666666666667) internal successors, (1546), 6 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-03-17 11:06:19,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:19,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 337 [2025-03-17 11:06:19,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:19,334 INFO L124 PetriNetUnfolderBase]: 366/1827 cut-off events. [2025-03-17 11:06:19,335 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2025-03-17 11:06:19,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2837 conditions, 1827 events. 366/1827 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 9985 event pairs, 364 based on Foata normal form. 0/1709 useless extension candidates. Maximal degree in co-relation 2590. Up to 844 conditions per place. [2025-03-17 11:06:19,341 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 78 selfloop transitions, 5 changer transitions 0/355 dead transitions. [2025-03-17 11:06:19,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 355 transitions, 1102 flow [2025-03-17 11:06:19,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:06:19,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:06:19,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1590 transitions. [2025-03-17 11:06:19,343 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7863501483679525 [2025-03-17 11:06:19,343 INFO L175 Difference]: Start difference. First operand has 379 places, 356 transitions, 938 flow. Second operand 6 states and 1590 transitions. [2025-03-17 11:06:19,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 355 transitions, 1102 flow [2025-03-17 11:06:19,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 355 transitions, 1092 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:06:19,348 INFO L231 Difference]: Finished difference. Result has 378 places, 355 transitions, 936 flow [2025-03-17 11:06:19,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=926, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=936, PETRI_PLACES=378, PETRI_TRANSITIONS=355} [2025-03-17 11:06:19,349 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 42 predicate places. [2025-03-17 11:06:19,349 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 355 transitions, 936 flow [2025-03-17 11:06:19,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 257.6666666666667) internal successors, (1546), 6 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-03-17 11:06:19,350 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:19,350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 11:06:19,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:06:19,350 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-17 11:06:19,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:19,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1410410785, now seen corresponding path program 1 times [2025-03-17 11:06:19,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:19,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300563648] [2025-03-17 11:06:19,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:19,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:19,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-03-17 11:06:19,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-03-17 11:06:19,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:19,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:19,466 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2025-03-17 11:06:19,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:19,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300563648] [2025-03-17 11:06:19,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300563648] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:06:19,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725889345] [2025-03-17 11:06:19,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:19,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:06:19,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:06:19,468 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-03-17 11:06:19,470 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-03-17 11:06:19,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-03-17 11:06:19,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-03-17 11:06:19,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:19,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:19,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 11:06:19,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:06:19,741 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2025-03-17 11:06:19,741 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:06:19,850 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2025-03-17 11:06:19,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725889345] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:06:19,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:06:19,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-17 11:06:19,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143710545] [2025-03-17 11:06:19,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:06:19,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:06:19,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:19,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:06:19,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:06:19,954 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 337 [2025-03-17 11:06:19,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 355 transitions, 936 flow. Second operand has 10 states, 10 states have (on average 323.0) internal successors, (3230), 10 states have internal predecessors, (3230), 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-03-17 11:06:19,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:19,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 337 [2025-03-17 11:06:19,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:20,070 INFO L124 PetriNetUnfolderBase]: 8/657 cut-off events. [2025-03-17 11:06:20,070 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2025-03-17 11:06:20,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 855 conditions, 657 events. 8/657 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 394 event pairs, 6 based on Foata normal form. 2/639 useless extension candidates. Maximal degree in co-relation 607. Up to 24 conditions per place. [2025-03-17 11:06:20,072 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 14 selfloop transitions, 9 changer transitions 0/363 dead transitions. [2025-03-17 11:06:20,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 363 transitions, 1000 flow [2025-03-17 11:06:20,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:06:20,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 11:06:20,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2914 transitions. [2025-03-17 11:06:20,074 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9607649192218926 [2025-03-17 11:06:20,074 INFO L175 Difference]: Start difference. First operand has 378 places, 355 transitions, 936 flow. Second operand 9 states and 2914 transitions. [2025-03-17 11:06:20,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 363 transitions, 1000 flow [2025-03-17 11:06:20,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 363 transitions, 990 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:06:20,078 INFO L231 Difference]: Finished difference. Result has 384 places, 361 transitions, 976 flow [2025-03-17 11:06:20,079 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=926, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=976, PETRI_PLACES=384, PETRI_TRANSITIONS=361} [2025-03-17 11:06:20,079 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 48 predicate places. [2025-03-17 11:06:20,079 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 361 transitions, 976 flow [2025-03-17 11:06:20,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 323.0) internal successors, (3230), 10 states have internal predecessors, (3230), 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-03-17 11:06:20,080 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:20,081 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 11:06:20,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 11:06:20,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:06:20,281 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-17 11:06:20,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:20,283 INFO L85 PathProgramCache]: Analyzing trace with hash 797315329, now seen corresponding path program 2 times [2025-03-17 11:06:20,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:20,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869887320] [2025-03-17 11:06:20,283 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:06:20,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:20,340 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 463 statements into 2 equivalence classes. [2025-03-17 11:06:20,344 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 98 of 463 statements. [2025-03-17 11:06:20,344 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:06:20,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:20,517 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2025-03-17 11:06:20,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:20,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869887320] [2025-03-17 11:06:20,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869887320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:20,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:20,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:06:20,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732865493] [2025-03-17 11:06:20,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:20,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:06:20,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:20,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:06:20,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:06:21,060 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 337 [2025-03-17 11:06:21,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 361 transitions, 976 flow. Second operand has 6 states, 6 states have (on average 282.3333333333333) internal successors, (1694), 6 states have internal predecessors, (1694), 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-03-17 11:06:21,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:21,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 337 [2025-03-17 11:06:21,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:21,506 INFO L124 PetriNetUnfolderBase]: 258/1984 cut-off events. [2025-03-17 11:06:21,507 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2025-03-17 11:06:21,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2787 conditions, 1984 events. 258/1984 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 10224 event pairs, 36 based on Foata normal form. 0/1858 useless extension candidates. Maximal degree in co-relation 2536. Up to 491 conditions per place. [2025-03-17 11:06:21,515 INFO L140 encePairwiseOnDemand]: 314/337 looper letters, 67 selfloop transitions, 70 changer transitions 0/439 dead transitions. [2025-03-17 11:06:21,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 439 transitions, 1406 flow [2025-03-17 11:06:21,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:06:21,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:06:21,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1794 transitions. [2025-03-17 11:06:21,518 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.887240356083086 [2025-03-17 11:06:21,518 INFO L175 Difference]: Start difference. First operand has 384 places, 361 transitions, 976 flow. Second operand 6 states and 1794 transitions. [2025-03-17 11:06:21,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 439 transitions, 1406 flow [2025-03-17 11:06:21,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 439 transitions, 1400 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-17 11:06:21,523 INFO L231 Difference]: Finished difference. Result has 393 places, 430 transitions, 1432 flow [2025-03-17 11:06:21,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=970, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1432, PETRI_PLACES=393, PETRI_TRANSITIONS=430} [2025-03-17 11:06:21,524 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 57 predicate places. [2025-03-17 11:06:21,524 INFO L471 AbstractCegarLoop]: Abstraction has has 393 places, 430 transitions, 1432 flow [2025-03-17 11:06:21,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 282.3333333333333) internal successors, (1694), 6 states have internal predecessors, (1694), 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-03-17 11:06:21,525 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:21,525 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 11:06:21,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:06:21,526 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-17 11:06:21,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:21,527 INFO L85 PathProgramCache]: Analyzing trace with hash 636673542, now seen corresponding path program 1 times [2025-03-17 11:06:21,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:21,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387450725] [2025-03-17 11:06:21,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:21,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:21,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-03-17 11:06:21,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-03-17 11:06:21,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:21,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:21,943 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-03-17 11:06:21,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:21,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387450725] [2025-03-17 11:06:21,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387450725] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:06:21,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011656420] [2025-03-17 11:06:21,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:21,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:06:21,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:06:21,946 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-03-17 11:06:21,948 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-03-17 11:06:22,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-03-17 11:06:22,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-03-17 11:06:22,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:22,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:22,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 1616 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 11:06:22,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:06:22,608 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-03-17 11:06:22,608 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:06:22,974 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-03-17 11:06:22,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011656420] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:06:22,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:06:22,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-17 11:06:22,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112981846] [2025-03-17 11:06:22,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:06:22,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 11:06:22,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:22,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 11:06:22,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-17 11:06:23,153 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 337 [2025-03-17 11:06:23,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 430 transitions, 1432 flow. Second operand has 18 states, 18 states have (on average 323.0) internal successors, (5814), 18 states have internal predecessors, (5814), 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-03-17 11:06:23,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:23,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 337 [2025-03-17 11:06:23,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:23,621 INFO L124 PetriNetUnfolderBase]: 153/2089 cut-off events. [2025-03-17 11:06:23,621 INFO L125 PetriNetUnfolderBase]: For 309/323 co-relation queries the response was YES. [2025-03-17 11:06:23,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2939 conditions, 2089 events. 153/2089 cut-off events. For 309/323 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7436 event pairs, 23 based on Foata normal form. 4/2007 useless extension candidates. Maximal degree in co-relation 2684. Up to 207 conditions per place. [2025-03-17 11:06:23,629 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 19 selfloop transitions, 21 changer transitions 0/448 dead transitions. [2025-03-17 11:06:23,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 448 transitions, 1600 flow [2025-03-17 11:06:23,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 11:06:23,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-17 11:06:23,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6784 transitions. [2025-03-17 11:06:23,632 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9585982761056945 [2025-03-17 11:06:23,632 INFO L175 Difference]: Start difference. First operand has 393 places, 430 transitions, 1432 flow. Second operand 21 states and 6784 transitions. [2025-03-17 11:06:23,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 448 transitions, 1600 flow [2025-03-17 11:06:23,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 448 transitions, 1600 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:06:23,639 INFO L231 Difference]: Finished difference. Result has 418 places, 443 transitions, 1562 flow [2025-03-17 11:06:23,640 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=1432, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1562, PETRI_PLACES=418, PETRI_TRANSITIONS=443} [2025-03-17 11:06:23,640 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 82 predicate places. [2025-03-17 11:06:23,640 INFO L471 AbstractCegarLoop]: Abstraction has has 418 places, 443 transitions, 1562 flow [2025-03-17 11:06:23,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 323.0) internal successors, (5814), 18 states have internal predecessors, (5814), 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-03-17 11:06:23,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:23,642 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 11:06:23,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 11:06:23,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 11:06:23,842 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-17 11:06:23,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:23,844 INFO L85 PathProgramCache]: Analyzing trace with hash 782513606, now seen corresponding path program 2 times [2025-03-17 11:06:23,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:23,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314559170] [2025-03-17 11:06:23,844 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:06:23,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:23,934 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 889 statements into 2 equivalence classes. [2025-03-17 11:06:23,937 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 104 of 889 statements. [2025-03-17 11:06:23,937 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:06:23,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:24,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3182 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3182 trivial. 0 not checked. [2025-03-17 11:06:24,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:24,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314559170] [2025-03-17 11:06:24,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314559170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:24,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:24,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:06:24,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579663965] [2025-03-17 11:06:24,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:24,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:06:24,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:24,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:06:24,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:06:24,428 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 337 [2025-03-17 11:06:24,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 443 transitions, 1562 flow. Second operand has 6 states, 6 states have (on average 282.1666666666667) internal successors, (1693), 6 states have internal predecessors, (1693), 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-03-17 11:06:24,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:24,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 337 [2025-03-17 11:06:24,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:25,334 INFO L124 PetriNetUnfolderBase]: 546/3193 cut-off events. [2025-03-17 11:06:25,334 INFO L125 PetriNetUnfolderBase]: For 957/1032 co-relation queries the response was YES. [2025-03-17 11:06:25,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5654 conditions, 3193 events. 546/3193 cut-off events. For 957/1032 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 16116 event pairs, 93 based on Foata normal form. 16/3044 useless extension candidates. Maximal degree in co-relation 5394. Up to 981 conditions per place. [2025-03-17 11:06:25,347 INFO L140 encePairwiseOnDemand]: 314/337 looper letters, 131 selfloop transitions, 130 changer transitions 0/580 dead transitions. [2025-03-17 11:06:25,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 580 transitions, 2734 flow [2025-03-17 11:06:25,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:06:25,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:06:25,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1793 transitions. [2025-03-17 11:06:25,349 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8867457962413452 [2025-03-17 11:06:25,349 INFO L175 Difference]: Start difference. First operand has 418 places, 443 transitions, 1562 flow. Second operand 6 states and 1793 transitions. [2025-03-17 11:06:25,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 580 transitions, 2734 flow [2025-03-17 11:06:25,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 580 transitions, 2710 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-17 11:06:25,360 INFO L231 Difference]: Finished difference. Result has 422 places, 572 transitions, 2766 flow [2025-03-17 11:06:25,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=1538, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2766, PETRI_PLACES=422, PETRI_TRANSITIONS=572} [2025-03-17 11:06:25,361 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 86 predicate places. [2025-03-17 11:06:25,361 INFO L471 AbstractCegarLoop]: Abstraction has has 422 places, 572 transitions, 2766 flow [2025-03-17 11:06:25,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 282.1666666666667) internal successors, (1693), 6 states have internal predecessors, (1693), 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-03-17 11:06:25,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:25,362 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 11:06:25,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:06:25,362 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-17 11:06:25,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:25,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1314445316, now seen corresponding path program 1 times [2025-03-17 11:06:25,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:25,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615567653] [2025-03-17 11:06:25,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:25,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:25,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 899 statements into 1 equivalence classes. [2025-03-17 11:06:25,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 899 of 899 statements. [2025-03-17 11:06:25,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:25,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:26,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3182 backedges. 0 proven. 2842 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-03-17 11:06:26,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:26,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615567653] [2025-03-17 11:06:26,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615567653] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:06:26,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356883048] [2025-03-17 11:06:26,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:26,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:06:26,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:06:26,574 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-03-17 11:06:26,575 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-03-17 11:06:26,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 899 statements into 1 equivalence classes. [2025-03-17 11:06:27,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 899 of 899 statements. [2025-03-17 11:06:27,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:27,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:27,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 3333 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 11:06:27,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:06:27,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3182 backedges. 0 proven. 2842 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-03-17 11:06:27,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:06:28,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3182 backedges. 0 proven. 2842 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-03-17 11:06:28,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356883048] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:06:28,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:06:28,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-17 11:06:28,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156766307] [2025-03-17 11:06:28,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:06:28,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 11:06:28,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:28,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 11:06:28,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-17 11:06:28,643 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 337 [2025-03-17 11:06:28,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 572 transitions, 2766 flow. Second operand has 23 states, 23 states have (on average 323.0869565217391) internal successors, (7431), 23 states have internal predecessors, (7431), 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-03-17 11:06:28,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:28,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 337 [2025-03-17 11:06:28,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:29,563 INFO L124 PetriNetUnfolderBase]: 414/3184 cut-off events. [2025-03-17 11:06:29,563 INFO L125 PetriNetUnfolderBase]: For 1291/1323 co-relation queries the response was YES. [2025-03-17 11:06:29,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5529 conditions, 3184 events. 414/3184 cut-off events. For 1291/1323 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 13452 event pairs, 39 based on Foata normal form. 7/3083 useless extension candidates. Maximal degree in co-relation 5264. Up to 468 conditions per place. [2025-03-17 11:06:29,575 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 22 selfloop transitions, 30 changer transitions 0/589 dead transitions. [2025-03-17 11:06:29,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 589 transitions, 2992 flow [2025-03-17 11:06:29,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-17 11:06:29,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-17 11:06:29,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 9684 transitions. [2025-03-17 11:06:29,582 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9578635014836795 [2025-03-17 11:06:29,582 INFO L175 Difference]: Start difference. First operand has 422 places, 572 transitions, 2766 flow. Second operand 30 states and 9684 transitions. [2025-03-17 11:06:29,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 589 transitions, 2992 flow [2025-03-17 11:06:29,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 589 transitions, 2992 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:06:29,594 INFO L231 Difference]: Finished difference. Result has 455 places, 582 transitions, 2918 flow [2025-03-17 11:06:29,595 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=2766, PETRI_DIFFERENCE_MINUEND_PLACES=422, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=549, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=2918, PETRI_PLACES=455, PETRI_TRANSITIONS=582} [2025-03-17 11:06:29,595 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 119 predicate places. [2025-03-17 11:06:29,595 INFO L471 AbstractCegarLoop]: Abstraction has has 455 places, 582 transitions, 2918 flow [2025-03-17 11:06:29,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 323.0869565217391) internal successors, (7431), 23 states have internal predecessors, (7431), 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-03-17 11:06:29,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:29,597 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:06:29,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 11:06:29,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 11:06:29,798 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-17 11:06:29,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:29,800 INFO L85 PathProgramCache]: Analyzing trace with hash -88035901, now seen corresponding path program 2 times [2025-03-17 11:06:29,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:29,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063556006] [2025-03-17 11:06:29,801 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:06:29,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:29,922 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1214 statements into 2 equivalence classes. [2025-03-17 11:06:29,925 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 114 of 1214 statements. [2025-03-17 11:06:29,926 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:06:29,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:30,061 INFO L134 CoverageAnalysis]: Checked inductivity of 6470 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6470 trivial. 0 not checked. [2025-03-17 11:06:30,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:30,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063556006] [2025-03-17 11:06:30,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063556006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:30,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:30,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:06:30,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376704018] [2025-03-17 11:06:30,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:30,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:06:30,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:30,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:06:30,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:06:30,349 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 337 [2025-03-17 11:06:30,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 582 transitions, 2918 flow. Second operand has 6 states, 6 states have (on average 282.3333333333333) internal successors, (1694), 6 states have internal predecessors, (1694), 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-03-17 11:06:30,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:30,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 337 [2025-03-17 11:06:30,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:31,423 INFO L124 PetriNetUnfolderBase]: 822/4274 cut-off events. [2025-03-17 11:06:31,423 INFO L125 PetriNetUnfolderBase]: For 3371/3545 co-relation queries the response was YES. [2025-03-17 11:06:31,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9001 conditions, 4274 events. 822/4274 cut-off events. For 3371/3545 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 22430 event pairs, 74 based on Foata normal form. 76/4175 useless extension candidates. Maximal degree in co-relation 8732. Up to 1323 conditions per place. [2025-03-17 11:06:31,437 INFO L140 encePairwiseOnDemand]: 314/337 looper letters, 251 selfloop transitions, 131 changer transitions 5/720 dead transitions. [2025-03-17 11:06:31,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 720 transitions, 4592 flow [2025-03-17 11:06:31,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:06:31,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:06:31,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1794 transitions. [2025-03-17 11:06:31,439 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.887240356083086 [2025-03-17 11:06:31,439 INFO L175 Difference]: Start difference. First operand has 455 places, 582 transitions, 2918 flow. Second operand 6 states and 1794 transitions. [2025-03-17 11:06:31,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 720 transitions, 4592 flow [2025-03-17 11:06:31,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 720 transitions, 4546 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-03-17 11:06:31,451 INFO L231 Difference]: Finished difference. Result has 447 places, 710 transitions, 4352 flow [2025-03-17 11:06:31,451 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=2872, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4352, PETRI_PLACES=447, PETRI_TRANSITIONS=710} [2025-03-17 11:06:31,452 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 111 predicate places. [2025-03-17 11:06:31,452 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 710 transitions, 4352 flow [2025-03-17 11:06:31,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 282.3333333333333) internal successors, (1694), 6 states have internal predecessors, (1694), 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-03-17 11:06:31,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:31,453 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:06:31,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:06:31,453 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-17 11:06:31,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:31,455 INFO L85 PathProgramCache]: Analyzing trace with hash -369219088, now seen corresponding path program 1 times [2025-03-17 11:06:31,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:31,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475440463] [2025-03-17 11:06:31,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:31,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:31,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1215 statements into 1 equivalence classes. [2025-03-17 11:06:31,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1215 of 1215 statements. [2025-03-17 11:06:31,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:31,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:34,489 INFO L134 CoverageAnalysis]: Checked inductivity of 6470 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6470 trivial. 0 not checked. [2025-03-17 11:06:34,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:34,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475440463] [2025-03-17 11:06:34,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475440463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:34,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:34,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:06:34,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497285327] [2025-03-17 11:06:34,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:34,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:06:34,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:34,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:06:34,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:06:34,735 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 337 [2025-03-17 11:06:34,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 710 transitions, 4352 flow. Second operand has 6 states, 6 states have (on average 262.6666666666667) internal successors, (1576), 6 states have internal predecessors, (1576), 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-03-17 11:06:34,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:34,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 337 [2025-03-17 11:06:34,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:36,339 INFO L124 PetriNetUnfolderBase]: 1309/5603 cut-off events. [2025-03-17 11:06:36,339 INFO L125 PetriNetUnfolderBase]: For 4983/5040 co-relation queries the response was YES. [2025-03-17 11:06:36,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13619 conditions, 5603 events. 1309/5603 cut-off events. For 4983/5040 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 33887 event pairs, 369 based on Foata normal form. 11/5369 useless extension candidates. Maximal degree in co-relation 13346. Up to 2549 conditions per place. [2025-03-17 11:06:36,367 INFO L140 encePairwiseOnDemand]: 318/337 looper letters, 316 selfloop transitions, 84 changer transitions 0/789 dead transitions. [2025-03-17 11:06:36,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 789 transitions, 5550 flow [2025-03-17 11:06:36,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:06:36,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:06:36,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1672 transitions. [2025-03-17 11:06:36,369 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8269040553907022 [2025-03-17 11:06:36,369 INFO L175 Difference]: Start difference. First operand has 447 places, 710 transitions, 4352 flow. Second operand 6 states and 1672 transitions. [2025-03-17 11:06:36,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 789 transitions, 5550 flow [2025-03-17 11:06:36,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 789 transitions, 5296 flow, removed 127 selfloop flow, removed 0 redundant places. [2025-03-17 11:06:36,392 INFO L231 Difference]: Finished difference. Result has 456 places, 781 transitions, 4888 flow [2025-03-17 11:06:36,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=4104, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=710, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=662, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4888, PETRI_PLACES=456, PETRI_TRANSITIONS=781} [2025-03-17 11:06:36,393 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 120 predicate places. [2025-03-17 11:06:36,394 INFO L471 AbstractCegarLoop]: Abstraction has has 456 places, 781 transitions, 4888 flow [2025-03-17 11:06:36,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 262.6666666666667) internal successors, (1576), 6 states have internal predecessors, (1576), 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-03-17 11:06:36,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:36,394 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:06:36,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 11:06:36,395 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-17 11:06:36,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:36,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1751889048, now seen corresponding path program 1 times [2025-03-17 11:06:36,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:36,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328669618] [2025-03-17 11:06:36,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:36,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:36,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1221 statements into 1 equivalence classes. [2025-03-17 11:06:38,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1221 of 1221 statements. [2025-03-17 11:06:38,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:38,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:07:03,511 INFO L134 CoverageAnalysis]: Checked inductivity of 6470 backedges. 2127 proven. 3973 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-03-17 11:07:03,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:07:03,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328669618] [2025-03-17 11:07:03,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328669618] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:07:03,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356618931] [2025-03-17 11:07:03,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:07:03,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:07:03,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:07:03,518 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:07:03,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 11:07:04,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1221 statements into 1 equivalence classes. [2025-03-17 11:07:05,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1221 of 1221 statements. [2025-03-17 11:07:05,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:07:05,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:07:05,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 4602 conjuncts, 132 conjuncts are in the unsatisfiable core [2025-03-17 11:07:05,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:07:05,620 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 11:07:05,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-17 11:07:06,092 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-17 11:07:06,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-03-17 11:07:06,835 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-17 11:07:06,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-03-17 11:07:07,143 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-17 11:07:07,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-03-17 11:07:07,882 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-17 11:07:07,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-03-17 11:07:08,226 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-03-17 11:07:08,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2025-03-17 11:07:09,253 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2025-03-17 11:07:09,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2025-03-17 11:07:10,032 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-17 11:07:10,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-03-17 11:07:11,628 INFO L349 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2025-03-17 11:07:11,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 32 treesize of output 57 [2025-03-17 11:07:12,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 11:07:13,236 INFO L349 Elim1Store]: treesize reduction 118, result has 33.0 percent of original size [2025-03-17 11:07:13,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 45 treesize of output 76 [2025-03-17 11:07:13,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 35 [2025-03-17 11:07:14,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 35 [2025-03-17 11:07:15,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 29 [2025-03-17 11:07:17,088 INFO L349 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2025-03-17 11:07:17,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 39 treesize of output 64 [2025-03-17 11:07:18,175 INFO L349 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2025-03-17 11:07:18,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 39 treesize of output 64 [2025-03-17 11:07:20,110 INFO L349 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2025-03-17 11:07:20,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 39 treesize of output 64 [2025-03-17 11:07:21,122 INFO L349 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2025-03-17 11:07:21,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 39 treesize of output 64 [2025-03-17 11:07:23,014 INFO L349 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2025-03-17 11:07:23,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 39 treesize of output 64 [2025-03-17 11:07:23,989 INFO L349 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2025-03-17 11:07:23,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 39 treesize of output 64 [2025-03-17 11:07:25,943 INFO L349 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2025-03-17 11:07:25,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 39 treesize of output 64 [2025-03-17 11:07:26,979 INFO L349 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2025-03-17 11:07:26,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 39 treesize of output 64 [2025-03-17 11:07:28,872 INFO L349 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2025-03-17 11:07:28,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 39 treesize of output 64 [2025-03-17 11:07:29,913 INFO L349 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2025-03-17 11:07:29,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 39 treesize of output 64