./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_12-arraycollapse_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_12-arraycollapse_rc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 034172cc4904075fab6f792587170b7236be9fb41f3a62fa7fbe9a216ec4ca2c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:46:54,448 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:46:54,496 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:46:54,503 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:46:54,505 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:46:54,523 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:46:54,525 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:46:54,525 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:46:54,525 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:46:54,526 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:46:54,526 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:46:54,527 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:46:54,527 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:46:54,527 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:46:54,527 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:46:54,527 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:46:54,527 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:46:54,528 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:46:54,528 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:46:54,528 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:46:54,528 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:46:54,528 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:46:54,528 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:46:54,528 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:46:54,528 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:46:54,528 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:46:54,528 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:46:54,528 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:46:54,528 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:46:54,528 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:46:54,528 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:46:54,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:46:54,528 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:46:54,528 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:46:54,528 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:46:54,528 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:46:54,529 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:46:54,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:46:54,529 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:46:54,529 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:46:54,529 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:46:54,529 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:46:54,529 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 -> 034172cc4904075fab6f792587170b7236be9fb41f3a62fa7fbe9a216ec4ca2c [2025-03-04 06:46:54,765 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:46:54,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:46:54,778 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:46:54,779 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:46:54,779 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:46:54,781 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_12-arraycollapse_rc.i [2025-03-04 06:46:55,895 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b92ba6e3a/14e59e16b8a34e09b5fcd330f29e0d5e/FLAGdbdb00183 [2025-03-04 06:46:56,204 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:46:56,205 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_12-arraycollapse_rc.i [2025-03-04 06:46:56,222 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b92ba6e3a/14e59e16b8a34e09b5fcd330f29e0d5e/FLAGdbdb00183 [2025-03-04 06:46:56,450 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b92ba6e3a/14e59e16b8a34e09b5fcd330f29e0d5e [2025-03-04 06:46:56,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:46:56,452 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:46:56,453 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:46:56,453 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:46:56,457 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:46:56,458 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:46:56" (1/1) ... [2025-03-04 06:46:56,458 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d1f70a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:56, skipping insertion in model container [2025-03-04 06:46:56,458 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:46:56" (1/1) ... [2025-03-04 06:46:56,488 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:46:56,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:46:56,869 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:46:56,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:46:56,989 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:46:56,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:56 WrapperNode [2025-03-04 06:46:56,990 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:46:56,991 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:46:56,991 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:46:56,991 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:46:56,995 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:56" (1/1) ... [2025-03-04 06:46:57,020 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:56" (1/1) ... [2025-03-04 06:46:57,050 INFO L138 Inliner]: procedures = 372, calls = 94, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 389 [2025-03-04 06:46:57,051 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:46:57,051 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:46:57,051 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:46:57,051 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:46:57,060 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:56" (1/1) ... [2025-03-04 06:46:57,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:56" (1/1) ... [2025-03-04 06:46:57,065 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:56" (1/1) ... [2025-03-04 06:46:57,065 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:56" (1/1) ... [2025-03-04 06:46:57,084 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:56" (1/1) ... [2025-03-04 06:46:57,093 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:56" (1/1) ... [2025-03-04 06:46:57,096 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:56" (1/1) ... [2025-03-04 06:46:57,097 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:56" (1/1) ... [2025-03-04 06:46:57,104 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:46:57,105 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:46:57,105 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:46:57,105 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:46:57,106 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:56" (1/1) ... [2025-03-04 06:46:57,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:46:57,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:46:57,134 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:46:57,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:46:57,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-04 06:46:57,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-04 06:46:57,153 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:46:57,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:46:57,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:46:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:46:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:46:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:46:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-04 06:46:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 06:46:57,154 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 06:46:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:46:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:46:57,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:46:57,155 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:46:57,272 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:46:57,274 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:46:57,862 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:46:57,863 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:46:57,890 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:46:57,890 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:46:57,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:46:57 BoogieIcfgContainer [2025-03-04 06:46:57,891 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:46:57,893 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:46:57,894 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:46:57,897 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:46:57,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:46:56" (1/3) ... [2025-03-04 06:46:57,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e25d23a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:46:57, skipping insertion in model container [2025-03-04 06:46:57,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:56" (2/3) ... [2025-03-04 06:46:57,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e25d23a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:46:57, skipping insertion in model container [2025-03-04 06:46:57,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:46:57" (3/3) ... [2025-03-04 06:46:57,899 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_12-arraycollapse_rc.i [2025-03-04 06:46:57,910 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:46:57,911 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_12-arraycollapse_rc.i that has 2 procedures, 454 locations, 1 initial locations, 1 loop locations, and 28 error locations. [2025-03-04 06:46:57,912 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:46:57,996 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:46:58,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 457 places, 457 transitions, 918 flow [2025-03-04 06:46:58,147 INFO L124 PetriNetUnfolderBase]: 4/456 cut-off events. [2025-03-04 06:46:58,148 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:46:58,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 460 conditions, 456 events. 4/456 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 390 event pairs, 0 based on Foata normal form. 0/424 useless extension candidates. Maximal degree in co-relation 328. Up to 2 conditions per place. [2025-03-04 06:46:58,157 INFO L82 GeneralOperation]: Start removeDead. Operand has 457 places, 457 transitions, 918 flow [2025-03-04 06:46:58,164 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 456 places, 456 transitions, 915 flow [2025-03-04 06:46:58,174 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:46:58,185 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;@22456d9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:46:58,185 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2025-03-04 06:46:58,198 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:46:58,198 INFO L124 PetriNetUnfolderBase]: 1/102 cut-off events. [2025-03-04 06:46:58,198 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:46:58,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:46:58,199 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-04 06:46:58,199 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-04 06:46:58,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:46:58,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1051118038, now seen corresponding path program 1 times [2025-03-04 06:46:58,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:46:58,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826712582] [2025-03-04 06:46:58,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:46:58,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:46:58,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 06:46:58,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 06:46:58,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:46:58,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:46:59,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:46:59,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:46:59,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826712582] [2025-03-04 06:46:59,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826712582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:46:59,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:46:59,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:46:59,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234795089] [2025-03-04 06:46:59,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:46:59,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:46:59,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:46:59,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:46:59,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:46:59,725 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 457 [2025-03-04 06:46:59,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 456 transitions, 915 flow. Second operand has 6 states, 6 states have (on average 329.3333333333333) internal successors, (1976), 6 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:46:59,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:46:59,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 457 [2025-03-04 06:46:59,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:00,131 INFO L124 PetriNetUnfolderBase]: 365/1803 cut-off events. [2025-03-04 06:47:00,133 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:47:00,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2659 conditions, 1803 events. 365/1803 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9412 event pairs, 364 based on Foata normal form. 12/1678 useless extension candidates. Maximal degree in co-relation 2247. Up to 837 conditions per place. [2025-03-04 06:47:00,144 INFO L140 encePairwiseOnDemand]: 436/457 looper letters, 108 selfloop transitions, 15 changer transitions 2/450 dead transitions. [2025-03-04 06:47:00,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 450 transitions, 1149 flow [2025-03-04 06:47:00,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:00,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:00,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2097 transitions. [2025-03-04 06:47:00,159 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7647702407002188 [2025-03-04 06:47:00,161 INFO L175 Difference]: Start difference. First operand has 456 places, 456 transitions, 915 flow. Second operand 6 states and 2097 transitions. [2025-03-04 06:47:00,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 450 transitions, 1149 flow [2025-03-04 06:47:00,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 450 transitions, 1148 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:47:00,176 INFO L231 Difference]: Finished difference. Result has 457 places, 448 transitions, 928 flow [2025-03-04 06:47:00,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=928, PETRI_PLACES=457, PETRI_TRANSITIONS=448} [2025-03-04 06:47:00,183 INFO L279 CegarLoopForPetriNet]: 456 programPoint places, 1 predicate places. [2025-03-04 06:47:00,185 INFO L471 AbstractCegarLoop]: Abstraction has has 457 places, 448 transitions, 928 flow [2025-03-04 06:47:00,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 329.3333333333333) internal successors, (1976), 6 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:00,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:00,186 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-04 06:47:00,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:47:00,187 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-04 06:47:00,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:00,188 INFO L85 PathProgramCache]: Analyzing trace with hash -593507047, now seen corresponding path program 1 times [2025-03-04 06:47:00,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:00,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891305226] [2025-03-04 06:47:00,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:00,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:00,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 06:47:00,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 06:47:00,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:00,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:00,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:00,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:00,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891305226] [2025-03-04 06:47:00,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891305226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:00,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:00,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:00,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979653085] [2025-03-04 06:47:00,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:00,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:00,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:00,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:00,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:01,197 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 457 [2025-03-04 06:47:01,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 448 transitions, 928 flow. Second operand has 6 states, 6 states have (on average 329.3333333333333) internal successors, (1976), 6 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:01,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:01,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 457 [2025-03-04 06:47:01,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:01,400 INFO L124 PetriNetUnfolderBase]: 365/1798 cut-off events. [2025-03-04 06:47:01,400 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:47:01,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2669 conditions, 1798 events. 365/1798 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9410 event pairs, 364 based on Foata normal form. 0/1666 useless extension candidates. Maximal degree in co-relation 2390. Up to 837 conditions per place. [2025-03-04 06:47:01,407 INFO L140 encePairwiseOnDemand]: 439/457 looper letters, 108 selfloop transitions, 15 changer transitions 0/445 dead transitions. [2025-03-04 06:47:01,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 457 places, 445 transitions, 1168 flow [2025-03-04 06:47:01,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:01,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:01,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2094 transitions. [2025-03-04 06:47:01,414 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7636761487964989 [2025-03-04 06:47:01,415 INFO L175 Difference]: Start difference. First operand has 457 places, 448 transitions, 928 flow. Second operand 6 states and 2094 transitions. [2025-03-04 06:47:01,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 457 places, 445 transitions, 1168 flow [2025-03-04 06:47:01,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 445 transitions, 1138 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:01,423 INFO L231 Difference]: Finished difference. Result has 452 places, 445 transitions, 922 flow [2025-03-04 06:47:01,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=447, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=922, PETRI_PLACES=452, PETRI_TRANSITIONS=445} [2025-03-04 06:47:01,424 INFO L279 CegarLoopForPetriNet]: 456 programPoint places, -4 predicate places. [2025-03-04 06:47:01,424 INFO L471 AbstractCegarLoop]: Abstraction has has 452 places, 445 transitions, 922 flow [2025-03-04 06:47:01,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 329.3333333333333) internal successors, (1976), 6 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:01,425 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:01,425 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-04 06:47:01,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:47:01,425 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-04 06:47:01,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:01,426 INFO L85 PathProgramCache]: Analyzing trace with hash 949717171, now seen corresponding path program 1 times [2025-03-04 06:47:01,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:01,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272040304] [2025-03-04 06:47:01,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:01,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:01,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 06:47:01,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 06:47:01,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:01,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:01,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:01,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:01,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272040304] [2025-03-04 06:47:01,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272040304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:01,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:01,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:01,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698212566] [2025-03-04 06:47:01,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:01,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:01,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:01,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:01,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:02,259 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 457 [2025-03-04 06:47:02,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 445 transitions, 922 flow. Second operand has 6 states, 6 states have (on average 328.8333333333333) internal successors, (1973), 6 states have internal predecessors, (1973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:02,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:02,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 457 [2025-03-04 06:47:02,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:02,443 INFO L124 PetriNetUnfolderBase]: 391/1887 cut-off events. [2025-03-04 06:47:02,444 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 06:47:02,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2814 conditions, 1887 events. 391/1887 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10198 event pairs, 390 based on Foata normal form. 0/1749 useless extension candidates. Maximal degree in co-relation 2517. Up to 903 conditions per place. [2025-03-04 06:47:02,451 INFO L140 encePairwiseOnDemand]: 451/457 looper letters, 122 selfloop transitions, 5 changer transitions 0/444 dead transitions. [2025-03-04 06:47:02,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 444 transitions, 1174 flow [2025-03-04 06:47:02,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:02,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:02,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2084 transitions. [2025-03-04 06:47:02,455 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7600291757840992 [2025-03-04 06:47:02,455 INFO L175 Difference]: Start difference. First operand has 452 places, 445 transitions, 922 flow. Second operand 6 states and 2084 transitions. [2025-03-04 06:47:02,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 444 transitions, 1174 flow [2025-03-04 06:47:02,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 444 transitions, 1144 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:02,460 INFO L231 Difference]: Finished difference. Result has 451 places, 444 transitions, 900 flow [2025-03-04 06:47:02,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=900, PETRI_PLACES=451, PETRI_TRANSITIONS=444} [2025-03-04 06:47:02,461 INFO L279 CegarLoopForPetriNet]: 456 programPoint places, -5 predicate places. [2025-03-04 06:47:02,461 INFO L471 AbstractCegarLoop]: Abstraction has has 451 places, 444 transitions, 900 flow [2025-03-04 06:47:02,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 328.8333333333333) internal successors, (1973), 6 states have internal predecessors, (1973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:02,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:02,463 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-04 06:47:02,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:47:02,463 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-04 06:47:02,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:02,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1854581511, now seen corresponding path program 1 times [2025-03-04 06:47:02,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:02,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100516938] [2025-03-04 06:47:02,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:02,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:02,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 06:47:02,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 06:47:02,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:02,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:02,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:02,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:02,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100516938] [2025-03-04 06:47:02,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100516938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:02,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:02,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:47:02,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129948558] [2025-03-04 06:47:02,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:02,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:47:02,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:02,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:47:02,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:47:02,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 443 out of 457 [2025-03-04 06:47:02,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 444 transitions, 900 flow. Second operand has 3 states, 3 states have (on average 444.3333333333333) internal successors, (1333), 3 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:02,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:02,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 443 of 457 [2025-03-04 06:47:02,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:02,647 INFO L124 PetriNetUnfolderBase]: 7/629 cut-off events. [2025-03-04 06:47:02,647 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:47:02,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 668 conditions, 629 events. 7/629 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 645 event pairs, 6 based on Foata normal form. 1/594 useless extension candidates. Maximal degree in co-relation 467. Up to 24 conditions per place. [2025-03-04 06:47:02,650 INFO L140 encePairwiseOnDemand]: 454/457 looper letters, 10 selfloop transitions, 2 changer transitions 0/445 dead transitions. [2025-03-04 06:47:02,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 445 transitions, 926 flow [2025-03-04 06:47:02,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:47:02,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:47:02,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1342 transitions. [2025-03-04 06:47:02,652 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9788475565280816 [2025-03-04 06:47:02,652 INFO L175 Difference]: Start difference. First operand has 451 places, 444 transitions, 900 flow. Second operand 3 states and 1342 transitions. [2025-03-04 06:47:02,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 445 transitions, 926 flow [2025-03-04 06:47:02,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 445 transitions, 916 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:02,660 INFO L231 Difference]: Finished difference. Result has 449 places, 445 transitions, 902 flow [2025-03-04 06:47:02,661 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=902, PETRI_PLACES=449, PETRI_TRANSITIONS=445} [2025-03-04 06:47:02,661 INFO L279 CegarLoopForPetriNet]: 456 programPoint places, -7 predicate places. [2025-03-04 06:47:02,662 INFO L471 AbstractCegarLoop]: Abstraction has has 449 places, 445 transitions, 902 flow [2025-03-04 06:47:02,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 444.3333333333333) internal successors, (1333), 3 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:02,663 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:02,663 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-04 06:47:02,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:47:02,663 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-04 06:47:02,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:02,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1571368498, now seen corresponding path program 1 times [2025-03-04 06:47:02,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:02,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110331346] [2025-03-04 06:47:02,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:02,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:02,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-04 06:47:02,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-04 06:47:02,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:02,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:03,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:03,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:03,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110331346] [2025-03-04 06:47:03,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110331346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:03,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:03,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:03,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309436550] [2025-03-04 06:47:03,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:03,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:03,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:03,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:03,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:03,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 457 [2025-03-04 06:47:03,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 445 transitions, 902 flow. Second operand has 6 states, 6 states have (on average 372.8333333333333) internal successors, (2237), 6 states have internal predecessors, (2237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:03,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:03,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 457 [2025-03-04 06:47:03,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:03,991 INFO L124 PetriNetUnfolderBase]: 55/870 cut-off events. [2025-03-04 06:47:03,992 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 06:47:03,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1109 conditions, 870 events. 55/870 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2251 event pairs, 54 based on Foata normal form. 0/810 useless extension candidates. Maximal degree in co-relation 887. Up to 219 conditions per place. [2025-03-04 06:47:03,994 INFO L140 encePairwiseOnDemand]: 451/457 looper letters, 81 selfloop transitions, 5 changer transitions 0/444 dead transitions. [2025-03-04 06:47:03,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 444 transitions, 1072 flow [2025-03-04 06:47:03,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:03,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:03,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2294 transitions. [2025-03-04 06:47:03,999 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8366156090444931 [2025-03-04 06:47:03,999 INFO L175 Difference]: Start difference. First operand has 449 places, 445 transitions, 902 flow. Second operand 6 states and 2294 transitions. [2025-03-04 06:47:03,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 444 transitions, 1072 flow [2025-03-04 06:47:04,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 444 transitions, 1070 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:47:04,005 INFO L231 Difference]: Finished difference. Result has 452 places, 444 transitions, 908 flow [2025-03-04 06:47:04,005 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=447, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=908, PETRI_PLACES=452, PETRI_TRANSITIONS=444} [2025-03-04 06:47:04,006 INFO L279 CegarLoopForPetriNet]: 456 programPoint places, -4 predicate places. [2025-03-04 06:47:04,006 INFO L471 AbstractCegarLoop]: Abstraction has has 452 places, 444 transitions, 908 flow [2025-03-04 06:47:04,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 372.8333333333333) internal successors, (2237), 6 states have internal predecessors, (2237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:04,007 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:04,007 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-04 06:47:04,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:47:04,007 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-04 06:47:04,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:04,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1480401979, now seen corresponding path program 1 times [2025-03-04 06:47:04,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:04,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604866130] [2025-03-04 06:47:04,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:04,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:04,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 06:47:04,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 06:47:04,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:04,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:04,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:04,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:04,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604866130] [2025-03-04 06:47:04,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604866130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:04,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:04,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:04,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507287252] [2025-03-04 06:47:04,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:04,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:04,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:04,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:04,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:05,070 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 457 [2025-03-04 06:47:05,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 444 transitions, 908 flow. Second operand has 6 states, 6 states have (on average 355.5) internal successors, (2133), 6 states have internal predecessors, (2133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:05,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:05,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 457 [2025-03-04 06:47:05,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:05,246 INFO L124 PetriNetUnfolderBase]: 37/783 cut-off events. [2025-03-04 06:47:05,246 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:47:05,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1012 conditions, 783 events. 37/783 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1739 event pairs, 36 based on Foata normal form. 0/740 useless extension candidates. Maximal degree in co-relation 755. Up to 190 conditions per place. [2025-03-04 06:47:05,248 INFO L140 encePairwiseOnDemand]: 439/457 looper letters, 85 selfloop transitions, 15 changer transitions 0/441 dead transitions. [2025-03-04 06:47:05,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 441 transitions, 1102 flow [2025-03-04 06:47:05,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:05,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:05,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2209 transitions. [2025-03-04 06:47:05,252 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8056163384390955 [2025-03-04 06:47:05,252 INFO L175 Difference]: Start difference. First operand has 452 places, 444 transitions, 908 flow. Second operand 6 states and 2209 transitions. [2025-03-04 06:47:05,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 441 transitions, 1102 flow [2025-03-04 06:47:05,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 441 transitions, 1092 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:05,258 INFO L231 Difference]: Finished difference. Result has 449 places, 441 transitions, 922 flow [2025-03-04 06:47:05,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=922, PETRI_PLACES=449, PETRI_TRANSITIONS=441} [2025-03-04 06:47:05,259 INFO L279 CegarLoopForPetriNet]: 456 programPoint places, -7 predicate places. [2025-03-04 06:47:05,259 INFO L471 AbstractCegarLoop]: Abstraction has has 449 places, 441 transitions, 922 flow [2025-03-04 06:47:05,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 355.5) internal successors, (2133), 6 states have internal predecessors, (2133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:05,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:05,260 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-04 06:47:05,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:47:05,261 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-04 06:47:05,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:05,261 INFO L85 PathProgramCache]: Analyzing trace with hash 2049080842, now seen corresponding path program 1 times [2025-03-04 06:47:05,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:05,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166751087] [2025-03-04 06:47:05,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:05,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:05,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-04 06:47:05,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-04 06:47:05,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:05,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:05,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:05,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:05,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166751087] [2025-03-04 06:47:05,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166751087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:05,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:05,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:05,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394439679] [2025-03-04 06:47:05,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:05,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:05,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:05,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:05,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:05,993 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 457 [2025-03-04 06:47:05,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 441 transitions, 922 flow. Second operand has 6 states, 6 states have (on average 319.1666666666667) internal successors, (1915), 6 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:05,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:05,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 457 [2025-03-04 06:47:05,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:06,294 INFO L124 PetriNetUnfolderBase]: 365/1896 cut-off events. [2025-03-04 06:47:06,294 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:47:06,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2835 conditions, 1896 events. 365/1896 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9364 event pairs, 364 based on Foata normal form. 0/1772 useless extension candidates. Maximal degree in co-relation 2448. Up to 890 conditions per place. [2025-03-04 06:47:06,302 INFO L140 encePairwiseOnDemand]: 439/457 looper letters, 123 selfloop transitions, 15 changer transitions 0/438 dead transitions. [2025-03-04 06:47:06,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 438 transitions, 1192 flow [2025-03-04 06:47:06,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:06,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:06,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2019 transitions. [2025-03-04 06:47:06,306 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7363238512035011 [2025-03-04 06:47:06,307 INFO L175 Difference]: Start difference. First operand has 449 places, 441 transitions, 922 flow. Second operand 6 states and 2019 transitions. [2025-03-04 06:47:06,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 438 transitions, 1192 flow [2025-03-04 06:47:06,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 438 transitions, 1162 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:06,312 INFO L231 Difference]: Finished difference. Result has 446 places, 438 transitions, 916 flow [2025-03-04 06:47:06,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=916, PETRI_PLACES=446, PETRI_TRANSITIONS=438} [2025-03-04 06:47:06,313 INFO L279 CegarLoopForPetriNet]: 456 programPoint places, -10 predicate places. [2025-03-04 06:47:06,315 INFO L471 AbstractCegarLoop]: Abstraction has has 446 places, 438 transitions, 916 flow [2025-03-04 06:47:06,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 319.1666666666667) internal successors, (1915), 6 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:06,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:06,316 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-04 06:47:06,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:47:06,316 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-04 06:47:06,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:06,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1082860791, now seen corresponding path program 1 times [2025-03-04 06:47:06,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:06,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936835009] [2025-03-04 06:47:06,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:06,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:06,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-04 06:47:06,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-04 06:47:06,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:06,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:06,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:06,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:06,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936835009] [2025-03-04 06:47:06,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936835009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:06,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:06,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:06,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923211741] [2025-03-04 06:47:06,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:06,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:06,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:06,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:06,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:07,008 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 457 [2025-03-04 06:47:07,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 438 transitions, 916 flow. Second operand has 6 states, 6 states have (on average 322.6666666666667) internal successors, (1936), 6 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:07,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:07,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 457 [2025-03-04 06:47:07,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:07,299 INFO L124 PetriNetUnfolderBase]: 365/1892 cut-off events. [2025-03-04 06:47:07,299 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:47:07,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2827 conditions, 1892 events. 365/1892 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9434 event pairs, 364 based on Foata normal form. 0/1772 useless extension candidates. Maximal degree in co-relation 2444. Up to 886 conditions per place. [2025-03-04 06:47:07,307 INFO L140 encePairwiseOnDemand]: 439/457 looper letters, 120 selfloop transitions, 15 changer transitions 0/435 dead transitions. [2025-03-04 06:47:07,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 435 transitions, 1180 flow [2025-03-04 06:47:07,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:07,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:07,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2034 transitions. [2025-03-04 06:47:07,311 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7417943107221007 [2025-03-04 06:47:07,311 INFO L175 Difference]: Start difference. First operand has 446 places, 438 transitions, 916 flow. Second operand 6 states and 2034 transitions. [2025-03-04 06:47:07,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 435 transitions, 1180 flow [2025-03-04 06:47:07,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 435 transitions, 1150 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:07,317 INFO L231 Difference]: Finished difference. Result has 443 places, 435 transitions, 910 flow [2025-03-04 06:47:07,318 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=910, PETRI_PLACES=443, PETRI_TRANSITIONS=435} [2025-03-04 06:47:07,320 INFO L279 CegarLoopForPetriNet]: 456 programPoint places, -13 predicate places. [2025-03-04 06:47:07,320 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 435 transitions, 910 flow [2025-03-04 06:47:07,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 322.6666666666667) internal successors, (1936), 6 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:07,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:07,321 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-04 06:47:07,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:47:07,322 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-04 06:47:07,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:07,322 INFO L85 PathProgramCache]: Analyzing trace with hash -95388905, now seen corresponding path program 1 times [2025-03-04 06:47:07,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:07,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262705887] [2025-03-04 06:47:07,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:07,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:07,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-04 06:47:07,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-04 06:47:07,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:07,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:07,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:07,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:07,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262705887] [2025-03-04 06:47:07,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262705887] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:47:07,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101833994] [2025-03-04 06:47:07,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:07,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:47:07,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:47:07,491 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:47:07,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 06:47:07,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-04 06:47:07,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-04 06:47:07,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:07,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:07,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 06:47:07,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:47:07,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:07,870 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:47:08,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:08,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101833994] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:47:08,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:47:08,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 06:47:08,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457391600] [2025-03-04 06:47:08,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:47:08,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:47:08,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:08,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:47:08,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:47:08,140 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 457 [2025-03-04 06:47:08,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 435 transitions, 910 flow. Second operand has 10 states, 10 states have (on average 441.8) internal successors, (4418), 10 states have internal predecessors, (4418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:08,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:08,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 457 [2025-03-04 06:47:08,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:08,268 INFO L124 PetriNetUnfolderBase]: 7/723 cut-off events. [2025-03-04 06:47:08,269 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:47:08,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 794 conditions, 723 events. 7/723 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 403 event pairs, 6 based on Foata normal form. 2/703 useless extension candidates. Maximal degree in co-relation 365. Up to 24 conditions per place. [2025-03-04 06:47:08,271 INFO L140 encePairwiseOnDemand]: 451/457 looper letters, 14 selfloop transitions, 9 changer transitions 0/443 dead transitions. [2025-03-04 06:47:08,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 443 transitions, 974 flow [2025-03-04 06:47:08,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:47:08,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 06:47:08,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3985 transitions. [2025-03-04 06:47:08,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9688791636275225 [2025-03-04 06:47:08,277 INFO L175 Difference]: Start difference. First operand has 443 places, 435 transitions, 910 flow. Second operand 9 states and 3985 transitions. [2025-03-04 06:47:08,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 443 transitions, 974 flow [2025-03-04 06:47:08,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 443 transitions, 944 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:08,282 INFO L231 Difference]: Finished difference. Result has 449 places, 441 transitions, 930 flow [2025-03-04 06:47:08,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=930, PETRI_PLACES=449, PETRI_TRANSITIONS=441} [2025-03-04 06:47:08,284 INFO L279 CegarLoopForPetriNet]: 456 programPoint places, -7 predicate places. [2025-03-04 06:47:08,284 INFO L471 AbstractCegarLoop]: Abstraction has has 449 places, 441 transitions, 930 flow [2025-03-04 06:47:08,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 441.8) internal successors, (4418), 10 states have internal predecessors, (4418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:08,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:08,286 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-04 06:47:08,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 06:47:08,490 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-04 06:47:08,490 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-04 06:47:08,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:08,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1718902583, now seen corresponding path program 2 times [2025-03-04 06:47:08,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:08,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975719348] [2025-03-04 06:47:08,491 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:47:08,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:08,546 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 446 statements into 2 equivalence classes. [2025-03-04 06:47:08,550 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 128 of 446 statements. [2025-03-04 06:47:08,550 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:47:08,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:08,764 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-04 06:47:08,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:08,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975719348] [2025-03-04 06:47:08,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975719348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:08,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:08,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:08,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622999998] [2025-03-04 06:47:08,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:08,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:08,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:08,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:08,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:09,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 365 out of 457 [2025-03-04 06:47:09,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 441 transitions, 930 flow. Second operand has 6 states, 6 states have (on average 372.3333333333333) internal successors, (2234), 6 states have internal predecessors, (2234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:09,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:09,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 365 of 457 [2025-03-04 06:47:09,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:09,771 INFO L124 PetriNetUnfolderBase]: 257/1976 cut-off events. [2025-03-04 06:47:09,772 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-04 06:47:09,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2671 conditions, 1976 events. 257/1976 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 9088 event pairs, 37 based on Foata normal form. 0/1853 useless extension candidates. Maximal degree in co-relation 2169. Up to 515 conditions per place. [2025-03-04 06:47:09,779 INFO L140 encePairwiseOnDemand]: 428/457 looper letters, 91 selfloop transitions, 75 changer transitions 0/518 dead transitions. [2025-03-04 06:47:09,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 518 transitions, 1416 flow [2025-03-04 06:47:09,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:09,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:09,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2358 transitions. [2025-03-04 06:47:09,806 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8599562363238512 [2025-03-04 06:47:09,806 INFO L175 Difference]: Start difference. First operand has 449 places, 441 transitions, 930 flow. Second operand 6 states and 2358 transitions. [2025-03-04 06:47:09,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 518 transitions, 1416 flow [2025-03-04 06:47:09,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 518 transitions, 1410 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 06:47:09,813 INFO L231 Difference]: Finished difference. Result has 457 places, 509 transitions, 1404 flow [2025-03-04 06:47:09,813 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=922, PETRI_DIFFERENCE_MINUEND_PLACES=447, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1404, PETRI_PLACES=457, PETRI_TRANSITIONS=509} [2025-03-04 06:47:09,814 INFO L279 CegarLoopForPetriNet]: 456 programPoint places, 1 predicate places. [2025-03-04 06:47:09,814 INFO L471 AbstractCegarLoop]: Abstraction has has 457 places, 509 transitions, 1404 flow [2025-03-04 06:47:09,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 372.3333333333333) internal successors, (2234), 6 states have internal predecessors, (2234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:09,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:09,815 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] [2025-03-04 06:47:09,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:47:09,815 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-04 06:47:09,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:09,816 INFO L85 PathProgramCache]: Analyzing trace with hash -2087579135, now seen corresponding path program 1 times [2025-03-04 06:47:09,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:09,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155826224] [2025-03-04 06:47:09,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:09,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:09,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-03-04 06:47:09,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-03-04 06:47:09,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:09,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:10,271 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-04 06:47:10,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:10,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155826224] [2025-03-04 06:47:10,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155826224] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:47:10,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487180807] [2025-03-04 06:47:10,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:10,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:47:10,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:47:10,274 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:47:10,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 06:47:10,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-03-04 06:47:10,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-03-04 06:47:10,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:10,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:10,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 1764 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 06:47:10,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:47:10,940 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-04 06:47:10,940 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:47:11,275 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-04 06:47:11,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487180807] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:47:11,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:47:11,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-04 06:47:11,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182711044] [2025-03-04 06:47:11,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:47:11,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 06:47:11,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:11,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 06:47:11,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-04 06:47:11,436 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 457 [2025-03-04 06:47:11,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 509 transitions, 1404 flow. Second operand has 18 states, 18 states have (on average 441.8888888888889) internal successors, (7954), 18 states have internal predecessors, (7954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:11,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:11,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 457 [2025-03-04 06:47:11,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:11,850 INFO L124 PetriNetUnfolderBase]: 159/2165 cut-off events. [2025-03-04 06:47:11,850 INFO L125 PetriNetUnfolderBase]: For 184/198 co-relation queries the response was YES. [2025-03-04 06:47:11,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2895 conditions, 2165 events. 159/2165 cut-off events. For 184/198 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7434 event pairs, 23 based on Foata normal form. 4/2082 useless extension candidates. Maximal degree in co-relation 1998. Up to 208 conditions per place. [2025-03-04 06:47:11,857 INFO L140 encePairwiseOnDemand]: 451/457 looper letters, 19 selfloop transitions, 21 changer transitions 0/527 dead transitions. [2025-03-04 06:47:11,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 527 transitions, 1572 flow [2025-03-04 06:47:11,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 06:47:11,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 06:47:11,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 9283 transitions. [2025-03-04 06:47:11,865 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9672814421173284 [2025-03-04 06:47:11,865 INFO L175 Difference]: Start difference. First operand has 457 places, 509 transitions, 1404 flow. Second operand 21 states and 9283 transitions. [2025-03-04 06:47:11,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 477 places, 527 transitions, 1572 flow [2025-03-04 06:47:11,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 477 places, 527 transitions, 1572 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:47:11,872 INFO L231 Difference]: Finished difference. Result has 482 places, 522 transitions, 1534 flow [2025-03-04 06:47:11,873 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=1404, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=498, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1534, PETRI_PLACES=482, PETRI_TRANSITIONS=522} [2025-03-04 06:47:11,873 INFO L279 CegarLoopForPetriNet]: 456 programPoint places, 26 predicate places. [2025-03-04 06:47:11,873 INFO L471 AbstractCegarLoop]: Abstraction has has 482 places, 522 transitions, 1534 flow [2025-03-04 06:47:11,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 441.8888888888889) internal successors, (7954), 18 states have internal predecessors, (7954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:11,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:11,876 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] [2025-03-04 06:47:11,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 06:47:12,076 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-04 06:47:12,076 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-04 06:47:12,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:12,078 INFO L85 PathProgramCache]: Analyzing trace with hash 2117820865, now seen corresponding path program 2 times [2025-03-04 06:47:12,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:12,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712099438] [2025-03-04 06:47:12,078 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:47:12,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:12,171 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 907 statements into 2 equivalence classes. [2025-03-04 06:47:12,182 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 165 of 907 statements. [2025-03-04 06:47:12,182 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:47:12,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:12,520 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-04 06:47:12,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:12,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712099438] [2025-03-04 06:47:12,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712099438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:12,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:12,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:12,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91497429] [2025-03-04 06:47:12,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:12,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:12,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:12,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:12,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:13,115 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 457 [2025-03-04 06:47:13,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 482 places, 522 transitions, 1534 flow. Second operand has 6 states, 6 states have (on average 379.6666666666667) internal successors, (2278), 6 states have internal predecessors, (2278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:13,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:13,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 457 [2025-03-04 06:47:13,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:13,485 INFO L124 PetriNetUnfolderBase]: 227/2346 cut-off events. [2025-03-04 06:47:13,485 INFO L125 PetriNetUnfolderBase]: For 437/481 co-relation queries the response was YES. [2025-03-04 06:47:13,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3668 conditions, 2346 events. 227/2346 cut-off events. For 437/481 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 8669 event pairs, 55 based on Foata normal form. 0/2232 useless extension candidates. Maximal degree in co-relation 2566. Up to 564 conditions per place. [2025-03-04 06:47:13,493 INFO L140 encePairwiseOnDemand]: 451/457 looper letters, 142 selfloop transitions, 5 changer transitions 0/521 dead transitions. [2025-03-04 06:47:13,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 486 places, 521 transitions, 1826 flow [2025-03-04 06:47:13,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:13,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:13,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2309 transitions. [2025-03-04 06:47:13,496 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8420860685630926 [2025-03-04 06:47:13,496 INFO L175 Difference]: Start difference. First operand has 482 places, 522 transitions, 1534 flow. Second operand 6 states and 2309 transitions. [2025-03-04 06:47:13,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 486 places, 521 transitions, 1826 flow [2025-03-04 06:47:13,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 480 places, 521 transitions, 1802 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-04 06:47:13,503 INFO L231 Difference]: Finished difference. Result has 480 places, 521 transitions, 1518 flow [2025-03-04 06:47:13,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=1508, PETRI_DIFFERENCE_MINUEND_PLACES=475, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1518, PETRI_PLACES=480, PETRI_TRANSITIONS=521} [2025-03-04 06:47:13,504 INFO L279 CegarLoopForPetriNet]: 456 programPoint places, 24 predicate places. [2025-03-04 06:47:13,504 INFO L471 AbstractCegarLoop]: Abstraction has has 480 places, 521 transitions, 1518 flow [2025-03-04 06:47:13,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 379.6666666666667) internal successors, (2278), 6 states have internal predecessors, (2278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:13,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:13,506 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] [2025-03-04 06:47:13,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:47:13,506 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-04 06:47:13,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:13,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1014355176, now seen corresponding path program 1 times [2025-03-04 06:47:13,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:13,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820842905] [2025-03-04 06:47:13,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:13,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:13,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 958 statements into 1 equivalence classes. [2025-03-04 06:47:13,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 958 of 958 statements. [2025-03-04 06:47:13,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:13,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:14,869 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-04 06:47:14,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:14,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820842905] [2025-03-04 06:47:14,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820842905] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:47:14,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125008817] [2025-03-04 06:47:14,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:14,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:47:14,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:47:14,873 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:47:14,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 06:47:15,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 958 statements into 1 equivalence classes. [2025-03-04 06:47:15,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 958 of 958 statements. [2025-03-04 06:47:15,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:15,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:15,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 3674 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 06:47:15,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:47:16,086 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-04 06:47:16,086 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:47:16,676 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-04 06:47:16,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125008817] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:47:16,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:47:16,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-04 06:47:16,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299417884] [2025-03-04 06:47:16,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:47:16,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 06:47:16,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:16,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 06:47:16,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-04 06:47:16,886 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 457 [2025-03-04 06:47:16,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 480 places, 521 transitions, 1518 flow. Second operand has 23 states, 23 states have (on average 442.0869565217391) internal successors, (10168), 23 states have internal predecessors, (10168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:16,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:16,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 457 [2025-03-04 06:47:16,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:17,512 INFO L124 PetriNetUnfolderBase]: 159/2482 cut-off events. [2025-03-04 06:47:17,512 INFO L125 PetriNetUnfolderBase]: For 301/315 co-relation queries the response was YES. [2025-03-04 06:47:17,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3293 conditions, 2482 events. 159/2482 cut-off events. For 301/315 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7416 event pairs, 23 based on Foata normal form. 3/2399 useless extension candidates. Maximal degree in co-relation 2009. Up to 208 conditions per place. [2025-03-04 06:47:17,520 INFO L140 encePairwiseOnDemand]: 451/457 looper letters, 22 selfloop transitions, 30 changer transitions 0/538 dead transitions. [2025-03-04 06:47:17,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 509 places, 538 transitions, 1744 flow [2025-03-04 06:47:17,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 06:47:17,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-04 06:47:17,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 13254 transitions. [2025-03-04 06:47:17,533 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9667396061269147 [2025-03-04 06:47:17,534 INFO L175 Difference]: Start difference. First operand has 480 places, 521 transitions, 1518 flow. Second operand 30 states and 13254 transitions. [2025-03-04 06:47:17,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 509 places, 538 transitions, 1744 flow [2025-03-04 06:47:17,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 504 places, 538 transitions, 1734 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:17,542 INFO L231 Difference]: Finished difference. Result has 508 places, 531 transitions, 1660 flow [2025-03-04 06:47:17,543 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=1508, PETRI_DIFFERENCE_MINUEND_PLACES=475, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=498, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1660, PETRI_PLACES=508, PETRI_TRANSITIONS=531} [2025-03-04 06:47:17,544 INFO L279 CegarLoopForPetriNet]: 456 programPoint places, 52 predicate places. [2025-03-04 06:47:17,544 INFO L471 AbstractCegarLoop]: Abstraction has has 508 places, 531 transitions, 1660 flow [2025-03-04 06:47:17,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 442.0869565217391) internal successors, (10168), 23 states have internal predecessors, (10168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:17,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:17,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] [2025-03-04 06:47:17,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-04 06:47:17,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-04 06:47:17,747 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-04 06:47:17,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:17,749 INFO L85 PathProgramCache]: Analyzing trace with hash 492000536, now seen corresponding path program 2 times [2025-03-04 06:47:17,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:17,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279375273] [2025-03-04 06:47:17,750 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:47:17,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:17,872 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1276 statements into 2 equivalence classes. [2025-03-04 06:47:17,879 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 216 of 1276 statements. [2025-03-04 06:47:17,879 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:47:17,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:18,169 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-04 06:47:18,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:18,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279375273] [2025-03-04 06:47:18,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279375273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:18,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:18,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:18,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178463753] [2025-03-04 06:47:18,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:18,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:18,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:18,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:18,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:18,611 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 457 [2025-03-04 06:47:18,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 508 places, 531 transitions, 1660 flow. Second operand has 6 states, 6 states have (on average 381.1666666666667) internal successors, (2287), 6 states have internal predecessors, (2287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:18,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:18,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 457 [2025-03-04 06:47:18,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:19,455 INFO L124 PetriNetUnfolderBase]: 545/3579 cut-off events. [2025-03-04 06:47:19,456 INFO L125 PetriNetUnfolderBase]: For 935/1028 co-relation queries the response was YES. [2025-03-04 06:47:19,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6089 conditions, 3579 events. 545/3579 cut-off events. For 935/1028 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 16120 event pairs, 93 based on Foata normal form. 16/3430 useless extension candidates. Maximal degree in co-relation 4524. Up to 1089 conditions per place. [2025-03-04 06:47:19,468 INFO L140 encePairwiseOnDemand]: 434/457 looper letters, 155 selfloop transitions, 130 changer transitions 0/668 dead transitions. [2025-03-04 06:47:19,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 513 places, 668 transitions, 2880 flow [2025-03-04 06:47:19,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:19,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:19,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2387 transitions. [2025-03-04 06:47:19,470 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8705324580598104 [2025-03-04 06:47:19,470 INFO L175 Difference]: Start difference. First operand has 508 places, 531 transitions, 1660 flow. Second operand 6 states and 2387 transitions. [2025-03-04 06:47:19,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 513 places, 668 transitions, 2880 flow [2025-03-04 06:47:19,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 495 places, 668 transitions, 2834 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-03-04 06:47:19,480 INFO L231 Difference]: Finished difference. Result has 500 places, 660 transitions, 2842 flow [2025-03-04 06:47:19,481 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=1614, PETRI_DIFFERENCE_MINUEND_PLACES=490, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=531, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=494, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2842, PETRI_PLACES=500, PETRI_TRANSITIONS=660} [2025-03-04 06:47:19,481 INFO L279 CegarLoopForPetriNet]: 456 programPoint places, 44 predicate places. [2025-03-04 06:47:19,481 INFO L471 AbstractCegarLoop]: Abstraction has has 500 places, 660 transitions, 2842 flow [2025-03-04 06:47:19,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 381.1666666666667) internal successors, (2287), 6 states have internal predecessors, (2287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:19,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:19,482 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] [2025-03-04 06:47:19,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:47:19,482 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-04 06:47:19,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:19,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1043410189, now seen corresponding path program 1 times [2025-03-04 06:47:19,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:19,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939752225] [2025-03-04 06:47:19,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:19,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:19,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1286 statements into 1 equivalence classes. [2025-03-04 06:47:19,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1286 of 1286 statements. [2025-03-04 06:47:19,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:19,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:22,525 INFO L134 CoverageAnalysis]: Checked inductivity of 4801 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4801 trivial. 0 not checked. [2025-03-04 06:47:22,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:22,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939752225] [2025-03-04 06:47:22,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939752225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:22,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:22,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:22,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518563541] [2025-03-04 06:47:22,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:22,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:22,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:22,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:22,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:23,028 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 457 [2025-03-04 06:47:23,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 500 places, 660 transitions, 2842 flow. Second operand has 6 states, 6 states have (on average 380.5) internal successors, (2283), 6 states have internal predecessors, (2283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:23,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:23,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 457 [2025-03-04 06:47:23,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:24,415 INFO L124 PetriNetUnfolderBase]: 821/4321 cut-off events. [2025-03-04 06:47:24,415 INFO L125 PetriNetUnfolderBase]: For 3350/3554 co-relation queries the response was YES. [2025-03-04 06:47:24,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8908 conditions, 4321 events. 821/4321 cut-off events. For 3350/3554 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/4208 useless extension candidates. Maximal degree in co-relation 7360. Up to 1348 conditions per place. [2025-03-04 06:47:24,433 INFO L140 encePairwiseOnDemand]: 434/457 looper letters, 276 selfloop transitions, 131 changer transitions 5/798 dead transitions. [2025-03-04 06:47:24,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 505 places, 798 transitions, 4566 flow [2025-03-04 06:47:24,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:24,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:24,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2383 transitions. [2025-03-04 06:47:24,435 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8690736688548505 [2025-03-04 06:47:24,435 INFO L175 Difference]: Start difference. First operand has 500 places, 660 transitions, 2842 flow. Second operand 6 states and 2383 transitions. [2025-03-04 06:47:24,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 505 places, 798 transitions, 4566 flow [2025-03-04 06:47:24,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 505 places, 798 transitions, 4566 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:47:24,448 INFO L231 Difference]: Finished difference. Result has 510 places, 788 transitions, 4322 flow [2025-03-04 06:47:24,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=2842, PETRI_DIFFERENCE_MINUEND_PLACES=500, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=660, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=622, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4322, PETRI_PLACES=510, PETRI_TRANSITIONS=788} [2025-03-04 06:47:24,450 INFO L279 CegarLoopForPetriNet]: 456 programPoint places, 54 predicate places. [2025-03-04 06:47:24,450 INFO L471 AbstractCegarLoop]: Abstraction has has 510 places, 788 transitions, 4322 flow [2025-03-04 06:47:24,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 380.5) internal successors, (2283), 6 states have internal predecessors, (2283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:24,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:24,451 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] [2025-03-04 06:47:24,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:47:24,452 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-04 06:47:24,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:24,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1184576600, now seen corresponding path program 1 times [2025-03-04 06:47:24,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:24,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5442705] [2025-03-04 06:47:24,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:24,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:24,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1287 statements into 1 equivalence classes. [2025-03-04 06:47:24,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1287 of 1287 statements. [2025-03-04 06:47:24,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:24,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:27,455 INFO L134 CoverageAnalysis]: Checked inductivity of 4801 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4801 trivial. 0 not checked. [2025-03-04 06:47:27,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:27,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5442705] [2025-03-04 06:47:27,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5442705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:27,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:27,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:27,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235291438] [2025-03-04 06:47:27,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:27,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:27,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:27,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:27,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:27,702 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 334 out of 457 [2025-03-04 06:47:27,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 510 places, 788 transitions, 4322 flow. Second operand has 6 states, 6 states have (on average 348.3333333333333) internal successors, (2090), 6 states have internal predecessors, (2090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:27,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:27,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 334 of 457 [2025-03-04 06:47:27,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:29,363 INFO L124 PetriNetUnfolderBase]: 1308/5674 cut-off events. [2025-03-04 06:47:29,364 INFO L125 PetriNetUnfolderBase]: For 4851/4908 co-relation queries the response was YES. [2025-03-04 06:47:29,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13603 conditions, 5674 events. 1308/5674 cut-off events. For 4851/4908 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 33824 event pairs, 369 based on Foata normal form. 11/5440 useless extension candidates. Maximal degree in co-relation 11971. Up to 2589 conditions per place. [2025-03-04 06:47:29,392 INFO L140 encePairwiseOnDemand]: 438/457 looper letters, 356 selfloop transitions, 84 changer transitions 0/867 dead transitions. [2025-03-04 06:47:29,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 514 places, 867 transitions, 5600 flow [2025-03-04 06:47:29,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:29,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:29,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2186 transitions. [2025-03-04 06:47:29,395 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7972283005105762 [2025-03-04 06:47:29,395 INFO L175 Difference]: Start difference. First operand has 510 places, 788 transitions, 4322 flow. Second operand 6 states and 2186 transitions. [2025-03-04 06:47:29,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 514 places, 867 transitions, 5600 flow [2025-03-04 06:47:29,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 514 places, 867 transitions, 5346 flow, removed 127 selfloop flow, removed 0 redundant places. [2025-03-04 06:47:29,419 INFO L231 Difference]: Finished difference. Result has 519 places, 859 transitions, 4858 flow [2025-03-04 06:47:29,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=4074, PETRI_DIFFERENCE_MINUEND_PLACES=509, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=788, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=740, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4858, PETRI_PLACES=519, PETRI_TRANSITIONS=859} [2025-03-04 06:47:29,421 INFO L279 CegarLoopForPetriNet]: 456 programPoint places, 63 predicate places. [2025-03-04 06:47:29,421 INFO L471 AbstractCegarLoop]: Abstraction has has 519 places, 859 transitions, 4858 flow [2025-03-04 06:47:29,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 348.3333333333333) internal successors, (2090), 6 states have internal predecessors, (2090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:29,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:29,422 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] [2025-03-04 06:47:29,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:47:29,422 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-04 06:47:29,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:29,425 INFO L85 PathProgramCache]: Analyzing trace with hash 314381157, now seen corresponding path program 1 times [2025-03-04 06:47:29,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:29,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752362234] [2025-03-04 06:47:29,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:29,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:29,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1293 statements into 1 equivalence classes. [2025-03-04 06:47:32,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1293 of 1293 statements. [2025-03-04 06:47:32,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:32,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:48:11,924 INFO L134 CoverageAnalysis]: Checked inductivity of 4801 backedges. 196 proven. 3626 refuted. 0 times theorem prover too weak. 979 trivial. 0 not checked. [2025-03-04 06:48:11,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:48:11,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752362234] [2025-03-04 06:48:11,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752362234] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:48:11,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587610026] [2025-03-04 06:48:11,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:48:11,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:48:11,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:48:11,927 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:48:11,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 06:48:12,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1293 statements into 1 equivalence classes. [2025-03-04 06:48:13,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1293 of 1293 statements. [2025-03-04 06:48:13,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:48:13,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:48:13,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 4988 conjuncts, 117 conjuncts are in the unsatisfiable core [2025-03-04 06:48:13,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:48:13,309 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 06:48:13,311 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-04 06:48:13,445 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 06:48:13,445 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-04 06:48:13,660 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 06:48:13,660 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-04 06:48:14,006 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-03-04 06:48:14,006 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-04 06:48:14,988 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2025-03-04 06:48:14,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2025-03-04 06:48:15,776 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-04 06:48:15,777 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-04 06:48:17,269 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-04 06:48:17,269 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-04 06:48:17,986 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-04 06:48:17,987 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-04 06:48:19,298 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-04 06:48:19,298 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-04 06:48:19,974 INFO L349 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2025-03-04 06:48:19,975 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