./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed 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_13-arraycollapse_nr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b018c23c1a90f89310fc4f08bf16b02660af5a398ccd47f63d319e7a234c112b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:59:01,210 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:59:01,267 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 21:59:01,272 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:59:01,273 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:59:01,292 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:59:01,293 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:59:01,294 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:59:01,294 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:59:01,294 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:59:01,295 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:59:01,295 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:59:01,295 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:59:01,296 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:59:01,296 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:59:01,297 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:59:01,297 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:59:01,297 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:59:01,297 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:59:01,297 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:59:01,297 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:59:01,297 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:59:01,297 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 21:59:01,297 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 21:59:01,297 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:59:01,297 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:59:01,297 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:59:01,297 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:59:01,298 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:59:01,298 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:59:01,298 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:59:01,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:59:01,298 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:59:01,298 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:59:01,299 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:59:01,299 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:59:01,299 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:59:01,299 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:59:01,299 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:59:01,299 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:59:01,299 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:59:01,299 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:59:01,299 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 -> b018c23c1a90f89310fc4f08bf16b02660af5a398ccd47f63d319e7a234c112b [2025-03-08 21:59:01,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:59:01,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:59:01,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:59:01,532 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:59:01,532 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:59:01,533 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr.i [2025-03-08 21:59:02,637 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53b469f0a/36012d70e6f84cafbb9406e6e4dea2f0/FLAGab2f5e536 [2025-03-08 21:59:02,974 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:59:02,974 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr.i [2025-03-08 21:59:02,989 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53b469f0a/36012d70e6f84cafbb9406e6e4dea2f0/FLAGab2f5e536 [2025-03-08 21:59:03,203 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53b469f0a/36012d70e6f84cafbb9406e6e4dea2f0 [2025-03-08 21:59:03,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:59:03,206 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:59:03,207 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:59:03,207 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:59:03,210 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:59:03,210 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:59:03" (1/1) ... [2025-03-08 21:59:03,211 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a34aacf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:03, skipping insertion in model container [2025-03-08 21:59:03,211 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:59:03" (1/1) ... [2025-03-08 21:59:03,241 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:59:03,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:59:03,675 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:59:03,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:59:03,792 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:59:03,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:03 WrapperNode [2025-03-08 21:59:03,792 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:59:03,793 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:59:03,793 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:59:03,794 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:59:03,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:03" (1/1) ... [2025-03-08 21:59:03,817 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:03" (1/1) ... [2025-03-08 21:59:03,852 INFO L138 Inliner]: procedures = 372, calls = 95, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 414 [2025-03-08 21:59:03,853 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:59:03,853 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:59:03,853 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:59:03,853 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:59:03,858 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:03" (1/1) ... [2025-03-08 21:59:03,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:03" (1/1) ... [2025-03-08 21:59:03,868 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:03" (1/1) ... [2025-03-08 21:59:03,868 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:03" (1/1) ... [2025-03-08 21:59:03,904 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:03" (1/1) ... [2025-03-08 21:59:03,905 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:03" (1/1) ... [2025-03-08 21:59:03,912 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:03" (1/1) ... [2025-03-08 21:59:03,914 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:03" (1/1) ... [2025-03-08 21:59:03,922 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:59:03,923 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:59:03,924 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:59:03,924 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:59:03,925 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:03" (1/1) ... [2025-03-08 21:59:03,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:59:03,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:59:03,948 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-08 21:59:03,951 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-08 21:59:03,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-08 21:59:03,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-08 21:59:03,967 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 21:59:03,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 21:59:03,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 21:59:03,967 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 21:59:03,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 21:59:03,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:59:03,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-08 21:59:03,968 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-08 21:59:03,968 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-08 21:59:03,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 21:59:03,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:59:03,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:59:03,969 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 21:59:04,093 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:59:04,095 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:59:04,714 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 21:59:04,714 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:59:04,742 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:59:04,742 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 21:59:04,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:59:04 BoogieIcfgContainer [2025-03-08 21:59:04,743 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:59:04,747 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:59:04,747 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:59:04,750 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:59:04,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:59:03" (1/3) ... [2025-03-08 21:59:04,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@596bee76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:59:04, skipping insertion in model container [2025-03-08 21:59:04,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:03" (2/3) ... [2025-03-08 21:59:04,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@596bee76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:59:04, skipping insertion in model container [2025-03-08 21:59:04,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:59:04" (3/3) ... [2025-03-08 21:59:04,753 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_13-arraycollapse_nr.i [2025-03-08 21:59:04,765 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:59:04,768 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_13-arraycollapse_nr.i that has 2 procedures, 485 locations, 1 initial locations, 1 loop locations, and 30 error locations. [2025-03-08 21:59:04,768 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 21:59:04,858 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 21:59:04,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 488 places, 488 transitions, 980 flow [2025-03-08 21:59:05,032 INFO L124 PetriNetUnfolderBase]: 4/487 cut-off events. [2025-03-08 21:59:05,034 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:59:05,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 487 events. 4/487 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 393 event pairs, 0 based on Foata normal form. 0/453 useless extension candidates. Maximal degree in co-relation 359. Up to 2 conditions per place. [2025-03-08 21:59:05,042 INFO L82 GeneralOperation]: Start removeDead. Operand has 488 places, 488 transitions, 980 flow [2025-03-08 21:59:05,085 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 487 places, 487 transitions, 977 flow [2025-03-08 21:59:05,096 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:59:05,107 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;@578c0f41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:59:05,108 INFO L334 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2025-03-08 21:59:05,125 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:59:05,125 INFO L124 PetriNetUnfolderBase]: 1/102 cut-off events. [2025-03-08 21:59:05,125 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:59:05,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:59:05,126 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] [2025-03-08 21:59:05,126 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-08 21:59:05,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:59:05,131 INFO L85 PathProgramCache]: Analyzing trace with hash -538343192, now seen corresponding path program 1 times [2025-03-08 21:59:05,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:59:05,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264462398] [2025-03-08 21:59:05,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:59:05,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:59:05,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 21:59:05,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 21:59:05,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:59:05,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:05,929 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-08 21:59:05,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:59:05,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264462398] [2025-03-08 21:59:05,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264462398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:59:05,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:59:05,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:59:05,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514945139] [2025-03-08 21:59:05,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:59:05,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:59:05,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:59:05,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:59:05,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:59:06,606 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 488 [2025-03-08 21:59:06,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 487 transitions, 977 flow. Second operand has 6 states, 6 states have (on average 349.3333333333333) internal successors, (2096), 6 states have internal predecessors, (2096), 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-08 21:59:06,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:59:06,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 488 [2025-03-08 21:59:06,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:59:06,983 INFO L124 PetriNetUnfolderBase]: 365/1842 cut-off events. [2025-03-08 21:59:06,984 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 21:59:06,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2708 conditions, 1842 events. 365/1842 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9496 event pairs, 364 based on Foata normal form. 13/1717 useless extension candidates. Maximal degree in co-relation 2256. Up to 842 conditions per place. [2025-03-08 21:59:06,999 INFO L140 encePairwiseOnDemand]: 461/488 looper letters, 113 selfloop transitions, 20 changer transitions 2/480 dead transitions. [2025-03-08 21:59:06,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 480 transitions, 1229 flow [2025-03-08 21:59:07,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:59:07,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:59:07,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2228 transitions. [2025-03-08 21:59:07,023 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7609289617486339 [2025-03-08 21:59:07,025 INFO L175 Difference]: Start difference. First operand has 487 places, 487 transitions, 977 flow. Second operand 6 states and 2228 transitions. [2025-03-08 21:59:07,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 488 places, 480 transitions, 1229 flow [2025-03-08 21:59:07,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 487 places, 480 transitions, 1228 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:59:07,042 INFO L231 Difference]: Finished difference. Result has 487 places, 478 transitions, 998 flow [2025-03-08 21:59:07,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=962, PETRI_DIFFERENCE_MINUEND_PLACES=482, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=480, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=460, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=998, PETRI_PLACES=487, PETRI_TRANSITIONS=478} [2025-03-08 21:59:07,049 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, 0 predicate places. [2025-03-08 21:59:07,049 INFO L471 AbstractCegarLoop]: Abstraction has has 487 places, 478 transitions, 998 flow [2025-03-08 21:59:07,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 349.3333333333333) internal successors, (2096), 6 states have internal predecessors, (2096), 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-08 21:59:07,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:59:07,051 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] [2025-03-08 21:59:07,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:59:07,051 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-08 21:59:07,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:59:07,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1447730720, now seen corresponding path program 1 times [2025-03-08 21:59:07,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:59:07,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999934913] [2025-03-08 21:59:07,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:59:07,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:59:07,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 21:59:07,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 21:59:07,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:59:07,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:07,416 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-08 21:59:07,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:59:07,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999934913] [2025-03-08 21:59:07,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999934913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:59:07,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:59:07,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:59:07,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983374860] [2025-03-08 21:59:07,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:59:07,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:59:07,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:59:07,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:59:07,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:59:08,238 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 488 [2025-03-08 21:59:08,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 478 transitions, 998 flow. Second operand has 6 states, 6 states have (on average 349.3333333333333) internal successors, (2096), 6 states have internal predecessors, (2096), 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-08 21:59:08,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:59:08,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 488 [2025-03-08 21:59:08,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:59:08,482 INFO L124 PetriNetUnfolderBase]: 365/1836 cut-off events. [2025-03-08 21:59:08,483 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:59:08,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2722 conditions, 1836 events. 365/1836 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9493 event pairs, 364 based on Foata normal form. 0/1704 useless extension candidates. Maximal degree in co-relation 2342. Up to 842 conditions per place. [2025-03-08 21:59:08,492 INFO L140 encePairwiseOnDemand]: 464/488 looper letters, 113 selfloop transitions, 20 changer transitions 0/474 dead transitions. [2025-03-08 21:59:08,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 486 places, 474 transitions, 1256 flow [2025-03-08 21:59:08,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:59:08,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:59:08,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2225 transitions. [2025-03-08 21:59:08,498 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7599043715846995 [2025-03-08 21:59:08,498 INFO L175 Difference]: Start difference. First operand has 487 places, 478 transitions, 998 flow. Second operand 6 states and 2225 transitions. [2025-03-08 21:59:08,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 486 places, 474 transitions, 1256 flow [2025-03-08 21:59:08,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 474 transitions, 1216 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:59:08,507 INFO L231 Difference]: Finished difference. Result has 481 places, 474 transitions, 990 flow [2025-03-08 21:59:08,508 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=950, PETRI_DIFFERENCE_MINUEND_PLACES=476, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=454, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=990, PETRI_PLACES=481, PETRI_TRANSITIONS=474} [2025-03-08 21:59:08,509 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -6 predicate places. [2025-03-08 21:59:08,509 INFO L471 AbstractCegarLoop]: Abstraction has has 481 places, 474 transitions, 990 flow [2025-03-08 21:59:08,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 349.3333333333333) internal successors, (2096), 6 states have internal predecessors, (2096), 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-08 21:59:08,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:59:08,511 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] [2025-03-08 21:59:08,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 21:59:08,511 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-08 21:59:08,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:59:08,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1954067955, now seen corresponding path program 1 times [2025-03-08 21:59:08,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:59:08,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561952771] [2025-03-08 21:59:08,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:59:08,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:59:08,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 21:59:08,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 21:59:08,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:59:08,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:08,945 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-08 21:59:08,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:59:08,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561952771] [2025-03-08 21:59:08,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561952771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:59:08,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:59:08,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:59:08,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766331024] [2025-03-08 21:59:08,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:59:08,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:59:08,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:59:08,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:59:08,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:59:09,619 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 349 out of 488 [2025-03-08 21:59:09,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 474 transitions, 990 flow. Second operand has 6 states, 6 states have (on average 351.8333333333333) internal successors, (2111), 6 states have internal predecessors, (2111), 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-08 21:59:09,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:59:09,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 349 of 488 [2025-03-08 21:59:09,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:59:09,820 INFO L124 PetriNetUnfolderBase]: 391/1924 cut-off events. [2025-03-08 21:59:09,820 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 21:59:09,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2864 conditions, 1924 events. 391/1924 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10265 event pairs, 390 based on Foata normal form. 0/1787 useless extension candidates. Maximal degree in co-relation 2468. Up to 911 conditions per place. [2025-03-08 21:59:09,827 INFO L140 encePairwiseOnDemand]: 482/488 looper letters, 130 selfloop transitions, 5 changer transitions 0/473 dead transitions. [2025-03-08 21:59:09,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 485 places, 473 transitions, 1258 flow [2025-03-08 21:59:09,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:59:09,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:59:09,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2230 transitions. [2025-03-08 21:59:09,831 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7616120218579235 [2025-03-08 21:59:09,831 INFO L175 Difference]: Start difference. First operand has 481 places, 474 transitions, 990 flow. Second operand 6 states and 2230 transitions. [2025-03-08 21:59:09,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 485 places, 473 transitions, 1258 flow [2025-03-08 21:59:09,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 480 places, 473 transitions, 1218 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:59:09,837 INFO L231 Difference]: Finished difference. Result has 480 places, 473 transitions, 958 flow [2025-03-08 21:59:09,838 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=948, PETRI_DIFFERENCE_MINUEND_PLACES=475, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=958, PETRI_PLACES=480, PETRI_TRANSITIONS=473} [2025-03-08 21:59:09,838 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -7 predicate places. [2025-03-08 21:59:09,838 INFO L471 AbstractCegarLoop]: Abstraction has has 480 places, 473 transitions, 958 flow [2025-03-08 21:59:09,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 351.8333333333333) internal successors, (2111), 6 states have internal predecessors, (2111), 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-08 21:59:09,839 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:59:09,840 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] [2025-03-08 21:59:09,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:59:09,840 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-08 21:59:09,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:59:09,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1076505214, now seen corresponding path program 1 times [2025-03-08 21:59:09,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:59:09,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362364582] [2025-03-08 21:59:09,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:59:09,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:59:09,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 21:59:09,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 21:59:09,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:59:09,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:09,930 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-08 21:59:09,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:59:09,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362364582] [2025-03-08 21:59:09,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362364582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:59:09,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:59:09,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:59:09,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100133406] [2025-03-08 21:59:09,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:59:09,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:59:09,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:59:09,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:59:09,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:59:09,961 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 474 out of 488 [2025-03-08 21:59:09,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 480 places, 473 transitions, 958 flow. Second operand has 3 states, 3 states have (on average 475.3333333333333) internal successors, (1426), 3 states have internal predecessors, (1426), 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-08 21:59:09,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:59:09,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 474 of 488 [2025-03-08 21:59:09,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:59:10,018 INFO L124 PetriNetUnfolderBase]: 7/658 cut-off events. [2025-03-08 21:59:10,018 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:59:10,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 697 conditions, 658 events. 7/658 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 643 event pairs, 6 based on Foata normal form. 1/623 useless extension candidates. Maximal degree in co-relation 496. Up to 24 conditions per place. [2025-03-08 21:59:10,020 INFO L140 encePairwiseOnDemand]: 485/488 looper letters, 10 selfloop transitions, 2 changer transitions 0/474 dead transitions. [2025-03-08 21:59:10,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 474 transitions, 984 flow [2025-03-08 21:59:10,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:59:10,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:59:10,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1435 transitions. [2025-03-08 21:59:10,023 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.980191256830601 [2025-03-08 21:59:10,023 INFO L175 Difference]: Start difference. First operand has 480 places, 473 transitions, 958 flow. Second operand 3 states and 1435 transitions. [2025-03-08 21:59:10,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 474 transitions, 984 flow [2025-03-08 21:59:10,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 477 places, 474 transitions, 974 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:59:10,033 INFO L231 Difference]: Finished difference. Result has 478 places, 474 transitions, 960 flow [2025-03-08 21:59:10,034 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=948, PETRI_DIFFERENCE_MINUEND_PLACES=475, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=960, PETRI_PLACES=478, PETRI_TRANSITIONS=474} [2025-03-08 21:59:10,035 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -9 predicate places. [2025-03-08 21:59:10,035 INFO L471 AbstractCegarLoop]: Abstraction has has 478 places, 474 transitions, 960 flow [2025-03-08 21:59:10,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 475.3333333333333) internal successors, (1426), 3 states have internal predecessors, (1426), 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-08 21:59:10,036 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:59:10,036 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:59:10,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 21:59:10,036 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-08 21:59:10,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:59:10,038 INFO L85 PathProgramCache]: Analyzing trace with hash 2022354614, now seen corresponding path program 1 times [2025-03-08 21:59:10,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:59:10,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552806077] [2025-03-08 21:59:10,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:59:10,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:59:10,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 21:59:10,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 21:59:10,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:59:10,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:10,552 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-08 21:59:10,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:59:10,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552806077] [2025-03-08 21:59:10,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552806077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:59:10,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:59:10,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:59:10,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314087643] [2025-03-08 21:59:10,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:59:10,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:59:10,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:59:10,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:59:10,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:59:11,300 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 488 [2025-03-08 21:59:11,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 474 transitions, 960 flow. Second operand has 6 states, 6 states have (on average 395.8333333333333) internal successors, (2375), 6 states have internal predecessors, (2375), 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-08 21:59:11,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:59:11,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 488 [2025-03-08 21:59:11,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:59:11,501 INFO L124 PetriNetUnfolderBase]: 55/899 cut-off events. [2025-03-08 21:59:11,501 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 21:59:11,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1146 conditions, 899 events. 55/899 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2249 event pairs, 54 based on Foata normal form. 0/839 useless extension candidates. Maximal degree in co-relation 924. Up to 227 conditions per place. [2025-03-08 21:59:11,504 INFO L140 encePairwiseOnDemand]: 482/488 looper letters, 89 selfloop transitions, 5 changer transitions 0/473 dead transitions. [2025-03-08 21:59:11,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 473 transitions, 1146 flow [2025-03-08 21:59:11,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:59:11,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:59:11,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2440 transitions. [2025-03-08 21:59:11,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2025-03-08 21:59:11,509 INFO L175 Difference]: Start difference. First operand has 478 places, 474 transitions, 960 flow. Second operand 6 states and 2440 transitions. [2025-03-08 21:59:11,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 473 transitions, 1146 flow [2025-03-08 21:59:11,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 473 transitions, 1144 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:59:11,520 INFO L231 Difference]: Finished difference. Result has 481 places, 473 transitions, 966 flow [2025-03-08 21:59:11,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=956, PETRI_DIFFERENCE_MINUEND_PLACES=476, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=966, PETRI_PLACES=481, PETRI_TRANSITIONS=473} [2025-03-08 21:59:11,522 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -6 predicate places. [2025-03-08 21:59:11,524 INFO L471 AbstractCegarLoop]: Abstraction has has 481 places, 473 transitions, 966 flow [2025-03-08 21:59:11,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 395.8333333333333) internal successors, (2375), 6 states have internal predecessors, (2375), 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-08 21:59:11,525 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:59:11,525 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:59:11,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:59:11,525 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-08 21:59:11,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:59:11,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1856699464, now seen corresponding path program 1 times [2025-03-08 21:59:11,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:59:11,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726213141] [2025-03-08 21:59:11,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:59:11,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:59:11,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 21:59:11,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 21:59:11,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:59:11,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:11,921 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-08 21:59:11,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:59:11,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726213141] [2025-03-08 21:59:11,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726213141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:59:11,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:59:11,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:59:11,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124293197] [2025-03-08 21:59:11,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:59:11,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:59:11,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:59:11,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:59:11,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:59:12,522 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 488 [2025-03-08 21:59:12,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 473 transitions, 966 flow. Second operand has 6 states, 6 states have (on average 378.5) internal successors, (2271), 6 states have internal predecessors, (2271), 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-08 21:59:12,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:59:12,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 488 [2025-03-08 21:59:12,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:59:12,716 INFO L124 PetriNetUnfolderBase]: 37/812 cut-off events. [2025-03-08 21:59:12,717 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 21:59:12,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1049 conditions, 812 events. 37/812 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1753 event pairs, 36 based on Foata normal form. 0/769 useless extension candidates. Maximal degree in co-relation 792. Up to 198 conditions per place. [2025-03-08 21:59:12,719 INFO L140 encePairwiseOnDemand]: 470/488 looper letters, 93 selfloop transitions, 15 changer transitions 0/470 dead transitions. [2025-03-08 21:59:12,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 483 places, 470 transitions, 1176 flow [2025-03-08 21:59:12,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:59:12,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:59:12,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2355 transitions. [2025-03-08 21:59:12,723 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8043032786885246 [2025-03-08 21:59:12,723 INFO L175 Difference]: Start difference. First operand has 481 places, 473 transitions, 966 flow. Second operand 6 states and 2355 transitions. [2025-03-08 21:59:12,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 483 places, 470 transitions, 1176 flow [2025-03-08 21:59:12,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 478 places, 470 transitions, 1166 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:59:12,729 INFO L231 Difference]: Finished difference. Result has 478 places, 470 transitions, 980 flow [2025-03-08 21:59:12,730 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=950, PETRI_DIFFERENCE_MINUEND_PLACES=473, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=455, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=980, PETRI_PLACES=478, PETRI_TRANSITIONS=470} [2025-03-08 21:59:12,730 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -9 predicate places. [2025-03-08 21:59:12,730 INFO L471 AbstractCegarLoop]: Abstraction has has 478 places, 470 transitions, 980 flow [2025-03-08 21:59:12,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 378.5) internal successors, (2271), 6 states have internal predecessors, (2271), 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-08 21:59:12,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:59:12,732 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:59:12,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 21:59:12,732 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-08 21:59:12,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:59:12,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1043417486, now seen corresponding path program 1 times [2025-03-08 21:59:12,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:59:12,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999705382] [2025-03-08 21:59:12,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:59:12,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:59:12,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 21:59:12,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 21:59:12,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:59:12,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:13,073 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-08 21:59:13,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:59:13,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999705382] [2025-03-08 21:59:13,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999705382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:59:13,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:59:13,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:59:13,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685695301] [2025-03-08 21:59:13,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:59:13,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:59:13,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:59:13,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:59:13,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:59:13,494 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 336 out of 488 [2025-03-08 21:59:13,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 470 transitions, 980 flow. Second operand has 6 states, 6 states have (on average 342.1666666666667) internal successors, (2053), 6 states have internal predecessors, (2053), 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-08 21:59:13,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:59:13,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 488 [2025-03-08 21:59:13,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:59:13,890 INFO L124 PetriNetUnfolderBase]: 365/1934 cut-off events. [2025-03-08 21:59:13,890 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 21:59:13,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2881 conditions, 1934 events. 365/1934 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9501 event pairs, 364 based on Foata normal form. 0/1810 useless extension candidates. Maximal degree in co-relation 2494. Up to 898 conditions per place. [2025-03-08 21:59:13,896 INFO L140 encePairwiseOnDemand]: 470/488 looper letters, 131 selfloop transitions, 15 changer transitions 0/467 dead transitions. [2025-03-08 21:59:13,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 467 transitions, 1266 flow [2025-03-08 21:59:13,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:59:13,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:59:13,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2165 transitions. [2025-03-08 21:59:13,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7394125683060109 [2025-03-08 21:59:13,900 INFO L175 Difference]: Start difference. First operand has 478 places, 470 transitions, 980 flow. Second operand 6 states and 2165 transitions. [2025-03-08 21:59:13,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 467 transitions, 1266 flow [2025-03-08 21:59:13,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 467 transitions, 1236 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:59:13,907 INFO L231 Difference]: Finished difference. Result has 475 places, 467 transitions, 974 flow [2025-03-08 21:59:13,908 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=944, PETRI_DIFFERENCE_MINUEND_PLACES=470, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=467, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=974, PETRI_PLACES=475, PETRI_TRANSITIONS=467} [2025-03-08 21:59:13,908 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -12 predicate places. [2025-03-08 21:59:13,908 INFO L471 AbstractCegarLoop]: Abstraction has has 475 places, 467 transitions, 974 flow [2025-03-08 21:59:13,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 342.1666666666667) internal successors, (2053), 6 states have internal predecessors, (2053), 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-08 21:59:13,909 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:59:13,909 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:59:13,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 21:59:13,910 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-08 21:59:13,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:59:13,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1887725144, now seen corresponding path program 1 times [2025-03-08 21:59:13,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:59:13,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217856864] [2025-03-08 21:59:13,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:59:13,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:59:13,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 21:59:13,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 21:59:13,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:59:13,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:14,252 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-08 21:59:14,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:59:14,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217856864] [2025-03-08 21:59:14,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217856864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:59:14,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:59:14,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:59:14,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890508310] [2025-03-08 21:59:14,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:59:14,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:59:14,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:59:14,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:59:14,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:59:14,639 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 339 out of 488 [2025-03-08 21:59:14,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 475 places, 467 transitions, 974 flow. Second operand has 6 states, 6 states have (on average 345.6666666666667) internal successors, (2074), 6 states have internal predecessors, (2074), 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-08 21:59:14,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:59:14,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 339 of 488 [2025-03-08 21:59:14,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:59:14,977 INFO L124 PetriNetUnfolderBase]: 365/1930 cut-off events. [2025-03-08 21:59:14,977 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 21:59:14,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2873 conditions, 1930 events. 365/1930 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9501 event pairs, 364 based on Foata normal form. 0/1810 useless extension candidates. Maximal degree in co-relation 2490. Up to 894 conditions per place. [2025-03-08 21:59:14,986 INFO L140 encePairwiseOnDemand]: 470/488 looper letters, 128 selfloop transitions, 15 changer transitions 0/464 dead transitions. [2025-03-08 21:59:14,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 464 transitions, 1254 flow [2025-03-08 21:59:14,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:59:14,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:59:14,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2180 transitions. [2025-03-08 21:59:14,990 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.744535519125683 [2025-03-08 21:59:14,990 INFO L175 Difference]: Start difference. First operand has 475 places, 467 transitions, 974 flow. Second operand 6 states and 2180 transitions. [2025-03-08 21:59:14,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 477 places, 464 transitions, 1254 flow [2025-03-08 21:59:14,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 472 places, 464 transitions, 1224 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:59:14,996 INFO L231 Difference]: Finished difference. Result has 472 places, 464 transitions, 968 flow [2025-03-08 21:59:14,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=938, PETRI_DIFFERENCE_MINUEND_PLACES=467, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=464, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=449, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=968, PETRI_PLACES=472, PETRI_TRANSITIONS=464} [2025-03-08 21:59:14,999 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -15 predicate places. [2025-03-08 21:59:14,999 INFO L471 AbstractCegarLoop]: Abstraction has has 472 places, 464 transitions, 968 flow [2025-03-08 21:59:15,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 345.6666666666667) internal successors, (2074), 6 states have internal predecessors, (2074), 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-08 21:59:15,000 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:59:15,000 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:59:15,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 21:59:15,001 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-08 21:59:15,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:59:15,001 INFO L85 PathProgramCache]: Analyzing trace with hash 242584771, now seen corresponding path program 1 times [2025-03-08 21:59:15,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:59:15,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155755923] [2025-03-08 21:59:15,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:59:15,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:59:15,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-08 21:59:15,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-08 21:59:15,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:59:15,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:15,188 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-08 21:59:15,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:59:15,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155755923] [2025-03-08 21:59:15,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155755923] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:59:15,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109645205] [2025-03-08 21:59:15,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:59:15,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:59:15,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:59:15,191 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-08 21:59:15,193 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-08 21:59:15,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-08 21:59:15,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-08 21:59:15,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:59:15,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:15,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 21:59:15,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:59:15,551 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-08 21:59:15,553 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:59:15,686 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-08 21:59:15,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109645205] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:59:15,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:59:15,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-08 21:59:15,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212354776] [2025-03-08 21:59:15,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:59:15,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 21:59:15,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:59:15,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 21:59:15,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 21:59:15,808 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 471 out of 488 [2025-03-08 21:59:15,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 464 transitions, 968 flow. Second operand has 10 states, 10 states have (on average 472.8) internal successors, (4728), 10 states have internal predecessors, (4728), 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-08 21:59:15,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:59:15,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 471 of 488 [2025-03-08 21:59:15,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:59:15,927 INFO L124 PetriNetUnfolderBase]: 7/752 cut-off events. [2025-03-08 21:59:15,927 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:59:15,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 752 events. 7/752 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 400 event pairs, 6 based on Foata normal form. 2/732 useless extension candidates. Maximal degree in co-relation 394. Up to 24 conditions per place. [2025-03-08 21:59:15,929 INFO L140 encePairwiseOnDemand]: 482/488 looper letters, 14 selfloop transitions, 9 changer transitions 0/472 dead transitions. [2025-03-08 21:59:15,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 472 transitions, 1032 flow [2025-03-08 21:59:15,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:59:15,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 21:59:15,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 4264 transitions. [2025-03-08 21:59:15,935 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.970856102003643 [2025-03-08 21:59:15,935 INFO L175 Difference]: Start difference. First operand has 472 places, 464 transitions, 968 flow. Second operand 9 states and 4264 transitions. [2025-03-08 21:59:15,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 472 transitions, 1032 flow [2025-03-08 21:59:15,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 472 transitions, 1002 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:59:15,942 INFO L231 Difference]: Finished difference. Result has 478 places, 470 transitions, 988 flow [2025-03-08 21:59:15,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=938, PETRI_DIFFERENCE_MINUEND_PLACES=467, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=464, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=458, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=988, PETRI_PLACES=478, PETRI_TRANSITIONS=470} [2025-03-08 21:59:15,944 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -9 predicate places. [2025-03-08 21:59:15,944 INFO L471 AbstractCegarLoop]: Abstraction has has 478 places, 470 transitions, 988 flow [2025-03-08 21:59:15,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 472.8) internal successors, (4728), 10 states have internal predecessors, (4728), 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-08 21:59:15,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:59:15,947 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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-08 21:59:15,955 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-08 21:59:16,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:59:16,148 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-08 21:59:16,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:59:16,149 INFO L85 PathProgramCache]: Analyzing trace with hash -112324731, now seen corresponding path program 2 times [2025-03-08 21:59:16,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:59:16,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21019331] [2025-03-08 21:59:16,149 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:59:16,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:59:16,209 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 446 statements into 2 equivalence classes. [2025-03-08 21:59:16,216 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 128 of 446 statements. [2025-03-08 21:59:16,216 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:59:16,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:16,546 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2025-03-08 21:59:16,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:59:16,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21019331] [2025-03-08 21:59:16,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21019331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:59:16,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:59:16,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:59:16,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318888140] [2025-03-08 21:59:16,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:59:16,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:59:16,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:59:16,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:59:16,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:59:17,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 488 [2025-03-08 21:59:17,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 470 transitions, 988 flow. Second operand has 6 states, 6 states have (on average 395.3333333333333) internal successors, (2372), 6 states have internal predecessors, (2372), 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-08 21:59:17,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:59:17,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 488 [2025-03-08 21:59:17,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:59:17,610 INFO L124 PetriNetUnfolderBase]: 257/2078 cut-off events. [2025-03-08 21:59:17,610 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-08 21:59:17,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2781 conditions, 2078 events. 257/2078 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 10111 event pairs, 36 based on Foata normal form. 0/1951 useless extension candidates. Maximal degree in co-relation 2279. Up to 523 conditions per place. [2025-03-08 21:59:17,617 INFO L140 encePairwiseOnDemand]: 459/488 looper letters, 99 selfloop transitions, 75 changer transitions 0/547 dead transitions. [2025-03-08 21:59:17,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 547 transitions, 1490 flow [2025-03-08 21:59:17,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:59:17,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:59:17,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2504 transitions. [2025-03-08 21:59:17,621 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.855191256830601 [2025-03-08 21:59:17,621 INFO L175 Difference]: Start difference. First operand has 478 places, 470 transitions, 988 flow. Second operand 6 states and 2504 transitions. [2025-03-08 21:59:17,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 547 transitions, 1490 flow [2025-03-08 21:59:17,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 547 transitions, 1484 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-08 21:59:17,629 INFO L231 Difference]: Finished difference. Result has 486 places, 538 transitions, 1462 flow [2025-03-08 21:59:17,630 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=980, PETRI_DIFFERENCE_MINUEND_PLACES=476, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=469, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1462, PETRI_PLACES=486, PETRI_TRANSITIONS=538} [2025-03-08 21:59:17,630 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -1 predicate places. [2025-03-08 21:59:17,630 INFO L471 AbstractCegarLoop]: Abstraction has has 486 places, 538 transitions, 1462 flow [2025-03-08 21:59:17,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 395.3333333333333) internal successors, (2372), 6 states have internal predecessors, (2372), 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-08 21:59:17,632 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:59:17,632 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:59:17,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 21:59:17,634 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-08 21:59:17,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:59:17,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1442875350, now seen corresponding path program 1 times [2025-03-08 21:59:17,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:59:17,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984952629] [2025-03-08 21:59:17,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:59:17,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:59:17,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 512 statements into 1 equivalence classes. [2025-03-08 21:59:17,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 512 of 512 statements. [2025-03-08 21:59:17,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:59:17,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:18,074 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:59:18,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:59:18,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984952629] [2025-03-08 21:59:18,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984952629] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:59:18,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420586788] [2025-03-08 21:59:18,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:59:18,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:59:18,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:59:18,077 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-08 21:59:18,078 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-08 21:59:18,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 512 statements into 1 equivalence classes. [2025-03-08 21:59:18,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 512 of 512 statements. [2025-03-08 21:59:18,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:59:18,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:18,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 1878 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 21:59:18,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:59:18,779 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:59:18,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:59:19,107 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:59:19,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420586788] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:59:19,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:59:19,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-08 21:59:19,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538768426] [2025-03-08 21:59:19,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:59:19,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 21:59:19,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:59:19,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 21:59:19,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-08 21:59:19,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 471 out of 488 [2025-03-08 21:59:19,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 486 places, 538 transitions, 1462 flow. Second operand has 18 states, 18 states have (on average 472.8888888888889) internal successors, (8512), 18 states have internal predecessors, (8512), 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-08 21:59:19,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:59:19,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 471 of 488 [2025-03-08 21:59:19,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:59:19,702 INFO L124 PetriNetUnfolderBase]: 150/2178 cut-off events. [2025-03-08 21:59:19,703 INFO L125 PetriNetUnfolderBase]: For 184/204 co-relation queries the response was YES. [2025-03-08 21:59:19,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2883 conditions, 2178 events. 150/2178 cut-off events. For 184/204 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 7288 event pairs, 21 based on Foata normal form. 4/2094 useless extension candidates. Maximal degree in co-relation 1986. Up to 207 conditions per place. [2025-03-08 21:59:19,708 INFO L140 encePairwiseOnDemand]: 482/488 looper letters, 19 selfloop transitions, 21 changer transitions 0/556 dead transitions. [2025-03-08 21:59:19,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 506 places, 556 transitions, 1630 flow [2025-03-08 21:59:19,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 21:59:19,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-08 21:59:19,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 9934 transitions. [2025-03-08 21:59:19,717 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.96935987509758 [2025-03-08 21:59:19,718 INFO L175 Difference]: Start difference. First operand has 486 places, 538 transitions, 1462 flow. Second operand 21 states and 9934 transitions. [2025-03-08 21:59:19,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 506 places, 556 transitions, 1630 flow [2025-03-08 21:59:19,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 506 places, 556 transitions, 1630 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:59:19,725 INFO L231 Difference]: Finished difference. Result has 511 places, 551 transitions, 1592 flow [2025-03-08 21:59:19,725 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=1462, PETRI_DIFFERENCE_MINUEND_PLACES=486, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1592, PETRI_PLACES=511, PETRI_TRANSITIONS=551} [2025-03-08 21:59:19,726 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, 24 predicate places. [2025-03-08 21:59:19,726 INFO L471 AbstractCegarLoop]: Abstraction has has 511 places, 551 transitions, 1592 flow [2025-03-08 21:59:19,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 472.8888888888889) internal successors, (8512), 18 states have internal predecessors, (8512), 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-08 21:59:19,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:59:19,728 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:59:19,737 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-08 21:59:19,933 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,SelfDestructingSolverStorable10 [2025-03-08 21:59:19,933 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-08 21:59:19,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:59:19,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1236607570, now seen corresponding path program 2 times [2025-03-08 21:59:19,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:59:19,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055273456] [2025-03-08 21:59:19,935 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:59:19,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:59:20,050 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 936 statements into 2 equivalence classes. [2025-03-08 21:59:20,059 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 194 of 936 statements. [2025-03-08 21:59:20,059 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:59:20,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:20,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2233 trivial. 0 not checked. [2025-03-08 21:59:20,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:59:20,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055273456] [2025-03-08 21:59:20,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055273456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:59:20,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:59:20,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:59:20,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664094953] [2025-03-08 21:59:20,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:59:20,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:59:20,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:59:20,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:59:20,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:59:21,000 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 488 [2025-03-08 21:59:21,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 511 places, 551 transitions, 1592 flow. Second operand has 6 states, 6 states have (on average 404.0) internal successors, (2424), 6 states have internal predecessors, (2424), 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-08 21:59:21,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:59:21,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 488 [2025-03-08 21:59:21,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:59:21,468 INFO L124 PetriNetUnfolderBase]: 212/2342 cut-off events. [2025-03-08 21:59:21,468 INFO L125 PetriNetUnfolderBase]: For 454/488 co-relation queries the response was YES. [2025-03-08 21:59:21,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3642 conditions, 2342 events. 212/2342 cut-off events. For 454/488 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 9069 event pairs, 54 based on Foata normal form. 0/2240 useless extension candidates. Maximal degree in co-relation 2540. Up to 572 conditions per place. [2025-03-08 21:59:21,476 INFO L140 encePairwiseOnDemand]: 482/488 looper letters, 150 selfloop transitions, 5 changer transitions 0/550 dead transitions. [2025-03-08 21:59:21,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 515 places, 550 transitions, 1900 flow [2025-03-08 21:59:21,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:59:21,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:59:21,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2455 transitions. [2025-03-08 21:59:21,480 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8384562841530054 [2025-03-08 21:59:21,480 INFO L175 Difference]: Start difference. First operand has 511 places, 551 transitions, 1592 flow. Second operand 6 states and 2455 transitions. [2025-03-08 21:59:21,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 515 places, 550 transitions, 1900 flow [2025-03-08 21:59:21,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 509 places, 550 transitions, 1876 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-08 21:59:21,488 INFO L231 Difference]: Finished difference. Result has 509 places, 550 transitions, 1576 flow [2025-03-08 21:59:21,489 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=1566, PETRI_DIFFERENCE_MINUEND_PLACES=504, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1576, PETRI_PLACES=509, PETRI_TRANSITIONS=550} [2025-03-08 21:59:21,489 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, 22 predicate places. [2025-03-08 21:59:21,489 INFO L471 AbstractCegarLoop]: Abstraction has has 509 places, 550 transitions, 1576 flow [2025-03-08 21:59:21,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 404.0) internal successors, (2424), 6 states have internal predecessors, (2424), 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-08 21:59:21,490 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:59:21,491 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:59:21,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 21:59:21,491 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-08 21:59:21,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:59:21,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1794064447, now seen corresponding path program 1 times [2025-03-08 21:59:21,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:59:21,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696281297] [2025-03-08 21:59:21,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:59:21,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:59:21,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 987 statements into 1 equivalence classes. [2025-03-08 21:59:21,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 987 of 987 statements. [2025-03-08 21:59:21,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:59:21,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:22,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 0 proven. 2233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:59:22,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:59:22,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696281297] [2025-03-08 21:59:22,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696281297] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:59:22,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240585966] [2025-03-08 21:59:22,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:59:22,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:59:22,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:59:22,881 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-08 21:59:22,884 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-08 21:59:23,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 987 statements into 1 equivalence classes. [2025-03-08 21:59:23,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 987 of 987 statements. [2025-03-08 21:59:23,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:59:23,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:23,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 3788 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 21:59:23,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:59:24,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 0 proven. 2233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:59:24,155 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:59:24,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 0 proven. 2233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:59:24,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240585966] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:59:24,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:59:24,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-08 21:59:24,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604649831] [2025-03-08 21:59:24,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:59:24,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 21:59:24,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:59:24,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 21:59:24,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-08 21:59:24,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 471 out of 488 [2025-03-08 21:59:24,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 509 places, 550 transitions, 1576 flow. Second operand has 23 states, 23 states have (on average 473.0869565217391) internal successors, (10881), 23 states have internal predecessors, (10881), 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-08 21:59:24,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:59:24,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 471 of 488 [2025-03-08 21:59:24,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:59:25,518 INFO L124 PetriNetUnfolderBase]: 150/2495 cut-off events. [2025-03-08 21:59:25,518 INFO L125 PetriNetUnfolderBase]: For 301/321 co-relation queries the response was YES. [2025-03-08 21:59:25,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3281 conditions, 2495 events. 150/2495 cut-off events. For 301/321 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 7270 event pairs, 21 based on Foata normal form. 3/2411 useless extension candidates. Maximal degree in co-relation 1997. Up to 207 conditions per place. [2025-03-08 21:59:25,525 INFO L140 encePairwiseOnDemand]: 482/488 looper letters, 22 selfloop transitions, 30 changer transitions 0/567 dead transitions. [2025-03-08 21:59:25,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 538 places, 567 transitions, 1802 flow [2025-03-08 21:59:25,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-08 21:59:25,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-08 21:59:25,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 14184 transitions. [2025-03-08 21:59:25,534 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9688524590163935 [2025-03-08 21:59:25,535 INFO L175 Difference]: Start difference. First operand has 509 places, 550 transitions, 1576 flow. Second operand 30 states and 14184 transitions. [2025-03-08 21:59:25,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 538 places, 567 transitions, 1802 flow [2025-03-08 21:59:25,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 533 places, 567 transitions, 1792 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:59:25,542 INFO L231 Difference]: Finished difference. Result has 537 places, 560 transitions, 1718 flow [2025-03-08 21:59:25,543 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=1566, PETRI_DIFFERENCE_MINUEND_PLACES=504, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1718, PETRI_PLACES=537, PETRI_TRANSITIONS=560} [2025-03-08 21:59:25,543 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, 50 predicate places. [2025-03-08 21:59:25,543 INFO L471 AbstractCegarLoop]: Abstraction has has 537 places, 560 transitions, 1718 flow [2025-03-08 21:59:25,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 473.0869565217391) internal successors, (10881), 23 states have internal predecessors, (10881), 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-08 21:59:25,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:59:25,546 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:59:25,557 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-08 21:59:25,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:59:25,746 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-08 21:59:25,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:59:25,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1647373346, now seen corresponding path program 2 times [2025-03-08 21:59:25,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:59:25,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745278006] [2025-03-08 21:59:25,749 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:59:25,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:59:25,865 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1305 statements into 2 equivalence classes. [2025-03-08 21:59:25,874 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 245 of 1305 statements. [2025-03-08 21:59:25,874 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:59:25,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:26,208 INFO L134 CoverageAnalysis]: Checked inductivity of 4780 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4780 trivial. 0 not checked. [2025-03-08 21:59:26,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:59:26,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745278006] [2025-03-08 21:59:26,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745278006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:59:26,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:59:26,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:59:26,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015384518] [2025-03-08 21:59:26,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:59:26,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:59:26,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:59:26,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:59:26,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:59:26,696 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 488 [2025-03-08 21:59:26,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 537 places, 560 transitions, 1718 flow. Second operand has 6 states, 6 states have (on average 405.5) internal successors, (2433), 6 states have internal predecessors, (2433), 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-08 21:59:26,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:59:26,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 488 [2025-03-08 21:59:26,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:59:27,716 INFO L124 PetriNetUnfolderBase]: 530/3564 cut-off events. [2025-03-08 21:59:27,716 INFO L125 PetriNetUnfolderBase]: For 951/1034 co-relation queries the response was YES. [2025-03-08 21:59:27,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6052 conditions, 3564 events. 530/3564 cut-off events. For 951/1034 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 16077 event pairs, 92 based on Foata normal form. 16/3423 useless extension candidates. Maximal degree in co-relation 4487. Up to 1097 conditions per place. [2025-03-08 21:59:27,729 INFO L140 encePairwiseOnDemand]: 465/488 looper letters, 163 selfloop transitions, 130 changer transitions 0/697 dead transitions. [2025-03-08 21:59:27,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 542 places, 697 transitions, 2954 flow [2025-03-08 21:59:27,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:59:27,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:59:27,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2533 transitions. [2025-03-08 21:59:27,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8650956284153005 [2025-03-08 21:59:27,731 INFO L175 Difference]: Start difference. First operand has 537 places, 560 transitions, 1718 flow. Second operand 6 states and 2533 transitions. [2025-03-08 21:59:27,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 542 places, 697 transitions, 2954 flow [2025-03-08 21:59:27,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 524 places, 697 transitions, 2908 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-03-08 21:59:27,742 INFO L231 Difference]: Finished difference. Result has 529 places, 689 transitions, 2900 flow [2025-03-08 21:59:27,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=1672, PETRI_DIFFERENCE_MINUEND_PLACES=519, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2900, PETRI_PLACES=529, PETRI_TRANSITIONS=689} [2025-03-08 21:59:27,743 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, 42 predicate places. [2025-03-08 21:59:27,743 INFO L471 AbstractCegarLoop]: Abstraction has has 529 places, 689 transitions, 2900 flow [2025-03-08 21:59:27,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 405.5) internal successors, (2433), 6 states have internal predecessors, (2433), 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-08 21:59:27,744 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:59:27,744 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:59:27,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 21:59:27,744 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-08 21:59:27,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:59:27,748 INFO L85 PathProgramCache]: Analyzing trace with hash 860894093, now seen corresponding path program 1 times [2025-03-08 21:59:27,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:59:27,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261786840] [2025-03-08 21:59:27,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:59:27,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:59:27,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1315 statements into 1 equivalence classes. [2025-03-08 21:59:27,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1315 of 1315 statements. [2025-03-08 21:59:27,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:59:27,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:30,631 INFO L134 CoverageAnalysis]: Checked inductivity of 4790 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4790 trivial. 0 not checked. [2025-03-08 21:59:30,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:59:30,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261786840] [2025-03-08 21:59:30,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261786840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:59:30,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:59:30,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:59:30,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046665563] [2025-03-08 21:59:30,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:59:30,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:59:30,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:59:30,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:59:30,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:59:31,092 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 392 out of 488 [2025-03-08 21:59:31,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 529 places, 689 transitions, 2900 flow. Second operand has 6 states, 6 states have (on average 404.0) internal successors, (2424), 6 states have internal predecessors, (2424), 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-08 21:59:31,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:59:31,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 392 of 488 [2025-03-08 21:59:31,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:59:32,315 INFO L124 PetriNetUnfolderBase]: 806/4335 cut-off events. [2025-03-08 21:59:32,315 INFO L125 PetriNetUnfolderBase]: For 3369/3576 co-relation queries the response was YES. [2025-03-08 21:59:32,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8916 conditions, 4335 events. 806/4335 cut-off events. For 3369/3576 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 22243 event pairs, 65 based on Foata normal form. 52/4222 useless extension candidates. Maximal degree in co-relation 7368. Up to 1357 conditions per place. [2025-03-08 21:59:32,331 INFO L140 encePairwiseOnDemand]: 465/488 looper letters, 285 selfloop transitions, 131 changer transitions 5/827 dead transitions. [2025-03-08 21:59:32,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 534 places, 827 transitions, 4642 flow [2025-03-08 21:59:32,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:59:32,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:59:32,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2524 transitions. [2025-03-08 21:59:32,334 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8620218579234973 [2025-03-08 21:59:32,334 INFO L175 Difference]: Start difference. First operand has 529 places, 689 transitions, 2900 flow. Second operand 6 states and 2524 transitions. [2025-03-08 21:59:32,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 534 places, 827 transitions, 4642 flow [2025-03-08 21:59:32,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 534 places, 827 transitions, 4642 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:59:32,348 INFO L231 Difference]: Finished difference. Result has 539 places, 817 transitions, 4380 flow [2025-03-08 21:59:32,349 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=2900, PETRI_DIFFERENCE_MINUEND_PLACES=529, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=689, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=651, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4380, PETRI_PLACES=539, PETRI_TRANSITIONS=817} [2025-03-08 21:59:32,349 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, 52 predicate places. [2025-03-08 21:59:32,349 INFO L471 AbstractCegarLoop]: Abstraction has has 539 places, 817 transitions, 4380 flow [2025-03-08 21:59:32,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 404.0) internal successors, (2424), 6 states have internal predecessors, (2424), 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-08 21:59:32,350 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:59:32,350 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:59:32,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 21:59:32,350 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-08 21:59:32,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:59:32,353 INFO L85 PathProgramCache]: Analyzing trace with hash -919070086, now seen corresponding path program 1 times [2025-03-08 21:59:32,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:59:32,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926211265] [2025-03-08 21:59:32,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:59:32,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:59:32,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1316 statements into 1 equivalence classes. [2025-03-08 21:59:32,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1316 of 1316 statements. [2025-03-08 21:59:32,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:59:32,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:35,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4790 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4790 trivial. 0 not checked. [2025-03-08 21:59:35,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:59:35,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926211265] [2025-03-08 21:59:35,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926211265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:59:35,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:59:35,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:59:35,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643682847] [2025-03-08 21:59:35,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:59:35,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:59:35,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:59:35,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:59:35,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:59:35,708 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 488 [2025-03-08 21:59:35,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 539 places, 817 transitions, 4380 flow. Second operand has 6 states, 6 states have (on average 372.6666666666667) internal successors, (2236), 6 states have internal predecessors, (2236), 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-08 21:59:35,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:59:35,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 488 [2025-03-08 21:59:35,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:59:37,378 INFO L124 PetriNetUnfolderBase]: 1308/5703 cut-off events. [2025-03-08 21:59:37,379 INFO L125 PetriNetUnfolderBase]: For 4874/4931 co-relation queries the response was YES. [2025-03-08 21:59:37,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13640 conditions, 5703 events. 1308/5703 cut-off events. For 4874/4931 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 33818 event pairs, 369 based on Foata normal form. 11/5469 useless extension candidates. Maximal degree in co-relation 12008. Up to 2597 conditions per place. [2025-03-08 21:59:37,397 INFO L140 encePairwiseOnDemand]: 469/488 looper letters, 364 selfloop transitions, 84 changer transitions 0/896 dead transitions. [2025-03-08 21:59:37,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 896 transitions, 5674 flow [2025-03-08 21:59:37,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:59:37,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:59:37,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2332 transitions. [2025-03-08 21:59:37,399 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.796448087431694 [2025-03-08 21:59:37,399 INFO L175 Difference]: Start difference. First operand has 539 places, 817 transitions, 4380 flow. Second operand 6 states and 2332 transitions. [2025-03-08 21:59:37,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 896 transitions, 5674 flow [2025-03-08 21:59:37,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 896 transitions, 5420 flow, removed 127 selfloop flow, removed 0 redundant places. [2025-03-08 21:59:37,421 INFO L231 Difference]: Finished difference. Result has 548 places, 888 transitions, 4916 flow [2025-03-08 21:59:37,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=4132, PETRI_DIFFERENCE_MINUEND_PLACES=538, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=817, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=769, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4916, PETRI_PLACES=548, PETRI_TRANSITIONS=888} [2025-03-08 21:59:37,423 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, 61 predicate places. [2025-03-08 21:59:37,423 INFO L471 AbstractCegarLoop]: Abstraction has has 548 places, 888 transitions, 4916 flow [2025-03-08 21:59:37,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 372.6666666666667) internal successors, (2236), 6 states have internal predecessors, (2236), 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-08 21:59:37,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:59:37,424 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:59:37,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 21:59:37,424 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-08 21:59:37,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:59:37,427 INFO L85 PathProgramCache]: Analyzing trace with hash 585557596, now seen corresponding path program 1 times [2025-03-08 21:59:37,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:59:37,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717642426] [2025-03-08 21:59:37,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:59:37,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:59:37,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1322 statements into 1 equivalence classes. [2025-03-08 21:59:40,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1322 of 1322 statements. [2025-03-08 21:59:40,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:59:40,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:55,743 INFO L134 CoverageAnalysis]: Checked inductivity of 4790 backedges. 57 proven. 1137 refuted. 0 times theorem prover too weak. 3596 trivial. 0 not checked. [2025-03-08 21:59:55,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:59:55,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717642426] [2025-03-08 21:59:55,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717642426] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:59:55,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939119655] [2025-03-08 21:59:55,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:59:55,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:59:55,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:59:55,745 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-08 21:59:55,746 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-08 21:59:56,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1322 statements into 1 equivalence classes. [2025-03-08 21:59:57,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1322 of 1322 statements. [2025-03-08 21:59:57,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:59:57,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:57,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 5102 conjuncts, 120 conjuncts are in the unsatisfiable core [2025-03-08 21:59:57,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:59:57,219 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-08 21:59:57,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-08 21:59:57,409 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-08 21:59:57,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-08 21:59:58,006 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-03-08 21:59:58,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2025-03-08 21:59:58,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 21:59:58,615 INFO L349 Elim1Store]: treesize reduction 72, result has 35.7 percent of original size [2025-03-08 21:59:58,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 57 [2025-03-08 21:59:58,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2025-03-08 21:59:58,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2025-03-08 21:59:59,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 21 [2025-03-08 22:00:00,264 INFO L349 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2025-03-08 22:00:00,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 38 [2025-03-08 22:00:01,128 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-08 22:00:01,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-03-08 22:00:02,449 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-08 22:00:02,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-03-08 22:00:03,237 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-08 22:00:03,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-03-08 22:00:04,512 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-08 22:00:04,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-03-08 22:00:05,246 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-08 22:00:05,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-03-08 22:00:06,536 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-08 22:00:06,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-03-08 22:00:07,178 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-08 22:00:07,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-03-08 22:00:08,503 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-08 22:00:08,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-03-08 22:00:09,180 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-08 22:00:09,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-03-08 22:00:10,426 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-08 22:00:10,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-03-08 22:00:11,080 INFO L349 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2025-03-08 22:00:11,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 38 [2025-03-08 22:00:12,403 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-08 22:00:12,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-03-08 22:00:13,055 INFO L349 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2025-03-08 22:00:13,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 38 [2025-03-08 22:00:14,373 INFO L349 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2025-03-08 22:00:14,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 38 [2025-03-08 22:00:15,070 INFO L349 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2025-03-08 22:00:15,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 38 [2025-03-08 22:00:16,829 INFO L349 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2025-03-08 22:00:16,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 32 treesize of output 57 [2025-03-08 22:00:18,844 INFO L349 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2025-03-08 22:00:18,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 39 treesize of output 64 [2025-03-08 22:00:21,262 INFO L349 Elim1Store]: treesize reduction 20, result has 51.2 percent of original size [2025-03-08 22:00:21,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 39 [2025-03-08 22:00:21,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 22:00:21,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2025-03-08 22:00:21,384 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:00:21,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2025-03-08 22:00:21,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:00:21,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 52 [2025-03-08 22:00:21,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 40 [2025-03-08 22:00:21,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4790 backedges. 1021 proven. 552 refuted. 0 times theorem prover too weak. 3217 trivial. 0 not checked. [2025-03-08 22:00:21,498 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:00:23,348 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse2 (+ |c_~#slot~0.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_~#slot~0.base| (store (select |c_#race| |c_~#slot~0.base|) .cse2 0)))) (and (forall ((v_ArrVal_12036 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_12036) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse1 1)) 0)) (forall ((v_ArrVal_12036 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_12036) |c_~#slot~0.base|) .cse2) 0)) (forall ((v_ArrVal_12036 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_12036) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse1)) 0)) (forall ((v_ArrVal_12036 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_12036) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse1)) 0)))))) is different from false