./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_16-arrayloop_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 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_16-arrayloop_rc.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 5810bf8f90e8e4e20451fbc06dd5039f754e5765485d12699b814c2e1d4badb7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:46:57,597 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:46:57,649 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:46:57,657 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:46:57,658 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:46:57,676 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:46:57,677 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:46:57,677 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:46:57,677 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:46:57,678 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:46:57,678 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:46:57,679 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:46:57,679 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:46:57,679 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:46:57,679 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:46:57,679 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:46:57,679 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:46:57,679 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:46:57,679 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:46:57,680 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:46:57,680 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:46:57,680 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:46:57,680 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:46:57,680 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:46:57,680 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:46:57,680 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:46:57,680 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:46:57,680 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:46:57,680 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:46:57,680 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:46:57,681 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:46:57,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:46:57,681 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:46:57,681 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:46:57,681 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:46:57,681 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:46:57,681 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:46:57,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:46:57,682 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:46:57,682 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:46:57,682 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:46:57,682 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:46:57,682 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 -> 5810bf8f90e8e4e20451fbc06dd5039f754e5765485d12699b814c2e1d4badb7 [2025-03-04 06:46:57,899 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:46:57,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:46:57,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:46:57,912 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:46:57,913 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:46:57,914 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_16-arrayloop_rc.i [2025-03-04 06:46:59,065 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a211a13e/3aa814f473eb4b19a7e5a2f3d3487bce/FLAG3c19831c0 [2025-03-04 06:46:59,322 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:46:59,323 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_16-arrayloop_rc.i [2025-03-04 06:46:59,334 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a211a13e/3aa814f473eb4b19a7e5a2f3d3487bce/FLAG3c19831c0 [2025-03-04 06:46:59,344 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a211a13e/3aa814f473eb4b19a7e5a2f3d3487bce [2025-03-04 06:46:59,345 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:46:59,346 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:46:59,347 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:46:59,347 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:46:59,350 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:46:59,350 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:46:59" (1/1) ... [2025-03-04 06:46:59,351 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28dbc3c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:59, skipping insertion in model container [2025-03-04 06:46:59,351 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:46:59" (1/1) ... [2025-03-04 06:46:59,382 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:46:59,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:46:59,809 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:46:59,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:46:59,899 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:46:59,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:59 WrapperNode [2025-03-04 06:46:59,900 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:46:59,900 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:46:59,900 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:46:59,900 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:46:59,906 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:59" (1/1) ... [2025-03-04 06:46:59,918 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:59" (1/1) ... [2025-03-04 06:46:59,943 INFO L138 Inliner]: procedures = 370, calls = 86, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 283 [2025-03-04 06:46:59,944 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:46:59,944 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:46:59,944 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:46:59,944 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:46:59,950 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:59" (1/1) ... [2025-03-04 06:46:59,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:59" (1/1) ... [2025-03-04 06:46:59,957 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:59" (1/1) ... [2025-03-04 06:46:59,958 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:59" (1/1) ... [2025-03-04 06:46:59,971 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:59" (1/1) ... [2025-03-04 06:46:59,977 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:59" (1/1) ... [2025-03-04 06:46:59,979 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:59" (1/1) ... [2025-03-04 06:46:59,980 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:59" (1/1) ... [2025-03-04 06:46:59,983 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:46:59,984 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:46:59,984 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:46:59,984 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:46:59,988 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:59" (1/1) ... [2025-03-04 06:46:59,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:47:00,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:47:00,015 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-04 06:47:00,018 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-04 06:47:00,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-04 06:47:00,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-04 06:47:00,034 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:47:00,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:47:00,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:47:00,034 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:47:00,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:47:00,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:47:00,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-04 06:47:00,035 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 06:47:00,035 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 06:47:00,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:47:00,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:47:00,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:47:00,036 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:47:00,137 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:47:00,139 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:47:00,581 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:47:00,581 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:47:00,609 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:47:00,611 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:47:00,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:47:00 BoogieIcfgContainer [2025-03-04 06:47:00,612 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:47:00,613 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:47:00,613 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:47:00,616 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:47:00,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:46:59" (1/3) ... [2025-03-04 06:47:00,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ca7517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:47:00, skipping insertion in model container [2025-03-04 06:47:00,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:59" (2/3) ... [2025-03-04 06:47:00,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ca7517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:47:00, skipping insertion in model container [2025-03-04 06:47:00,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:47:00" (3/3) ... [2025-03-04 06:47:00,620 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_16-arrayloop_rc.i [2025-03-04 06:47:00,630 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:47:00,632 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_16-arrayloop_rc.i that has 2 procedures, 319 locations, 1 initial locations, 3 loop locations, and 18 error locations. [2025-03-04 06:47:00,632 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:47:00,735 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:47:00,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 322 places, 321 transitions, 646 flow [2025-03-04 06:47:00,845 INFO L124 PetriNetUnfolderBase]: 3/320 cut-off events. [2025-03-04 06:47:00,846 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:47:00,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 320 events. 3/320 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 432 event pairs, 0 based on Foata normal form. 0/299 useless extension candidates. Maximal degree in co-relation 199. Up to 2 conditions per place. [2025-03-04 06:47:00,858 INFO L82 GeneralOperation]: Start removeDead. Operand has 322 places, 321 transitions, 646 flow [2025-03-04 06:47:00,863 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 321 places, 320 transitions, 643 flow [2025-03-04 06:47:00,869 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:47:00,877 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;@387d1a31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:47:00,877 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-03-04 06:47:00,898 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:47:00,899 INFO L124 PetriNetUnfolderBase]: 0/121 cut-off events. [2025-03-04 06:47:00,899 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:47:00,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:00,899 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] [2025-03-04 06:47:00,900 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-04 06:47:00,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:00,904 INFO L85 PathProgramCache]: Analyzing trace with hash 34199624, now seen corresponding path program 1 times [2025-03-04 06:47:00,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:00,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008540223] [2025-03-04 06:47:00,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:00,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:00,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 06:47:01,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 06:47:01,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:01,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:01,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:01,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:01,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008540223] [2025-03-04 06:47:01,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008540223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:01,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:01,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:01,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118409384] [2025-03-04 06:47:01,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:01,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:01,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:01,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:01,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:02,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 321 [2025-03-04 06:47:02,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 320 transitions, 643 flow. Second operand has 6 states, 6 states have (on average 239.33333333333334) internal successors, (1436), 6 states have internal predecessors, (1436), 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-04 06:47:02,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:02,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 321 [2025-03-04 06:47:02,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:03,004 INFO L124 PetriNetUnfolderBase]: 1265/4916 cut-off events. [2025-03-04 06:47:03,005 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:47:03,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7460 conditions, 4916 events. 1265/4916 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 36271 event pairs, 912 based on Foata normal form. 0/4506 useless extension candidates. Maximal degree in co-relation 7320. Up to 2359 conditions per place. [2025-03-04 06:47:03,024 INFO L140 encePairwiseOnDemand]: 284/321 looper letters, 84 selfloop transitions, 107 changer transitions 0/428 dead transitions. [2025-03-04 06:47:03,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 428 transitions, 1241 flow [2025-03-04 06:47:03,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:03,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:03,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1621 transitions. [2025-03-04 06:47:03,043 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8416407061266874 [2025-03-04 06:47:03,044 INFO L175 Difference]: Start difference. First operand has 321 places, 320 transitions, 643 flow. Second operand 6 states and 1621 transitions. [2025-03-04 06:47:03,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 428 transitions, 1241 flow [2025-03-04 06:47:03,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 428 transitions, 1240 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:47:03,057 INFO L231 Difference]: Finished difference. Result has 329 places, 420 transitions, 1330 flow [2025-03-04 06:47:03,062 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1330, PETRI_PLACES=329, PETRI_TRANSITIONS=420} [2025-03-04 06:47:03,064 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, 8 predicate places. [2025-03-04 06:47:03,066 INFO L471 AbstractCegarLoop]: Abstraction has has 329 places, 420 transitions, 1330 flow [2025-03-04 06:47:03,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 239.33333333333334) internal successors, (1436), 6 states have internal predecessors, (1436), 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-04 06:47:03,067 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:03,067 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] [2025-03-04 06:47:03,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:47:03,067 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-04 06:47:03,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:03,069 INFO L85 PathProgramCache]: Analyzing trace with hash -623977462, now seen corresponding path program 1 times [2025-03-04 06:47:03,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:03,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005860090] [2025-03-04 06:47:03,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:03,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:03,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 06:47:03,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 06:47:03,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:03,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:03,485 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-04 06:47:03,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:03,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005860090] [2025-03-04 06:47:03,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005860090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:03,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:03,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:03,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006892836] [2025-03-04 06:47:03,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:03,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:03,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:03,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:03,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:03,857 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 321 [2025-03-04 06:47:03,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 420 transitions, 1330 flow. Second operand has 6 states, 6 states have (on average 239.33333333333334) internal successors, (1436), 6 states have internal predecessors, (1436), 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-04 06:47:03,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:03,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 321 [2025-03-04 06:47:03,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:04,533 INFO L124 PetriNetUnfolderBase]: 1531/5800 cut-off events. [2025-03-04 06:47:04,534 INFO L125 PetriNetUnfolderBase]: For 1217/1220 co-relation queries the response was YES. [2025-03-04 06:47:04,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10592 conditions, 5800 events. 1531/5800 cut-off events. For 1217/1220 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 44152 event pairs, 936 based on Foata normal form. 0/5357 useless extension candidates. Maximal degree in co-relation 10439. Up to 2637 conditions per place. [2025-03-04 06:47:04,559 INFO L140 encePairwiseOnDemand]: 284/321 looper letters, 180 selfloop transitions, 107 changer transitions 0/528 dead transitions. [2025-03-04 06:47:04,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 528 transitions, 2312 flow [2025-03-04 06:47:04,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:04,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:04,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1621 transitions. [2025-03-04 06:47:04,563 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8416407061266874 [2025-03-04 06:47:04,563 INFO L175 Difference]: Start difference. First operand has 329 places, 420 transitions, 1330 flow. Second operand 6 states and 1621 transitions. [2025-03-04 06:47:04,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 528 transitions, 2312 flow [2025-03-04 06:47:04,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 528 transitions, 2312 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:47:04,583 INFO L231 Difference]: Finished difference. Result has 338 places, 520 transitions, 2210 flow [2025-03-04 06:47:04,583 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=1328, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2210, PETRI_PLACES=338, PETRI_TRANSITIONS=520} [2025-03-04 06:47:04,584 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, 17 predicate places. [2025-03-04 06:47:04,584 INFO L471 AbstractCegarLoop]: Abstraction has has 338 places, 520 transitions, 2210 flow [2025-03-04 06:47:04,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 239.33333333333334) internal successors, (1436), 6 states have internal predecessors, (1436), 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-04 06:47:04,585 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:04,585 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-04 06:47:04,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:47:04,586 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-04 06:47:04,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:04,587 INFO L85 PathProgramCache]: Analyzing trace with hash -707668766, now seen corresponding path program 1 times [2025-03-04 06:47:04,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:04,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179287042] [2025-03-04 06:47:04,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:04,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:04,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 06:47:04,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 06:47:04,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:04,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:04,680 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-04 06:47:04,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:04,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179287042] [2025-03-04 06:47:04,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179287042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:04,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:04,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:47:04,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360397567] [2025-03-04 06:47:04,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:04,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:47:04,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:04,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:47:04,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:47:04,731 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 321 [2025-03-04 06:47:04,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 520 transitions, 2210 flow. Second operand has 3 states, 3 states have (on average 309.0) internal successors, (927), 3 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:04,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:04,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 321 [2025-03-04 06:47:04,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:05,271 INFO L124 PetriNetUnfolderBase]: 1081/4426 cut-off events. [2025-03-04 06:47:05,271 INFO L125 PetriNetUnfolderBase]: For 1106/1112 co-relation queries the response was YES. [2025-03-04 06:47:05,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8836 conditions, 4426 events. 1081/4426 cut-off events. For 1106/1112 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 28499 event pairs, 108 based on Foata normal form. 4/4184 useless extension candidates. Maximal degree in co-relation 8615. Up to 1137 conditions per place. [2025-03-04 06:47:05,293 INFO L140 encePairwiseOnDemand]: 315/321 looper letters, 16 selfloop transitions, 4 changer transitions 0/526 dead transitions. [2025-03-04 06:47:05,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 526 transitions, 2262 flow [2025-03-04 06:47:05,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:47:05,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:47:05,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 943 transitions. [2025-03-04 06:47:05,295 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9792315680166147 [2025-03-04 06:47:05,296 INFO L175 Difference]: Start difference. First operand has 338 places, 520 transitions, 2210 flow. Second operand 3 states and 943 transitions. [2025-03-04 06:47:05,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 526 transitions, 2262 flow [2025-03-04 06:47:05,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 526 transitions, 2070 flow, removed 96 selfloop flow, removed 0 redundant places. [2025-03-04 06:47:05,312 INFO L231 Difference]: Finished difference. Result has 341 places, 522 transitions, 2042 flow [2025-03-04 06:47:05,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=2018, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=520, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2042, PETRI_PLACES=341, PETRI_TRANSITIONS=522} [2025-03-04 06:47:05,314 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, 20 predicate places. [2025-03-04 06:47:05,314 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 522 transitions, 2042 flow [2025-03-04 06:47:05,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 309.0) internal successors, (927), 3 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:05,315 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:05,315 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:47:05,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:47:05,315 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-04 06:47:05,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:05,316 INFO L85 PathProgramCache]: Analyzing trace with hash -175300369, now seen corresponding path program 1 times [2025-03-04 06:47:05,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:05,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981747321] [2025-03-04 06:47:05,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:05,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:05,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 06:47:05,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 06:47:05,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:05,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:05,686 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-04 06:47:05,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:05,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981747321] [2025-03-04 06:47:05,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981747321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:05,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:05,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:05,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970598972] [2025-03-04 06:47:05,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:05,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:05,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:05,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:05,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:06,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 321 [2025-03-04 06:47:06,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 522 transitions, 2042 flow. Second operand has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 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-04 06:47:06,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:06,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 321 [2025-03-04 06:47:06,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:07,565 INFO L124 PetriNetUnfolderBase]: 2970/10686 cut-off events. [2025-03-04 06:47:07,566 INFO L125 PetriNetUnfolderBase]: For 6020/6123 co-relation queries the response was YES. [2025-03-04 06:47:07,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23742 conditions, 10686 events. 2970/10686 cut-off events. For 6020/6123 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 84582 event pairs, 1872 based on Foata normal form. 0/10145 useless extension candidates. Maximal degree in co-relation 23486. Up to 5591 conditions per place. [2025-03-04 06:47:07,623 INFO L140 encePairwiseOnDemand]: 315/321 looper letters, 285 selfloop transitions, 5 changer transitions 0/521 dead transitions. [2025-03-04 06:47:07,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 521 transitions, 2620 flow [2025-03-04 06:47:07,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:07,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:07,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1471 transitions. [2025-03-04 06:47:07,627 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7637590861889927 [2025-03-04 06:47:07,627 INFO L175 Difference]: Start difference. First operand has 341 places, 522 transitions, 2042 flow. Second operand 6 states and 1471 transitions. [2025-03-04 06:47:07,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 521 transitions, 2620 flow [2025-03-04 06:47:07,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 521 transitions, 2616 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:47:07,643 INFO L231 Difference]: Finished difference. Result has 344 places, 521 transitions, 2046 flow [2025-03-04 06:47:07,643 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=2036, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2046, PETRI_PLACES=344, PETRI_TRANSITIONS=521} [2025-03-04 06:47:07,644 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, 23 predicate places. [2025-03-04 06:47:07,644 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 521 transitions, 2046 flow [2025-03-04 06:47:07,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 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-04 06:47:07,645 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:07,645 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:47:07,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:47:07,645 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-04 06:47:07,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:07,646 INFO L85 PathProgramCache]: Analyzing trace with hash 145570978, now seen corresponding path program 1 times [2025-03-04 06:47:07,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:07,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630762986] [2025-03-04 06:47:07,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:07,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:07,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-04 06:47:07,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-04 06:47:07,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:07,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:07,788 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-04 06:47:07,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:07,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630762986] [2025-03-04 06:47:07,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630762986] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:47:07,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103592899] [2025-03-04 06:47:07,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:07,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:47:07,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:47:07,791 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-04 06:47:07,898 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-04 06:47:07,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-04 06:47:08,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-04 06:47:08,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:08,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:08,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 06:47:08,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:47:08,117 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-04 06:47:08,117 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:47:08,189 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-04 06:47:08,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103592899] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:47:08,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:47:08,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 06:47:08,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816406505] [2025-03-04 06:47:08,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:47:08,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:47:08,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:08,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:47:08,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:47:08,372 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 321 [2025-03-04 06:47:08,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 521 transitions, 2046 flow. Second operand has 10 states, 10 states have (on average 305.0) internal successors, (3050), 10 states have internal predecessors, (3050), 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-04 06:47:08,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:08,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 321 [2025-03-04 06:47:08,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:08,885 INFO L124 PetriNetUnfolderBase]: 1095/4581 cut-off events. [2025-03-04 06:47:08,885 INFO L125 PetriNetUnfolderBase]: For 683/689 co-relation queries the response was YES. [2025-03-04 06:47:08,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8884 conditions, 4581 events. 1095/4581 cut-off events. For 683/689 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 29283 event pairs, 106 based on Foata normal form. 2/4327 useless extension candidates. Maximal degree in co-relation 8588. Up to 922 conditions per place. [2025-03-04 06:47:09,007 INFO L140 encePairwiseOnDemand]: 312/321 looper letters, 22 selfloop transitions, 13 changer transitions 0/536 dead transitions. [2025-03-04 06:47:09,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 536 transitions, 2148 flow [2025-03-04 06:47:09,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:47:09,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 06:47:09,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2764 transitions. [2025-03-04 06:47:09,012 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9567324333679473 [2025-03-04 06:47:09,012 INFO L175 Difference]: Start difference. First operand has 344 places, 521 transitions, 2046 flow. Second operand 9 states and 2764 transitions. [2025-03-04 06:47:09,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 536 transitions, 2148 flow [2025-03-04 06:47:09,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 536 transitions, 2138 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:09,022 INFO L231 Difference]: Finished difference. Result has 350 places, 528 transitions, 2104 flow [2025-03-04 06:47:09,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=2036, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=511, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2104, PETRI_PLACES=350, PETRI_TRANSITIONS=528} [2025-03-04 06:47:09,023 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, 29 predicate places. [2025-03-04 06:47:09,024 INFO L471 AbstractCegarLoop]: Abstraction has has 350 places, 528 transitions, 2104 flow [2025-03-04 06:47:09,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 305.0) internal successors, (3050), 10 states have internal predecessors, (3050), 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-04 06:47:09,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:09,025 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:47:09,032 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-04 06:47:09,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:47:09,230 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-04 06:47:09,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:09,231 INFO L85 PathProgramCache]: Analyzing trace with hash 940868770, now seen corresponding path program 2 times [2025-03-04 06:47:09,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:09,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426483292] [2025-03-04 06:47:09,231 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:47:09,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:09,256 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 220 statements into 2 equivalence classes. [2025-03-04 06:47:09,260 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 97 of 220 statements. [2025-03-04 06:47:09,260 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:47:09,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:09,429 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2025-03-04 06:47:09,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:09,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426483292] [2025-03-04 06:47:09,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426483292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:09,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:09,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:09,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006692465] [2025-03-04 06:47:09,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:09,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:09,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:09,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:09,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:09,729 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 321 [2025-03-04 06:47:09,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 528 transitions, 2104 flow. Second operand has 6 states, 6 states have (on average 244.66666666666666) internal successors, (1468), 6 states have internal predecessors, (1468), 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-04 06:47:09,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:09,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 321 [2025-03-04 06:47:09,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:11,799 INFO L124 PetriNetUnfolderBase]: 3572/12304 cut-off events. [2025-03-04 06:47:11,799 INFO L125 PetriNetUnfolderBase]: For 5280/5362 co-relation queries the response was YES. [2025-03-04 06:47:11,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26818 conditions, 12304 events. 3572/12304 cut-off events. For 5280/5362 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 98000 event pairs, 1616 based on Foata normal form. 0/11548 useless extension candidates. Maximal degree in co-relation 26484. Up to 6064 conditions per place. [2025-03-04 06:47:11,860 INFO L140 encePairwiseOnDemand]: 278/321 looper letters, 245 selfloop transitions, 170 changer transitions 0/697 dead transitions. [2025-03-04 06:47:11,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 697 transitions, 3412 flow [2025-03-04 06:47:11,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:11,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:11,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1684 transitions. [2025-03-04 06:47:11,864 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8743509865005192 [2025-03-04 06:47:11,865 INFO L175 Difference]: Start difference. First operand has 350 places, 528 transitions, 2104 flow. Second operand 6 states and 1684 transitions. [2025-03-04 06:47:11,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 697 transitions, 3412 flow [2025-03-04 06:47:11,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 697 transitions, 3402 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-04 06:47:11,884 INFO L231 Difference]: Finished difference. Result has 359 places, 689 transitions, 3344 flow [2025-03-04 06:47:11,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=2094, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=466, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3344, PETRI_PLACES=359, PETRI_TRANSITIONS=689} [2025-03-04 06:47:11,885 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, 38 predicate places. [2025-03-04 06:47:11,885 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 689 transitions, 3344 flow [2025-03-04 06:47:11,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 244.66666666666666) internal successors, (1468), 6 states have internal predecessors, (1468), 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-04 06:47:11,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:11,886 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:47:11,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:47:11,886 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-04 06:47:11,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:11,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1069253030, now seen corresponding path program 1 times [2025-03-04 06:47:11,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:11,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549993154] [2025-03-04 06:47:11,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:11,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:11,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-04 06:47:11,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-04 06:47:11,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:11,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:12,187 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:12,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:12,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549993154] [2025-03-04 06:47:12,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549993154] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:47:12,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132475846] [2025-03-04 06:47:12,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:12,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:47:12,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:47:12,190 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-04 06:47:12,191 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-04 06:47:12,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-04 06:47:12,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-04 06:47:12,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:12,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:12,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 06:47:12,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:47:12,522 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:12,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:47:12,717 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:12,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132475846] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:47:12,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:47:12,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-04 06:47:12,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410715925] [2025-03-04 06:47:12,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:47:12,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 06:47:12,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:12,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 06:47:12,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-04 06:47:13,035 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 321 [2025-03-04 06:47:13,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 689 transitions, 3344 flow. Second operand has 18 states, 18 states have (on average 305.0) internal successors, (5490), 18 states have internal predecessors, (5490), 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-04 06:47:13,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:13,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 321 [2025-03-04 06:47:13,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:14,395 INFO L124 PetriNetUnfolderBase]: 1777/6922 cut-off events. [2025-03-04 06:47:14,396 INFO L125 PetriNetUnfolderBase]: For 3172/3271 co-relation queries the response was YES. [2025-03-04 06:47:14,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16027 conditions, 6922 events. 1777/6922 cut-off events. For 3172/3271 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 48034 event pairs, 163 based on Foata normal form. 4/6621 useless extension candidates. Maximal degree in co-relation 15426. Up to 1392 conditions per place. [2025-03-04 06:47:14,428 INFO L140 encePairwiseOnDemand]: 312/321 looper letters, 26 selfloop transitions, 25 changer transitions 0/713 dead transitions. [2025-03-04 06:47:14,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 713 transitions, 3546 flow [2025-03-04 06:47:14,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 06:47:14,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 06:47:14,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6418 transitions. [2025-03-04 06:47:14,436 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9520842604954755 [2025-03-04 06:47:14,437 INFO L175 Difference]: Start difference. First operand has 359 places, 689 transitions, 3344 flow. Second operand 21 states and 6418 transitions. [2025-03-04 06:47:14,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 713 transitions, 3546 flow [2025-03-04 06:47:14,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 713 transitions, 3510 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-03-04 06:47:14,468 INFO L231 Difference]: Finished difference. Result has 384 places, 702 transitions, 3452 flow [2025-03-04 06:47:14,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=3308, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=689, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=674, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=3452, PETRI_PLACES=384, PETRI_TRANSITIONS=702} [2025-03-04 06:47:14,469 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, 63 predicate places. [2025-03-04 06:47:14,469 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 702 transitions, 3452 flow [2025-03-04 06:47:14,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 305.0) internal successors, (5490), 18 states have internal predecessors, (5490), 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-04 06:47:14,472 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:14,472 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:47:14,480 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-04 06:47:14,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 06:47:14,677 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-04 06:47:14,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:14,678 INFO L85 PathProgramCache]: Analyzing trace with hash -705424986, now seen corresponding path program 2 times [2025-03-04 06:47:14,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:14,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974520465] [2025-03-04 06:47:14,678 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:47:14,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:14,722 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 392 statements into 2 equivalence classes. [2025-03-04 06:47:14,728 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 105 of 392 statements. [2025-03-04 06:47:14,729 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:47:14,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:14,931 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 868 trivial. 0 not checked. [2025-03-04 06:47:14,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:14,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974520465] [2025-03-04 06:47:14,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974520465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:14,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:14,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:14,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075048140] [2025-03-04 06:47:14,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:14,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:14,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:14,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:14,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:15,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 321 [2025-03-04 06:47:15,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 702 transitions, 3452 flow. Second operand has 6 states, 6 states have (on average 244.66666666666666) internal successors, (1468), 6 states have internal predecessors, (1468), 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-04 06:47:15,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:15,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 321 [2025-03-04 06:47:15,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:18,276 INFO L124 PetriNetUnfolderBase]: 4263/14675 cut-off events. [2025-03-04 06:47:18,276 INFO L125 PetriNetUnfolderBase]: For 10453/10598 co-relation queries the response was YES. [2025-03-04 06:47:18,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37006 conditions, 14675 events. 4263/14675 cut-off events. For 10453/10598 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 119037 event pairs, 1677 based on Foata normal form. 0/13875 useless extension candidates. Maximal degree in co-relation 36312. Up to 6897 conditions per place. [2025-03-04 06:47:18,353 INFO L140 encePairwiseOnDemand]: 278/321 looper letters, 395 selfloop transitions, 170 changer transitions 0/871 dead transitions. [2025-03-04 06:47:18,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 871 transitions, 5360 flow [2025-03-04 06:47:18,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:18,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:18,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1684 transitions. [2025-03-04 06:47:18,356 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8743509865005192 [2025-03-04 06:47:18,356 INFO L175 Difference]: Start difference. First operand has 384 places, 702 transitions, 3452 flow. Second operand 6 states and 1684 transitions. [2025-03-04 06:47:18,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 871 transitions, 5360 flow [2025-03-04 06:47:18,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 871 transitions, 5334 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-04 06:47:18,541 INFO L231 Difference]: Finished difference. Result has 388 places, 863 transitions, 4976 flow [2025-03-04 06:47:18,542 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=3426, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=702, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=640, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4976, PETRI_PLACES=388, PETRI_TRANSITIONS=863} [2025-03-04 06:47:18,542 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, 67 predicate places. [2025-03-04 06:47:18,542 INFO L471 AbstractCegarLoop]: Abstraction has has 388 places, 863 transitions, 4976 flow [2025-03-04 06:47:18,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 244.66666666666666) internal successors, (1468), 6 states have internal predecessors, (1468), 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-04 06:47:18,543 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:18,543 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:47:18,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:47:18,543 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-04 06:47:18,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:18,544 INFO L85 PathProgramCache]: Analyzing trace with hash 369410306, now seen corresponding path program 1 times [2025-03-04 06:47:18,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:18,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305511548] [2025-03-04 06:47:18,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:18,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:18,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 400 statements into 1 equivalence classes. [2025-03-04 06:47:18,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 400 of 400 statements. [2025-03-04 06:47:18,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:18,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:19,291 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:19,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:19,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305511548] [2025-03-04 06:47:19,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305511548] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:47:19,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764183731] [2025-03-04 06:47:19,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:19,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:47:19,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:47:19,294 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-04 06:47:19,296 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-04 06:47:19,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 400 statements into 1 equivalence classes. [2025-03-04 06:47:19,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 400 of 400 statements. [2025-03-04 06:47:19,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:19,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:19,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 1413 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 06:47:19,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:47:19,916 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:19,917 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:47:20,304 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:20,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764183731] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:47:20,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:47:20,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-04 06:47:20,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024928373] [2025-03-04 06:47:20,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:47:20,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 06:47:20,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:20,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 06:47:20,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-04 06:47:20,622 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 321 [2025-03-04 06:47:20,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 863 transitions, 4976 flow. Second operand has 23 states, 23 states have (on average 305.2173913043478) internal successors, (7020), 23 states have internal predecessors, (7020), 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-04 06:47:20,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:20,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 321 [2025-03-04 06:47:20,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:22,800 INFO L124 PetriNetUnfolderBase]: 2478/9371 cut-off events. [2025-03-04 06:47:22,801 INFO L125 PetriNetUnfolderBase]: For 7419/7565 co-relation queries the response was YES. [2025-03-04 06:47:22,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24560 conditions, 9371 events. 2478/9371 cut-off events. For 7419/7565 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 68668 event pairs, 229 based on Foata normal form. 3/9000 useless extension candidates. Maximal degree in co-relation 23696. Up to 2110 conditions per place. [2025-03-04 06:47:22,847 INFO L140 encePairwiseOnDemand]: 312/321 looper letters, 29 selfloop transitions, 34 changer transitions 0/886 dead transitions. [2025-03-04 06:47:22,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 886 transitions, 5236 flow [2025-03-04 06:47:22,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 06:47:22,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-04 06:47:22,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 9156 transitions. [2025-03-04 06:47:22,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950778816199377 [2025-03-04 06:47:22,855 INFO L175 Difference]: Start difference. First operand has 388 places, 863 transitions, 4976 flow. Second operand 30 states and 9156 transitions. [2025-03-04 06:47:22,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 886 transitions, 5236 flow [2025-03-04 06:47:22,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 886 transitions, 4900 flow, removed 168 selfloop flow, removed 0 redundant places. [2025-03-04 06:47:22,909 INFO L231 Difference]: Finished difference. Result has 421 places, 873 transitions, 4806 flow [2025-03-04 06:47:22,910 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=4640, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=863, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=836, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=4806, PETRI_PLACES=421, PETRI_TRANSITIONS=873} [2025-03-04 06:47:22,910 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, 100 predicate places. [2025-03-04 06:47:22,910 INFO L471 AbstractCegarLoop]: Abstraction has has 421 places, 873 transitions, 4806 flow [2025-03-04 06:47:22,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 305.2173913043478) internal successors, (7020), 23 states have internal predecessors, (7020), 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-04 06:47:22,912 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:22,912 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:47:22,923 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-04 06:47:23,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:47:23,117 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-04 06:47:23,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:23,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1826966770, now seen corresponding path program 2 times [2025-03-04 06:47:23,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:23,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343128361] [2025-03-04 06:47:23,118 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:47:23,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:23,170 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 523 statements into 2 equivalence classes. [2025-03-04 06:47:23,175 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 113 of 523 statements. [2025-03-04 06:47:23,175 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:47:23,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:23,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2025-03-04 06:47:23,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:23,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343128361] [2025-03-04 06:47:23,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343128361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:23,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:23,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 06:47:23,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233669580] [2025-03-04 06:47:23,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:23,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 06:47:23,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:23,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 06:47:23,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-04 06:47:24,349 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 321 [2025-03-04 06:47:24,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 873 transitions, 4806 flow. Second operand has 11 states, 11 states have (on average 232.0909090909091) internal successors, (2553), 11 states have internal predecessors, (2553), 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-04 06:47:24,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:24,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 321 [2025-03-04 06:47:24,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:28,609 INFO L124 PetriNetUnfolderBase]: 4877/16068 cut-off events. [2025-03-04 06:47:28,609 INFO L125 PetriNetUnfolderBase]: For 17214/17649 co-relation queries the response was YES. [2025-03-04 06:47:28,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46677 conditions, 16068 events. 4877/16068 cut-off events. For 17214/17649 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 129288 event pairs, 1704 based on Foata normal form. 20/15366 useless extension candidates. Maximal degree in co-relation 45651. Up to 5419 conditions per place. [2025-03-04 06:47:28,717 INFO L140 encePairwiseOnDemand]: 273/321 looper letters, 591 selfloop transitions, 145 changer transitions 0/1041 dead transitions. [2025-03-04 06:47:28,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 1041 transitions, 7260 flow [2025-03-04 06:47:28,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 06:47:28,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 06:47:28,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3080 transitions. [2025-03-04 06:47:28,721 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7995846313603323 [2025-03-04 06:47:28,721 INFO L175 Difference]: Start difference. First operand has 421 places, 873 transitions, 4806 flow. Second operand 12 states and 3080 transitions. [2025-03-04 06:47:28,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 432 places, 1041 transitions, 7260 flow [2025-03-04 06:47:28,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 1041 transitions, 7212 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-03-04 06:47:28,790 INFO L231 Difference]: Finished difference. Result has 419 places, 892 transitions, 5384 flow [2025-03-04 06:47:28,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=4758, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=873, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=732, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5384, PETRI_PLACES=419, PETRI_TRANSITIONS=892} [2025-03-04 06:47:28,791 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, 98 predicate places. [2025-03-04 06:47:28,791 INFO L471 AbstractCegarLoop]: Abstraction has has 419 places, 892 transitions, 5384 flow [2025-03-04 06:47:28,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 232.0909090909091) internal successors, (2553), 11 states have internal predecessors, (2553), 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-04 06:47:28,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:28,793 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:47:28,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:47:28,793 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-04 06:47:28,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:28,794 INFO L85 PathProgramCache]: Analyzing trace with hash 583886118, now seen corresponding path program 3 times [2025-03-04 06:47:28,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:28,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382386467] [2025-03-04 06:47:28,794 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 06:47:28,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:28,845 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 523 statements into 11 equivalence classes. [2025-03-04 06:47:28,849 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 113 of 523 statements. [2025-03-04 06:47:28,850 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 06:47:28,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:29,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2025-03-04 06:47:29,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:29,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382386467] [2025-03-04 06:47:29,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382386467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:29,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:29,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 06:47:29,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919179860] [2025-03-04 06:47:29,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:29,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 06:47:29,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:29,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 06:47:29,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 06:47:29,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 321 [2025-03-04 06:47:29,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 892 transitions, 5384 flow. Second operand has 11 states, 11 states have (on average 232.0909090909091) internal successors, (2553), 11 states have internal predecessors, (2553), 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-04 06:47:29,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:29,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 321 [2025-03-04 06:47:29,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:34,762 INFO L124 PetriNetUnfolderBase]: 5770/18258 cut-off events. [2025-03-04 06:47:34,763 INFO L125 PetriNetUnfolderBase]: For 24548/24746 co-relation queries the response was YES. [2025-03-04 06:47:34,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57797 conditions, 18258 events. 5770/18258 cut-off events. For 24548/24746 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 148398 event pairs, 1608 based on Foata normal form. 82/17663 useless extension candidates. Maximal degree in co-relation 56668. Up to 4534 conditions per place. [2025-03-04 06:47:34,852 INFO L140 encePairwiseOnDemand]: 280/321 looper letters, 868 selfloop transitions, 148 changer transitions 0/1321 dead transitions. [2025-03-04 06:47:34,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 1321 transitions, 10834 flow [2025-03-04 06:47:34,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 06:47:34,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-04 06:47:34,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 5615 transitions. [2025-03-04 06:47:34,856 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7605309494785317 [2025-03-04 06:47:34,856 INFO L175 Difference]: Start difference. First operand has 419 places, 892 transitions, 5384 flow. Second operand 23 states and 5615 transitions. [2025-03-04 06:47:34,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 1321 transitions, 10834 flow [2025-03-04 06:47:34,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 1321 transitions, 10620 flow, removed 1 selfloop flow, removed 6 redundant places. [2025-03-04 06:47:34,940 INFO L231 Difference]: Finished difference. Result has 452 places, 1021 transitions, 7048 flow [2025-03-04 06:47:34,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=5268, PETRI_DIFFERENCE_MINUEND_PLACES=413, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=892, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=786, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=7048, PETRI_PLACES=452, PETRI_TRANSITIONS=1021} [2025-03-04 06:47:34,941 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, 131 predicate places. [2025-03-04 06:47:34,941 INFO L471 AbstractCegarLoop]: Abstraction has has 452 places, 1021 transitions, 7048 flow [2025-03-04 06:47:34,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 232.0909090909091) internal successors, (2553), 11 states have internal predecessors, (2553), 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-04 06:47:34,942 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:34,942 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:47:34,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:47:34,942 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-04 06:47:34,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:34,943 INFO L85 PathProgramCache]: Analyzing trace with hash -976836340, now seen corresponding path program 4 times [2025-03-04 06:47:34,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:34,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721948076] [2025-03-04 06:47:34,943 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 06:47:34,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:34,991 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 523 statements into 2 equivalence classes. [2025-03-04 06:47:35,033 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 456 of 523 statements. [2025-03-04 06:47:35,034 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 06:47:35,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:36,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2025-03-04 06:47:36,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:36,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721948076] [2025-03-04 06:47:36,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721948076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:36,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:36,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 06:47:36,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020007699] [2025-03-04 06:47:36,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:36,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 06:47:36,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:36,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 06:47:36,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-04 06:47:37,129 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 321 [2025-03-04 06:47:37,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 1021 transitions, 7048 flow. Second operand has 11 states, 11 states have (on average 232.0909090909091) internal successors, (2553), 11 states have internal predecessors, (2553), 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-04 06:47:37,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:37,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 321 [2025-03-04 06:47:37,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:44,077 INFO L124 PetriNetUnfolderBase]: 5852/18503 cut-off events. [2025-03-04 06:47:44,078 INFO L125 PetriNetUnfolderBase]: For 34129/34575 co-relation queries the response was YES. [2025-03-04 06:47:44,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62796 conditions, 18503 events. 5852/18503 cut-off events. For 34129/34575 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 150536 event pairs, 1708 based on Foata normal form. 50/17821 useless extension candidates. Maximal degree in co-relation 61680. Up to 5461 conditions per place. [2025-03-04 06:47:44,170 INFO L140 encePairwiseOnDemand]: 273/321 looper letters, 661 selfloop transitions, 237 changer transitions 0/1203 dead transitions. [2025-03-04 06:47:44,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 1203 transitions, 10245 flow [2025-03-04 06:47:44,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 06:47:44,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 06:47:44,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 3313 transitions. [2025-03-04 06:47:44,172 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7939132518571771 [2025-03-04 06:47:44,172 INFO L175 Difference]: Start difference. First operand has 452 places, 1021 transitions, 7048 flow. Second operand 13 states and 3313 transitions. [2025-03-04 06:47:44,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 1203 transitions, 10245 flow [2025-03-04 06:47:44,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 1203 transitions, 10133 flow, removed 26 selfloop flow, removed 2 redundant places. [2025-03-04 06:47:44,334 INFO L231 Difference]: Finished difference. Result has 469 places, 1050 transitions, 8209 flow [2025-03-04 06:47:44,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=6982, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1021, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=210, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=793, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=8209, PETRI_PLACES=469, PETRI_TRANSITIONS=1050} [2025-03-04 06:47:44,335 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, 148 predicate places. [2025-03-04 06:47:44,335 INFO L471 AbstractCegarLoop]: Abstraction has has 469 places, 1050 transitions, 8209 flow [2025-03-04 06:47:44,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 232.0909090909091) internal successors, (2553), 11 states have internal predecessors, (2553), 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-04 06:47:44,336 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:44,336 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:47:44,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:47:44,336 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-04 06:47:44,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:44,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1870333652, now seen corresponding path program 5 times [2025-03-04 06:47:44,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:44,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707967606] [2025-03-04 06:47:44,338 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 06:47:44,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:44,389 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 523 statements into 11 equivalence classes. [2025-03-04 06:47:44,635 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 523 of 523 statements. [2025-03-04 06:47:44,635 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-04 06:47:44,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:46,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 19 proven. 152 refuted. 0 times theorem prover too weak. 1684 trivial. 0 not checked. [2025-03-04 06:47:46,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:46,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707967606] [2025-03-04 06:47:46,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707967606] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:47:46,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554171191] [2025-03-04 06:47:46,135 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 06:47:46,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:47:46,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:47:46,137 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-04 06:47:46,140 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-04 06:47:46,386 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 523 statements into 11 equivalence classes.