./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/06-symbeq_06-tricky_address1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/06-symbeq_06-tricky_address1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 99f794c04b6feffb38c1e5c415a278bf34dda5287d389b184a9a7d818ab0b70e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:04:26,328 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:04:26,389 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:04:26,396 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:04:26,396 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:04:26,418 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:04:26,419 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:04:26,419 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:04:26,420 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:04:26,420 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:04:26,420 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:04:26,421 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:04:26,421 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:04:26,421 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:04:26,421 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:04:26,421 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:04:26,421 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:04:26,421 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:04:26,422 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:04:26,422 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:04:26,422 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:04:26,422 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:04:26,422 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:04:26,422 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:04:26,422 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:04:26,422 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:04:26,422 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:04:26,422 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:04:26,423 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:04:26,423 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:04:26,423 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:04:26,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:04:26,423 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:04:26,423 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:04:26,424 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:04:26,424 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:04:26,424 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:04:26,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:04:26,424 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:04:26,424 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:04:26,424 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:04:26,424 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:04:26,424 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 99f794c04b6feffb38c1e5c415a278bf34dda5287d389b184a9a7d818ab0b70e [2025-03-17 11:04:26,660 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:04:26,668 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:04:26,670 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:04:26,671 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:04:26,672 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:04:26,672 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/06-symbeq_06-tricky_address1.i [2025-03-17 11:04:27,876 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60cc32bc9/cbb3d37de9984956b0d6ff0e09f1b54f/FLAGc223565ab [2025-03-17 11:04:28,157 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:04:28,157 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/06-symbeq_06-tricky_address1.i [2025-03-17 11:04:28,170 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60cc32bc9/cbb3d37de9984956b0d6ff0e09f1b54f/FLAGc223565ab [2025-03-17 11:04:28,449 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60cc32bc9/cbb3d37de9984956b0d6ff0e09f1b54f [2025-03-17 11:04:28,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:04:28,452 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:04:28,453 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:04:28,453 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:04:28,457 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:04:28,458 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:04:28" (1/1) ... [2025-03-17 11:04:28,460 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f66c5d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:28, skipping insertion in model container [2025-03-17 11:04:28,460 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:04:28" (1/1) ... [2025-03-17 11:04:28,495 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:04:28,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:04:28,808 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:04:28,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:04:28,896 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:04:28,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:28 WrapperNode [2025-03-17 11:04:28,897 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:04:28,898 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:04:28,898 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:04:28,899 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:04:28,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:28" (1/1) ... [2025-03-17 11:04:28,915 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:28" (1/1) ... [2025-03-17 11:04:28,940 INFO L138 Inliner]: procedures = 265, calls = 74, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 148 [2025-03-17 11:04:28,941 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:04:28,942 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:04:28,942 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:04:28,942 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:04:28,950 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:28" (1/1) ... [2025-03-17 11:04:28,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:28" (1/1) ... [2025-03-17 11:04:28,952 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:28" (1/1) ... [2025-03-17 11:04:28,955 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:28" (1/1) ... [2025-03-17 11:04:28,965 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:28" (1/1) ... [2025-03-17 11:04:28,969 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:28" (1/1) ... [2025-03-17 11:04:28,973 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:28" (1/1) ... [2025-03-17 11:04:28,974 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:28" (1/1) ... [2025-03-17 11:04:28,979 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:04:28,980 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:04:28,980 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:04:28,980 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:04:28,981 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:28" (1/1) ... [2025-03-17 11:04:28,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:04:29,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:04:29,012 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:04:29,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:04:29,030 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 11:04:29,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:04:29,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:04:29,031 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 11:04:29,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:04:29,031 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-17 11:04:29,031 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-17 11:04:29,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:04:29,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:04:29,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:04:29,032 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:04:29,146 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:04:29,148 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:04:29,425 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:04:29,425 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:04:29,448 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:04:29,449 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:04:29,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:04:29 BoogieIcfgContainer [2025-03-17 11:04:29,449 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:04:29,451 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:04:29,451 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:04:29,454 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:04:29,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:04:28" (1/3) ... [2025-03-17 11:04:29,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bc1946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:04:29, skipping insertion in model container [2025-03-17 11:04:29,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:28" (2/3) ... [2025-03-17 11:04:29,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bc1946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:04:29, skipping insertion in model container [2025-03-17 11:04:29,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:04:29" (3/3) ... [2025-03-17 11:04:29,456 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_06-tricky_address1.i [2025-03-17 11:04:29,466 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:04:29,468 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_06-tricky_address1.i that has 2 procedures, 158 locations, 1 initial locations, 1 loop locations, and 4 error locations. [2025-03-17 11:04:29,468 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:04:29,533 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 11:04:29,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 160 transitions, 324 flow [2025-03-17 11:04:29,637 INFO L124 PetriNetUnfolderBase]: 3/159 cut-off events. [2025-03-17 11:04:29,639 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:04:29,645 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-03-17 11:04:29,645 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 160 transitions, 324 flow [2025-03-17 11:04:29,648 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 159 transitions, 321 flow [2025-03-17 11:04:29,657 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:04:29,668 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;@6c006875, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:04:29,668 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-17 11:04:29,694 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:04:29,695 INFO L124 PetriNetUnfolderBase]: 3/112 cut-off events. [2025-03-17 11:04:29,695 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:04:29,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:29,696 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-03-17 11:04:29,696 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-03-17 11:04:29,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:29,701 INFO L85 PathProgramCache]: Analyzing trace with hash 489885583, now seen corresponding path program 1 times [2025-03-17 11:04:29,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:29,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76146991] [2025-03-17 11:04:29,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:04:29,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:29,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 11:04:29,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 11:04:29,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:04:29,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:30,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:04:30,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:30,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76146991] [2025-03-17 11:04:30,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76146991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:04:30,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:04:30,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:04:30,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653102677] [2025-03-17 11:04:30,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:30,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:04:30,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:30,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:04:30,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:04:30,099 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 160 [2025-03-17 11:04:30,102 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-03-17 11:04:30,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:30,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 160 [2025-03-17 11:04:30,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:30,170 INFO L124 PetriNetUnfolderBase]: 7/221 cut-off events. [2025-03-17 11:04:30,171 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:04:30,172 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 324 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-03-17 11:04:30,174 INFO L140 encePairwiseOnDemand]: 155/160 looper letters, 10 selfloop transitions, 2 changer transitions 1/158 dead transitions. [2025-03-17 11:04:30,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 158 transitions, 343 flow [2025-03-17 11:04:30,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:04:30,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:04:30,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 456 transitions. [2025-03-17 11:04:30,186 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.95 [2025-03-17 11:04:30,187 INFO L175 Difference]: Start difference. First operand has 160 places, 159 transitions, 321 flow. Second operand 3 states and 456 transitions. [2025-03-17 11:04:30,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 158 transitions, 343 flow [2025-03-17 11:04:30,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 158 transitions, 342 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:04:30,197 INFO L231 Difference]: Finished difference. Result has 162 places, 157 transitions, 326 flow [2025-03-17 11:04:30,199 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-03-17 11:04:30,203 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 2 predicate places. [2025-03-17 11:04:30,203 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 157 transitions, 326 flow [2025-03-17 11:04:30,204 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-03-17 11:04:30,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:30,205 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-03-17 11:04:30,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:04:30,205 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-03-17 11:04:30,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:30,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1681250623, now seen corresponding path program 1 times [2025-03-17 11:04:30,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:30,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450510725] [2025-03-17 11:04:30,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:04:30,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:30,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 11:04:30,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 11:04:30,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:04:30,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:30,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:04:30,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:30,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450510725] [2025-03-17 11:04:30,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450510725] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:04:30,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703457914] [2025-03-17 11:04:30,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:04:30,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:04:30,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:04:30,461 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:04:30,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 11:04:30,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 11:04:30,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 11:04:30,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:04:30,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:30,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 11:04:30,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:04:30,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:04:30,606 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:04:30,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:04:30,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703457914] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:04:30,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:04:30,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-17 11:04:30,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810467148] [2025-03-17 11:04:30,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:04:30,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:04:30,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:30,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:04:30,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:04:30,676 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 160 [2025-03-17 11:04:30,678 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-03-17 11:04:30,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:30,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 160 [2025-03-17 11:04:30,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:30,806 INFO L124 PetriNetUnfolderBase]: 7/227 cut-off events. [2025-03-17 11:04:30,806 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:04:30,807 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 319 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-03-17 11:04:30,807 INFO L140 encePairwiseOnDemand]: 154/160 looper letters, 14 selfloop transitions, 9 changer transitions 0/165 dead transitions. [2025-03-17 11:04:30,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 165 transitions, 390 flow [2025-03-17 11:04:30,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:04:30,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 11:04:30,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1321 transitions. [2025-03-17 11:04:30,811 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9173611111111111 [2025-03-17 11:04:30,811 INFO L175 Difference]: Start difference. First operand has 162 places, 157 transitions, 326 flow. Second operand 9 states and 1321 transitions. [2025-03-17 11:04:30,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 165 transitions, 390 flow [2025-03-17 11:04:30,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 165 transitions, 388 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:04:30,814 INFO L231 Difference]: Finished difference. Result has 171 places, 163 transitions, 374 flow [2025-03-17 11:04:30,814 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-03-17 11:04:30,816 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 11 predicate places. [2025-03-17 11:04:30,816 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 163 transitions, 374 flow [2025-03-17 11:04:30,817 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-03-17 11:04:30,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:30,817 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-03-17 11:04:30,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 11:04:31,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:04:31,018 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-03-17 11:04:31,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:31,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1189937025, now seen corresponding path program 2 times [2025-03-17 11:04:31,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:31,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128694122] [2025-03-17 11:04:31,022 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:04:31,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:31,040 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 109 statements into 2 equivalence classes. [2025-03-17 11:04:31,048 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 94 of 109 statements. [2025-03-17 11:04:31,049 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:04:31,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:31,634 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 11:04:31,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:31,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128694122] [2025-03-17 11:04:31,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128694122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:04:31,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:04:31,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:04:31,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381918897] [2025-03-17 11:04:31,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:31,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:04:31,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:31,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:04:31,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:04:32,141 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 160 [2025-03-17 11:04:32,142 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-03-17 11:04:32,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:32,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 160 [2025-03-17 11:04:32,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:32,350 INFO L124 PetriNetUnfolderBase]: 103/540 cut-off events. [2025-03-17 11:04:32,350 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-17 11:04:32,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 806 conditions, 540 events. 103/540 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2316 event pairs, 40 based on Foata normal form. 0/503 useless extension candidates. Maximal degree in co-relation 693. Up to 184 conditions per place. [2025-03-17 11:04:32,356 INFO L140 encePairwiseOnDemand]: 149/160 looper letters, 31 selfloop transitions, 22 changer transitions 0/192 dead transitions. [2025-03-17 11:04:32,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 192 transitions, 538 flow [2025-03-17 11:04:32,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:04:32,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:04:32,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 858 transitions. [2025-03-17 11:04:32,359 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.89375 [2025-03-17 11:04:32,359 INFO L175 Difference]: Start difference. First operand has 171 places, 163 transitions, 374 flow. Second operand 6 states and 858 transitions. [2025-03-17 11:04:32,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 192 transitions, 538 flow [2025-03-17 11:04:32,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 192 transitions, 532 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-17 11:04:32,366 INFO L231 Difference]: Finished difference. Result has 180 places, 184 transitions, 518 flow [2025-03-17 11:04:32,366 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=518, PETRI_PLACES=180, PETRI_TRANSITIONS=184} [2025-03-17 11:04:32,366 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 20 predicate places. [2025-03-17 11:04:32,370 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 184 transitions, 518 flow [2025-03-17 11:04:32,370 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-03-17 11:04:32,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:32,370 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-03-17 11:04:32,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:04:32,371 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-03-17 11:04:32,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:32,372 INFO L85 PathProgramCache]: Analyzing trace with hash 591590064, now seen corresponding path program 1 times [2025-03-17 11:04:32,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:32,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453923795] [2025-03-17 11:04:32,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:04:32,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:32,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 11:04:32,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 11:04:32,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:04:32,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:32,560 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:04:32,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:32,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453923795] [2025-03-17 11:04:32,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453923795] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:04:32,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348998592] [2025-03-17 11:04:32,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:04:32,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:04:32,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:04:32,562 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:04:32,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 11:04:32,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 11:04:32,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 11:04:32,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:04:32,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:32,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 11:04:32,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:04:32,685 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:04:32,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:04:32,764 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:04:32,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348998592] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:04:32,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:04:32,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-17 11:04:32,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025568399] [2025-03-17 11:04:32,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:04:32,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 11:04:32,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:32,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 11:04:32,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-17 11:04:32,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 160 [2025-03-17 11:04:32,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 184 transitions, 518 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-03-17 11:04:32,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:32,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 160 [2025-03-17 11:04:32,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:33,001 INFO L124 PetriNetUnfolderBase]: 35/393 cut-off events. [2025-03-17 11:04:33,001 INFO L125 PetriNetUnfolderBase]: For 57/62 co-relation queries the response was YES. [2025-03-17 11:04:33,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 664 conditions, 393 events. 35/393 cut-off events. For 57/62 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1194 event pairs, 11 based on Foata normal form. 4/381 useless extension candidates. Maximal degree in co-relation 476. Up to 51 conditions per place. [2025-03-17 11:04:33,003 INFO L140 encePairwiseOnDemand]: 154/160 looper letters, 18 selfloop transitions, 21 changer transitions 0/202 dead transitions. [2025-03-17 11:04:33,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 202 transitions, 684 flow [2025-03-17 11:04:33,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 11:04:33,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-17 11:04:33,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3067 transitions. [2025-03-17 11:04:33,009 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.912797619047619 [2025-03-17 11:04:33,010 INFO L175 Difference]: Start difference. First operand has 180 places, 184 transitions, 518 flow. Second operand 21 states and 3067 transitions. [2025-03-17 11:04:33,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 202 transitions, 684 flow [2025-03-17 11:04:33,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 202 transitions, 684 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:04:33,017 INFO L231 Difference]: Finished difference. Result has 205 places, 197 transitions, 648 flow [2025-03-17 11:04:33,019 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=648, PETRI_PLACES=205, PETRI_TRANSITIONS=197} [2025-03-17 11:04:33,020 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 45 predicate places. [2025-03-17 11:04:33,020 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 197 transitions, 648 flow [2025-03-17 11:04:33,021 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-03-17 11:04:33,021 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:33,021 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-03-17 11:04:33,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 11:04:33,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-17 11:04:33,227 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-03-17 11:04:33,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:33,228 INFO L85 PathProgramCache]: Analyzing trace with hash -184331216, now seen corresponding path program 2 times [2025-03-17 11:04:33,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:33,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484663102] [2025-03-17 11:04:33,228 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:04:33,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:33,242 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 137 statements into 2 equivalence classes. [2025-03-17 11:04:33,254 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 102 of 137 statements. [2025-03-17 11:04:33,255 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:04:33,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:33,571 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 11:04:33,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:33,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484663102] [2025-03-17 11:04:33,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484663102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:04:33,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:04:33,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:04:33,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609933733] [2025-03-17 11:04:33,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:33,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:04:33,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:33,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:04:33,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:04:33,890 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 160 [2025-03-17 11:04:33,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 197 transitions, 648 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-03-17 11:04:33,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:33,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 160 [2025-03-17 11:04:33,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:34,123 INFO L124 PetriNetUnfolderBase]: 223/892 cut-off events. [2025-03-17 11:04:34,124 INFO L125 PetriNetUnfolderBase]: For 190/196 co-relation queries the response was YES. [2025-03-17 11:04:34,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1763 conditions, 892 events. 223/892 cut-off events. For 190/196 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4679 event pairs, 82 based on Foata normal form. 5/839 useless extension candidates. Maximal degree in co-relation 1566. Up to 407 conditions per place. [2025-03-17 11:04:34,131 INFO L140 encePairwiseOnDemand]: 145/160 looper letters, 53 selfloop transitions, 39 changer transitions 5/242 dead transitions. [2025-03-17 11:04:34,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 242 transitions, 962 flow [2025-03-17 11:04:34,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:04:34,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:04:34,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 844 transitions. [2025-03-17 11:04:34,133 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8791666666666667 [2025-03-17 11:04:34,133 INFO L175 Difference]: Start difference. First operand has 205 places, 197 transitions, 648 flow. Second operand 6 states and 844 transitions. [2025-03-17 11:04:34,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 242 transitions, 962 flow [2025-03-17 11:04:34,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 242 transitions, 938 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-17 11:04:34,142 INFO L231 Difference]: Finished difference. Result has 209 places, 233 transitions, 912 flow [2025-03-17 11:04:34,143 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=912, PETRI_PLACES=209, PETRI_TRANSITIONS=233} [2025-03-17 11:04:34,144 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 49 predicate places. [2025-03-17 11:04:34,145 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 233 transitions, 912 flow [2025-03-17 11:04:34,145 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-03-17 11:04:34,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:34,146 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-03-17 11:04:34,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:04:34,146 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-03-17 11:04:34,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:34,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1149960540, now seen corresponding path program 1 times [2025-03-17 11:04:34,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:34,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214375577] [2025-03-17 11:04:34,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:04:34,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:34,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 11:04:34,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 11:04:34,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:04:34,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:34,416 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:04:34,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:34,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214375577] [2025-03-17 11:04:34,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214375577] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:04:34,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088162749] [2025-03-17 11:04:34,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:04:34,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:04:34,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:04:34,419 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:04:34,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 11:04:34,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 11:04:34,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 11:04:34,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:04:34,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:34,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 11:04:34,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:04:34,586 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:04:34,587 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:04:34,769 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:04:34,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088162749] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:04:34,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:04:34,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-17 11:04:34,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108732858] [2025-03-17 11:04:34,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:04:34,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 11:04:34,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:34,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 11:04:34,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-17 11:04:34,801 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 160 [2025-03-17 11:04:34,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 233 transitions, 912 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-03-17 11:04:34,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:34,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 160 [2025-03-17 11:04:34,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:35,130 INFO L124 PetriNetUnfolderBase]: 123/664 cut-off events. [2025-03-17 11:04:35,130 INFO L125 PetriNetUnfolderBase]: For 324/327 co-relation queries the response was YES. [2025-03-17 11:04:35,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1409 conditions, 664 events. 123/664 cut-off events. For 324/327 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2936 event pairs, 15 based on Foata normal form. 3/639 useless extension candidates. Maximal degree in co-relation 1133. Up to 118 conditions per place. [2025-03-17 11:04:35,134 INFO L140 encePairwiseOnDemand]: 154/160 looper letters, 21 selfloop transitions, 30 changer transitions 0/250 dead transitions. [2025-03-17 11:04:35,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 250 transitions, 1136 flow [2025-03-17 11:04:35,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-17 11:04:35,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-17 11:04:35,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 4374 transitions. [2025-03-17 11:04:35,141 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.91125 [2025-03-17 11:04:35,141 INFO L175 Difference]: Start difference. First operand has 209 places, 233 transitions, 912 flow. Second operand 30 states and 4374 transitions. [2025-03-17 11:04:35,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 250 transitions, 1136 flow [2025-03-17 11:04:35,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 250 transitions, 1104 flow, removed 16 selfloop flow, removed 0 redundant places. [2025-03-17 11:04:35,147 INFO L231 Difference]: Finished difference. Result has 241 places, 243 transitions, 1032 flow [2025-03-17 11:04:35,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1032, PETRI_PLACES=241, PETRI_TRANSITIONS=243} [2025-03-17 11:04:35,148 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 81 predicate places. [2025-03-17 11:04:35,148 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 243 transitions, 1032 flow [2025-03-17 11:04:35,153 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-03-17 11:04:35,154 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:35,154 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-03-17 11:04:35,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 11:04:35,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:04:35,355 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-03-17 11:04:35,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:35,355 INFO L85 PathProgramCache]: Analyzing trace with hash 2056736754, now seen corresponding path program 2 times [2025-03-17 11:04:35,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:35,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567979802] [2025-03-17 11:04:35,356 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:04:35,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:35,366 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 154 statements into 2 equivalence classes. [2025-03-17 11:04:35,370 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 104 of 154 statements. [2025-03-17 11:04:35,371 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:04:35,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:35,575 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-17 11:04:35,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:35,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567979802] [2025-03-17 11:04:35,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567979802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:04:35,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:04:35,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:04:35,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262329507] [2025-03-17 11:04:35,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:35,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:04:35,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:35,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:04:35,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:04:35,661 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 160 [2025-03-17 11:04:35,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 243 transitions, 1032 flow. Second operand has 6 states, 6 states have (on average 138.33333333333334) internal successors, (830), 6 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:04:35,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:35,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 160 [2025-03-17 11:04:35,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:35,869 INFO L124 PetriNetUnfolderBase]: 212/925 cut-off events. [2025-03-17 11:04:35,869 INFO L125 PetriNetUnfolderBase]: For 576/620 co-relation queries the response was YES. [2025-03-17 11:04:35,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2185 conditions, 925 events. 212/925 cut-off events. For 576/620 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4937 event pairs, 40 based on Foata normal form. 1/908 useless extension candidates. Maximal degree in co-relation 1908. Up to 338 conditions per place. [2025-03-17 11:04:35,875 INFO L140 encePairwiseOnDemand]: 149/160 looper letters, 72 selfloop transitions, 40 changer transitions 0/282 dead transitions. [2025-03-17 11:04:35,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 282 transitions, 1440 flow [2025-03-17 11:04:35,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:04:35,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:04:35,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 873 transitions. [2025-03-17 11:04:35,877 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.909375 [2025-03-17 11:04:35,878 INFO L175 Difference]: Start difference. First operand has 241 places, 243 transitions, 1032 flow. Second operand 6 states and 873 transitions. [2025-03-17 11:04:35,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 282 transitions, 1440 flow [2025-03-17 11:04:35,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 282 transitions, 1394 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-03-17 11:04:35,886 INFO L231 Difference]: Finished difference. Result has 233 places, 274 transitions, 1354 flow [2025-03-17 11:04:35,887 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=986, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1354, PETRI_PLACES=233, PETRI_TRANSITIONS=274} [2025-03-17 11:04:35,888 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 73 predicate places. [2025-03-17 11:04:35,888 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 274 transitions, 1354 flow [2025-03-17 11:04:35,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 138.33333333333334) internal successors, (830), 6 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:04:35,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:35,889 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-03-17 11:04:35,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:04:35,889 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-03-17 11:04:35,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:35,889 INFO L85 PathProgramCache]: Analyzing trace with hash -162158218, now seen corresponding path program 1 times [2025-03-17 11:04:35,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:35,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667416027] [2025-03-17 11:04:35,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:04:35,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:35,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-17 11:04:35,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-17 11:04:35,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:04:35,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:36,249 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-17 11:04:36,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:36,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667416027] [2025-03-17 11:04:36,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667416027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:04:36,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:04:36,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:04:36,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46981107] [2025-03-17 11:04:36,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:36,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:04:36,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:36,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:04:36,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:04:36,331 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 160 [2025-03-17 11:04:36,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 274 transitions, 1354 flow. Second operand has 6 states, 6 states have (on average 133.33333333333334) internal successors, (800), 6 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:04:36,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:36,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 160 [2025-03-17 11:04:36,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:36,582 INFO L124 PetriNetUnfolderBase]: 361/1326 cut-off events. [2025-03-17 11:04:36,582 INFO L125 PetriNetUnfolderBase]: For 1446/1474 co-relation queries the response was YES. [2025-03-17 11:04:36,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3665 conditions, 1326 events. 361/1326 cut-off events. For 1446/1474 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 7977 event pairs, 87 based on Foata normal form. 2/1292 useless extension candidates. Maximal degree in co-relation 3405. Up to 610 conditions per place. [2025-03-17 11:04:36,590 INFO L140 encePairwiseOnDemand]: 145/160 looper letters, 100 selfloop transitions, 64 changer transitions 10/335 dead transitions. [2025-03-17 11:04:36,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 335 transitions, 2042 flow [2025-03-17 11:04:36,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:04:36,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:04:36,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 859 transitions. [2025-03-17 11:04:36,592 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8947916666666667 [2025-03-17 11:04:36,592 INFO L175 Difference]: Start difference. First operand has 233 places, 274 transitions, 1354 flow. Second operand 6 states and 859 transitions. [2025-03-17 11:04:36,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 335 transitions, 2042 flow [2025-03-17 11:04:36,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 335 transitions, 2024 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-17 11:04:36,607 INFO L231 Difference]: Finished difference. Result has 243 places, 321 transitions, 1922 flow [2025-03-17 11:04:36,608 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=1336, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1922, PETRI_PLACES=243, PETRI_TRANSITIONS=321} [2025-03-17 11:04:36,609 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 83 predicate places. [2025-03-17 11:04:36,609 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 321 transitions, 1922 flow [2025-03-17 11:04:36,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.33333333333334) internal successors, (800), 6 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:04:36,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:36,610 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-03-17 11:04:36,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:04:36,611 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-03-17 11:04:36,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:36,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1571568099, now seen corresponding path program 1 times [2025-03-17 11:04:36,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:36,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669365350] [2025-03-17 11:04:36,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:04:36,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:36,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-17 11:04:36,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-17 11:04:36,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:04:36,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:42,324 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-17 11:04:42,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:42,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669365350] [2025-03-17 11:04:42,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669365350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:04:42,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:04:42,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 11:04:42,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975459079] [2025-03-17 11:04:42,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:42,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 11:04:42,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:42,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 11:04:42,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-03-17 11:04:44,447 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 160 [2025-03-17 11:04:44,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 321 transitions, 1922 flow. Second operand has 15 states, 15 states have (on average 121.73333333333333) internal successors, (1826), 15 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:04:44,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:44,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 160 [2025-03-17 11:04:44,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:45,496 INFO L124 PetriNetUnfolderBase]: 461/1566 cut-off events. [2025-03-17 11:04:45,496 INFO L125 PetriNetUnfolderBase]: For 2923/3003 co-relation queries the response was YES. [2025-03-17 11:04:45,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5173 conditions, 1566 events. 461/1566 cut-off events. For 2923/3003 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 9800 event pairs, 19 based on Foata normal form. 37/1587 useless extension candidates. Maximal degree in co-relation 4896. Up to 562 conditions per place. [2025-03-17 11:04:45,506 INFO L140 encePairwiseOnDemand]: 133/160 looper letters, 190 selfloop transitions, 84 changer transitions 47/471 dead transitions. [2025-03-17 11:04:45,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 471 transitions, 3654 flow [2025-03-17 11:04:45,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 11:04:45,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-17 11:04:45,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2298 transitions. [2025-03-17 11:04:45,511 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7979166666666667 [2025-03-17 11:04:45,512 INFO L175 Difference]: Start difference. First operand has 243 places, 321 transitions, 1922 flow. Second operand 18 states and 2298 transitions. [2025-03-17 11:04:45,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 471 transitions, 3654 flow [2025-03-17 11:04:45,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 471 transitions, 3568 flow, removed 43 selfloop flow, removed 0 redundant places. [2025-03-17 11:04:45,531 INFO L231 Difference]: Finished difference. Result has 268 places, 358 transitions, 2482 flow [2025-03-17 11:04:45,532 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=1848, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2482, PETRI_PLACES=268, PETRI_TRANSITIONS=358} [2025-03-17 11:04:45,533 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 108 predicate places. [2025-03-17 11:04:45,533 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 358 transitions, 2482 flow [2025-03-17 11:04:45,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 121.73333333333333) internal successors, (1826), 15 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:04:45,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:45,534 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-03-17 11:04:45,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:04:45,535 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-03-17 11:04:45,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:45,535 INFO L85 PathProgramCache]: Analyzing trace with hash -320685067, now seen corresponding path program 2 times [2025-03-17 11:04:45,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:45,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126020412] [2025-03-17 11:04:45,536 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:04:45,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:45,552 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 168 statements into 2 equivalence classes. [2025-03-17 11:04:45,567 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 118 of 168 statements. [2025-03-17 11:04:45,567 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:04:45,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:46,069 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-17 11:04:46,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:46,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126020412] [2025-03-17 11:04:46,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126020412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:04:46,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:04:46,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:04:46,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388629531] [2025-03-17 11:04:46,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:46,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:04:46,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:46,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:04:46,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:04:46,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 160 [2025-03-17 11:04:46,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 358 transitions, 2482 flow. Second operand has 10 states, 10 states have (on average 126.0) internal successors, (1260), 10 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:04:46,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:46,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 160 [2025-03-17 11:04:46,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:47,294 INFO L124 PetriNetUnfolderBase]: 458/1562 cut-off events. [2025-03-17 11:04:47,295 INFO L125 PetriNetUnfolderBase]: For 4284/4330 co-relation queries the response was YES. [2025-03-17 11:04:47,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5969 conditions, 1562 events. 458/1562 cut-off events. For 4284/4330 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 9765 event pairs, 44 based on Foata normal form. 19/1562 useless extension candidates. Maximal degree in co-relation 5682. Up to 662 conditions per place. [2025-03-17 11:04:47,310 INFO L140 encePairwiseOnDemand]: 140/160 looper letters, 165 selfloop transitions, 80 changer transitions 27/424 dead transitions. [2025-03-17 11:04:47,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 424 transitions, 3515 flow [2025-03-17 11:04:47,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:04:47,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 11:04:47,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1234 transitions. [2025-03-17 11:04:47,313 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8569444444444444 [2025-03-17 11:04:47,313 INFO L175 Difference]: Start difference. First operand has 268 places, 358 transitions, 2482 flow. Second operand 9 states and 1234 transitions. [2025-03-17 11:04:47,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 424 transitions, 3515 flow [2025-03-17 11:04:47,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 424 transitions, 3475 flow, removed 12 selfloop flow, removed 6 redundant places. [2025-03-17 11:04:47,346 INFO L231 Difference]: Finished difference. Result has 271 places, 359 transitions, 2649 flow [2025-03-17 11:04:47,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=2447, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2649, PETRI_PLACES=271, PETRI_TRANSITIONS=359} [2025-03-17 11:04:47,348 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 111 predicate places. [2025-03-17 11:04:47,348 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 359 transitions, 2649 flow [2025-03-17 11:04:47,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 126.0) internal successors, (1260), 10 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:04:47,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:47,349 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-03-17 11:04:47,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:04:47,349 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:04:47,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:47,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1319053051, now seen corresponding path program 3 times [2025-03-17 11:04:47,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:47,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418241156] [2025-03-17 11:04:47,350 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:04:47,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:47,363 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 168 statements into 11 equivalence classes. [2025-03-17 11:04:47,374 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 118 of 168 statements. [2025-03-17 11:04:47,374 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 11:04:47,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:47,876 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-17 11:04:47,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:47,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418241156] [2025-03-17 11:04:47,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418241156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:04:47,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:04:47,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:04:47,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161755300] [2025-03-17 11:04:47,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:47,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:04:47,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:47,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:04:47,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:04:48,526 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 160 [2025-03-17 11:04:48,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 359 transitions, 2649 flow. Second operand has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:04:48,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:48,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 160 [2025-03-17 11:04:48,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:49,056 INFO L124 PetriNetUnfolderBase]: 754/2506 cut-off events. [2025-03-17 11:04:49,057 INFO L125 PetriNetUnfolderBase]: For 9057/9185 co-relation queries the response was YES. [2025-03-17 11:04:49,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10262 conditions, 2506 events. 754/2506 cut-off events. For 9057/9185 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 18816 event pairs, 62 based on Foata normal form. 48/2524 useless extension candidates. Maximal degree in co-relation 9972. Up to 612 conditions per place. [2025-03-17 11:04:49,074 INFO L140 encePairwiseOnDemand]: 141/160 looper letters, 329 selfloop transitions, 100 changer transitions 18/603 dead transitions. [2025-03-17 11:04:49,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 603 transitions, 6036 flow [2025-03-17 11:04:49,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:04:49,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 11:04:49,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1402 transitions. [2025-03-17 11:04:49,076 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.87625 [2025-03-17 11:04:49,077 INFO L175 Difference]: Start difference. First operand has 271 places, 359 transitions, 2649 flow. Second operand 10 states and 1402 transitions. [2025-03-17 11:04:49,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 603 transitions, 6036 flow [2025-03-17 11:04:49,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 603 transitions, 5900 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-17 11:04:49,116 INFO L231 Difference]: Finished difference. Result has 282 places, 439 transitions, 4069 flow [2025-03-17 11:04:49,117 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=2584, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4069, PETRI_PLACES=282, PETRI_TRANSITIONS=439} [2025-03-17 11:04:49,117 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 122 predicate places. [2025-03-17 11:04:49,117 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 439 transitions, 4069 flow [2025-03-17 11:04:49,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:04:49,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:49,118 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-03-17 11:04:49,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:04:49,118 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-03-17 11:04:49,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:49,119 INFO L85 PathProgramCache]: Analyzing trace with hash -649698653, now seen corresponding path program 4 times [2025-03-17 11:04:49,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:49,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601180875] [2025-03-17 11:04:49,119 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:04:49,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:49,129 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 168 statements into 2 equivalence classes. [2025-03-17 11:04:49,146 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 168 of 168 statements. [2025-03-17 11:04:49,146 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 11:04:49,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:50,047 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-17 11:04:50,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:50,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601180875] [2025-03-17 11:04:50,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601180875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:04:50,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:04:50,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 11:04:50,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156816369] [2025-03-17 11:04:50,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:50,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 11:04:50,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:50,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 11:04:50,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-17 11:04:52,441 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 160 [2025-03-17 11:04:52,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 439 transitions, 4069 flow. Second operand has 15 states, 15 states have (on average 120.8) internal successors, (1812), 15 states have internal predecessors, (1812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:04:52,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:52,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 160 [2025-03-17 11:04:52,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:53,785 INFO L124 PetriNetUnfolderBase]: 850/2753 cut-off events. [2025-03-17 11:04:53,785 INFO L125 PetriNetUnfolderBase]: For 12937/13101 co-relation queries the response was YES. [2025-03-17 11:04:53,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12017 conditions, 2753 events. 850/2753 cut-off events. For 12937/13101 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 20508 event pairs, 93 based on Foata normal form. 93/2814 useless extension candidates. Maximal degree in co-relation 11721. Up to 1157 conditions per place. [2025-03-17 11:04:53,812 INFO L140 encePairwiseOnDemand]: 134/160 looper letters, 225 selfloop transitions, 174 changer transitions 13/561 dead transitions. [2025-03-17 11:04:53,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 561 transitions, 5826 flow [2025-03-17 11:04:53,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-17 11:04:53,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-17 11:04:53,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 3278 transitions. [2025-03-17 11:04:53,817 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7879807692307692 [2025-03-17 11:04:53,817 INFO L175 Difference]: Start difference. First operand has 282 places, 439 transitions, 4069 flow. Second operand 26 states and 3278 transitions. [2025-03-17 11:04:53,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 561 transitions, 5826 flow [2025-03-17 11:04:53,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 561 transitions, 5798 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-03-17 11:04:53,869 INFO L231 Difference]: Finished difference. Result has 323 places, 479 transitions, 4979 flow [2025-03-17 11:04:53,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=4047, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=4979, PETRI_PLACES=323, PETRI_TRANSITIONS=479} [2025-03-17 11:04:53,870 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 163 predicate places. [2025-03-17 11:04:53,870 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 479 transitions, 4979 flow [2025-03-17 11:04:53,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 120.8) internal successors, (1812), 15 states have internal predecessors, (1812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:04:53,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:53,871 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-03-17 11:04:53,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:04:53,871 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-03-17 11:04:53,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:53,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1054947937, now seen corresponding path program 5 times [2025-03-17 11:04:53,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:53,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881225195] [2025-03-17 11:04:53,872 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 11:04:53,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:53,886 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 168 statements into 11 equivalence classes. [2025-03-17 11:04:53,935 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 168 of 168 statements. [2025-03-17 11:04:53,936 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-17 11:04:53,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:58,197 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:04:58,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:58,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881225195] [2025-03-17 11:04:58,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881225195] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:04:58,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766581843] [2025-03-17 11:04:58,197 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 11:04:58,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:04:58,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:04:58,199 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:04:58,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 11:04:58,262 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 168 statements into 11 equivalence classes. [2025-03-17 11:04:58,336 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 168 of 168 statements. [2025-03-17 11:04:58,336 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-17 11:04:58,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:58,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-03-17 11:04:58,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:04:58,415 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-03-17 11:04:58,532 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-03-17 11:04:58,620 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-17 11:04:58,621 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 22 treesize of output 15 [2025-03-17 11:04:58,689 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-03-17 11:04:58,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2025-03-17 11:04:58,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2025-03-17 11:04:58,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:04:58,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:04:58,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:04:58,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:04:58,977 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:04:58,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 73 [2025-03-17 11:04:59,221 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 11:04:59,222 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:04:59,902 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 21 treesize of output 19 [2025-03-17 11:04:59,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 8 [2025-03-17 11:04:59,908 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-17 11:04:59,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766581843] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 11:04:59,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 11:04:59,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [34, 25] total 49 [2025-03-17 11:04:59,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783564029] [2025-03-17 11:04:59,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:59,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:04:59,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:59,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:04:59,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2243, Unknown=0, NotChecked=0, Total=2450 [2025-03-17 11:05:01,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 160 [2025-03-17 11:05:01,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 479 transitions, 4979 flow. Second operand has 10 states, 10 states have (on average 126.1) internal successors, (1261), 10 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:05:01,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:01,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 160 [2025-03-17 11:05:01,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:04,240 INFO L124 PetriNetUnfolderBase]: 1273/3983 cut-off events. [2025-03-17 11:05:04,240 INFO L125 PetriNetUnfolderBase]: For 25672/25945 co-relation queries the response was YES. [2025-03-17 11:05:04,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19320 conditions, 3983 events. 1273/3983 cut-off events. For 25672/25945 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 32843 event pairs, 50 based on Foata normal form. 115/4071 useless extension candidates. Maximal degree in co-relation 19006. Up to 1053 conditions per place. [2025-03-17 11:05:04,268 INFO L140 encePairwiseOnDemand]: 137/160 looper letters, 374 selfloop transitions, 260 changer transitions 23/820 dead transitions. [2025-03-17 11:05:04,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 820 transitions, 10552 flow [2025-03-17 11:05:04,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 11:05:04,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-17 11:05:04,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2164 transitions. [2025-03-17 11:05:04,270 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8453125 [2025-03-17 11:05:04,270 INFO L175 Difference]: Start difference. First operand has 323 places, 479 transitions, 4979 flow. Second operand 16 states and 2164 transitions. [2025-03-17 11:05:04,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 820 transitions, 10552 flow [2025-03-17 11:05:04,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 820 transitions, 9904 flow, removed 104 selfloop flow, removed 5 redundant places. [2025-03-17 11:05:04,362 INFO L231 Difference]: Finished difference. Result has 345 places, 594 transitions, 7452 flow [2025-03-17 11:05:04,363 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=4653, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=7452, PETRI_PLACES=345, PETRI_TRANSITIONS=594} [2025-03-17 11:05:04,363 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 185 predicate places. [2025-03-17 11:05:04,363 INFO L471 AbstractCegarLoop]: Abstraction has has 345 places, 594 transitions, 7452 flow [2025-03-17 11:05:04,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 126.1) internal successors, (1261), 10 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:05:04,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:04,364 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-03-17 11:05:04,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 11:05:04,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:05:04,564 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-03-17 11:05:04,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:04,565 INFO L85 PathProgramCache]: Analyzing trace with hash -255738827, now seen corresponding path program 6 times [2025-03-17 11:05:04,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:04,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096905525] [2025-03-17 11:05:04,566 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 11:05:04,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:04,585 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 168 statements into 11 equivalence classes. [2025-03-17 11:05:04,594 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 118 of 168 statements. [2025-03-17 11:05:04,594 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-17 11:05:04,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:05,288 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-17 11:05:05,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:05,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096905525] [2025-03-17 11:05:05,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096905525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:05,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:05,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:05:05,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640956502] [2025-03-17 11:05:05,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:05,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:05:05,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:05,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:05:05,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:05:06,435 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 160 [2025-03-17 11:05:06,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 594 transitions, 7452 flow. Second operand has 10 states, 10 states have (on average 126.0) internal successors, (1260), 10 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:05:06,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:06,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 160 [2025-03-17 11:05:06,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:07,492 INFO L124 PetriNetUnfolderBase]: 1332/3996 cut-off events. [2025-03-17 11:05:07,493 INFO L125 PetriNetUnfolderBase]: For 33435/33754 co-relation queries the response was YES. [2025-03-17 11:05:07,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21541 conditions, 3996 events. 1332/3996 cut-off events. For 33435/33754 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 32768 event pairs, 219 based on Foata normal form. 140/4096 useless extension candidates. Maximal degree in co-relation 21215. Up to 1927 conditions per place. [2025-03-17 11:05:07,582 INFO L140 encePairwiseOnDemand]: 140/160 looper letters, 248 selfloop transitions, 254 changer transitions 18/683 dead transitions. [2025-03-17 11:05:07,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 683 transitions, 9712 flow [2025-03-17 11:05:07,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 11:05:07,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-17 11:05:07,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1731 transitions. [2025-03-17 11:05:07,584 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8322115384615385 [2025-03-17 11:05:07,584 INFO L175 Difference]: Start difference. First operand has 345 places, 594 transitions, 7452 flow. Second operand 13 states and 1731 transitions. [2025-03-17 11:05:07,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 683 transitions, 9712 flow [2025-03-17 11:05:07,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 683 transitions, 9584 flow, removed 64 selfloop flow, removed 0 redundant places. [2025-03-17 11:05:07,726 INFO L231 Difference]: Finished difference. Result has 362 places, 625 transitions, 8564 flow [2025-03-17 11:05:07,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=7326, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=594, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=228, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=8564, PETRI_PLACES=362, PETRI_TRANSITIONS=625} [2025-03-17 11:05:07,728 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 202 predicate places. [2025-03-17 11:05:07,728 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 625 transitions, 8564 flow [2025-03-17 11:05:07,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 126.0) internal successors, (1260), 10 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:05:07,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:07,729 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-03-17 11:05:07,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:05:07,729 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-03-17 11:05:07,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:07,730 INFO L85 PathProgramCache]: Analyzing trace with hash -813343781, now seen corresponding path program 7 times [2025-03-17 11:05:07,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:07,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702604828] [2025-03-17 11:05:07,730 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 11:05:07,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:07,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-17 11:05:07,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-17 11:05:07,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:07,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:11,957 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-17 11:05:11,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:11,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702604828] [2025-03-17 11:05:11,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702604828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:11,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:11,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 11:05:11,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687463130] [2025-03-17 11:05:11,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:11,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 11:05:11,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:11,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 11:05:11,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-17 11:05:13,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 160 [2025-03-17 11:05:13,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 625 transitions, 8564 flow. Second operand has 15 states, 15 states have (on average 121.73333333333333) internal successors, (1826), 15 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:05:13,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:13,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 160 [2025-03-17 11:05:13,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:15,092 INFO L124 PetriNetUnfolderBase]: 1236/3869 cut-off events. [2025-03-17 11:05:15,092 INFO L125 PetriNetUnfolderBase]: For 38802/39058 co-relation queries the response was YES. [2025-03-17 11:05:15,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21772 conditions, 3869 events. 1236/3869 cut-off events. For 38802/39058 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 32005 event pairs, 117 based on Foata normal form. 110/3933 useless extension candidates. Maximal degree in co-relation 21438. Up to 1219 conditions per place. [2025-03-17 11:05:15,126 INFO L140 encePairwiseOnDemand]: 135/160 looper letters, 446 selfloop transitions, 209 changer transitions 25/841 dead transitions. [2025-03-17 11:05:15,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 841 transitions, 12304 flow [2025-03-17 11:05:15,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 11:05:15,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-17 11:05:15,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2195 transitions. [2025-03-17 11:05:15,128 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8069852941176471 [2025-03-17 11:05:15,128 INFO L175 Difference]: Start difference. First operand has 362 places, 625 transitions, 8564 flow. Second operand 17 states and 2195 transitions. [2025-03-17 11:05:15,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 841 transitions, 12304 flow [2025-03-17 11:05:15,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 841 transitions, 11995 flow, removed 103 selfloop flow, removed 3 redundant places. [2025-03-17 11:05:15,310 INFO L231 Difference]: Finished difference. Result has 382 places, 659 transitions, 9661 flow [2025-03-17 11:05:15,310 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=8294, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=175, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=9661, PETRI_PLACES=382, PETRI_TRANSITIONS=659} [2025-03-17 11:05:15,310 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 222 predicate places. [2025-03-17 11:05:15,310 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 659 transitions, 9661 flow [2025-03-17 11:05:15,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 121.73333333333333) internal successors, (1826), 15 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:05:15,311 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:15,311 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-03-17 11:05:15,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:05:15,311 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-03-17 11:05:15,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:15,312 INFO L85 PathProgramCache]: Analyzing trace with hash 569634147, now seen corresponding path program 8 times [2025-03-17 11:05:15,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:15,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988677788] [2025-03-17 11:05:15,312 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:05:15,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:15,322 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 168 statements into 2 equivalence classes. [2025-03-17 11:05:15,330 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 118 of 168 statements. [2025-03-17 11:05:15,330 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:05:15,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:15,875 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-17 11:05:15,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:15,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988677788] [2025-03-17 11:05:15,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988677788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:15,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:15,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:05:15,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357498343] [2025-03-17 11:05:15,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:15,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:05:15,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:15,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:05:15,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:05:16,675 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 160 [2025-03-17 11:05:16,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 659 transitions, 9661 flow. Second operand has 10 states, 10 states have (on average 126.0) internal successors, (1260), 10 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:05:16,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:16,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 160 [2025-03-17 11:05:16,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:17,826 INFO L124 PetriNetUnfolderBase]: 1340/4036 cut-off events. [2025-03-17 11:05:17,826 INFO L125 PetriNetUnfolderBase]: For 48702/48952 co-relation queries the response was YES. [2025-03-17 11:05:17,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24019 conditions, 4036 events. 1340/4036 cut-off events. For 48702/48952 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 33300 event pairs, 223 based on Foata normal form. 100/4095 useless extension candidates. Maximal degree in co-relation 23678. Up to 1917 conditions per place. [2025-03-17 11:05:17,858 INFO L140 encePairwiseOnDemand]: 140/160 looper letters, 284 selfloop transitions, 280 changer transitions 18/745 dead transitions. [2025-03-17 11:05:17,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 745 transitions, 12190 flow [2025-03-17 11:05:17,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 11:05:17,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-17 11:05:17,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1850 transitions. [2025-03-17 11:05:17,860 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8258928571428571 [2025-03-17 11:05:17,860 INFO L175 Difference]: Start difference. First operand has 382 places, 659 transitions, 9661 flow. Second operand 14 states and 1850 transitions. [2025-03-17 11:05:17,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 745 transitions, 12190 flow [2025-03-17 11:05:18,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 745 transitions, 11747 flow, removed 111 selfloop flow, removed 7 redundant places. [2025-03-17 11:05:18,072 INFO L231 Difference]: Finished difference. Result has 397 places, 696 transitions, 10812 flow [2025-03-17 11:05:18,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=9232, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=659, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=247, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=10812, PETRI_PLACES=397, PETRI_TRANSITIONS=696} [2025-03-17 11:05:18,073 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 237 predicate places. [2025-03-17 11:05:18,073 INFO L471 AbstractCegarLoop]: Abstraction has has 397 places, 696 transitions, 10812 flow [2025-03-17 11:05:18,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 126.0) internal successors, (1260), 10 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:05:18,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:18,074 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-03-17 11:05:18,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:05:18,074 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-03-17 11:05:18,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:18,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1998258951, now seen corresponding path program 9 times [2025-03-17 11:05:18,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:18,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755252304] [2025-03-17 11:05:18,075 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:05:18,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:18,087 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 168 statements into 11 equivalence classes. [2025-03-17 11:05:18,097 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 118 of 168 statements. [2025-03-17 11:05:18,097 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 11:05:18,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:22,369 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-17 11:05:22,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:22,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755252304] [2025-03-17 11:05:22,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755252304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:22,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:22,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 11:05:22,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557135084] [2025-03-17 11:05:22,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:22,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 11:05:22,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:22,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 11:05:22,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-03-17 11:05:26,300 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 160 [2025-03-17 11:05:26,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 696 transitions, 10812 flow. Second operand has 16 states, 16 states have (on average 112.0625) internal successors, (1793), 16 states have internal predecessors, (1793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:05:26,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:26,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 160 [2025-03-17 11:05:26,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:29,234 INFO L124 PetriNetUnfolderBase]: 1964/5622 cut-off events. [2025-03-17 11:05:29,234 INFO L125 PetriNetUnfolderBase]: For 75669/75962 co-relation queries the response was YES. [2025-03-17 11:05:29,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34830 conditions, 5622 events. 1964/5622 cut-off events. For 75669/75962 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 48405 event pairs, 226 based on Foata normal form. 121/5708 useless extension candidates. Maximal degree in co-relation 34481. Up to 1673 conditions per place. [2025-03-17 11:05:29,283 INFO L140 encePairwiseOnDemand]: 130/160 looper letters, 649 selfloop transitions, 285 changer transitions 37/1110 dead transitions. [2025-03-17 11:05:29,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 1110 transitions, 19182 flow [2025-03-17 11:05:29,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 11:05:29,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-17 11:05:29,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2311 transitions. [2025-03-17 11:05:29,286 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7601973684210527 [2025-03-17 11:05:29,286 INFO L175 Difference]: Start difference. First operand has 397 places, 696 transitions, 10812 flow. Second operand 19 states and 2311 transitions. [2025-03-17 11:05:29,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 1110 transitions, 19182 flow [2025-03-17 11:05:29,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 1110 transitions, 18682 flow, removed 203 selfloop flow, removed 2 redundant places. [2025-03-17 11:05:29,624 INFO L231 Difference]: Finished difference. Result has 424 places, 838 transitions, 14848 flow [2025-03-17 11:05:29,625 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=10521, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=696, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=14848, PETRI_PLACES=424, PETRI_TRANSITIONS=838} [2025-03-17 11:05:29,625 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 264 predicate places. [2025-03-17 11:05:29,625 INFO L471 AbstractCegarLoop]: Abstraction has has 424 places, 838 transitions, 14848 flow [2025-03-17 11:05:29,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 112.0625) internal successors, (1793), 16 states have internal predecessors, (1793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:05:29,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:29,626 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-03-17 11:05:29,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:05:29,626 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-03-17 11:05:29,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:29,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1586657949, now seen corresponding path program 10 times [2025-03-17 11:05:29,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:29,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873611060] [2025-03-17 11:05:29,627 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:05:29,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:29,640 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 168 statements into 2 equivalence classes. [2025-03-17 11:05:29,649 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 168 of 168 statements. [2025-03-17 11:05:29,649 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 11:05:29,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:30,444 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-17 11:05:30,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:30,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873611060] [2025-03-17 11:05:30,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873611060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:30,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:30,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 11:05:30,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035283632] [2025-03-17 11:05:30,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:30,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 11:05:30,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:30,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 11:05:30,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-03-17 11:05:31,947 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 160 [2025-03-17 11:05:31,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 838 transitions, 14848 flow. Second operand has 15 states, 15 states have (on average 120.8) internal successors, (1812), 15 states have internal predecessors, (1812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:05:31,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:31,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 160 [2025-03-17 11:05:31,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:34,156 INFO L124 PetriNetUnfolderBase]: 2288/6611 cut-off events. [2025-03-17 11:05:34,156 INFO L125 PetriNetUnfolderBase]: For 106910/107309 co-relation queries the response was YES. [2025-03-17 11:05:34,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43593 conditions, 6611 events. 2288/6611 cut-off events. For 106910/107309 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 59831 event pairs, 236 based on Foata normal form. 143/6697 useless extension candidates. Maximal degree in co-relation 43234. Up to 2571 conditions per place. [2025-03-17 11:05:34,230 INFO L140 encePairwiseOnDemand]: 134/160 looper letters, 772 selfloop transitions, 291 changer transitions 0/1213 dead transitions. [2025-03-17 11:05:34,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 1213 transitions, 23249 flow [2025-03-17 11:05:34,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-17 11:05:34,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-03-17 11:05:34,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 3544 transitions. [2025-03-17 11:05:34,340 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7910714285714285 [2025-03-17 11:05:34,340 INFO L175 Difference]: Start difference. First operand has 424 places, 838 transitions, 14848 flow. Second operand 28 states and 3544 transitions. [2025-03-17 11:05:34,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 1213 transitions, 23249 flow [2025-03-17 11:05:34,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 1213 transitions, 23037 flow, removed 54 selfloop flow, removed 7 redundant places. [2025-03-17 11:05:34,834 INFO L231 Difference]: Finished difference. Result has 464 places, 978 transitions, 19206 flow [2025-03-17 11:05:34,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=14669, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=838, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=589, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=19206, PETRI_PLACES=464, PETRI_TRANSITIONS=978} [2025-03-17 11:05:34,835 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 304 predicate places. [2025-03-17 11:05:34,835 INFO L471 AbstractCegarLoop]: Abstraction has has 464 places, 978 transitions, 19206 flow [2025-03-17 11:05:34,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 120.8) internal successors, (1812), 15 states have internal predecessors, (1812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:05:34,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:34,835 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-03-17 11:05:34,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:05:34,835 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:05:34,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:34,837 INFO L85 PathProgramCache]: Analyzing trace with hash 507103521, now seen corresponding path program 11 times [2025-03-17 11:05:34,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:34,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407061926] [2025-03-17 11:05:34,837 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 11:05:34,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:34,846 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 168 statements into 11 equivalence classes. [2025-03-17 11:05:34,858 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 168 of 168 statements. [2025-03-17 11:05:34,858 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-17 11:05:34,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:35,324 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-17 11:05:35,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:35,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407061926] [2025-03-17 11:05:35,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407061926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:35,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:35,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:05:35,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484616977] [2025-03-17 11:05:35,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:35,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:05:35,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:35,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:05:35,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:05:36,108 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 160 [2025-03-17 11:05:36,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 978 transitions, 19206 flow. Second operand has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:05:36,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:36,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 160 [2025-03-17 11:05:36,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:38,037 INFO L124 PetriNetUnfolderBase]: 2094/6202 cut-off events. [2025-03-17 11:05:38,037 INFO L125 PetriNetUnfolderBase]: For 116601/117109 co-relation queries the response was YES. [2025-03-17 11:05:38,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42660 conditions, 6202 events. 2094/6202 cut-off events. For 116601/117109 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 57008 event pairs, 316 based on Foata normal form. 297/6427 useless extension candidates. Maximal degree in co-relation 42281. Up to 2955 conditions per place. [2025-03-17 11:05:38,086 INFO L140 encePairwiseOnDemand]: 140/160 looper letters, 351 selfloop transitions, 481 changer transitions 9/1022 dead transitions. [2025-03-17 11:05:38,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 474 places, 1022 transitions, 21523 flow [2025-03-17 11:05:38,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:05:38,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 11:05:38,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1495 transitions. [2025-03-17 11:05:38,088 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8494318181818182 [2025-03-17 11:05:38,088 INFO L175 Difference]: Start difference. First operand has 464 places, 978 transitions, 19206 flow. Second operand 11 states and 1495 transitions. [2025-03-17 11:05:38,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 474 places, 1022 transitions, 21523 flow [2025-03-17 11:05:38,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 468 places, 1022 transitions, 21185 flow, removed 144 selfloop flow, removed 6 redundant places. [2025-03-17 11:05:38,651 INFO L231 Difference]: Finished difference. Result has 470 places, 982 transitions, 19966 flow [2025-03-17 11:05:38,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=18868, PETRI_DIFFERENCE_MINUEND_PLACES=458, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=978, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=477, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=499, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=19966, PETRI_PLACES=470, PETRI_TRANSITIONS=982} [2025-03-17 11:05:38,652 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 310 predicate places. [2025-03-17 11:05:38,652 INFO L471 AbstractCegarLoop]: Abstraction has has 470 places, 982 transitions, 19966 flow [2025-03-17 11:05:38,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:05:38,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:38,652 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-03-17 11:05:38,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 11:05:38,653 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:05:38,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:38,654 INFO L85 PathProgramCache]: Analyzing trace with hash 976767757, now seen corresponding path program 12 times [2025-03-17 11:05:38,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:38,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876938838] [2025-03-17 11:05:38,654 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 11:05:38,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:38,662 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 168 statements into 11 equivalence classes. [2025-03-17 11:05:38,666 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 116 of 168 statements. [2025-03-17 11:05:38,666 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-17 11:05:38,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:39,042 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-03-17 11:05:39,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:39,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876938838] [2025-03-17 11:05:39,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876938838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:39,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:39,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:05:39,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798395063] [2025-03-17 11:05:39,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:39,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:05:39,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:39,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:05:39,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:05:39,936 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 160 [2025-03-17 11:05:39,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 470 places, 982 transitions, 19966 flow. Second operand has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:05:39,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:39,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 160 [2025-03-17 11:05:39,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:42,140 INFO L124 PetriNetUnfolderBase]: 2110/6261 cut-off events. [2025-03-17 11:05:42,140 INFO L125 PetriNetUnfolderBase]: For 129102/129618 co-relation queries the response was YES. [2025-03-17 11:05:42,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44453 conditions, 6261 events. 2110/6261 cut-off events. For 129102/129618 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 57645 event pairs, 312 based on Foata normal form. 271/6456 useless extension candidates. Maximal degree in co-relation 44073. Up to 2931 conditions per place. [2025-03-17 11:05:42,224 INFO L140 encePairwiseOnDemand]: 140/160 looper letters, 391 selfloop transitions, 459 changer transitions 9/1040 dead transitions. [2025-03-17 11:05:42,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 1040 transitions, 22666 flow [2025-03-17 11:05:42,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:05:42,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 11:05:42,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1361 transitions. [2025-03-17 11:05:42,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.850625 [2025-03-17 11:05:42,226 INFO L175 Difference]: Start difference. First operand has 470 places, 982 transitions, 19966 flow. Second operand 10 states and 1361 transitions. [2025-03-17 11:05:42,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 479 places, 1040 transitions, 22666 flow [2025-03-17 11:05:42,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 1040 transitions, 21689 flow, removed 24 selfloop flow, removed 8 redundant places. [2025-03-17 11:05:42,962 INFO L231 Difference]: Finished difference. Result has 475 places, 999 transitions, 20474 flow [2025-03-17 11:05:42,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=19035, PETRI_DIFFERENCE_MINUEND_PLACES=462, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=982, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=442, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=529, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=20474, PETRI_PLACES=475, PETRI_TRANSITIONS=999} [2025-03-17 11:05:42,963 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 315 predicate places. [2025-03-17 11:05:42,963 INFO L471 AbstractCegarLoop]: Abstraction has has 475 places, 999 transitions, 20474 flow [2025-03-17 11:05:42,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:05:42,964 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:42,964 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-03-17 11:05:42,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 11:05:42,964 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:05:42,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:42,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1819052159, now seen corresponding path program 13 times [2025-03-17 11:05:42,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:42,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767335655] [2025-03-17 11:05:42,966 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 11:05:42,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:42,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-17 11:05:42,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-17 11:05:42,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:42,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:46,533 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-03-17 11:05:46,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:46,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767335655] [2025-03-17 11:05:46,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767335655] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:05:46,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560321080] [2025-03-17 11:05:46,534 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 11:05:46,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:05:46,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:05:46,535 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:05:46,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 11:05:46,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-17 11:05:46,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-17 11:05:46,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:46,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:46,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-03-17 11:05:46,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:05:47,010 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-03-17 11:05:47,051 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-03-17 11:05:47,087 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-03-17 11:05:47,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2025-03-17 11:05:47,274 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-17 11:05:47,274 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 22 treesize of output 15 [2025-03-17 11:05:47,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2025-03-17 11:05:47,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:05:47,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:05:47,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:05:47,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:05:47,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:47,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 73 [2025-03-17 11:05:47,579 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 11:05:47,579 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:05:48,074 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-03-17 11:05:48,138 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 21 treesize of output 19 [2025-03-17 11:05:48,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 8 [2025-03-17 11:05:48,142 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2025-03-17 11:05:48,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560321080] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 11:05:48,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 11:05:48,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14, 25] total 46 [2025-03-17 11:05:48,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732377527] [2025-03-17 11:05:48,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:48,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:05:48,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:48,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:05:48,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1987, Unknown=0, NotChecked=0, Total=2162