./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/06-symbeq_07-tricky_address2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc 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_07-tricky_address2.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 c18dd13658bb5739ed2db8c4c80ae330682b7c3cebd2ad85657518c27ca325b9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:20:49,380 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:20:49,420 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:20:49,423 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:20:49,424 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:20:49,437 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:20:49,438 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:20:49,438 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:20:49,439 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:20:49,439 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:20:49,439 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:20:49,439 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:20:49,439 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:20:49,439 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:20:49,439 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:20:49,439 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:20:49,439 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:20:49,440 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:20:49,440 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:20:49,440 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:20:49,440 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:20:49,440 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:20:49,440 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:20:49,440 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:20:49,440 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:20:49,440 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:20:49,440 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:20:49,440 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:20:49,441 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:20:49,441 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:20:49,441 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:20:49,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:20:49,441 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:20:49,441 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:20:49,441 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:20:49,441 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:20:49,441 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:20:49,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:20:49,441 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:20:49,441 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:20:49,442 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:20:49,442 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:20:49,442 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 -> c18dd13658bb5739ed2db8c4c80ae330682b7c3cebd2ad85657518c27ca325b9 [2025-02-06 09:20:49,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:20:49,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:20:49,679 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:20:49,679 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:20:49,680 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:20:49,681 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/06-symbeq_07-tricky_address2.i [2025-02-06 09:20:50,931 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/65d22fc08/c550e2c8b43640dfbb06fecd2c6f1675/FLAG48d0ff61f [2025-02-06 09:20:51,231 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:20:51,232 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/06-symbeq_07-tricky_address2.i [2025-02-06 09:20:51,247 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/65d22fc08/c550e2c8b43640dfbb06fecd2c6f1675/FLAG48d0ff61f [2025-02-06 09:20:51,517 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/65d22fc08/c550e2c8b43640dfbb06fecd2c6f1675 [2025-02-06 09:20:51,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:20:51,520 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:20:51,522 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:20:51,522 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:20:51,525 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:20:51,526 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:20:51" (1/1) ... [2025-02-06 09:20:51,527 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c3c3395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:51, skipping insertion in model container [2025-02-06 09:20:51,527 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:20:51" (1/1) ... [2025-02-06 09:20:51,557 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:20:51,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:20:51,867 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:20:51,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:20:51,940 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:20:51,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:51 WrapperNode [2025-02-06 09:20:51,941 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:20:51,942 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:20:51,942 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:20:51,943 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:20:51,946 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:51" (1/1) ... [2025-02-06 09:20:51,965 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:51" (1/1) ... [2025-02-06 09:20:51,986 INFO L138 Inliner]: procedures = 265, calls = 74, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 148 [2025-02-06 09:20:51,986 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:20:51,987 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:20:51,987 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:20:51,987 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:20:51,994 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:51" (1/1) ... [2025-02-06 09:20:51,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:51" (1/1) ... [2025-02-06 09:20:51,997 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:51" (1/1) ... [2025-02-06 09:20:51,997 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:51" (1/1) ... [2025-02-06 09:20:52,003 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:51" (1/1) ... [2025-02-06 09:20:52,004 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:51" (1/1) ... [2025-02-06 09:20:52,005 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:51" (1/1) ... [2025-02-06 09:20:52,006 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:51" (1/1) ... [2025-02-06 09:20:52,008 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:20:52,008 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:20:52,008 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:20:52,009 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:20:52,009 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:51" (1/1) ... [2025-02-06 09:20:52,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:20:52,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:20:52,060 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-06 09:20:52,063 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-06 09:20:52,078 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 09:20:52,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:20:52,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:20:52,079 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 09:20:52,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:20:52,079 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 09:20:52,079 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 09:20:52,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:20:52,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:20:52,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:20:52,080 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:20:52,185 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:20:52,186 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:20:52,533 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:20:52,536 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:20:52,563 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:20:52,564 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:20:52,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:20:52 BoogieIcfgContainer [2025-02-06 09:20:52,565 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:20:52,567 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:20:52,568 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:20:52,571 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:20:52,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:20:51" (1/3) ... [2025-02-06 09:20:52,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75876230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:20:52, skipping insertion in model container [2025-02-06 09:20:52,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:51" (2/3) ... [2025-02-06 09:20:52,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75876230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:20:52, skipping insertion in model container [2025-02-06 09:20:52,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:20:52" (3/3) ... [2025-02-06 09:20:52,573 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_07-tricky_address2.i [2025-02-06 09:20:52,586 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:20:52,588 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_07-tricky_address2.i that has 2 procedures, 158 locations, 1 initial locations, 1 loop locations, and 4 error locations. [2025-02-06 09:20:52,589 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:20:52,653 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 09:20:52,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 160 transitions, 324 flow [2025-02-06 09:20:52,796 INFO L124 PetriNetUnfolderBase]: 3/159 cut-off events. [2025-02-06 09:20:52,797 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:20:52,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 159 events. 3/159 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 83 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2025-02-06 09:20:52,801 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 160 transitions, 324 flow [2025-02-06 09:20:52,803 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 159 transitions, 321 flow [2025-02-06 09:20:52,808 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:20:52,815 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;@1a2bd2e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:20:52,816 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-06 09:20:52,833 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:20:52,833 INFO L124 PetriNetUnfolderBase]: 3/112 cut-off events. [2025-02-06 09:20:52,833 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:20:52,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:20:52,834 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] [2025-02-06 09:20:52,834 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 09:20:52,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:20:52,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1531881620, now seen corresponding path program 1 times [2025-02-06 09:20:52,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:20:52,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751703062] [2025-02-06 09:20:52,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:20:52,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:20:52,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 09:20:53,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 09:20:53,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:20:53,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:20:53,258 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-06 09:20:53,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:20:53,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751703062] [2025-02-06 09:20:53,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751703062] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:20:53,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:20:53,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:20:53,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516616207] [2025-02-06 09:20:53,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:20:53,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:20:53,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:20:53,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:20:53,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:20:53,311 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 160 [2025-02-06 09:20:53,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 159 transitions, 321 flow. Second operand has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 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-06 09:20:53,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:20:53,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 160 [2025-02-06 09:20:53,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:20:53,377 INFO L124 PetriNetUnfolderBase]: 7/221 cut-off events. [2025-02-06 09:20:53,377 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:20:53,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 221 events. 7/221 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 323 event pairs, 6 based on Foata normal form. 5/214 useless extension candidates. Maximal degree in co-relation 144. Up to 24 conditions per place. [2025-02-06 09:20:53,380 INFO L140 encePairwiseOnDemand]: 155/160 looper letters, 10 selfloop transitions, 2 changer transitions 1/158 dead transitions. [2025-02-06 09:20:53,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 158 transitions, 343 flow [2025-02-06 09:20:53,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:20:53,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:20:53,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 456 transitions. [2025-02-06 09:20:53,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.95 [2025-02-06 09:20:53,395 INFO L175 Difference]: Start difference. First operand has 160 places, 159 transitions, 321 flow. Second operand 3 states and 456 transitions. [2025-02-06 09:20:53,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 158 transitions, 343 flow [2025-02-06 09:20:53,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 158 transitions, 342 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:20:53,405 INFO L231 Difference]: Finished difference. Result has 162 places, 157 transitions, 326 flow [2025-02-06 09:20:53,407 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=326, PETRI_PLACES=162, PETRI_TRANSITIONS=157} [2025-02-06 09:20:53,411 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 2 predicate places. [2025-02-06 09:20:53,412 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 157 transitions, 326 flow [2025-02-06 09:20:53,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 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-06 09:20:53,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:20:53,413 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:20:53,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:20:53,413 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 09:20:53,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:20:53,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1288320965, now seen corresponding path program 1 times [2025-02-06 09:20:53,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:20:53,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604478591] [2025-02-06 09:20:53,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:20:53,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:20:53,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 09:20:53,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 09:20:53,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:20:53,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:20:53,595 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-06 09:20:53,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:20:53,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604478591] [2025-02-06 09:20:53,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604478591] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:20:53,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736730287] [2025-02-06 09:20:53,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:20:53,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:20:53,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:20:53,599 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-06 09:20:53,600 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-06 09:20:53,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 09:20:53,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 09:20:53,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:20:53,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:20:53,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 09:20:53,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:20:53,713 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-06 09:20:53,713 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:20:53,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-06 09:20:53,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736730287] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:20:53,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:20:53,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-06 09:20:53,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690681245] [2025-02-06 09:20:53,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:20:53,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 09:20:53,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:20:53,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 09:20:53,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 09:20:53,772 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 160 [2025-02-06 09:20:53,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 157 transitions, 326 flow. Second operand has 10 states, 10 states have (on average 146.0) internal successors, (1460), 10 states have internal predecessors, (1460), 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-06 09:20:53,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:20:53,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 160 [2025-02-06 09:20:53,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:20:53,872 INFO L124 PetriNetUnfolderBase]: 7/227 cut-off events. [2025-02-06 09:20:53,872 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:20:53,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 227 events. 7/227 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 318 event pairs, 6 based on Foata normal form. 2/218 useless extension candidates. Maximal degree in co-relation 191. Up to 24 conditions per place. [2025-02-06 09:20:53,873 INFO L140 encePairwiseOnDemand]: 154/160 looper letters, 14 selfloop transitions, 9 changer transitions 0/165 dead transitions. [2025-02-06 09:20:53,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 165 transitions, 390 flow [2025-02-06 09:20:53,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 09:20:53,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 09:20:53,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1321 transitions. [2025-02-06 09:20:53,877 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9173611111111111 [2025-02-06 09:20:53,877 INFO L175 Difference]: Start difference. First operand has 162 places, 157 transitions, 326 flow. Second operand 9 states and 1321 transitions. [2025-02-06 09:20:53,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 165 transitions, 390 flow [2025-02-06 09:20:53,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 165 transitions, 388 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:20:53,880 INFO L231 Difference]: Finished difference. Result has 171 places, 163 transitions, 374 flow [2025-02-06 09:20:53,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=374, PETRI_PLACES=171, PETRI_TRANSITIONS=163} [2025-02-06 09:20:53,881 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 11 predicate places. [2025-02-06 09:20:53,881 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 163 transitions, 374 flow [2025-02-06 09:20:53,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 146.0) internal successors, (1460), 10 states have internal predecessors, (1460), 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-06 09:20:53,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:20:53,882 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:20:53,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 09:20:54,082 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-06 09:20:54,083 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 09:20:54,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:20:54,084 INFO L85 PathProgramCache]: Analyzing trace with hash -320842789, now seen corresponding path program 2 times [2025-02-06 09:20:54,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:20:54,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905710509] [2025-02-06 09:20:54,084 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:20:54,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:20:54,096 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 109 statements into 2 equivalence classes. [2025-02-06 09:20:54,103 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 94 of 109 statements. [2025-02-06 09:20:54,103 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:20:54,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:20:54,522 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-06 09:20:54,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:20:54,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905710509] [2025-02-06 09:20:54,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905710509] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:20:54,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:20:54,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:20:54,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354003794] [2025-02-06 09:20:54,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:20:54,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:20:54,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:20:54,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:20:54,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:20:54,982 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 160 [2025-02-06 09:20:54,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 163 transitions, 374 flow. Second operand has 6 states, 6 states have (on average 135.66666666666666) internal successors, (814), 6 states have internal predecessors, (814), 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-06 09:20:54,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:20:54,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 160 [2025-02-06 09:20:54,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:20:55,202 INFO L124 PetriNetUnfolderBase]: 129/676 cut-off events. [2025-02-06 09:20:55,202 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-06 09:20:55,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1006 conditions, 676 events. 129/676 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3547 event pairs, 46 based on Foata normal form. 0/616 useless extension candidates. Maximal degree in co-relation 893. Up to 178 conditions per place. [2025-02-06 09:20:55,206 INFO L140 encePairwiseOnDemand]: 149/160 looper letters, 43 selfloop transitions, 22 changer transitions 0/204 dead transitions. [2025-02-06 09:20:55,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 204 transitions, 586 flow [2025-02-06 09:20:55,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:20:55,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:20:55,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 870 transitions. [2025-02-06 09:20:55,209 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.90625 [2025-02-06 09:20:55,209 INFO L175 Difference]: Start difference. First operand has 171 places, 163 transitions, 374 flow. Second operand 6 states and 870 transitions. [2025-02-06 09:20:55,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 204 transitions, 586 flow [2025-02-06 09:20:55,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 204 transitions, 580 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-06 09:20:55,214 INFO L231 Difference]: Finished difference. Result has 179 places, 185 transitions, 514 flow [2025-02-06 09:20:55,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=514, PETRI_PLACES=179, PETRI_TRANSITIONS=185} [2025-02-06 09:20:55,215 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 19 predicate places. [2025-02-06 09:20:55,215 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 185 transitions, 514 flow [2025-02-06 09:20:55,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 135.66666666666666) internal successors, (814), 6 states have internal predecessors, (814), 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-06 09:20:55,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:20:55,216 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:20:55,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:20:55,216 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 09:20:55,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:20:55,217 INFO L85 PathProgramCache]: Analyzing trace with hash -78790998, now seen corresponding path program 1 times [2025-02-06 09:20:55,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:20:55,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560267620] [2025-02-06 09:20:55,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:20:55,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:20:55,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-06 09:20:55,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-06 09:20:55,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:20:55,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:20:55,380 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-06 09:20:55,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:20:55,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560267620] [2025-02-06 09:20:55,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560267620] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:20:55,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78491941] [2025-02-06 09:20:55,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:20:55,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:20:55,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:20:55,384 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-06 09:20:55,389 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-06 09:20:55,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-06 09:20:55,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-06 09:20:55,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:20:55,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:20:55,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 09:20:55,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:20:55,519 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-06 09:20:55,519 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:20:55,598 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-06 09:20:55,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78491941] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:20:55,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:20:55,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-02-06 09:20:55,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739382431] [2025-02-06 09:20:55,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:20:55,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 09:20:55,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:20:55,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 09:20:55,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-02-06 09:20:55,627 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 160 [2025-02-06 09:20:55,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 185 transitions, 514 flow. Second operand has 18 states, 18 states have (on average 146.0) internal successors, (2628), 18 states have internal predecessors, (2628), 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-06 09:20:55,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:20:55,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 160 [2025-02-06 09:20:55,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:20:55,834 INFO L124 PetriNetUnfolderBase]: 41/503 cut-off events. [2025-02-06 09:20:55,834 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-02-06 09:20:55,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 814 conditions, 503 events. 41/503 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2262 event pairs, 16 based on Foata normal form. 4/480 useless extension candidates. Maximal degree in co-relation 626. Up to 55 conditions per place. [2025-02-06 09:20:55,837 INFO L140 encePairwiseOnDemand]: 154/160 looper letters, 18 selfloop transitions, 21 changer transitions 0/203 dead transitions. [2025-02-06 09:20:55,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 203 transitions, 680 flow [2025-02-06 09:20:55,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 09:20:55,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-02-06 09:20:55,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3067 transitions. [2025-02-06 09:20:55,843 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.912797619047619 [2025-02-06 09:20:55,843 INFO L175 Difference]: Start difference. First operand has 179 places, 185 transitions, 514 flow. Second operand 21 states and 3067 transitions. [2025-02-06 09:20:55,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 203 transitions, 680 flow [2025-02-06 09:20:55,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 203 transitions, 680 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:20:55,848 INFO L231 Difference]: Finished difference. Result has 204 places, 198 transitions, 644 flow [2025-02-06 09:20:55,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=644, PETRI_PLACES=204, PETRI_TRANSITIONS=198} [2025-02-06 09:20:55,849 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 44 predicate places. [2025-02-06 09:20:55,849 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 198 transitions, 644 flow [2025-02-06 09:20:55,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 146.0) internal successors, (2628), 18 states have internal predecessors, (2628), 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-06 09:20:55,851 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:20:55,851 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:20:55,862 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-06 09:20:56,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:20:56,053 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 09:20:56,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:20:56,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1783398934, now seen corresponding path program 2 times [2025-02-06 09:20:56,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:20:56,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046693972] [2025-02-06 09:20:56,054 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:20:56,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:20:56,068 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 137 statements into 2 equivalence classes. [2025-02-06 09:20:56,075 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 102 of 137 statements. [2025-02-06 09:20:56,078 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:20:56,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:20:56,403 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-06 09:20:56,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:20:56,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046693972] [2025-02-06 09:20:56,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046693972] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:20:56,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:20:56,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:20:56,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145876433] [2025-02-06 09:20:56,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:20:56,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:20:56,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:20:56,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:20:56,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:20:56,755 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 160 [2025-02-06 09:20:56,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 198 transitions, 644 flow. Second operand has 6 states, 6 states have (on average 130.66666666666666) internal successors, (784), 6 states have internal predecessors, (784), 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-06 09:20:56,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:20:56,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 160 [2025-02-06 09:20:56,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:20:57,040 INFO L124 PetriNetUnfolderBase]: 306/1335 cut-off events. [2025-02-06 09:20:57,040 INFO L125 PetriNetUnfolderBase]: For 286/296 co-relation queries the response was YES. [2025-02-06 09:20:57,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2502 conditions, 1335 events. 306/1335 cut-off events. For 286/296 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 9036 event pairs, 116 based on Foata normal form. 5/1228 useless extension candidates. Maximal degree in co-relation 2305. Up to 464 conditions per place. [2025-02-06 09:20:57,047 INFO L140 encePairwiseOnDemand]: 145/160 looper letters, 72 selfloop transitions, 36 changer transitions 2/255 dead transitions. [2025-02-06 09:20:57,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 255 transitions, 1016 flow [2025-02-06 09:20:57,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:20:57,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:20:57,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 856 transitions. [2025-02-06 09:20:57,049 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8916666666666667 [2025-02-06 09:20:57,049 INFO L175 Difference]: Start difference. First operand has 204 places, 198 transitions, 644 flow. Second operand 6 states and 856 transitions. [2025-02-06 09:20:57,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 255 transitions, 1016 flow [2025-02-06 09:20:57,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 255 transitions, 992 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-02-06 09:20:57,054 INFO L231 Difference]: Finished difference. Result has 207 places, 230 transitions, 872 flow [2025-02-06 09:20:57,055 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=872, PETRI_PLACES=207, PETRI_TRANSITIONS=230} [2025-02-06 09:20:57,055 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 47 predicate places. [2025-02-06 09:20:57,055 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 230 transitions, 872 flow [2025-02-06 09:20:57,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.66666666666666) internal successors, (784), 6 states have internal predecessors, (784), 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-06 09:20:57,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:20:57,056 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:20:57,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:20:57,057 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 09:20:57,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:20:57,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1518349476, now seen corresponding path program 1 times [2025-02-06 09:20:57,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:20:57,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568261169] [2025-02-06 09:20:57,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:20:57,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:20:57,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 09:20:57,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 09:20:57,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:20:57,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:20:57,303 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-06 09:20:57,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:20:57,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568261169] [2025-02-06 09:20:57,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568261169] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:20:57,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509265931] [2025-02-06 09:20:57,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:20:57,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:20:57,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:20:57,309 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-06 09:20:57,312 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-06 09:20:57,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 09:20:57,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 09:20:57,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:20:57,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:20:57,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 09:20:57,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:20:57,457 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-06 09:20:57,458 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:20:57,616 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-06 09:20:57,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509265931] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:20:57,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:20:57,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-02-06 09:20:57,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464279603] [2025-02-06 09:20:57,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:20:57,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 09:20:57,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:20:57,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 09:20:57,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-02-06 09:20:57,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 160 [2025-02-06 09:20:57,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 230 transitions, 872 flow. Second operand has 23 states, 23 states have (on average 146.08695652173913) internal successors, (3360), 23 states have internal predecessors, (3360), 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-06 09:20:57,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:20:57,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 160 [2025-02-06 09:20:57,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:20:57,942 INFO L124 PetriNetUnfolderBase]: 120/935 cut-off events. [2025-02-06 09:20:57,942 INFO L125 PetriNetUnfolderBase]: For 414/414 co-relation queries the response was YES. [2025-02-06 09:20:57,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1833 conditions, 935 events. 120/935 cut-off events. For 414/414 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5959 event pairs, 33 based on Foata normal form. 3/879 useless extension candidates. Maximal degree in co-relation 1557. Up to 134 conditions per place. [2025-02-06 09:20:57,947 INFO L140 encePairwiseOnDemand]: 154/160 looper letters, 21 selfloop transitions, 30 changer transitions 0/247 dead transitions. [2025-02-06 09:20:57,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 247 transitions, 1096 flow [2025-02-06 09:20:57,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-06 09:20:57,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-02-06 09:20:57,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 4374 transitions. [2025-02-06 09:20:57,953 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.91125 [2025-02-06 09:20:57,953 INFO L175 Difference]: Start difference. First operand has 207 places, 230 transitions, 872 flow. Second operand 30 states and 4374 transitions. [2025-02-06 09:20:57,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 247 transitions, 1096 flow [2025-02-06 09:20:57,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 247 transitions, 1072 flow, removed 12 selfloop flow, removed 0 redundant places. [2025-02-06 09:20:57,960 INFO L231 Difference]: Finished difference. Result has 239 places, 240 transitions, 1000 flow [2025-02-06 09:20:57,960 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1000, PETRI_PLACES=239, PETRI_TRANSITIONS=240} [2025-02-06 09:20:57,960 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 79 predicate places. [2025-02-06 09:20:57,960 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 240 transitions, 1000 flow [2025-02-06 09:20:57,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 146.08695652173913) internal successors, (3360), 23 states have internal predecessors, (3360), 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-06 09:20:57,962 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:20:57,962 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] [2025-02-06 09:20:57,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 09:20:58,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:20:58,164 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 09:20:58,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:20:58,165 INFO L85 PathProgramCache]: Analyzing trace with hash 928010101, now seen corresponding path program 2 times [2025-02-06 09:20:58,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:20:58,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457806305] [2025-02-06 09:20:58,165 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:20:58,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:20:58,176 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 154 statements into 2 equivalence classes. [2025-02-06 09:20:58,180 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 104 of 154 statements. [2025-02-06 09:20:58,181 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:20:58,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:20:58,385 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-06 09:20:58,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:20:58,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457806305] [2025-02-06 09:20:58,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457806305] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:20:58,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:20:58,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:20:58,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907292349] [2025-02-06 09:20:58,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:20:58,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:20:58,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:20:58,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:20:58,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:20:58,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 160 [2025-02-06 09:20:58,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 240 transitions, 1000 flow. Second operand has 6 states, 6 states have (on average 137.5) internal successors, (825), 6 states have internal predecessors, (825), 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-06 09:20:58,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:20:58,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 160 [2025-02-06 09:20:58,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:20:59,141 INFO L124 PetriNetUnfolderBase]: 300/1427 cut-off events. [2025-02-06 09:20:59,142 INFO L125 PetriNetUnfolderBase]: For 878/918 co-relation queries the response was YES. [2025-02-06 09:20:59,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3261 conditions, 1427 events. 300/1427 cut-off events. For 878/918 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10128 event pairs, 66 based on Foata normal form. 10/1390 useless extension candidates. Maximal degree in co-relation 2983. Up to 443 conditions per place. [2025-02-06 09:20:59,148 INFO L140 encePairwiseOnDemand]: 149/160 looper letters, 79 selfloop transitions, 49 changer transitions 0/306 dead transitions. [2025-02-06 09:20:59,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 306 transitions, 1555 flow [2025-02-06 09:20:59,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:20:59,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:20:59,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 880 transitions. [2025-02-06 09:20:59,150 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2025-02-06 09:20:59,150 INFO L175 Difference]: Start difference. First operand has 239 places, 240 transitions, 1000 flow. Second operand 6 states and 880 transitions. [2025-02-06 09:20:59,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 306 transitions, 1555 flow [2025-02-06 09:20:59,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 306 transitions, 1509 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-02-06 09:20:59,158 INFO L231 Difference]: Finished difference. Result has 230 places, 281 transitions, 1370 flow [2025-02-06 09:20:59,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=954, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1370, PETRI_PLACES=230, PETRI_TRANSITIONS=281} [2025-02-06 09:20:59,159 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 70 predicate places. [2025-02-06 09:20:59,159 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 281 transitions, 1370 flow [2025-02-06 09:20:59,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 137.5) internal successors, (825), 6 states have internal predecessors, (825), 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-06 09:20:59,159 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:20:59,159 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:20:59,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:20:59,160 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 09:20:59,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:20:59,161 INFO L85 PathProgramCache]: Analyzing trace with hash 590300793, now seen corresponding path program 1 times [2025-02-06 09:20:59,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:20:59,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336187478] [2025-02-06 09:20:59,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:20:59,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:20:59,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-06 09:20:59,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-06 09:20:59,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:20:59,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:20:59,510 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-06 09:20:59,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:20:59,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336187478] [2025-02-06 09:20:59,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336187478] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:20:59,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:20:59,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:20:59,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829836783] [2025-02-06 09:20:59,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:20:59,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:20:59,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:20:59,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:20:59,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:20:59,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 160 [2025-02-06 09:20:59,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 281 transitions, 1370 flow. Second operand has 6 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 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-06 09:20:59,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:20:59,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 160 [2025-02-06 09:20:59,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:00,154 INFO L124 PetriNetUnfolderBase]: 569/2203 cut-off events. [2025-02-06 09:21:00,154 INFO L125 PetriNetUnfolderBase]: For 2421/2481 co-relation queries the response was YES. [2025-02-06 09:21:00,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5833 conditions, 2203 events. 569/2203 cut-off events. For 2421/2481 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 17202 event pairs, 130 based on Foata normal form. 12/2129 useless extension candidates. Maximal degree in co-relation 5572. Up to 803 conditions per place. [2025-02-06 09:21:00,165 INFO L140 encePairwiseOnDemand]: 145/160 looper letters, 118 selfloop transitions, 78 changer transitions 11/375 dead transitions. [2025-02-06 09:21:00,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 375 transitions, 2308 flow [2025-02-06 09:21:00,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:21:00,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:21:00,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 866 transitions. [2025-02-06 09:21:00,167 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9020833333333333 [2025-02-06 09:21:00,167 INFO L175 Difference]: Start difference. First operand has 230 places, 281 transitions, 1370 flow. Second operand 6 states and 866 transitions. [2025-02-06 09:21:00,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 375 transitions, 2308 flow [2025-02-06 09:21:00,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 375 transitions, 2306 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-06 09:21:00,180 INFO L231 Difference]: Finished difference. Result has 239 places, 329 transitions, 1974 flow [2025-02-06 09:21:00,181 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=1368, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1974, PETRI_PLACES=239, PETRI_TRANSITIONS=329} [2025-02-06 09:21:00,181 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 79 predicate places. [2025-02-06 09:21:00,181 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 329 transitions, 1974 flow [2025-02-06 09:21:00,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 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-06 09:21:00,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:00,182 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:21:00,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:21:00,182 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 09:21:00,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:00,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1412083614, now seen corresponding path program 1 times [2025-02-06 09:21:00,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:00,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695877296] [2025-02-06 09:21:00,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:21:00,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:00,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-06 09:21:00,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-06 09:21:00,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:21:00,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:04,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-06 09:21:04,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:04,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695877296] [2025-02-06 09:21:04,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695877296] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:04,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:04,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 09:21:04,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164246505] [2025-02-06 09:21:04,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:04,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 09:21:04,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:04,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 09:21:04,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-02-06 09:21:05,576 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 160 [2025-02-06 09:21:05,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 329 transitions, 1974 flow. Second operand has 13 states, 13 states have (on average 121.07692307692308) internal successors, (1574), 13 states have internal predecessors, (1574), 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-06 09:21:05,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:05,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 160 [2025-02-06 09:21:05,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:06,910 INFO L124 PetriNetUnfolderBase]: 1232/4499 cut-off events. [2025-02-06 09:21:06,910 INFO L125 PetriNetUnfolderBase]: For 9411/9652 co-relation queries the response was YES. [2025-02-06 09:21:06,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14333 conditions, 4499 events. 1232/4499 cut-off events. For 9411/9652 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 42035 event pairs, 133 based on Foata normal form. 159/4607 useless extension candidates. Maximal degree in co-relation 14056. Up to 884 conditions per place. [2025-02-06 09:21:06,942 INFO L140 encePairwiseOnDemand]: 133/160 looper letters, 364 selfloop transitions, 83 changer transitions 93/697 dead transitions. [2025-02-06 09:21:06,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 697 transitions, 6113 flow [2025-02-06 09:21:06,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 09:21:06,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-02-06 09:21:06,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2449 transitions. [2025-02-06 09:21:06,948 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8055921052631579 [2025-02-06 09:21:06,948 INFO L175 Difference]: Start difference. First operand has 239 places, 329 transitions, 1974 flow. Second operand 19 states and 2449 transitions. [2025-02-06 09:21:06,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 697 transitions, 6113 flow [2025-02-06 09:21:06,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 697 transitions, 6027 flow, removed 43 selfloop flow, removed 0 redundant places. [2025-02-06 09:21:06,985 INFO L231 Difference]: Finished difference. Result has 268 places, 402 transitions, 3022 flow [2025-02-06 09:21:06,985 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=1940, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3022, PETRI_PLACES=268, PETRI_TRANSITIONS=402} [2025-02-06 09:21:06,986 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 108 predicate places. [2025-02-06 09:21:06,986 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 402 transitions, 3022 flow [2025-02-06 09:21:06,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 121.07692307692308) internal successors, (1574), 13 states have internal predecessors, (1574), 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-06 09:21:06,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:06,989 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:21:06,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:21:06,989 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 09:21:06,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:06,990 INFO L85 PathProgramCache]: Analyzing trace with hash 823331198, now seen corresponding path program 2 times [2025-02-06 09:21:06,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:06,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316137003] [2025-02-06 09:21:06,990 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:21:06,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:07,001 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 168 statements into 2 equivalence classes. [2025-02-06 09:21:07,021 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 118 of 168 statements. [2025-02-06 09:21:07,021 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:21:07,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:10,372 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-06 09:21:10,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:10,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316137003] [2025-02-06 09:21:10,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316137003] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:10,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:10,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 09:21:10,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955670927] [2025-02-06 09:21:10,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:10,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 09:21:10,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:10,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 09:21:10,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-02-06 09:21:12,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 160 [2025-02-06 09:21:12,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 402 transitions, 3022 flow. Second operand has 14 states, 14 states have (on average 120.92857142857143) internal successors, (1693), 14 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:21:12,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:12,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 160 [2025-02-06 09:21:12,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:14,504 INFO L124 PetriNetUnfolderBase]: 1203/4432 cut-off events. [2025-02-06 09:21:14,504 INFO L125 PetriNetUnfolderBase]: For 13718/14006 co-relation queries the response was YES. [2025-02-06 09:21:14,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16372 conditions, 4432 events. 1203/4432 cut-off events. For 13718/14006 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 41749 event pairs, 182 based on Foata normal form. 166/4543 useless extension candidates. Maximal degree in co-relation 16083. Up to 1196 conditions per place. [2025-02-06 09:21:14,561 INFO L140 encePairwiseOnDemand]: 133/160 looper letters, 309 selfloop transitions, 119 changer transitions 74/659 dead transitions. [2025-02-06 09:21:14,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 659 transitions, 6426 flow [2025-02-06 09:21:14,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 09:21:14,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-02-06 09:21:14,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2177 transitions. [2025-02-06 09:21:14,567 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8003676470588236 [2025-02-06 09:21:14,567 INFO L175 Difference]: Start difference. First operand has 268 places, 402 transitions, 3022 flow. Second operand 17 states and 2177 transitions. [2025-02-06 09:21:14,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 659 transitions, 6426 flow [2025-02-06 09:21:14,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 659 transitions, 6409 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-02-06 09:21:14,694 INFO L231 Difference]: Finished difference. Result has 283 places, 435 transitions, 3807 flow [2025-02-06 09:21:14,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=3007, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3807, PETRI_PLACES=283, PETRI_TRANSITIONS=435} [2025-02-06 09:21:14,697 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 123 predicate places. [2025-02-06 09:21:14,697 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 435 transitions, 3807 flow [2025-02-06 09:21:14,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 120.92857142857143) internal successors, (1693), 14 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:21:14,698 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:14,698 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:21:14,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:21:14,698 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 09:21:14,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:14,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1461832613, now seen corresponding path program 1 times [2025-02-06 09:21:14,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:14,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453866480] [2025-02-06 09:21:14,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:21:14,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:14,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-06 09:21:14,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-06 09:21:14,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:21:14,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:19,176 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-06 09:21:19,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:19,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453866480] [2025-02-06 09:21:19,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453866480] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:19,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:19,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 09:21:19,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301462212] [2025-02-06 09:21:19,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:19,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 09:21:19,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:19,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 09:21:19,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-02-06 09:21:21,707 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 160 [2025-02-06 09:21:21,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 435 transitions, 3807 flow. Second operand has 14 states, 14 states have (on average 125.5) internal successors, (1757), 14 states have internal predecessors, (1757), 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-06 09:21:21,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:21,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 160 [2025-02-06 09:21:21,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:23,286 INFO L124 PetriNetUnfolderBase]: 1464/5713 cut-off events. [2025-02-06 09:21:23,286 INFO L125 PetriNetUnfolderBase]: For 28004/28521 co-relation queries the response was YES. [2025-02-06 09:21:23,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23274 conditions, 5713 events. 1464/5713 cut-off events. For 28004/28521 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 59561 event pairs, 116 based on Foata normal form. 205/5864 useless extension candidates. Maximal degree in co-relation 22978. Up to 1022 conditions per place. [2025-02-06 09:21:23,328 INFO L140 encePairwiseOnDemand]: 138/160 looper letters, 395 selfloop transitions, 116 changer transitions 86/789 dead transitions. [2025-02-06 09:21:23,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 789 transitions, 9096 flow [2025-02-06 09:21:23,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 09:21:23,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-02-06 09:21:23,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2868 transitions. [2025-02-06 09:21:23,332 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8147727272727273 [2025-02-06 09:21:23,332 INFO L175 Difference]: Start difference. First operand has 283 places, 435 transitions, 3807 flow. Second operand 22 states and 2868 transitions. [2025-02-06 09:21:23,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 789 transitions, 9096 flow [2025-02-06 09:21:23,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 789 transitions, 8981 flow, removed 28 selfloop flow, removed 10 redundant places. [2025-02-06 09:21:23,436 INFO L231 Difference]: Finished difference. Result has 307 places, 514 transitions, 5043 flow [2025-02-06 09:21:23,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=3736, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=5043, PETRI_PLACES=307, PETRI_TRANSITIONS=514} [2025-02-06 09:21:23,437 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 147 predicate places. [2025-02-06 09:21:23,438 INFO L471 AbstractCegarLoop]: Abstraction has has 307 places, 514 transitions, 5043 flow [2025-02-06 09:21:23,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 125.5) internal successors, (1757), 14 states have internal predecessors, (1757), 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-06 09:21:23,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:23,439 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:21:23,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:21:23,439 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 09:21:23,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:23,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1524960966, now seen corresponding path program 3 times [2025-02-06 09:21:23,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:23,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233584500] [2025-02-06 09:21:23,440 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 09:21:23,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:23,452 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 168 statements into 11 equivalence classes. [2025-02-06 09:21:23,469 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 118 of 168 statements. [2025-02-06 09:21:23,469 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 09:21:23,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:26,610 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-06 09:21:26,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:26,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233584500] [2025-02-06 09:21:26,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233584500] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:26,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:26,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 09:21:26,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601278507] [2025-02-06 09:21:26,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:26,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 09:21:26,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:26,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 09:21:26,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-02-06 09:21:29,774 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 160 [2025-02-06 09:21:29,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 514 transitions, 5043 flow. Second operand has 14 states, 14 states have (on average 120.92857142857143) internal successors, (1693), 14 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:21:29,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:29,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 160 [2025-02-06 09:21:29,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:31,683 INFO L124 PetriNetUnfolderBase]: 1777/6419 cut-off events. [2025-02-06 09:21:31,683 INFO L125 PetriNetUnfolderBase]: For 37328/37715 co-relation queries the response was YES. [2025-02-06 09:21:31,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28692 conditions, 6419 events. 1777/6419 cut-off events. For 37328/37715 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 66265 event pairs, 255 based on Foata normal form. 310/6662 useless extension candidates. Maximal degree in co-relation 28385. Up to 1442 conditions per place. [2025-02-06 09:21:31,756 INFO L140 encePairwiseOnDemand]: 135/160 looper letters, 304 selfloop transitions, 208 changer transitions 55/730 dead transitions. [2025-02-06 09:21:31,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 730 transitions, 8732 flow [2025-02-06 09:21:31,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 09:21:31,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-02-06 09:21:31,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2048 transitions. [2025-02-06 09:21:31,758 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8 [2025-02-06 09:21:31,758 INFO L175 Difference]: Start difference. First operand has 307 places, 514 transitions, 5043 flow. Second operand 16 states and 2048 transitions. [2025-02-06 09:21:31,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 730 transitions, 8732 flow [2025-02-06 09:21:31,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 730 transitions, 8640 flow, removed 37 selfloop flow, removed 7 redundant places. [2025-02-06 09:21:31,973 INFO L231 Difference]: Finished difference. Result has 320 places, 539 transitions, 6003 flow [2025-02-06 09:21:31,974 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=4999, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=183, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=6003, PETRI_PLACES=320, PETRI_TRANSITIONS=539} [2025-02-06 09:21:31,976 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 160 predicate places. [2025-02-06 09:21:31,976 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 539 transitions, 6003 flow [2025-02-06 09:21:31,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 120.92857142857143) internal successors, (1693), 14 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:21:31,977 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:31,977 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:21:31,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:21:31,977 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 09:21:31,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:31,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1790305926, now seen corresponding path program 4 times [2025-02-06 09:21:31,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:31,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753362122] [2025-02-06 09:21:31,978 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 09:21:31,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:31,992 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 168 statements into 2 equivalence classes. [2025-02-06 09:21:32,013 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 168 of 168 statements. [2025-02-06 09:21:32,014 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 09:21:32,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:32,526 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-02-06 09:21:32,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:32,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753362122] [2025-02-06 09:21:32,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753362122] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:32,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:32,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 09:21:32,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171660731] [2025-02-06 09:21:32,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:32,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 09:21:32,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:32,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 09:21:32,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-02-06 09:21:34,658 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 160 [2025-02-06 09:21:34,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 539 transitions, 6003 flow. Second operand has 14 states, 14 states have (on average 120.92857142857143) internal successors, (1693), 14 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:21:34,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:34,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 160 [2025-02-06 09:21:34,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:36,666 INFO L124 PetriNetUnfolderBase]: 2579/8837 cut-off events. [2025-02-06 09:21:36,666 INFO L125 PetriNetUnfolderBase]: For 71186/71672 co-relation queries the response was YES. [2025-02-06 09:21:36,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43886 conditions, 8837 events. 2579/8837 cut-off events. For 71186/71672 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 94209 event pairs, 289 based on Foata normal form. 265/9016 useless extension candidates. Maximal degree in co-relation 43574. Up to 1994 conditions per place. [2025-02-06 09:21:36,721 INFO L140 encePairwiseOnDemand]: 136/160 looper letters, 583 selfloop transitions, 177 changer transitions 84/1007 dead transitions. [2025-02-06 09:21:36,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 1007 transitions, 13984 flow [2025-02-06 09:21:36,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 09:21:36,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-02-06 09:21:36,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2604 transitions. [2025-02-06 09:21:36,725 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.81375 [2025-02-06 09:21:36,725 INFO L175 Difference]: Start difference. First operand has 320 places, 539 transitions, 6003 flow. Second operand 20 states and 2604 transitions. [2025-02-06 09:21:36,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 1007 transitions, 13984 flow [2025-02-06 09:21:36,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 1007 transitions, 13735 flow, removed 62 selfloop flow, removed 10 redundant places. [2025-02-06 09:21:37,005 INFO L231 Difference]: Finished difference. Result has 344 places, 636 transitions, 8418 flow [2025-02-06 09:21:37,005 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=5872, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=8418, PETRI_PLACES=344, PETRI_TRANSITIONS=636} [2025-02-06 09:21:37,006 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 184 predicate places. [2025-02-06 09:21:37,006 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 636 transitions, 8418 flow [2025-02-06 09:21:37,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 120.92857142857143) internal successors, (1693), 14 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:21:37,007 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:37,007 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:21:37,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 09:21:37,007 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 09:21:37,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:37,008 INFO L85 PathProgramCache]: Analyzing trace with hash 662602600, now seen corresponding path program 5 times [2025-02-06 09:21:37,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:37,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112910589] [2025-02-06 09:21:37,008 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 09:21:37,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:37,020 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 168 statements into 11 equivalence classes. [2025-02-06 09:21:37,032 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 168 of 168 statements. [2025-02-06 09:21:37,033 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-02-06 09:21:37,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:37,503 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-02-06 09:21:37,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:37,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112910589] [2025-02-06 09:21:37,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112910589] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:37,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:37,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 09:21:37,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456825407] [2025-02-06 09:21:37,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:37,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 09:21:37,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:37,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 09:21:37,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-02-06 09:21:38,585 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 160 [2025-02-06 09:21:38,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 636 transitions, 8418 flow. Second operand has 11 states, 11 states have (on average 126.9090909090909) internal successors, (1396), 11 states have internal predecessors, (1396), 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-06 09:21:38,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:38,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 160 [2025-02-06 09:21:38,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:40,593 INFO L124 PetriNetUnfolderBase]: 2481/8873 cut-off events. [2025-02-06 09:21:40,593 INFO L125 PetriNetUnfolderBase]: For 88156/88605 co-relation queries the response was YES. [2025-02-06 09:21:40,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46930 conditions, 8873 events. 2481/8873 cut-off events. For 88156/88605 co-relation queries the response was YES. Maximal size of possible extension queue 588. Compared 98315 event pairs, 376 based on Foata normal form. 345/9123 useless extension candidates. Maximal degree in co-relation 46778. Up to 1909 conditions per place. [2025-02-06 09:21:40,653 INFO L140 encePairwiseOnDemand]: 141/160 looper letters, 322 selfloop transitions, 286 changer transitions 39/821 dead transitions. [2025-02-06 09:21:40,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 821 transitions, 12120 flow [2025-02-06 09:21:40,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 09:21:40,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 09:21:40,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1639 transitions. [2025-02-06 09:21:40,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8536458333333333 [2025-02-06 09:21:40,655 INFO L175 Difference]: Start difference. First operand has 344 places, 636 transitions, 8418 flow. Second operand 12 states and 1639 transitions. [2025-02-06 09:21:40,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 821 transitions, 12120 flow [2025-02-06 09:21:41,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 821 transitions, 12054 flow, removed 18 selfloop flow, removed 5 redundant places. [2025-02-06 09:21:41,039 INFO L231 Difference]: Finished difference. Result has 351 places, 656 transitions, 9435 flow [2025-02-06 09:21:41,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=8367, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=636, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=263, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=9435, PETRI_PLACES=351, PETRI_TRANSITIONS=656} [2025-02-06 09:21:41,040 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 191 predicate places. [2025-02-06 09:21:41,040 INFO L471 AbstractCegarLoop]: Abstraction has has 351 places, 656 transitions, 9435 flow [2025-02-06 09:21:41,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 126.9090909090909) internal successors, (1396), 11 states have internal predecessors, (1396), 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-06 09:21:41,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:41,041 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:21:41,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 09:21:41,041 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 09:21:41,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:41,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1252450348, now seen corresponding path program 6 times [2025-02-06 09:21:41,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:41,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375333998] [2025-02-06 09:21:41,042 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 09:21:41,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:41,051 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 168 statements into 11 equivalence classes. [2025-02-06 09:21:41,055 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 116 of 168 statements. [2025-02-06 09:21:41,055 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 09:21:41,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:41,366 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-02-06 09:21:41,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:41,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375333998] [2025-02-06 09:21:41,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375333998] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:41,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:41,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 09:21:41,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76249735] [2025-02-06 09:21:41,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:41,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 09:21:41,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:41,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 09:21:41,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 09:21:42,251 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 160 [2025-02-06 09:21:42,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 656 transitions, 9435 flow. Second operand has 10 states, 10 states have (on average 127.1) internal successors, (1271), 10 states have internal predecessors, (1271), 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-06 09:21:42,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:42,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 160 [2025-02-06 09:21:42,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:44,482 INFO L124 PetriNetUnfolderBase]: 2901/10130 cut-off events. [2025-02-06 09:21:44,483 INFO L125 PetriNetUnfolderBase]: For 128196/128737 co-relation queries the response was YES. [2025-02-06 09:21:44,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58424 conditions, 10130 events. 2901/10130 cut-off events. For 128196/128737 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 114154 event pairs, 364 based on Foata normal form. 301/10303 useless extension candidates. Maximal degree in co-relation 58096. Up to 2181 conditions per place. [2025-02-06 09:21:44,548 INFO L140 encePairwiseOnDemand]: 142/160 looper letters, 553 selfloop transitions, 253 changer transitions 52/1032 dead transitions. [2025-02-06 09:21:44,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 1032 transitions, 17415 flow [2025-02-06 09:21:44,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 09:21:44,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-06 09:21:44,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2034 transitions. [2025-02-06 09:21:44,551 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8475 [2025-02-06 09:21:44,551 INFO L175 Difference]: Start difference. First operand has 351 places, 656 transitions, 9435 flow. Second operand 15 states and 2034 transitions. [2025-02-06 09:21:44,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 1032 transitions, 17415 flow [2025-02-06 09:21:45,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 1032 transitions, 16742 flow, removed 23 selfloop flow, removed 6 redundant places. [2025-02-06 09:21:45,093 INFO L231 Difference]: Finished difference. Result has 368 places, 770 transitions, 12452 flow [2025-02-06 09:21:45,093 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=9007, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=656, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=12452, PETRI_PLACES=368, PETRI_TRANSITIONS=770} [2025-02-06 09:21:45,094 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 208 predicate places. [2025-02-06 09:21:45,094 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 770 transitions, 12452 flow [2025-02-06 09:21:45,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 127.1) internal successors, (1271), 10 states have internal predecessors, (1271), 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-06 09:21:45,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:45,094 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:21:45,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 09:21:45,095 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 09:21:45,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:45,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1660027730, now seen corresponding path program 7 times [2025-02-06 09:21:45,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:45,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034350291] [2025-02-06 09:21:45,096 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 09:21:45,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:45,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-06 09:21:45,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-06 09:21:45,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:21:45,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:49,950 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-06 09:21:49,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:49,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034350291] [2025-02-06 09:21:49,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034350291] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:21:49,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653774312] [2025-02-06 09:21:49,951 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 09:21:49,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:21:49,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:21:49,953 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-06 09:21:49,955 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-06 09:21:50,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-06 09:21:50,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-06 09:21:50,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:21:50,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:50,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-02-06 09:21:50,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:21:50,367 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 16 treesize of output 12 [2025-02-06 09:21:50,423 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 15 treesize of output 11 [2025-02-06 09:21:50,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-02-06 09:21:50,618 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 09:21:50,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2025-02-06 09:21:50,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:21:50,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2025-02-06 09:21:50,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:21:50,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2025-02-06 09:21:50,715 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2025-02-06 09:21:50,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 63 treesize of output 71 [2025-02-06 09:21:50,831 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 214 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 09:21:50,832 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:21:51,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2025-02-06 09:21:51,378 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-02-06 09:21:51,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653774312] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 09:21:51,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 09:21:51,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13, 23] total 40 [2025-02-06 09:21:51,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266393351] [2025-02-06 09:21:51,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:51,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 09:21:51,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:51,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 09:21:51,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1478, Unknown=0, NotChecked=0, Total=1640 [2025-02-06 09:21:52,622 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 160 [2025-02-06 09:21:52,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 770 transitions, 12452 flow. Second operand has 11 states, 11 states have (on average 124.9090909090909) internal successors, (1374), 11 states have internal predecessors, (1374), 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-06 09:21:52,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:52,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 160 [2025-02-06 09:21:52,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:56,465 INFO L124 PetriNetUnfolderBase]: 4158/13170 cut-off events. [2025-02-06 09:21:56,465 INFO L125 PetriNetUnfolderBase]: For 196943/197837 co-relation queries the response was YES. [2025-02-06 09:21:56,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82219 conditions, 13170 events. 4158/13170 cut-off events. For 196943/197837 co-relation queries the response was YES. Maximal size of possible extension queue 883. Compared 149193 event pairs, 394 based on Foata normal form. 463/13510 useless extension candidates. Maximal degree in co-relation 81882. Up to 2509 conditions per place. [2025-02-06 09:21:56,588 INFO L140 encePairwiseOnDemand]: 135/160 looper letters, 537 selfloop transitions, 507 changer transitions 111/1313 dead transitions. [2025-02-06 09:21:56,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 1313 transitions, 23611 flow [2025-02-06 09:21:56,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 09:21:56,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-06 09:21:56,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2035 transitions. [2025-02-06 09:21:56,590 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8479166666666667 [2025-02-06 09:21:56,590 INFO L175 Difference]: Start difference. First operand has 368 places, 770 transitions, 12452 flow. Second operand 15 states and 2035 transitions. [2025-02-06 09:21:56,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 1313 transitions, 23611 flow [2025-02-06 09:21:57,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 1313 transitions, 23340 flow, removed 109 selfloop flow, removed 5 redundant places. [2025-02-06 09:21:57,713 INFO L231 Difference]: Finished difference. Result has 384 places, 934 transitions, 17398 flow [2025-02-06 09:21:57,713 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=12244, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=770, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=339, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=17398, PETRI_PLACES=384, PETRI_TRANSITIONS=934} [2025-02-06 09:21:57,714 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 224 predicate places. [2025-02-06 09:21:57,714 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 934 transitions, 17398 flow [2025-02-06 09:21:57,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 124.9090909090909) internal successors, (1374), 11 states have internal predecessors, (1374), 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-06 09:21:57,715 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:57,715 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:21:57,721 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-06 09:21:57,915 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,SelfDestructingSolverStorable15 [2025-02-06 09:21:57,916 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 09:21:57,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:57,917 INFO L85 PathProgramCache]: Analyzing trace with hash -2039555800, now seen corresponding path program 8 times [2025-02-06 09:21:57,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:57,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356848395] [2025-02-06 09:21:57,917 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:21:57,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:57,929 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 168 statements into 2 equivalence classes. [2025-02-06 09:21:57,940 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 116 of 168 statements. [2025-02-06 09:21:57,940 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:21:57,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:04,484 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-02-06 09:22:04,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:04,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356848395] [2025-02-06 09:22:04,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356848395] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:04,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:04,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 09:22:04,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669280378] [2025-02-06 09:22:04,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:04,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 09:22:04,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:04,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 09:22:04,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-02-06 09:22:07,951 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 160 [2025-02-06 09:22:07,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 934 transitions, 17398 flow. Second operand has 14 states, 14 states have (on average 120.92857142857143) internal successors, (1693), 14 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:07,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:07,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 160 [2025-02-06 09:22:07,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:13,968 INFO L124 PetriNetUnfolderBase]: 3817/12776 cut-off events. [2025-02-06 09:22:13,969 INFO L125 PetriNetUnfolderBase]: For 220473/221277 co-relation queries the response was YES. [2025-02-06 09:22:14,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83631 conditions, 12776 events. 3817/12776 cut-off events. For 220473/221277 co-relation queries the response was YES. Maximal size of possible extension queue 853. Compared 146420 event pairs, 478 based on Foata normal form. 397/13041 useless extension candidates. Maximal degree in co-relation 83288. Up to 2925 conditions per place. [2025-02-06 09:22:14,099 INFO L140 encePairwiseOnDemand]: 137/160 looper letters, 724 selfloop transitions, 401 changer transitions 53/1344 dead transitions. [2025-02-06 09:22:14,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 1344 transitions, 26146 flow [2025-02-06 09:22:14,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 09:22:14,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-02-06 09:22:14,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2847 transitions. [2025-02-06 09:22:14,101 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8088068181818182 [2025-02-06 09:22:14,101 INFO L175 Difference]: Start difference. First operand has 384 places, 934 transitions, 17398 flow. Second operand 22 states and 2847 transitions. [2025-02-06 09:22:14,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 1344 transitions, 26146 flow [2025-02-06 09:22:15,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 1344 transitions, 25438 flow, removed 104 selfloop flow, removed 2 redundant places. [2025-02-06 09:22:15,361 INFO L231 Difference]: Finished difference. Result has 412 places, 978 transitions, 19042 flow [2025-02-06 09:22:15,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=16803, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=934, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=357, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=537, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=19042, PETRI_PLACES=412, PETRI_TRANSITIONS=978} [2025-02-06 09:22:15,362 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 252 predicate places. [2025-02-06 09:22:15,362 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 978 transitions, 19042 flow [2025-02-06 09:22:15,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 120.92857142857143) internal successors, (1693), 14 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:15,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:15,362 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:22:15,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 09:22:15,363 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 09:22:15,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:15,364 INFO L85 PathProgramCache]: Analyzing trace with hash -608938196, now seen corresponding path program 9 times [2025-02-06 09:22:15,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:15,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226553806] [2025-02-06 09:22:15,364 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 09:22:15,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:15,375 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 168 statements into 11 equivalence classes. [2025-02-06 09:22:15,384 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 116 of 168 statements. [2025-02-06 09:22:15,384 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 09:22:15,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:15,719 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-02-06 09:22:15,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:15,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226553806] [2025-02-06 09:22:15,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226553806] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:15,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:15,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 09:22:15,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469059305] [2025-02-06 09:22:15,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:15,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 09:22:15,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:15,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 09:22:15,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 09:22:16,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 160 [2025-02-06 09:22:16,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 978 transitions, 19042 flow. Second operand has 10 states, 10 states have (on average 127.1) internal successors, (1271), 10 states have internal predecessors, (1271), 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-06 09:22:16,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:16,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 160 [2025-02-06 09:22:16,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand