./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/06-symbeq_04-funloop_hard1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/06-symbeq_04-funloop_hard1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4d853145e48ada6aa212af657ef21b1dd6bc82cb156511f71c23f87b45f2510e --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:31:06,178 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:31:06,217 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:31:06,221 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:31:06,221 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:31:06,233 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:31:06,234 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:31:06,234 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:31:06,234 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:31:06,234 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:31:06,234 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:31:06,235 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:31:06,235 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:31:06,235 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:31:06,235 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:31:06,235 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:31:06,235 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:31:06,235 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:31:06,235 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:31:06,235 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:31:06,235 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:31:06,235 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:31:06,235 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:31:06,235 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:31:06,235 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:31:06,235 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:31:06,235 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:31:06,236 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:31:06,236 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:31:06,236 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:31:06,236 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:31:06,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:31:06,236 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:31:06,236 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:31:06,236 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:31:06,236 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:31:06,236 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:31:06,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:31:06,236 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:31:06,236 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:31:06,236 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:31:06,236 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:31:06,236 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4d853145e48ada6aa212af657ef21b1dd6bc82cb156511f71c23f87b45f2510e [2025-02-08 05:31:06,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:31:06,423 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:31:06,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:31:06,426 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:31:06,426 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:31:06,427 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/06-symbeq_04-funloop_hard1.i [2025-02-08 05:31:07,705 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/72e4e131c/6ebb8cda09f84d628913695bc2d8ed16/FLAGbd9a2d3b8 [2025-02-08 05:31:08,043 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:31:08,043 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/06-symbeq_04-funloop_hard1.i [2025-02-08 05:31:08,061 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/72e4e131c/6ebb8cda09f84d628913695bc2d8ed16/FLAGbd9a2d3b8 [2025-02-08 05:31:08,075 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/72e4e131c/6ebb8cda09f84d628913695bc2d8ed16 [2025-02-08 05:31:08,079 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:31:08,080 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:31:08,081 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:31:08,081 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:31:08,087 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:31:08,088 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:31:08" (1/1) ... [2025-02-08 05:31:08,089 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@652ce60b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:08, skipping insertion in model container [2025-02-08 05:31:08,089 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:31:08" (1/1) ... [2025-02-08 05:31:08,113 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:31:08,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:31:08,382 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:31:08,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:31:08,456 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:31:08,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:08 WrapperNode [2025-02-08 05:31:08,458 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:31:08,458 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:31:08,459 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:31:08,459 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:31:08,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:08" (1/1) ... [2025-02-08 05:31:08,475 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:08" (1/1) ... [2025-02-08 05:31:08,492 INFO L138 Inliner]: procedures = 263, calls = 74, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 170 [2025-02-08 05:31:08,493 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:31:08,496 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:31:08,496 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:31:08,496 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:31:08,500 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:08" (1/1) ... [2025-02-08 05:31:08,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:08" (1/1) ... [2025-02-08 05:31:08,503 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:08" (1/1) ... [2025-02-08 05:31:08,503 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:08" (1/1) ... [2025-02-08 05:31:08,509 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:08" (1/1) ... [2025-02-08 05:31:08,510 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:08" (1/1) ... [2025-02-08 05:31:08,511 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:08" (1/1) ... [2025-02-08 05:31:08,512 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:08" (1/1) ... [2025-02-08 05:31:08,517 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:31:08,518 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:31:08,518 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:31:08,518 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:31:08,518 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:08" (1/1) ... [2025-02-08 05:31:08,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:31:08,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:31:08,551 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:31:08,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:31:08,570 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:31:08,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:31:08,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:31:08,570 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:31:08,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:31:08,570 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-08 05:31:08,570 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-08 05:31:08,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:31:08,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:31:08,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:31:08,571 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:31:08,651 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:31:08,652 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:31:08,901 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:31:08,902 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:31:08,918 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:31:08,919 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:31:08,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:31:08 BoogieIcfgContainer [2025-02-08 05:31:08,919 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:31:08,920 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:31:08,921 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:31:08,924 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:31:08,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:31:08" (1/3) ... [2025-02-08 05:31:08,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@547896c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:31:08, skipping insertion in model container [2025-02-08 05:31:08,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:08" (2/3) ... [2025-02-08 05:31:08,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@547896c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:31:08, skipping insertion in model container [2025-02-08 05:31:08,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:31:08" (3/3) ... [2025-02-08 05:31:08,926 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_04-funloop_hard1.i [2025-02-08 05:31:08,935 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:31:08,936 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_04-funloop_hard1.i that has 2 procedures, 180 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-02-08 05:31:08,937 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:31:08,990 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:31:09,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 183 places, 182 transitions, 368 flow [2025-02-08 05:31:09,114 INFO L124 PetriNetUnfolderBase]: 3/181 cut-off events. [2025-02-08 05:31:09,118 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:31:09,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 181 events. 3/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 230 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2025-02-08 05:31:09,123 INFO L82 GeneralOperation]: Start removeDead. Operand has 183 places, 182 transitions, 368 flow [2025-02-08 05:31:09,128 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 182 places, 181 transitions, 365 flow [2025-02-08 05:31:09,136 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:31:09,148 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;@46fcd621, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:31:09,148 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-02-08 05:31:09,175 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:31:09,176 INFO L124 PetriNetUnfolderBase]: 1/115 cut-off events. [2025-02-08 05:31:09,176 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:31:09,176 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:09,176 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:09,178 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:31:09,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:09,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1488094149, now seen corresponding path program 1 times [2025-02-08 05:31:09,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:09,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311375268] [2025-02-08 05:31:09,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:31:09,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:09,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-08 05:31:09,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 05:31:09,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:09,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:09,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:09,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:09,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311375268] [2025-02-08 05:31:09,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311375268] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:09,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:09,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:31:09,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97999643] [2025-02-08 05:31:09,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:09,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:31:09,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:09,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:31:09,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:31:09,522 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 182 [2025-02-08 05:31:09,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 181 transitions, 365 flow. Second operand has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:09,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:09,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 182 [2025-02-08 05:31:09,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:09,583 INFO L124 PetriNetUnfolderBase]: 15/321 cut-off events. [2025-02-08 05:31:09,584 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:31:09,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 321 events. 15/321 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 914 event pairs, 10 based on Foata normal form. 1/301 useless extension candidates. Maximal degree in co-relation 266. Up to 36 conditions per place. [2025-02-08 05:31:09,586 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 12 selfloop transitions, 2 changer transitions 0/182 dead transitions. [2025-02-08 05:31:09,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 182 transitions, 395 flow [2025-02-08 05:31:09,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:31:09,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:31:09,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 522 transitions. [2025-02-08 05:31:09,595 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9560439560439561 [2025-02-08 05:31:09,596 INFO L175 Difference]: Start difference. First operand has 182 places, 181 transitions, 365 flow. Second operand 3 states and 522 transitions. [2025-02-08 05:31:09,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 182 transitions, 395 flow [2025-02-08 05:31:09,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 182 transitions, 394 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:31:09,603 INFO L231 Difference]: Finished difference. Result has 184 places, 182 transitions, 376 flow [2025-02-08 05:31:09,604 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=376, PETRI_PLACES=184, PETRI_TRANSITIONS=182} [2025-02-08 05:31:09,606 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 2 predicate places. [2025-02-08 05:31:09,607 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 182 transitions, 376 flow [2025-02-08 05:31:09,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:09,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:09,607 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:09,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:31:09,608 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:31:09,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:09,608 INFO L85 PathProgramCache]: Analyzing trace with hash 120000725, now seen corresponding path program 1 times [2025-02-08 05:31:09,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:09,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554420397] [2025-02-08 05:31:09,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:31:09,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:09,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-08 05:31:09,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-08 05:31:09,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:09,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:09,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:09,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:09,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554420397] [2025-02-08 05:31:09,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554420397] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:31:09,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167516587] [2025-02-08 05:31:09,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:31:09,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:31:09,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:31:09,753 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:31:09,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 05:31:09,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-08 05:31:09,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-08 05:31:09,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:09,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:09,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 05:31:09,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:31:09,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:31:09,856 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:31:09,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167516587] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:09,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 05:31:09,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-08 05:31:09,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106982586] [2025-02-08 05:31:09,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:09,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:31:09,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:09,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:31:09,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:31:09,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 182 [2025-02-08 05:31:09,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 182 transitions, 376 flow. Second operand has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:09,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:09,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 182 [2025-02-08 05:31:09,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:09,935 INFO L124 PetriNetUnfolderBase]: 35/481 cut-off events. [2025-02-08 05:31:09,935 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:31:09,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 560 conditions, 481 events. 35/481 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1724 event pairs, 10 based on Foata normal form. 3/450 useless extension candidates. Maximal degree in co-relation 481. Up to 51 conditions per place. [2025-02-08 05:31:09,938 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 16 selfloop transitions, 2 changer transitions 0/187 dead transitions. [2025-02-08 05:31:09,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 187 transitions, 422 flow [2025-02-08 05:31:09,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:31:09,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:31:09,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 526 transitions. [2025-02-08 05:31:09,940 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9633699633699634 [2025-02-08 05:31:09,940 INFO L175 Difference]: Start difference. First operand has 184 places, 182 transitions, 376 flow. Second operand 3 states and 526 transitions. [2025-02-08 05:31:09,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 187 transitions, 422 flow [2025-02-08 05:31:09,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 187 transitions, 420 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:31:09,943 INFO L231 Difference]: Finished difference. Result has 186 places, 183 transitions, 386 flow [2025-02-08 05:31:09,943 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=386, PETRI_PLACES=186, PETRI_TRANSITIONS=183} [2025-02-08 05:31:09,944 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 4 predicate places. [2025-02-08 05:31:09,944 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 183 transitions, 386 flow [2025-02-08 05:31:09,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:09,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:09,944 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:09,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 05:31:10,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:31:10,150 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:31:10,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:10,151 INFO L85 PathProgramCache]: Analyzing trace with hash 706216788, now seen corresponding path program 1 times [2025-02-08 05:31:10,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:10,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115120571] [2025-02-08 05:31:10,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:31:10,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:10,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-08 05:31:10,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-08 05:31:10,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:10,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:10,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:10,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:10,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115120571] [2025-02-08 05:31:10,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115120571] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:31:10,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996527832] [2025-02-08 05:31:10,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:31:10,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:31:10,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:31:10,318 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:31:10,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 05:31:10,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-08 05:31:10,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-08 05:31:10,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:10,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:10,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 05:31:10,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:31:10,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:10,447 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:31:10,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:10,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996527832] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:31:10,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:31:10,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-08 05:31:10,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959429294] [2025-02-08 05:31:10,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:31:10,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:31:10,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:10,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:31:10,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 05:31:10,506 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 182 [2025-02-08 05:31:10,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 183 transitions, 386 flow. Second operand has 10 states, 10 states have (on average 168.0) internal successors, (1680), 10 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:10,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:10,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 182 [2025-02-08 05:31:10,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:10,670 INFO L124 PetriNetUnfolderBase]: 24/489 cut-off events. [2025-02-08 05:31:10,677 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:31:10,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 568 conditions, 489 events. 24/489 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1556 event pairs, 14 based on Foata normal form. 2/457 useless extension candidates. Maximal degree in co-relation 458. Up to 51 conditions per place. [2025-02-08 05:31:10,680 INFO L140 encePairwiseOnDemand]: 176/182 looper letters, 16 selfloop transitions, 9 changer transitions 0/191 dead transitions. [2025-02-08 05:31:10,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 191 transitions, 454 flow [2025-02-08 05:31:10,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:31:10,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 05:31:10,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1521 transitions. [2025-02-08 05:31:10,687 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9285714285714286 [2025-02-08 05:31:10,687 INFO L175 Difference]: Start difference. First operand has 186 places, 183 transitions, 386 flow. Second operand 9 states and 1521 transitions. [2025-02-08 05:31:10,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 191 transitions, 454 flow [2025-02-08 05:31:10,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 191 transitions, 452 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:31:10,694 INFO L231 Difference]: Finished difference. Result has 196 places, 189 transitions, 434 flow [2025-02-08 05:31:10,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=434, PETRI_PLACES=196, PETRI_TRANSITIONS=189} [2025-02-08 05:31:10,694 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 14 predicate places. [2025-02-08 05:31:10,694 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 189 transitions, 434 flow [2025-02-08 05:31:10,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 168.0) internal successors, (1680), 10 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:10,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:10,696 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:10,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 05:31:10,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:31:10,897 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:31:10,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:10,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1661637524, now seen corresponding path program 2 times [2025-02-08 05:31:10,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:10,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080364056] [2025-02-08 05:31:10,898 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:31:10,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:10,916 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 105 statements into 2 equivalence classes. [2025-02-08 05:31:10,931 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 90 of 105 statements. [2025-02-08 05:31:10,933 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:31:10,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:11,368 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-08 05:31:11,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:11,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080364056] [2025-02-08 05:31:11,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080364056] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:11,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:11,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:31:11,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316331004] [2025-02-08 05:31:11,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:11,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:31:11,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:11,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:31:11,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:31:11,555 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-08 05:31:11,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 189 transitions, 434 flow. Second operand has 6 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:11,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:11,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-08 05:31:11,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:11,761 INFO L124 PetriNetUnfolderBase]: 333/1545 cut-off events. [2025-02-08 05:31:11,761 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 05:31:11,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2256 conditions, 1545 events. 333/1545 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 10026 event pairs, 160 based on Foata normal form. 0/1455 useless extension candidates. Maximal degree in co-relation 2144. Up to 544 conditions per place. [2025-02-08 05:31:11,772 INFO L140 encePairwiseOnDemand]: 171/182 looper letters, 36 selfloop transitions, 22 changer transitions 0/218 dead transitions. [2025-02-08 05:31:11,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 218 transitions, 608 flow [2025-02-08 05:31:11,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:31:11,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:31:11,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 977 transitions. [2025-02-08 05:31:11,777 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8946886446886447 [2025-02-08 05:31:11,777 INFO L175 Difference]: Start difference. First operand has 196 places, 189 transitions, 434 flow. Second operand 6 states and 977 transitions. [2025-02-08 05:31:11,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 218 transitions, 608 flow [2025-02-08 05:31:11,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 218 transitions, 602 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-08 05:31:11,783 INFO L231 Difference]: Finished difference. Result has 205 places, 210 transitions, 578 flow [2025-02-08 05:31:11,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=578, PETRI_PLACES=205, PETRI_TRANSITIONS=210} [2025-02-08 05:31:11,784 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 23 predicate places. [2025-02-08 05:31:11,784 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 210 transitions, 578 flow [2025-02-08 05:31:11,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:11,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:11,785 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:11,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:31:11,785 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:31:11,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:11,787 INFO L85 PathProgramCache]: Analyzing trace with hash -791398651, now seen corresponding path program 1 times [2025-02-08 05:31:11,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:11,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905679094] [2025-02-08 05:31:11,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:31:11,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:11,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-08 05:31:11,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-08 05:31:11,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:11,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:11,939 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:11,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:11,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905679094] [2025-02-08 05:31:11,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905679094] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:31:11,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945889625] [2025-02-08 05:31:11,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:31:11,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:31:11,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:31:11,946 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:31:11,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 05:31:12,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-08 05:31:12,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-08 05:31:12,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:12,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:12,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 05:31:12,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:31:12,087 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:12,087 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:31:12,172 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:12,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945889625] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:31:12,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:31:12,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-02-08 05:31:12,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871287281] [2025-02-08 05:31:12,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:31:12,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 05:31:12,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:12,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 05:31:12,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-02-08 05:31:12,211 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 182 [2025-02-08 05:31:12,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 210 transitions, 578 flow. Second operand has 18 states, 18 states have (on average 168.0) internal successors, (3024), 18 states have internal predecessors, (3024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:12,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:12,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 182 [2025-02-08 05:31:12,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:12,489 INFO L124 PetriNetUnfolderBase]: 118/1109 cut-off events. [2025-02-08 05:31:12,489 INFO L125 PetriNetUnfolderBase]: For 77/83 co-relation queries the response was YES. [2025-02-08 05:31:12,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1607 conditions, 1109 events. 118/1109 cut-off events. For 77/83 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 5920 event pairs, 24 based on Foata normal form. 4/1039 useless extension candidates. Maximal degree in co-relation 1418. Up to 133 conditions per place. [2025-02-08 05:31:12,498 INFO L140 encePairwiseOnDemand]: 176/182 looper letters, 20 selfloop transitions, 21 changer transitions 0/228 dead transitions. [2025-02-08 05:31:12,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 228 transitions, 748 flow [2025-02-08 05:31:12,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-08 05:31:12,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-02-08 05:31:12,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3531 transitions. [2025-02-08 05:31:12,504 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.923861852433281 [2025-02-08 05:31:12,504 INFO L175 Difference]: Start difference. First operand has 205 places, 210 transitions, 578 flow. Second operand 21 states and 3531 transitions. [2025-02-08 05:31:12,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 228 transitions, 748 flow [2025-02-08 05:31:12,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 228 transitions, 748 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:31:12,513 INFO L231 Difference]: Finished difference. Result has 230 places, 223 transitions, 708 flow [2025-02-08 05:31:12,514 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=708, PETRI_PLACES=230, PETRI_TRANSITIONS=223} [2025-02-08 05:31:12,514 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 48 predicate places. [2025-02-08 05:31:12,514 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 223 transitions, 708 flow [2025-02-08 05:31:12,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 168.0) internal successors, (3024), 18 states have internal predecessors, (3024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:12,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:12,517 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:12,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 05:31:12,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:31:12,721 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:31:12,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:12,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1564960645, now seen corresponding path program 2 times [2025-02-08 05:31:12,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:12,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549380186] [2025-02-08 05:31:12,723 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:31:12,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:12,736 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 125 statements into 2 equivalence classes. [2025-02-08 05:31:12,742 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 90 of 125 statements. [2025-02-08 05:31:12,743 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:31:12,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:13,006 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-08 05:31:13,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:13,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549380186] [2025-02-08 05:31:13,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549380186] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:13,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:13,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:31:13,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345761811] [2025-02-08 05:31:13,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:13,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:31:13,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:13,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:31:13,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:31:13,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-08 05:31:13,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 223 transitions, 708 flow. Second operand has 6 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:13,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:13,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-08 05:31:13,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:13,568 INFO L124 PetriNetUnfolderBase]: 505/2412 cut-off events. [2025-02-08 05:31:13,569 INFO L125 PetriNetUnfolderBase]: For 415/445 co-relation queries the response was YES. [2025-02-08 05:31:13,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4105 conditions, 2412 events. 505/2412 cut-off events. For 415/445 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 17741 event pairs, 194 based on Foata normal form. 5/2276 useless extension candidates. Maximal degree in co-relation 3909. Up to 824 conditions per place. [2025-02-08 05:31:13,578 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 61 selfloop transitions, 46 changer transitions 0/284 dead transitions. [2025-02-08 05:31:13,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 284 transitions, 1086 flow [2025-02-08 05:31:13,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:31:13,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:31:13,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1001 transitions. [2025-02-08 05:31:13,581 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2025-02-08 05:31:13,581 INFO L175 Difference]: Start difference. First operand has 230 places, 223 transitions, 708 flow. Second operand 6 states and 1001 transitions. [2025-02-08 05:31:13,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 284 transitions, 1086 flow [2025-02-08 05:31:13,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 284 transitions, 1062 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-02-08 05:31:13,588 INFO L231 Difference]: Finished difference. Result has 234 places, 268 transitions, 1038 flow [2025-02-08 05:31:13,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1038, PETRI_PLACES=234, PETRI_TRANSITIONS=268} [2025-02-08 05:31:13,590 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 52 predicate places. [2025-02-08 05:31:13,591 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 268 transitions, 1038 flow [2025-02-08 05:31:13,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:13,591 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:13,592 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:13,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:31:13,592 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:31:13,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:13,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1215913403, now seen corresponding path program 1 times [2025-02-08 05:31:13,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:13,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502855852] [2025-02-08 05:31:13,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:31:13,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:13,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-08 05:31:13,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-08 05:31:13,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:13,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:13,899 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:13,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:13,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502855852] [2025-02-08 05:31:13,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502855852] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:31:13,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429813869] [2025-02-08 05:31:13,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:31:13,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:31:13,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:31:13,905 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:31:13,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 05:31:13,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-08 05:31:13,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-08 05:31:13,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:13,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:13,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 05:31:13,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:31:14,043 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:14,043 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:31:14,203 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:14,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429813869] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:31:14,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:31:14,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-02-08 05:31:14,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878840808] [2025-02-08 05:31:14,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:31:14,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-08 05:31:14,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:14,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-08 05:31:14,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-02-08 05:31:14,230 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 182 [2025-02-08 05:31:14,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 268 transitions, 1038 flow. Second operand has 23 states, 23 states have (on average 168.08695652173913) internal successors, (3866), 23 states have internal predecessors, (3866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:14,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:14,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 182 [2025-02-08 05:31:14,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:14,632 INFO L124 PetriNetUnfolderBase]: 264/1738 cut-off events. [2025-02-08 05:31:14,632 INFO L125 PetriNetUnfolderBase]: For 589/618 co-relation queries the response was YES. [2025-02-08 05:31:14,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3163 conditions, 1738 events. 264/1738 cut-off events. For 589/618 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 11582 event pairs, 40 based on Foata normal form. 13/1667 useless extension candidates. Maximal degree in co-relation 2886. Up to 204 conditions per place. [2025-02-08 05:31:14,639 INFO L140 encePairwiseOnDemand]: 176/182 looper letters, 23 selfloop transitions, 30 changer transitions 0/285 dead transitions. [2025-02-08 05:31:14,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 285 transitions, 1266 flow [2025-02-08 05:31:14,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-08 05:31:14,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-02-08 05:31:14,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 5036 transitions. [2025-02-08 05:31:14,646 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9223443223443224 [2025-02-08 05:31:14,646 INFO L175 Difference]: Start difference. First operand has 234 places, 268 transitions, 1038 flow. Second operand 30 states and 5036 transitions. [2025-02-08 05:31:14,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 285 transitions, 1266 flow [2025-02-08 05:31:14,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 285 transitions, 1266 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:31:14,653 INFO L231 Difference]: Finished difference. Result has 267 places, 278 transitions, 1190 flow [2025-02-08 05:31:14,653 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=1038, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1190, PETRI_PLACES=267, PETRI_TRANSITIONS=278} [2025-02-08 05:31:14,654 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 85 predicate places. [2025-02-08 05:31:14,654 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 278 transitions, 1190 flow [2025-02-08 05:31:14,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 168.08695652173913) internal successors, (3866), 23 states have internal predecessors, (3866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:14,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:14,655 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:14,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 05:31:14,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-02-08 05:31:14,860 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:31:14,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:14,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1486487265, now seen corresponding path program 2 times [2025-02-08 05:31:14,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:14,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592393730] [2025-02-08 05:31:14,861 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:31:14,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:14,873 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 148 statements into 2 equivalence classes. [2025-02-08 05:31:14,877 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 98 of 148 statements. [2025-02-08 05:31:14,877 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:31:14,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:15,354 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 05:31:15,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:15,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592393730] [2025-02-08 05:31:15,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592393730] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:15,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:15,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:31:15,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454679965] [2025-02-08 05:31:15,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:15,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:31:15,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:15,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:31:15,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:31:15,507 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 182 [2025-02-08 05:31:15,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 278 transitions, 1190 flow. Second operand has 6 states, 6 states have (on average 145.5) internal successors, (873), 6 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:15,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:15,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 182 [2025-02-08 05:31:15,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:16,048 INFO L124 PetriNetUnfolderBase]: 949/3309 cut-off events. [2025-02-08 05:31:16,049 INFO L125 PetriNetUnfolderBase]: For 2070/2165 co-relation queries the response was YES. [2025-02-08 05:31:16,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7539 conditions, 3309 events. 949/3309 cut-off events. For 2070/2165 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 23775 event pairs, 303 based on Foata normal form. 20/3172 useless extension candidates. Maximal degree in co-relation 7261. Up to 1634 conditions per place. [2025-02-08 05:31:16,065 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 102 selfloop transitions, 57 changer transitions 0/333 dead transitions. [2025-02-08 05:31:16,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 333 transitions, 1752 flow [2025-02-08 05:31:16,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:31:16,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:31:16,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 943 transitions. [2025-02-08 05:31:16,067 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8635531135531136 [2025-02-08 05:31:16,067 INFO L175 Difference]: Start difference. First operand has 267 places, 278 transitions, 1190 flow. Second operand 6 states and 943 transitions. [2025-02-08 05:31:16,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 333 transitions, 1752 flow [2025-02-08 05:31:16,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 333 transitions, 1706 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-02-08 05:31:16,078 INFO L231 Difference]: Finished difference. Result has 259 places, 325 transitions, 1642 flow [2025-02-08 05:31:16,079 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=1144, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1642, PETRI_PLACES=259, PETRI_TRANSITIONS=325} [2025-02-08 05:31:16,079 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 77 predicate places. [2025-02-08 05:31:16,079 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 325 transitions, 1642 flow [2025-02-08 05:31:16,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 145.5) internal successors, (873), 6 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:16,080 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:16,080 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:16,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:31:16,080 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:31:16,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:16,081 INFO L85 PathProgramCache]: Analyzing trace with hash 472970467, now seen corresponding path program 1 times [2025-02-08 05:31:16,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:16,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948624123] [2025-02-08 05:31:16,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:31:16,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:16,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-08 05:31:16,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-08 05:31:16,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:16,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:16,394 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 05:31:16,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:16,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948624123] [2025-02-08 05:31:16,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948624123] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:16,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:16,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:31:16,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862797709] [2025-02-08 05:31:16,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:16,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:31:16,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:16,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:31:16,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:31:16,483 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 182 [2025-02-08 05:31:16,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 325 transitions, 1642 flow. Second operand has 6 states, 6 states have (on average 145.5) internal successors, (873), 6 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:16,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:16,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 182 [2025-02-08 05:31:16,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:17,130 INFO L124 PetriNetUnfolderBase]: 1319/4555 cut-off events. [2025-02-08 05:31:17,130 INFO L125 PetriNetUnfolderBase]: For 4939/5070 co-relation queries the response was YES. [2025-02-08 05:31:17,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11634 conditions, 4555 events. 1319/4555 cut-off events. For 4939/5070 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 35720 event pairs, 341 based on Foata normal form. 40/4406 useless extension candidates. Maximal degree in co-relation 11373. Up to 2190 conditions per place. [2025-02-08 05:31:17,154 INFO L140 encePairwiseOnDemand]: 159/182 looper letters, 143 selfloop transitions, 103 changer transitions 4/426 dead transitions. [2025-02-08 05:31:17,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 426 transitions, 2608 flow [2025-02-08 05:31:17,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:31:17,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:31:17,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 983 transitions. [2025-02-08 05:31:17,157 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9001831501831502 [2025-02-08 05:31:17,157 INFO L175 Difference]: Start difference. First operand has 259 places, 325 transitions, 1642 flow. Second operand 6 states and 983 transitions. [2025-02-08 05:31:17,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 426 transitions, 2608 flow [2025-02-08 05:31:17,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 426 transitions, 2544 flow, removed 32 selfloop flow, removed 0 redundant places. [2025-02-08 05:31:17,175 INFO L231 Difference]: Finished difference. Result has 269 places, 410 transitions, 2494 flow [2025-02-08 05:31:17,176 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=1584, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2494, PETRI_PLACES=269, PETRI_TRANSITIONS=410} [2025-02-08 05:31:17,176 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 87 predicate places. [2025-02-08 05:31:17,176 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 410 transitions, 2494 flow [2025-02-08 05:31:17,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 145.5) internal successors, (873), 6 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:17,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:17,177 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:17,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:31:17,177 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:31:17,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:17,178 INFO L85 PathProgramCache]: Analyzing trace with hash 437781765, now seen corresponding path program 1 times [2025-02-08 05:31:17,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:17,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691167439] [2025-02-08 05:31:17,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:31:17,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:17,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-08 05:31:17,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-08 05:31:17,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:17,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:17,897 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 05:31:17,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:17,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691167439] [2025-02-08 05:31:17,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691167439] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:17,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:17,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 05:31:17,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668112419] [2025-02-08 05:31:17,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:17,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 05:31:17,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:17,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 05:31:17,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:31:19,083 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-08 05:31:19,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 410 transitions, 2494 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:19,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:19,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-08 05:31:19,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:19,792 INFO L124 PetriNetUnfolderBase]: 1229/4915 cut-off events. [2025-02-08 05:31:19,793 INFO L125 PetriNetUnfolderBase]: For 6169/6308 co-relation queries the response was YES. [2025-02-08 05:31:19,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13115 conditions, 4915 events. 1229/4915 cut-off events. For 6169/6308 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 41567 event pairs, 180 based on Foata normal form. 37/4875 useless extension candidates. Maximal degree in co-relation 12837. Up to 712 conditions per place. [2025-02-08 05:31:19,825 INFO L140 encePairwiseOnDemand]: 168/182 looper letters, 73 selfloop transitions, 15 changer transitions 0/468 dead transitions. [2025-02-08 05:31:19,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 468 transitions, 2786 flow [2025-02-08 05:31:19,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:31:19,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 05:31:19,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1467 transitions. [2025-02-08 05:31:19,828 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8956043956043956 [2025-02-08 05:31:19,828 INFO L175 Difference]: Start difference. First operand has 269 places, 410 transitions, 2494 flow. Second operand 9 states and 1467 transitions. [2025-02-08 05:31:19,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 468 transitions, 2786 flow [2025-02-08 05:31:19,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 468 transitions, 2672 flow, removed 57 selfloop flow, removed 0 redundant places. [2025-02-08 05:31:19,866 INFO L231 Difference]: Finished difference. Result has 284 places, 424 transitions, 2492 flow [2025-02-08 05:31:19,867 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=2380, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2492, PETRI_PLACES=284, PETRI_TRANSITIONS=424} [2025-02-08 05:31:19,867 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 102 predicate places. [2025-02-08 05:31:19,867 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 424 transitions, 2492 flow [2025-02-08 05:31:19,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:19,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:19,869 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:19,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:31:19,869 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:31:19,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:19,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1398517849, now seen corresponding path program 2 times [2025-02-08 05:31:19,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:19,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716749287] [2025-02-08 05:31:19,870 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:31:19,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:19,885 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 159 statements into 2 equivalence classes. [2025-02-08 05:31:19,902 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-02-08 05:31:19,903 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:31:19,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:20,186 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 05:31:20,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:20,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716749287] [2025-02-08 05:31:20,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716749287] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:20,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:20,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 05:31:20,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008224404] [2025-02-08 05:31:20,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:20,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 05:31:20,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:20,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 05:31:20,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:31:21,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-08 05:31:21,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 424 transitions, 2492 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:21,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:21,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-08 05:31:21,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:22,845 INFO L124 PetriNetUnfolderBase]: 2479/9316 cut-off events. [2025-02-08 05:31:22,845 INFO L125 PetriNetUnfolderBase]: For 12674/12974 co-relation queries the response was YES. [2025-02-08 05:31:22,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26480 conditions, 9316 events. 2479/9316 cut-off events. For 12674/12974 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 88705 event pairs, 325 based on Foata normal form. 99/9273 useless extension candidates. Maximal degree in co-relation 26194. Up to 1468 conditions per place. [2025-02-08 05:31:22,893 INFO L140 encePairwiseOnDemand]: 168/182 looper letters, 119 selfloop transitions, 20 changer transitions 4/523 dead transitions. [2025-02-08 05:31:22,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 523 transitions, 3210 flow [2025-02-08 05:31:22,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:31:22,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 05:31:22,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1475 transitions. [2025-02-08 05:31:22,895 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9004884004884005 [2025-02-08 05:31:22,895 INFO L175 Difference]: Start difference. First operand has 284 places, 424 transitions, 2492 flow. Second operand 9 states and 1475 transitions. [2025-02-08 05:31:22,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 523 transitions, 3210 flow [2025-02-08 05:31:22,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 523 transitions, 3200 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:31:22,947 INFO L231 Difference]: Finished difference. Result has 298 places, 441 transitions, 2671 flow [2025-02-08 05:31:22,948 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=2490, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2671, PETRI_PLACES=298, PETRI_TRANSITIONS=441} [2025-02-08 05:31:22,948 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 116 predicate places. [2025-02-08 05:31:22,948 INFO L471 AbstractCegarLoop]: Abstraction has has 298 places, 441 transitions, 2671 flow [2025-02-08 05:31:22,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:22,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:22,949 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:22,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:31:22,949 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:31:22,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:22,950 INFO L85 PathProgramCache]: Analyzing trace with hash -831907079, now seen corresponding path program 3 times [2025-02-08 05:31:22,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:22,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956415020] [2025-02-08 05:31:22,950 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 05:31:22,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:22,962 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 159 statements into 11 equivalence classes. [2025-02-08 05:31:22,973 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-02-08 05:31:22,973 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 05:31:22,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:23,223 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 05:31:23,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:23,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956415020] [2025-02-08 05:31:23,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956415020] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:23,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:23,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 05:31:23,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550109451] [2025-02-08 05:31:23,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:23,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 05:31:23,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:23,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 05:31:23,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:31:24,398 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-08 05:31:24,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 441 transitions, 2671 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:24,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:24,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-08 05:31:24,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:26,131 INFO L124 PetriNetUnfolderBase]: 2778/10527 cut-off events. [2025-02-08 05:31:26,131 INFO L125 PetriNetUnfolderBase]: For 16432/16884 co-relation queries the response was YES. [2025-02-08 05:31:26,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31099 conditions, 10527 events. 2778/10527 cut-off events. For 16432/16884 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 101869 event pairs, 352 based on Foata normal form. 106/10467 useless extension candidates. Maximal degree in co-relation 30805. Up to 1567 conditions per place. [2025-02-08 05:31:26,197 INFO L140 encePairwiseOnDemand]: 168/182 looper letters, 123 selfloop transitions, 22 changer transitions 0/525 dead transitions. [2025-02-08 05:31:26,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 525 transitions, 3459 flow [2025-02-08 05:31:26,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:31:26,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 05:31:26,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1472 transitions. [2025-02-08 05:31:26,201 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8986568986568987 [2025-02-08 05:31:26,201 INFO L175 Difference]: Start difference. First operand has 298 places, 441 transitions, 2671 flow. Second operand 9 states and 1472 transitions. [2025-02-08 05:31:26,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 525 transitions, 3459 flow [2025-02-08 05:31:26,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 525 transitions, 3421 flow, removed 19 selfloop flow, removed 0 redundant places. [2025-02-08 05:31:26,274 INFO L231 Difference]: Finished difference. Result has 311 places, 453 transitions, 2840 flow [2025-02-08 05:31:26,274 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=2657, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2840, PETRI_PLACES=311, PETRI_TRANSITIONS=453} [2025-02-08 05:31:26,275 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 129 predicate places. [2025-02-08 05:31:26,275 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 453 transitions, 2840 flow [2025-02-08 05:31:26,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:26,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:26,276 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:26,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:31:26,276 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:31:26,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:26,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1532316581, now seen corresponding path program 4 times [2025-02-08 05:31:26,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:26,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900449765] [2025-02-08 05:31:26,277 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 05:31:26,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:26,295 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 159 statements into 2 equivalence classes. [2025-02-08 05:31:26,313 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 159 of 159 statements. [2025-02-08 05:31:26,314 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 05:31:26,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:27,150 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 05:31:27,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:27,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900449765] [2025-02-08 05:31:27,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900449765] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:27,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:27,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 05:31:27,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807687631] [2025-02-08 05:31:27,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:27,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:31:27,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:27,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:31:27,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-08 05:31:28,454 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-08 05:31:28,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 453 transitions, 2840 flow. Second operand has 10 states, 10 states have (on average 154.6) internal successors, (1546), 10 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:28,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:28,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-08 05:31:28,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:30,502 INFO L124 PetriNetUnfolderBase]: 3073/11395 cut-off events. [2025-02-08 05:31:30,502 INFO L125 PetriNetUnfolderBase]: For 20334/20790 co-relation queries the response was YES. [2025-02-08 05:31:30,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34824 conditions, 11395 events. 3073/11395 cut-off events. For 20334/20790 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 111168 event pairs, 346 based on Foata normal form. 119/11359 useless extension candidates. Maximal degree in co-relation 34524. Up to 1851 conditions per place. [2025-02-08 05:31:30,562 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 137 selfloop transitions, 28 changer transitions 4/549 dead transitions. [2025-02-08 05:31:30,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 549 transitions, 3825 flow [2025-02-08 05:31:30,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:31:30,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 05:31:30,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1631 transitions. [2025-02-08 05:31:30,567 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8961538461538462 [2025-02-08 05:31:30,567 INFO L175 Difference]: Start difference. First operand has 311 places, 453 transitions, 2840 flow. Second operand 10 states and 1631 transitions. [2025-02-08 05:31:30,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 549 transitions, 3825 flow [2025-02-08 05:31:30,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 549 transitions, 3746 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-02-08 05:31:30,646 INFO L231 Difference]: Finished difference. Result has 322 places, 465 transitions, 3021 flow [2025-02-08 05:31:30,646 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=2814, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3021, PETRI_PLACES=322, PETRI_TRANSITIONS=465} [2025-02-08 05:31:30,647 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 140 predicate places. [2025-02-08 05:31:30,647 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 465 transitions, 3021 flow [2025-02-08 05:31:30,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 154.6) internal successors, (1546), 10 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:30,647 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:30,648 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:30,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:31:30,648 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:31:30,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:30,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1651051123, now seen corresponding path program 5 times [2025-02-08 05:31:30,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:30,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842648649] [2025-02-08 05:31:30,650 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 05:31:30,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:30,660 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 159 statements into 11 equivalence classes. [2025-02-08 05:31:30,674 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 159 of 159 statements. [2025-02-08 05:31:30,675 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-02-08 05:31:30,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:31,299 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-02-08 05:31:31,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:31,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842648649] [2025-02-08 05:31:31,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842648649] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:31:31,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222294453] [2025-02-08 05:31:31,299 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 05:31:31,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:31:31,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:31:31,303 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:31:31,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 05:31:31,366 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 159 statements into 11 equivalence classes. [2025-02-08 05:31:31,422 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 159 of 159 statements. [2025-02-08 05:31:31,423 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-02-08 05:31:31,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:31,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-08 05:31:31,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:31:31,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 05:31:31,705 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 05:31:31,705 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:31:31,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222294453] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:31,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 05:31:31,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2025-02-08 05:31:31,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818148413] [2025-02-08 05:31:31,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:31,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:31:31,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:31,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:31:31,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-02-08 05:31:32,694 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-08 05:31:32,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 465 transitions, 3021 flow. Second operand has 10 states, 10 states have (on average 154.6) internal successors, (1546), 10 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:32,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:32,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-08 05:31:32,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:34,974 INFO L124 PetriNetUnfolderBase]: 3406/12720 cut-off events. [2025-02-08 05:31:34,975 INFO L125 PetriNetUnfolderBase]: For 25378/25972 co-relation queries the response was YES. [2025-02-08 05:31:35,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39483 conditions, 12720 events. 3406/12720 cut-off events. For 25378/25972 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 126970 event pairs, 382 based on Foata normal form. 112/12645 useless extension candidates. Maximal degree in co-relation 39177. Up to 1959 conditions per place. [2025-02-08 05:31:35,056 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 136 selfloop transitions, 30 changer transitions 0/546 dead transitions. [2025-02-08 05:31:35,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 546 transitions, 4004 flow [2025-02-08 05:31:35,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:31:35,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 05:31:35,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1628 transitions. [2025-02-08 05:31:35,058 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8945054945054945 [2025-02-08 05:31:35,058 INFO L175 Difference]: Start difference. First operand has 322 places, 465 transitions, 3021 flow. Second operand 10 states and 1628 transitions. [2025-02-08 05:31:35,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 546 transitions, 4004 flow [2025-02-08 05:31:35,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 546 transitions, 3911 flow, removed 10 selfloop flow, removed 4 redundant places. [2025-02-08 05:31:35,161 INFO L231 Difference]: Finished difference. Result has 333 places, 480 transitions, 3259 flow [2025-02-08 05:31:35,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=2978, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=465, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3259, PETRI_PLACES=333, PETRI_TRANSITIONS=480} [2025-02-08 05:31:35,163 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 151 predicate places. [2025-02-08 05:31:35,164 INFO L471 AbstractCegarLoop]: Abstraction has has 333 places, 480 transitions, 3259 flow [2025-02-08 05:31:35,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 154.6) internal successors, (1546), 10 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:35,164 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:35,165 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:35,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 05:31:35,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-08 05:31:35,366 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:31:35,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:35,366 INFO L85 PathProgramCache]: Analyzing trace with hash 612747393, now seen corresponding path program 6 times [2025-02-08 05:31:35,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:35,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766135882] [2025-02-08 05:31:35,367 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 05:31:35,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:35,380 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 159 statements into 11 equivalence classes. [2025-02-08 05:31:35,389 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-02-08 05:31:35,389 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 05:31:35,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:35,563 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 05:31:35,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:35,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766135882] [2025-02-08 05:31:35,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766135882] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:35,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:35,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 05:31:35,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003019186] [2025-02-08 05:31:35,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:35,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 05:31:35,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:35,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 05:31:35,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:31:36,549 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-08 05:31:36,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 480 transitions, 3259 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:36,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:36,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-08 05:31:36,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:38,961 INFO L124 PetriNetUnfolderBase]: 3725/13728 cut-off events. [2025-02-08 05:31:38,961 INFO L125 PetriNetUnfolderBase]: For 31646/32260 co-relation queries the response was YES. [2025-02-08 05:31:39,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43944 conditions, 13728 events. 3725/13728 cut-off events. For 31646/32260 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 138954 event pairs, 386 based on Foata normal form. 120/13668 useless extension candidates. Maximal degree in co-relation 43632. Up to 2232 conditions per place. [2025-02-08 05:31:39,046 INFO L140 encePairwiseOnDemand]: 168/182 looper letters, 154 selfloop transitions, 34 changer transitions 2/570 dead transitions. [2025-02-08 05:31:39,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 570 transitions, 4410 flow [2025-02-08 05:31:39,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:31:39,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 05:31:39,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1479 transitions. [2025-02-08 05:31:39,047 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9029304029304029 [2025-02-08 05:31:39,047 INFO L175 Difference]: Start difference. First operand has 333 places, 480 transitions, 3259 flow. Second operand 9 states and 1479 transitions. [2025-02-08 05:31:39,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 570 transitions, 4410 flow [2025-02-08 05:31:39,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 570 transitions, 4312 flow, removed 27 selfloop flow, removed 3 redundant places. [2025-02-08 05:31:39,172 INFO L231 Difference]: Finished difference. Result has 344 places, 495 transitions, 3504 flow [2025-02-08 05:31:39,172 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=3198, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=480, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=451, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3504, PETRI_PLACES=344, PETRI_TRANSITIONS=495} [2025-02-08 05:31:39,173 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 162 predicate places. [2025-02-08 05:31:39,173 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 495 transitions, 3504 flow [2025-02-08 05:31:39,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:39,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:39,173 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:39,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:31:39,173 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:31:39,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:39,175 INFO L85 PathProgramCache]: Analyzing trace with hash -2003261937, now seen corresponding path program 7 times [2025-02-08 05:31:39,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:39,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634774580] [2025-02-08 05:31:39,175 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 05:31:39,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:39,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-08 05:31:39,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-08 05:31:39,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:39,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:39,502 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 05:31:39,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:39,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634774580] [2025-02-08 05:31:39,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634774580] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:39,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:39,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 05:31:39,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164657326] [2025-02-08 05:31:39,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:39,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 05:31:39,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:39,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 05:31:39,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:31:40,423 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-08 05:31:40,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 495 transitions, 3504 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:40,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:40,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-08 05:31:40,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:42,972 INFO L124 PetriNetUnfolderBase]: 4068/15087 cut-off events. [2025-02-08 05:31:42,973 INFO L125 PetriNetUnfolderBase]: For 40062/40723 co-relation queries the response was YES. [2025-02-08 05:31:43,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49325 conditions, 15087 events. 4068/15087 cut-off events. For 40062/40723 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 155876 event pairs, 478 based on Foata normal form. 107/14981 useless extension candidates. Maximal degree in co-relation 49008. Up to 2363 conditions per place. [2025-02-08 05:31:43,069 INFO L140 encePairwiseOnDemand]: 168/182 looper letters, 150 selfloop transitions, 36 changer transitions 0/566 dead transitions. [2025-02-08 05:31:43,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 566 transitions, 4606 flow [2025-02-08 05:31:43,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:31:43,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 05:31:43,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1477 transitions. [2025-02-08 05:31:43,071 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9017094017094017 [2025-02-08 05:31:43,071 INFO L175 Difference]: Start difference. First operand has 344 places, 495 transitions, 3504 flow. Second operand 9 states and 1477 transitions. [2025-02-08 05:31:43,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 566 transitions, 4606 flow [2025-02-08 05:31:43,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 566 transitions, 4506 flow, removed 26 selfloop flow, removed 2 redundant places. [2025-02-08 05:31:43,233 INFO L231 Difference]: Finished difference. Result has 357 places, 514 transitions, 3855 flow [2025-02-08 05:31:43,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=3426, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=495, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=465, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3855, PETRI_PLACES=357, PETRI_TRANSITIONS=514} [2025-02-08 05:31:43,234 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 175 predicate places. [2025-02-08 05:31:43,234 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 514 transitions, 3855 flow [2025-02-08 05:31:43,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:43,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:43,235 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:43,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:31:43,235 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:31:43,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:43,236 INFO L85 PathProgramCache]: Analyzing trace with hash 827447523, now seen corresponding path program 8 times [2025-02-08 05:31:43,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:43,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258327612] [2025-02-08 05:31:43,236 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:31:43,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:43,246 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 159 statements into 2 equivalence classes. [2025-02-08 05:31:43,251 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-02-08 05:31:43,251 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:31:43,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:43,387 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 05:31:43,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:43,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258327612] [2025-02-08 05:31:43,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258327612] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:43,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:43,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 05:31:43,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423026734] [2025-02-08 05:31:43,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:43,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 05:31:43,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:43,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 05:31:43,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:31:43,954 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-08 05:31:43,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 514 transitions, 3855 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:43,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:43,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-08 05:31:43,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:46,666 INFO L124 PetriNetUnfolderBase]: 4671/16951 cut-off events. [2025-02-08 05:31:46,666 INFO L125 PetriNetUnfolderBase]: For 51154/52038 co-relation queries the response was YES. [2025-02-08 05:31:46,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57058 conditions, 16951 events. 4671/16951 cut-off events. For 51154/52038 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 179891 event pairs, 469 based on Foata normal form. 137/16875 useless extension candidates. Maximal degree in co-relation 56734. Up to 2778 conditions per place. [2025-02-08 05:31:46,803 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 173 selfloop transitions, 45 changer transitions 0/598 dead transitions. [2025-02-08 05:31:46,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 598 transitions, 5172 flow [2025-02-08 05:31:46,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:31:46,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 05:31:46,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1481 transitions. [2025-02-08 05:31:46,804 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9041514041514042 [2025-02-08 05:31:46,804 INFO L175 Difference]: Start difference. First operand has 357 places, 514 transitions, 3855 flow. Second operand 9 states and 1481 transitions. [2025-02-08 05:31:46,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 598 transitions, 5172 flow [2025-02-08 05:31:47,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 598 transitions, 5068 flow, removed 52 selfloop flow, removed 0 redundant places. [2025-02-08 05:31:47,019 INFO L231 Difference]: Finished difference. Result has 372 places, 532 transitions, 4209 flow [2025-02-08 05:31:47,020 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=3751, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=474, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4209, PETRI_PLACES=372, PETRI_TRANSITIONS=532} [2025-02-08 05:31:47,020 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 190 predicate places. [2025-02-08 05:31:47,020 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 532 transitions, 4209 flow [2025-02-08 05:31:47,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:47,021 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:47,021 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:47,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:31:47,021 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:31:47,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:47,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1766678525, now seen corresponding path program 9 times [2025-02-08 05:31:47,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:47,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873554360] [2025-02-08 05:31:47,022 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 05:31:47,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:47,031 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 159 statements into 11 equivalence classes. [2025-02-08 05:31:47,035 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-02-08 05:31:47,035 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 05:31:47,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:47,195 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 05:31:47,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:47,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873554360] [2025-02-08 05:31:47,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873554360] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:47,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:47,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 05:31:47,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955075752] [2025-02-08 05:31:47,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:47,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 05:31:47,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:47,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 05:31:47,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:31:48,186 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-08 05:31:48,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 532 transitions, 4209 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:48,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:48,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-08 05:31:48,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:51,238 INFO L124 PetriNetUnfolderBase]: 4663/17065 cut-off events. [2025-02-08 05:31:51,239 INFO L125 PetriNetUnfolderBase]: For 56849/57751 co-relation queries the response was YES. [2025-02-08 05:31:51,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58128 conditions, 17065 events. 4663/17065 cut-off events. For 56849/57751 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 181771 event pairs, 445 based on Foata normal form. 223/17085 useless extension candidates. Maximal degree in co-relation 57796. Up to 2699 conditions per place. [2025-02-08 05:31:51,369 INFO L140 encePairwiseOnDemand]: 166/182 looper letters, 185 selfloop transitions, 58 changer transitions 0/623 dead transitions. [2025-02-08 05:31:51,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 623 transitions, 5535 flow [2025-02-08 05:31:51,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:31:51,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 05:31:51,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1470 transitions. [2025-02-08 05:31:51,371 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8974358974358975 [2025-02-08 05:31:51,371 INFO L175 Difference]: Start difference. First operand has 372 places, 532 transitions, 4209 flow. Second operand 9 states and 1470 transitions. [2025-02-08 05:31:51,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 623 transitions, 5535 flow [2025-02-08 05:31:51,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 623 transitions, 5447 flow, removed 44 selfloop flow, removed 0 redundant places. [2025-02-08 05:31:51,594 INFO L231 Difference]: Finished difference. Result has 384 places, 544 transitions, 4449 flow [2025-02-08 05:31:51,594 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=4123, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=478, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4449, PETRI_PLACES=384, PETRI_TRANSITIONS=544} [2025-02-08 05:31:51,595 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 202 predicate places. [2025-02-08 05:31:51,595 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 544 transitions, 4449 flow [2025-02-08 05:31:51,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:51,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:51,596 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:51,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:31:51,596 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:31:51,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:51,597 INFO L85 PathProgramCache]: Analyzing trace with hash 701480627, now seen corresponding path program 10 times [2025-02-08 05:31:51,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:51,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448894489] [2025-02-08 05:31:51,597 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 05:31:51,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:51,607 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 159 statements into 2 equivalence classes. [2025-02-08 05:31:51,619 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 159 of 159 statements. [2025-02-08 05:31:51,620 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 05:31:51,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:52,150 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 05:31:52,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:52,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448894489] [2025-02-08 05:31:52,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448894489] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:52,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:52,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 05:31:52,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121373559] [2025-02-08 05:31:52,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:52,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:31:52,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:52,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:31:52,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-08 05:31:53,135 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-08 05:31:53,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 544 transitions, 4449 flow. Second operand has 10 states, 10 states have (on average 154.6) internal successors, (1546), 10 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:53,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:53,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-08 05:31:53,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:56,035 INFO L124 PetriNetUnfolderBase]: 4388/16276 cut-off events. [2025-02-08 05:31:56,036 INFO L125 PetriNetUnfolderBase]: For 58784/59687 co-relation queries the response was YES. [2025-02-08 05:31:56,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56085 conditions, 16276 events. 4388/16276 cut-off events. For 58784/59687 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 171676 event pairs, 426 based on Foata normal form. 205/16278 useless extension candidates. Maximal degree in co-relation 55748. Up to 2535 conditions per place. [2025-02-08 05:31:56,158 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 185 selfloop transitions, 55 changer transitions 0/620 dead transitions. [2025-02-08 05:31:56,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 620 transitions, 5663 flow [2025-02-08 05:31:56,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:31:56,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 05:31:56,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1621 transitions. [2025-02-08 05:31:56,163 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8906593406593407 [2025-02-08 05:31:56,163 INFO L175 Difference]: Start difference. First operand has 384 places, 544 transitions, 4449 flow. Second operand 10 states and 1621 transitions. [2025-02-08 05:31:56,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 620 transitions, 5663 flow [2025-02-08 05:31:56,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 620 transitions, 5481 flow, removed 52 selfloop flow, removed 4 redundant places. [2025-02-08 05:31:56,403 INFO L231 Difference]: Finished difference. Result has 392 places, 547 transitions, 4483 flow [2025-02-08 05:31:56,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=4279, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=489, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4483, PETRI_PLACES=392, PETRI_TRANSITIONS=547} [2025-02-08 05:31:56,404 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 210 predicate places. [2025-02-08 05:31:56,404 INFO L471 AbstractCegarLoop]: Abstraction has has 392 places, 547 transitions, 4483 flow [2025-02-08 05:31:56,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 154.6) internal successors, (1546), 10 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:56,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:56,405 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:56,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:31:56,405 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:31:56,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:56,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1391794329, now seen corresponding path program 11 times [2025-02-08 05:31:56,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:56,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432375036] [2025-02-08 05:31:56,406 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 05:31:56,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:56,416 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 159 statements into 11 equivalence classes. [2025-02-08 05:31:56,422 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 159 of 159 statements. [2025-02-08 05:31:56,423 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-02-08 05:31:56,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:56,770 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-02-08 05:31:56,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:56,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432375036] [2025-02-08 05:31:56,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432375036] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:31:56,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071536855] [2025-02-08 05:31:56,771 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 05:31:56,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:31:56,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:31:56,776 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:31:56,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 05:31:56,848 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 159 statements into 11 equivalence classes. [2025-02-08 05:31:56,901 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 159 of 159 statements. [2025-02-08 05:31:56,902 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-02-08 05:31:56,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:56,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-08 05:31:56,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:31:57,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 05:31:57,126 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 05:31:57,126 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:31:57,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071536855] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:57,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 05:31:57,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2025-02-08 05:31:57,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94770721] [2025-02-08 05:31:57,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:57,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:31:57,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:57,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:31:57,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2025-02-08 05:31:58,040 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-08 05:31:58,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 547 transitions, 4483 flow. Second operand has 10 states, 10 states have (on average 154.6) internal successors, (1546), 10 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:58,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:58,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-08 05:31:58,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:01,235 INFO L124 PetriNetUnfolderBase]: 4390/16303 cut-off events. [2025-02-08 05:32:01,236 INFO L125 PetriNetUnfolderBase]: For 56526/57306 co-relation queries the response was YES. [2025-02-08 05:32:01,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56006 conditions, 16303 events. 4390/16303 cut-off events. For 56526/57306 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 171898 event pairs, 450 based on Foata normal form. 175/16273 useless extension candidates. Maximal degree in co-relation 55665. Up to 2566 conditions per place. [2025-02-08 05:32:01,367 INFO L140 encePairwiseOnDemand]: 166/182 looper letters, 179 selfloop transitions, 61 changer transitions 0/620 dead transitions. [2025-02-08 05:32:01,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 620 transitions, 5647 flow [2025-02-08 05:32:01,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:32:01,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 05:32:01,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1624 transitions. [2025-02-08 05:32:01,369 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8923076923076924 [2025-02-08 05:32:01,369 INFO L175 Difference]: Start difference. First operand has 392 places, 547 transitions, 4483 flow. Second operand 10 states and 1624 transitions. [2025-02-08 05:32:01,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 620 transitions, 5647 flow [2025-02-08 05:32:01,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 620 transitions, 5529 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-02-08 05:32:01,607 INFO L231 Difference]: Finished difference. Result has 400 places, 558 transitions, 4735 flow [2025-02-08 05:32:01,608 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=4383, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=490, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4735, PETRI_PLACES=400, PETRI_TRANSITIONS=558} [2025-02-08 05:32:01,608 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 218 predicate places. [2025-02-08 05:32:01,608 INFO L471 AbstractCegarLoop]: Abstraction has has 400 places, 558 transitions, 4735 flow [2025-02-08 05:32:01,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 154.6) internal successors, (1546), 10 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:01,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:01,609 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:32:01,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 05:32:01,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:32:01,810 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:32:01,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:01,811 INFO L85 PathProgramCache]: Analyzing trace with hash -899460179, now seen corresponding path program 12 times [2025-02-08 05:32:01,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:01,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948676971] [2025-02-08 05:32:01,812 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 05:32:01,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:01,822 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 159 statements into 11 equivalence classes. [2025-02-08 05:32:01,826 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-02-08 05:32:01,826 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 05:32:01,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:01,954 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 05:32:01,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:01,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948676971] [2025-02-08 05:32:01,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948676971] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:01,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:01,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 05:32:01,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303810843] [2025-02-08 05:32:01,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:01,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 05:32:01,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:01,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 05:32:01,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:32:02,866 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-08 05:32:02,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 558 transitions, 4735 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:02,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:02,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-08 05:32:02,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:05,987 INFO L124 PetriNetUnfolderBase]: 4679/17288 cut-off events. [2025-02-08 05:32:05,987 INFO L125 PetriNetUnfolderBase]: For 63812/64634 co-relation queries the response was YES. [2025-02-08 05:32:06,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59966 conditions, 17288 events. 4679/17288 cut-off events. For 63812/64634 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 184670 event pairs, 475 based on Foata normal form. 163/17232 useless extension candidates. Maximal degree in co-relation 59620. Up to 2741 conditions per place. [2025-02-08 05:32:06,133 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 203 selfloop transitions, 49 changer transitions 0/632 dead transitions. [2025-02-08 05:32:06,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 632 transitions, 6071 flow [2025-02-08 05:32:06,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:32:06,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 05:32:06,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1479 transitions. [2025-02-08 05:32:06,138 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9029304029304029 [2025-02-08 05:32:06,138 INFO L175 Difference]: Start difference. First operand has 400 places, 558 transitions, 4735 flow. Second operand 9 states and 1479 transitions. [2025-02-08 05:32:06,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 632 transitions, 6071 flow [2025-02-08 05:32:06,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 632 transitions, 5865 flow, removed 73 selfloop flow, removed 4 redundant places. [2025-02-08 05:32:06,427 INFO L231 Difference]: Finished difference. Result has 408 places, 568 transitions, 4915 flow [2025-02-08 05:32:06,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=4627, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=512, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4915, PETRI_PLACES=408, PETRI_TRANSITIONS=568} [2025-02-08 05:32:06,430 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 226 predicate places. [2025-02-08 05:32:06,430 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 568 transitions, 4915 flow [2025-02-08 05:32:06,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:06,435 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:06,435 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:32:06,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:32:06,435 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:32:06,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:06,436 INFO L85 PathProgramCache]: Analyzing trace with hash 809050863, now seen corresponding path program 13 times [2025-02-08 05:32:06,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:06,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046144581] [2025-02-08 05:32:06,436 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 05:32:06,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:06,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-08 05:32:06,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-08 05:32:06,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:06,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:06,764 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 05:32:06,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:06,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046144581] [2025-02-08 05:32:06,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046144581] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:06,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:06,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 05:32:06,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587255404] [2025-02-08 05:32:06,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:06,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 05:32:06,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:06,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 05:32:06,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:32:07,462 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-08 05:32:07,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 568 transitions, 4915 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:07,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:07,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-08 05:32:07,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand