./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.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 ebedbc62bd44b0c214a81c07c6f99e850a5d96675b77716f8547d1b39e8b2cf8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:57:26,797 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:57:26,843 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 21:57:26,850 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:57:26,850 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:57:26,867 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:57:26,868 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:57:26,868 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:57:26,869 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:57:26,869 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:57:26,869 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:57:26,869 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:57:26,869 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:57:26,870 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:57:26,870 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:57:26,870 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:57:26,870 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:57:26,871 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:57:26,871 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:57:26,871 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:57:26,871 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:57:26,871 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:57:26,871 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 21:57:26,871 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 21:57:26,871 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:57:26,871 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:57:26,871 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:57:26,871 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:57:26,871 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:57:26,871 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:57:26,871 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:57:26,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:57:26,871 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:57:26,871 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:57:26,871 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:57:26,871 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:57:26,871 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:57:26,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:57:26,871 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:57:26,872 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:57:26,872 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:57:26,872 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:57:26,872 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 -> ebedbc62bd44b0c214a81c07c6f99e850a5d96675b77716f8547d1b39e8b2cf8 [2025-03-08 21:57:27,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:57:27,082 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:57:27,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:57:27,084 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:57:27,084 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:57:27,085 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i [2025-03-08 21:57:28,212 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83482b252/0b6399e2329b4ad7933566a2f45fce3d/FLAG6d929a3fd [2025-03-08 21:57:28,508 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:57:28,511 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i [2025-03-08 21:57:28,527 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83482b252/0b6399e2329b4ad7933566a2f45fce3d/FLAG6d929a3fd [2025-03-08 21:57:28,785 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83482b252/0b6399e2329b4ad7933566a2f45fce3d [2025-03-08 21:57:28,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:57:28,788 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:57:28,789 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:57:28,789 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:57:28,793 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:57:28,793 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:57:28" (1/1) ... [2025-03-08 21:57:28,794 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4db9aec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:28, skipping insertion in model container [2025-03-08 21:57:28,794 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:57:28" (1/1) ... [2025-03-08 21:57:28,817 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:57:29,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:57:29,104 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:57:29,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:57:29,190 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:57:29,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:29 WrapperNode [2025-03-08 21:57:29,192 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:57:29,193 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:57:29,193 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:57:29,193 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:57:29,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:29" (1/1) ... [2025-03-08 21:57:29,209 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:29" (1/1) ... [2025-03-08 21:57:29,227 INFO L138 Inliner]: procedures = 263, calls = 70, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 147 [2025-03-08 21:57:29,227 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:57:29,228 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:57:29,228 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:57:29,228 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:57:29,232 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:29" (1/1) ... [2025-03-08 21:57:29,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:29" (1/1) ... [2025-03-08 21:57:29,235 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:29" (1/1) ... [2025-03-08 21:57:29,236 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:29" (1/1) ... [2025-03-08 21:57:29,242 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:29" (1/1) ... [2025-03-08 21:57:29,243 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:29" (1/1) ... [2025-03-08 21:57:29,245 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:29" (1/1) ... [2025-03-08 21:57:29,245 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:29" (1/1) ... [2025-03-08 21:57:29,247 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:57:29,248 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:57:29,248 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:57:29,248 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:57:29,249 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:29" (1/1) ... [2025-03-08 21:57:29,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:57:29,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:57:29,274 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 21:57:29,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 21:57:29,292 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 21:57:29,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 21:57:29,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 21:57:29,292 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 21:57:29,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:57:29,292 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-08 21:57:29,292 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-08 21:57:29,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 21:57:29,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:57:29,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:57:29,293 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 21:57:29,393 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:57:29,395 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:57:29,671 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 21:57:29,672 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:57:29,690 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:57:29,691 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 21:57:29,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:57:29 BoogieIcfgContainer [2025-03-08 21:57:29,691 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:57:29,694 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:57:29,694 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:57:29,697 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:57:29,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:57:28" (1/3) ... [2025-03-08 21:57:29,698 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b426fa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:57:29, skipping insertion in model container [2025-03-08 21:57:29,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:29" (2/3) ... [2025-03-08 21:57:29,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b426fa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:57:29, skipping insertion in model container [2025-03-08 21:57:29,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:57:29" (3/3) ... [2025-03-08 21:57:29,700 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_02-funloop_norace.i [2025-03-08 21:57:29,714 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:57:29,715 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_02-funloop_norace.i that has 2 procedures, 157 locations, 1 initial locations, 3 loop locations, and 4 error locations. [2025-03-08 21:57:29,715 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 21:57:29,768 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 21:57:29,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 159 transitions, 322 flow [2025-03-08 21:57:29,879 INFO L124 PetriNetUnfolderBase]: 3/158 cut-off events. [2025-03-08 21:57:29,881 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:57:29,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 158 events. 3/158 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 129 event pairs, 0 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2025-03-08 21:57:29,886 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 159 transitions, 322 flow [2025-03-08 21:57:29,890 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 158 transitions, 319 flow [2025-03-08 21:57:29,895 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:57:29,908 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;@13729be6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:57:29,909 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-08 21:57:29,934 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:57:29,935 INFO L124 PetriNetUnfolderBase]: 1/117 cut-off events. [2025-03-08 21:57:29,935 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:57:29,935 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:29,935 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] [2025-03-08 21:57:29,936 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-08 21:57:29,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:29,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1988920771, now seen corresponding path program 1 times [2025-03-08 21:57:29,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:29,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920909014] [2025-03-08 21:57:29,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:29,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:30,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 21:57:30,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 21:57:30,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:30,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:30,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:57:30,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:30,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920909014] [2025-03-08 21:57:30,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920909014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:30,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:30,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:57:30,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290506422] [2025-03-08 21:57:30,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:30,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:57:30,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:30,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:57:30,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:57:30,257 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 159 [2025-03-08 21:57:30,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 158 transitions, 319 flow. Second operand has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:30,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:30,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 159 [2025-03-08 21:57:30,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:30,325 INFO L124 PetriNetUnfolderBase]: 11/244 cut-off events. [2025-03-08 21:57:30,325 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 21:57:30,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 244 events. 11/244 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 411 event pairs, 6 based on Foata normal form. 1/230 useless extension candidates. Maximal degree in co-relation 179. Up to 26 conditions per place. [2025-03-08 21:57:30,331 INFO L140 encePairwiseOnDemand]: 156/159 looper letters, 10 selfloop transitions, 2 changer transitions 0/159 dead transitions. [2025-03-08 21:57:30,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 159 transitions, 345 flow [2025-03-08 21:57:30,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:57:30,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:57:30,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2025-03-08 21:57:30,350 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9580712788259959 [2025-03-08 21:57:30,351 INFO L175 Difference]: Start difference. First operand has 159 places, 158 transitions, 319 flow. Second operand 3 states and 457 transitions. [2025-03-08 21:57:30,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 159 transitions, 345 flow [2025-03-08 21:57:30,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 159 transitions, 344 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:57:30,360 INFO L231 Difference]: Finished difference. Result has 161 places, 159 transitions, 330 flow [2025-03-08 21:57:30,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=161, PETRI_TRANSITIONS=159} [2025-03-08 21:57:30,368 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 2 predicate places. [2025-03-08 21:57:30,368 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 159 transitions, 330 flow [2025-03-08 21:57:30,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:30,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:30,369 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:30,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:57:30,370 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-08 21:57:30,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:30,371 INFO L85 PathProgramCache]: Analyzing trace with hash 433133351, now seen corresponding path program 1 times [2025-03-08 21:57:30,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:30,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404068463] [2025-03-08 21:57:30,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:30,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:30,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 21:57:30,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 21:57:30,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:30,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:30,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:57:30,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:30,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404068463] [2025-03-08 21:57:30,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404068463] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:57:30,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041373865] [2025-03-08 21:57:30,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:30,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:57:30,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:57:30,565 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:57:30,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 21:57:30,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 21:57:30,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 21:57:30,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:30,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:30,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 21:57:30,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:57:30,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:57:30,708 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:57:30,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:57:30,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041373865] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:57:30,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:57:30,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-08 21:57:30,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896118416] [2025-03-08 21:57:30,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:57:30,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 21:57:30,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:30,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 21:57:30,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 21:57:30,783 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 159 [2025-03-08 21:57:30,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 159 transitions, 330 flow. Second operand has 10 states, 10 states have (on average 147.0) internal successors, (1470), 10 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:30,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:30,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 159 [2025-03-08 21:57:30,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:30,889 INFO L124 PetriNetUnfolderBase]: 11/251 cut-off events. [2025-03-08 21:57:30,889 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 21:57:30,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 251 events. 11/251 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 400 event pairs, 6 based on Foata normal form. 2/238 useless extension candidates. Maximal degree in co-relation 217. Up to 26 conditions per place. [2025-03-08 21:57:30,891 INFO L140 encePairwiseOnDemand]: 153/159 looper letters, 14 selfloop transitions, 9 changer transitions 0/167 dead transitions. [2025-03-08 21:57:30,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 167 transitions, 394 flow [2025-03-08 21:57:30,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:57:30,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 21:57:30,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1330 transitions. [2025-03-08 21:57:30,894 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9294199860237596 [2025-03-08 21:57:30,894 INFO L175 Difference]: Start difference. First operand has 161 places, 159 transitions, 330 flow. Second operand 9 states and 1330 transitions. [2025-03-08 21:57:30,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 167 transitions, 394 flow [2025-03-08 21:57:30,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 167 transitions, 392 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:57:30,897 INFO L231 Difference]: Finished difference. Result has 171 places, 165 transitions, 378 flow [2025-03-08 21:57:30,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=378, PETRI_PLACES=171, PETRI_TRANSITIONS=165} [2025-03-08 21:57:30,897 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 12 predicate places. [2025-03-08 21:57:30,897 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 165 transitions, 378 flow [2025-03-08 21:57:30,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 147.0) internal successors, (1470), 10 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:30,898 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:30,899 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:30,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 21:57:31,103 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-08 21:57:31,103 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-08 21:57:31,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:31,106 INFO L85 PathProgramCache]: Analyzing trace with hash 188541095, now seen corresponding path program 2 times [2025-03-08 21:57:31,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:31,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322292517] [2025-03-08 21:57:31,106 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:57:31,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:31,117 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 105 statements into 2 equivalence classes. [2025-03-08 21:57:31,130 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 90 of 105 statements. [2025-03-08 21:57:31,130 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:57:31,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:31,529 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-08 21:57:31,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:31,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322292517] [2025-03-08 21:57:31,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322292517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:31,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:31,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:57:31,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962126338] [2025-03-08 21:57:31,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:31,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:57:31,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:31,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:57:31,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:57:31,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 159 [2025-03-08 21:57:31,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 165 transitions, 378 flow. Second operand has 6 states, 6 states have (on average 137.5) internal successors, (825), 6 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:31,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:31,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 159 [2025-03-08 21:57:31,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:31,831 INFO L124 PetriNetUnfolderBase]: 150/828 cut-off events. [2025-03-08 21:57:31,831 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-08 21:57:31,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1156 conditions, 828 events. 150/828 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4582 event pairs, 62 based on Foata normal form. 0/769 useless extension candidates. Maximal degree in co-relation 1045. Up to 240 conditions per place. [2025-03-08 21:57:31,835 INFO L140 encePairwiseOnDemand]: 148/159 looper letters, 30 selfloop transitions, 22 changer transitions 0/194 dead transitions. [2025-03-08 21:57:31,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 194 transitions, 540 flow [2025-03-08 21:57:31,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:57:31,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:57:31,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 869 transitions. [2025-03-08 21:57:31,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.910901467505241 [2025-03-08 21:57:31,838 INFO L175 Difference]: Start difference. First operand has 171 places, 165 transitions, 378 flow. Second operand 6 states and 869 transitions. [2025-03-08 21:57:31,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 194 transitions, 540 flow [2025-03-08 21:57:31,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 194 transitions, 534 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-08 21:57:31,842 INFO L231 Difference]: Finished difference. Result has 180 places, 186 transitions, 522 flow [2025-03-08 21:57:31,842 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=522, PETRI_PLACES=180, PETRI_TRANSITIONS=186} [2025-03-08 21:57:31,843 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 21 predicate places. [2025-03-08 21:57:31,843 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 186 transitions, 522 flow [2025-03-08 21:57:31,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 137.5) internal successors, (825), 6 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:31,844 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:31,844 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:31,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:57:31,844 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:57:31,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:31,845 INFO L85 PathProgramCache]: Analyzing trace with hash 525716816, now seen corresponding path program 1 times [2025-03-08 21:57:31,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:31,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389106392] [2025-03-08 21:57:31,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:31,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:31,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 21:57:31,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 21:57:31,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:31,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:31,990 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-08 21:57:31,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:31,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389106392] [2025-03-08 21:57:31,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389106392] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:57:31,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008948184] [2025-03-08 21:57:31,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:31,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:57:31,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:57:31,993 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:57:31,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 21:57:32,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 21:57:32,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 21:57:32,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:32,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:32,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 21:57:32,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:57:32,129 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-08 21:57:32,130 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:57:32,216 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-08 21:57:32,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008948184] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:57:32,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:57:32,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-08 21:57:32,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323840670] [2025-03-08 21:57:32,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:57:32,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 21:57:32,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:32,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 21:57:32,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-08 21:57:32,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 159 [2025-03-08 21:57:32,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 186 transitions, 522 flow. Second operand has 18 states, 18 states have (on average 147.0) internal successors, (2646), 18 states have internal predecessors, (2646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:32,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:32,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 159 [2025-03-08 21:57:32,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:32,497 INFO L124 PetriNetUnfolderBase]: 58/571 cut-off events. [2025-03-08 21:57:32,497 INFO L125 PetriNetUnfolderBase]: For 50/53 co-relation queries the response was YES. [2025-03-08 21:57:32,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 571 events. 58/571 cut-off events. For 50/53 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2200 event pairs, 11 based on Foata normal form. 4/540 useless extension candidates. Maximal degree in co-relation 669. Up to 63 conditions per place. [2025-03-08 21:57:32,501 INFO L140 encePairwiseOnDemand]: 153/159 looper letters, 18 selfloop transitions, 21 changer transitions 0/204 dead transitions. [2025-03-08 21:57:32,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 204 transitions, 688 flow [2025-03-08 21:57:32,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 21:57:32,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-08 21:57:32,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3088 transitions. [2025-03-08 21:57:32,508 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9248277927523211 [2025-03-08 21:57:32,509 INFO L175 Difference]: Start difference. First operand has 180 places, 186 transitions, 522 flow. Second operand 21 states and 3088 transitions. [2025-03-08 21:57:32,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 204 transitions, 688 flow [2025-03-08 21:57:32,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 204 transitions, 688 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:57:32,518 INFO L231 Difference]: Finished difference. Result has 205 places, 199 transitions, 652 flow [2025-03-08 21:57:32,518 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=652, PETRI_PLACES=205, PETRI_TRANSITIONS=199} [2025-03-08 21:57:32,519 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 46 predicate places. [2025-03-08 21:57:32,519 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 199 transitions, 652 flow [2025-03-08 21:57:32,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 147.0) internal successors, (2646), 18 states have internal predecessors, (2646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:32,520 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:32,521 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:32,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 21:57:32,721 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-08 21:57:32,721 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:57:32,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:32,723 INFO L85 PathProgramCache]: Analyzing trace with hash -367144880, now seen corresponding path program 2 times [2025-03-08 21:57:32,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:32,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252938027] [2025-03-08 21:57:32,723 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:57:32,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:32,735 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 125 statements into 2 equivalence classes. [2025-03-08 21:57:32,740 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 90 of 125 statements. [2025-03-08 21:57:32,741 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:57:32,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:32,989 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-08 21:57:32,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:32,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252938027] [2025-03-08 21:57:32,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252938027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:32,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:32,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:57:32,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047764948] [2025-03-08 21:57:32,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:32,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:57:32,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:32,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:57:32,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:57:33,110 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 159 [2025-03-08 21:57:33,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 199 transitions, 652 flow. Second operand has 6 states, 6 states have (on average 137.5) internal successors, (825), 6 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:33,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:33,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 159 [2025-03-08 21:57:33,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:33,277 INFO L124 PetriNetUnfolderBase]: 206/1098 cut-off events. [2025-03-08 21:57:33,278 INFO L125 PetriNetUnfolderBase]: For 224/244 co-relation queries the response was YES. [2025-03-08 21:57:33,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1886 conditions, 1098 events. 206/1098 cut-off events. For 224/244 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 6584 event pairs, 62 based on Foata normal form. 5/1041 useless extension candidates. Maximal degree in co-relation 1691. Up to 330 conditions per place. [2025-03-08 21:57:33,285 INFO L140 encePairwiseOnDemand]: 148/159 looper letters, 47 selfloop transitions, 30 changer transitions 0/236 dead transitions. [2025-03-08 21:57:33,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 236 transitions, 922 flow [2025-03-08 21:57:33,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:57:33,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:57:33,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 869 transitions. [2025-03-08 21:57:33,287 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.910901467505241 [2025-03-08 21:57:33,287 INFO L175 Difference]: Start difference. First operand has 205 places, 199 transitions, 652 flow. Second operand 6 states and 869 transitions. [2025-03-08 21:57:33,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 236 transitions, 922 flow [2025-03-08 21:57:33,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 236 transitions, 898 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-08 21:57:33,293 INFO L231 Difference]: Finished difference. Result has 209 places, 228 transitions, 878 flow [2025-03-08 21:57:33,294 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=878, PETRI_PLACES=209, PETRI_TRANSITIONS=228} [2025-03-08 21:57:33,296 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 50 predicate places. [2025-03-08 21:57:33,296 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 228 transitions, 878 flow [2025-03-08 21:57:33,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 137.5) internal successors, (825), 6 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:33,297 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:33,297 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:33,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:57:33,297 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:57:33,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:33,298 INFO L85 PathProgramCache]: Analyzing trace with hash -129760487, now seen corresponding path program 1 times [2025-03-08 21:57:33,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:33,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720988238] [2025-03-08 21:57:33,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:33,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:33,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 21:57:33,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 21:57:33,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:33,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:33,585 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-08 21:57:33,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:33,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720988238] [2025-03-08 21:57:33,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720988238] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:57:33,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37896606] [2025-03-08 21:57:33,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:33,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:57:33,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:57:33,588 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:57:33,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 21:57:33,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 21:57:33,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 21:57:33,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:33,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:33,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 21:57:33,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:57:33,758 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-08 21:57:33,758 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:57:33,929 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-08 21:57:33,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37896606] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:57:33,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:57:33,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-08 21:57:33,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055025066] [2025-03-08 21:57:33,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:57:33,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 21:57:33,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:33,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 21:57:33,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-08 21:57:33,958 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 159 [2025-03-08 21:57:33,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 228 transitions, 878 flow. Second operand has 23 states, 23 states have (on average 147.08695652173913) internal successors, (3383), 23 states have internal predecessors, (3383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:33,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:33,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 159 [2025-03-08 21:57:33,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:34,294 INFO L124 PetriNetUnfolderBase]: 114/841 cut-off events. [2025-03-08 21:57:34,294 INFO L125 PetriNetUnfolderBase]: For 345/358 co-relation queries the response was YES. [2025-03-08 21:57:34,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1576 conditions, 841 events. 114/841 cut-off events. For 345/358 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4317 event pairs, 14 based on Foata normal form. 8/811 useless extension candidates. Maximal degree in co-relation 1300. Up to 84 conditions per place. [2025-03-08 21:57:34,299 INFO L140 encePairwiseOnDemand]: 153/159 looper letters, 21 selfloop transitions, 30 changer transitions 0/245 dead transitions. [2025-03-08 21:57:34,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 245 transitions, 1102 flow [2025-03-08 21:57:34,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-08 21:57:34,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-08 21:57:34,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 4404 transitions. [2025-03-08 21:57:34,306 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9232704402515723 [2025-03-08 21:57:34,306 INFO L175 Difference]: Start difference. First operand has 209 places, 228 transitions, 878 flow. Second operand 30 states and 4404 transitions. [2025-03-08 21:57:34,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 245 transitions, 1102 flow [2025-03-08 21:57:34,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 245 transitions, 1102 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:57:34,312 INFO L231 Difference]: Finished difference. Result has 242 places, 238 transitions, 1030 flow [2025-03-08 21:57:34,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=878, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1030, PETRI_PLACES=242, PETRI_TRANSITIONS=238} [2025-03-08 21:57:34,313 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 83 predicate places. [2025-03-08 21:57:34,313 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 238 transitions, 1030 flow [2025-03-08 21:57:34,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 147.08695652173913) internal successors, (3383), 23 states have internal predecessors, (3383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:34,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:34,315 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:34,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 21:57:34,515 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-08 21:57:34,515 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:57:34,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:34,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1886927285, now seen corresponding path program 2 times [2025-03-08 21:57:34,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:34,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941989099] [2025-03-08 21:57:34,516 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:57:34,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:34,527 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 148 statements into 2 equivalence classes. [2025-03-08 21:57:34,532 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 98 of 148 statements. [2025-03-08 21:57:34,532 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:57:34,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:34,751 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-08 21:57:34,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:34,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941989099] [2025-03-08 21:57:34,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941989099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:34,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:34,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:57:34,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629289451] [2025-03-08 21:57:34,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:34,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:57:34,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:34,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:57:34,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:57:34,825 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 159 [2025-03-08 21:57:34,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 238 transitions, 1030 flow. Second operand has 6 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:34,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:34,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 159 [2025-03-08 21:57:34,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:35,074 INFO L124 PetriNetUnfolderBase]: 422/1653 cut-off events. [2025-03-08 21:57:35,074 INFO L125 PetriNetUnfolderBase]: For 1006/1048 co-relation queries the response was YES. [2025-03-08 21:57:35,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3663 conditions, 1653 events. 422/1653 cut-off events. For 1006/1048 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 10549 event pairs, 107 based on Foata normal form. 12/1574 useless extension candidates. Maximal degree in co-relation 3386. Up to 718 conditions per place. [2025-03-08 21:57:35,081 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 76 selfloop transitions, 57 changer transitions 0/293 dead transitions. [2025-03-08 21:57:35,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 293 transitions, 1540 flow [2025-03-08 21:57:35,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:57:35,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:57:35,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 855 transitions. [2025-03-08 21:57:35,085 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8962264150943396 [2025-03-08 21:57:35,085 INFO L175 Difference]: Start difference. First operand has 242 places, 238 transitions, 1030 flow. Second operand 6 states and 855 transitions. [2025-03-08 21:57:35,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 293 transitions, 1540 flow [2025-03-08 21:57:35,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 293 transitions, 1494 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-03-08 21:57:35,097 INFO L231 Difference]: Finished difference. Result has 234 places, 285 transitions, 1482 flow [2025-03-08 21:57:35,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=984, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1482, PETRI_PLACES=234, PETRI_TRANSITIONS=285} [2025-03-08 21:57:35,098 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 75 predicate places. [2025-03-08 21:57:35,098 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 285 transitions, 1482 flow [2025-03-08 21:57:35,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:35,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:35,099 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:35,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 21:57:35,099 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-08 21:57:35,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:35,100 INFO L85 PathProgramCache]: Analyzing trace with hash -2013589520, now seen corresponding path program 1 times [2025-03-08 21:57:35,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:35,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805295809] [2025-03-08 21:57:35,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:35,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:35,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 21:57:35,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 21:57:35,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:35,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:35,422 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-08 21:57:35,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:35,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805295809] [2025-03-08 21:57:35,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805295809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:35,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:35,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:57:35,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849945113] [2025-03-08 21:57:35,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:35,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:57:35,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:35,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:57:35,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:57:35,514 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 159 [2025-03-08 21:57:35,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 285 transitions, 1482 flow. Second operand has 6 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:35,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:35,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 159 [2025-03-08 21:57:35,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:35,846 INFO L124 PetriNetUnfolderBase]: 542/2093 cut-off events. [2025-03-08 21:57:35,846 INFO L125 PetriNetUnfolderBase]: For 2297/2353 co-relation queries the response was YES. [2025-03-08 21:57:35,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5260 conditions, 2093 events. 542/2093 cut-off events. For 2297/2353 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 14590 event pairs, 113 based on Foata normal form. 13/2020 useless extension candidates. Maximal degree in co-relation 5000. Up to 894 conditions per place. [2025-03-08 21:57:35,857 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 113 selfloop transitions, 71 changer transitions 0/346 dead transitions. [2025-03-08 21:57:35,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 346 transitions, 2204 flow [2025-03-08 21:57:35,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:57:35,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:57:35,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 855 transitions. [2025-03-08 21:57:35,859 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8962264150943396 [2025-03-08 21:57:35,859 INFO L175 Difference]: Start difference. First operand has 234 places, 285 transitions, 1482 flow. Second operand 6 states and 855 transitions. [2025-03-08 21:57:35,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 346 transitions, 2204 flow [2025-03-08 21:57:35,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 346 transitions, 2140 flow, removed 32 selfloop flow, removed 0 redundant places. [2025-03-08 21:57:35,874 INFO L231 Difference]: Finished difference. Result has 244 places, 338 transitions, 2094 flow [2025-03-08 21:57:35,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=1424, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2094, PETRI_PLACES=244, PETRI_TRANSITIONS=338} [2025-03-08 21:57:35,877 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 85 predicate places. [2025-03-08 21:57:35,877 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 338 transitions, 2094 flow [2025-03-08 21:57:35,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:35,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:35,878 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:35,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 21:57:35,878 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:57:35,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:35,879 INFO L85 PathProgramCache]: Analyzing trace with hash 476073459, now seen corresponding path program 1 times [2025-03-08 21:57:35,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:35,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723796434] [2025-03-08 21:57:35,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:35,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:35,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 21:57:35,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 21:57:35,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:35,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:36,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-08 21:57:36,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:36,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723796434] [2025-03-08 21:57:36,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723796434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:36,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:36,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 21:57:36,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402134745] [2025-03-08 21:57:36,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:36,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 21:57:36,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:36,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 21:57:36,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 21:57:37,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-08 21:57:37,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 338 transitions, 2094 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:37,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:37,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-08 21:57:37,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:37,982 INFO L124 PetriNetUnfolderBase]: 1064/4158 cut-off events. [2025-03-08 21:57:37,982 INFO L125 PetriNetUnfolderBase]: For 5423/5551 co-relation queries the response was YES. [2025-03-08 21:57:37,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11502 conditions, 4158 events. 1064/4158 cut-off events. For 5423/5551 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 33116 event pairs, 151 based on Foata normal form. 45/4180 useless extension candidates. Maximal degree in co-relation 11225. Up to 580 conditions per place. [2025-03-08 21:57:38,006 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 68 selfloop transitions, 15 changer transitions 3/397 dead transitions. [2025-03-08 21:57:38,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 397 transitions, 2384 flow [2025-03-08 21:57:38,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:57:38,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 21:57:38,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1277 transitions. [2025-03-08 21:57:38,008 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8923829489867225 [2025-03-08 21:57:38,008 INFO L175 Difference]: Start difference. First operand has 244 places, 338 transitions, 2094 flow. Second operand 9 states and 1277 transitions. [2025-03-08 21:57:38,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 397 transitions, 2384 flow [2025-03-08 21:57:38,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 397 transitions, 2302 flow, removed 41 selfloop flow, removed 0 redundant places. [2025-03-08 21:57:38,040 INFO L231 Difference]: Finished difference. Result has 259 places, 353 transitions, 2130 flow [2025-03-08 21:57:38,041 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=2012, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2130, PETRI_PLACES=259, PETRI_TRANSITIONS=353} [2025-03-08 21:57:38,041 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 100 predicate places. [2025-03-08 21:57:38,041 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 353 transitions, 2130 flow [2025-03-08 21:57:38,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:38,042 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:38,042 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:38,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 21:57:38,042 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:57:38,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:38,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1884975981, now seen corresponding path program 2 times [2025-03-08 21:57:38,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:38,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882019071] [2025-03-08 21:57:38,043 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:57:38,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:38,055 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 159 statements into 2 equivalence classes. [2025-03-08 21:57:38,062 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-03-08 21:57:38,062 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:57:38,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:38,319 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-08 21:57:38,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:38,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882019071] [2025-03-08 21:57:38,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882019071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:38,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:38,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 21:57:38,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711031557] [2025-03-08 21:57:38,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:38,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 21:57:38,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:38,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 21:57:38,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 21:57:39,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-08 21:57:39,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 353 transitions, 2130 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:39,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:39,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-08 21:57:39,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:40,425 INFO L124 PetriNetUnfolderBase]: 2043/7618 cut-off events. [2025-03-08 21:57:40,426 INFO L125 PetriNetUnfolderBase]: For 10660/10922 co-relation queries the response was YES. [2025-03-08 21:57:40,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22390 conditions, 7618 events. 2043/7618 cut-off events. For 10660/10922 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 68419 event pairs, 280 based on Foata normal form. 85/7653 useless extension candidates. Maximal degree in co-relation 22105. Up to 1204 conditions per place. [2025-03-08 21:57:40,474 INFO L140 encePairwiseOnDemand]: 145/159 looper letters, 107 selfloop transitions, 20 changer transitions 6/444 dead transitions. [2025-03-08 21:57:40,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 444 transitions, 2796 flow [2025-03-08 21:57:40,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:57:40,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 21:57:40,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1276 transitions. [2025-03-08 21:57:40,476 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8916841369671559 [2025-03-08 21:57:40,476 INFO L175 Difference]: Start difference. First operand has 259 places, 353 transitions, 2130 flow. Second operand 9 states and 1276 transitions. [2025-03-08 21:57:40,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 444 transitions, 2796 flow [2025-03-08 21:57:40,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 444 transitions, 2796 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:57:40,523 INFO L231 Difference]: Finished difference. Result has 274 places, 370 transitions, 2310 flow [2025-03-08 21:57:40,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=2130, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2310, PETRI_PLACES=274, PETRI_TRANSITIONS=370} [2025-03-08 21:57:40,524 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 115 predicate places. [2025-03-08 21:57:40,524 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 370 transitions, 2310 flow [2025-03-08 21:57:40,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:40,525 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:40,525 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:40,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 21:57:40,525 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:57:40,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:40,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1125012511, now seen corresponding path program 3 times [2025-03-08 21:57:40,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:40,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516773492] [2025-03-08 21:57:40,526 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 21:57:40,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:40,540 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 159 statements into 11 equivalence classes. [2025-03-08 21:57:40,547 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-03-08 21:57:40,547 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 21:57:40,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:40,832 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-08 21:57:40,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:40,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516773492] [2025-03-08 21:57:40,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516773492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:40,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:40,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 21:57:40,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001358146] [2025-03-08 21:57:40,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:40,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 21:57:40,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:40,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 21:57:40,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 21:57:41,820 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-08 21:57:41,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 370 transitions, 2310 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:41,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:41,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-08 21:57:41,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:43,154 INFO L124 PetriNetUnfolderBase]: 2340/8659 cut-off events. [2025-03-08 21:57:43,154 INFO L125 PetriNetUnfolderBase]: For 14349/14746 co-relation queries the response was YES. [2025-03-08 21:57:43,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26794 conditions, 8659 events. 2340/8659 cut-off events. For 14349/14746 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 79094 event pairs, 290 based on Foata normal form. 94/8697 useless extension candidates. Maximal degree in co-relation 26501. Up to 1318 conditions per place. [2025-03-08 21:57:43,226 INFO L140 encePairwiseOnDemand]: 145/159 looper letters, 119 selfloop transitions, 22 changer transitions 2/454 dead transitions. [2025-03-08 21:57:43,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 454 transitions, 3094 flow [2025-03-08 21:57:43,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:57:43,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 21:57:43,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1281 transitions. [2025-03-08 21:57:43,230 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8951781970649895 [2025-03-08 21:57:43,230 INFO L175 Difference]: Start difference. First operand has 274 places, 370 transitions, 2310 flow. Second operand 9 states and 1281 transitions. [2025-03-08 21:57:43,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 454 transitions, 3094 flow [2025-03-08 21:57:43,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 454 transitions, 3056 flow, removed 19 selfloop flow, removed 0 redundant places. [2025-03-08 21:57:43,309 INFO L231 Difference]: Finished difference. Result has 287 places, 382 transitions, 2479 flow [2025-03-08 21:57:43,309 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=2296, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2479, PETRI_PLACES=287, PETRI_TRANSITIONS=382} [2025-03-08 21:57:43,310 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 128 predicate places. [2025-03-08 21:57:43,310 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 382 transitions, 2479 flow [2025-03-08 21:57:43,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:43,310 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:43,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] [2025-03-08 21:57:43,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 21:57:43,311 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:57:43,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:43,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1620779797, now seen corresponding path program 4 times [2025-03-08 21:57:43,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:43,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247066310] [2025-03-08 21:57:43,312 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 21:57:43,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:43,327 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 159 statements into 2 equivalence classes. [2025-03-08 21:57:43,357 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 21:57:43,360 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 21:57:43,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:44,475 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-08 21:57:44,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:44,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247066310] [2025-03-08 21:57:44,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247066310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:44,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:44,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 21:57:44,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153820332] [2025-03-08 21:57:44,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:44,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 21:57:44,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:44,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 21:57:44,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-03-08 21:57:45,755 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 159 [2025-03-08 21:57:45,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 382 transitions, 2479 flow. Second operand has 15 states, 15 states have (on average 117.53333333333333) internal successors, (1763), 15 states have internal predecessors, (1763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:45,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:45,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 159 [2025-03-08 21:57:45,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:48,254 INFO L124 PetriNetUnfolderBase]: 4335/12704 cut-off events. [2025-03-08 21:57:48,254 INFO L125 PetriNetUnfolderBase]: For 34829/35231 co-relation queries the response was YES. [2025-03-08 21:57:48,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46187 conditions, 12704 events. 4335/12704 cut-off events. For 34829/35231 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 113798 event pairs, 834 based on Foata normal form. 151/12748 useless extension candidates. Maximal degree in co-relation 45888. Up to 3023 conditions per place. [2025-03-08 21:57:48,369 INFO L140 encePairwiseOnDemand]: 132/159 looper letters, 612 selfloop transitions, 143 changer transitions 6/931 dead transitions. [2025-03-08 21:57:48,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 931 transitions, 8571 flow [2025-03-08 21:57:48,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 21:57:48,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-08 21:57:48,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2255 transitions. [2025-03-08 21:57:48,373 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8342582315945246 [2025-03-08 21:57:48,373 INFO L175 Difference]: Start difference. First operand has 287 places, 382 transitions, 2479 flow. Second operand 17 states and 2255 transitions. [2025-03-08 21:57:48,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 931 transitions, 8571 flow [2025-03-08 21:57:48,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 931 transitions, 8426 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-03-08 21:57:48,500 INFO L231 Difference]: Finished difference. Result has 313 places, 511 transitions, 4454 flow [2025-03-08 21:57:48,501 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=2453, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=4454, PETRI_PLACES=313, PETRI_TRANSITIONS=511} [2025-03-08 21:57:48,502 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 154 predicate places. [2025-03-08 21:57:48,502 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 511 transitions, 4454 flow [2025-03-08 21:57:48,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 117.53333333333333) internal successors, (1763), 15 states have internal predecessors, (1763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:48,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:48,504 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:48,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 21:57:48,504 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:57:48,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:48,505 INFO L85 PathProgramCache]: Analyzing trace with hash -579763471, now seen corresponding path program 1 times [2025-03-08 21:57:48,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:48,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422248935] [2025-03-08 21:57:48,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:48,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:48,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 21:57:48,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 21:57:48,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:48,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:48,825 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-08 21:57:48,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:48,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422248935] [2025-03-08 21:57:48,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422248935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:48,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:48,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 21:57:48,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077009225] [2025-03-08 21:57:48,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:48,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 21:57:48,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:48,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 21:57:48,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 21:57:49,632 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-08 21:57:49,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 511 transitions, 4454 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:49,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:49,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-08 21:57:49,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:51,476 INFO L124 PetriNetUnfolderBase]: 3085/11186 cut-off events. [2025-03-08 21:57:51,476 INFO L125 PetriNetUnfolderBase]: For 34656/35415 co-relation queries the response was YES. [2025-03-08 21:57:51,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38952 conditions, 11186 events. 3085/11186 cut-off events. For 34656/35415 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 107972 event pairs, 310 based on Foata normal form. 143/11237 useless extension candidates. Maximal degree in co-relation 38641. Up to 1753 conditions per place. [2025-03-08 21:57:51,559 INFO L140 encePairwiseOnDemand]: 145/159 looper letters, 142 selfloop transitions, 42 changer transitions 1/594 dead transitions. [2025-03-08 21:57:51,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 594 transitions, 5518 flow [2025-03-08 21:57:51,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:57:51,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 21:57:51,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1284 transitions. [2025-03-08 21:57:51,561 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8972746331236897 [2025-03-08 21:57:51,561 INFO L175 Difference]: Start difference. First operand has 313 places, 511 transitions, 4454 flow. Second operand 9 states and 1284 transitions. [2025-03-08 21:57:51,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 594 transitions, 5518 flow [2025-03-08 21:57:51,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 594 transitions, 5414 flow, removed 23 selfloop flow, removed 2 redundant places. [2025-03-08 21:57:51,712 INFO L231 Difference]: Finished difference. Result has 325 places, 527 transitions, 4729 flow [2025-03-08 21:57:51,712 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=4393, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=511, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=474, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4729, PETRI_PLACES=325, PETRI_TRANSITIONS=527} [2025-03-08 21:57:51,713 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 166 predicate places. [2025-03-08 21:57:51,713 INFO L471 AbstractCegarLoop]: Abstraction has has 325 places, 527 transitions, 4729 flow [2025-03-08 21:57:51,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:51,713 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:51,713 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:51,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 21:57:51,713 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:57:51,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:51,714 INFO L85 PathProgramCache]: Analyzing trace with hash -215192421, now seen corresponding path program 5 times [2025-03-08 21:57:51,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:51,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746368710] [2025-03-08 21:57:51,714 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 21:57:51,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:51,723 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 159 statements into 11 equivalence classes. [2025-03-08 21:57:51,734 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 21:57:51,735 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-08 21:57:51,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:52,222 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-03-08 21:57:52,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:52,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746368710] [2025-03-08 21:57:52,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746368710] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:57:52,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527519213] [2025-03-08 21:57:52,223 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 21:57:52,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:57:52,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:57:52,225 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:57:52,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 21:57:52,287 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 159 statements into 11 equivalence classes. [2025-03-08 21:57:52,338 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 21:57:52,339 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-08 21:57:52,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:52,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 21:57:52,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:57:52,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 21:57:52,636 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-08 21:57:52,637 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 21:57:52,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527519213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:52,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 21:57:52,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2025-03-08 21:57:52,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715081197] [2025-03-08 21:57:52,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:52,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 21:57:52,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:52,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 21:57:52,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-03-08 21:57:53,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-08 21:57:53,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 527 transitions, 4729 flow. Second operand has 10 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:53,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:53,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-08 21:57:53,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:55,775 INFO L124 PetriNetUnfolderBase]: 3411/12435 cut-off events. [2025-03-08 21:57:55,775 INFO L125 PetriNetUnfolderBase]: For 42620/43369 co-relation queries the response was YES. [2025-03-08 21:57:55,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44350 conditions, 12435 events. 3411/12435 cut-off events. For 42620/43369 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 123195 event pairs, 334 based on Foata normal form. 148/12490 useless extension candidates. Maximal degree in co-relation 44032. Up to 2022 conditions per place. [2025-03-08 21:57:55,895 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 159 selfloop transitions, 44 changer transitions 2/614 dead transitions. [2025-03-08 21:57:55,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 614 transitions, 5929 flow [2025-03-08 21:57:55,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 21:57:55,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-08 21:57:55,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1416 transitions. [2025-03-08 21:57:55,897 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8905660377358491 [2025-03-08 21:57:55,897 INFO L175 Difference]: Start difference. First operand has 325 places, 527 transitions, 4729 flow. Second operand 10 states and 1416 transitions. [2025-03-08 21:57:55,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 614 transitions, 5929 flow [2025-03-08 21:57:56,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 614 transitions, 5816 flow, removed 24 selfloop flow, removed 2 redundant places. [2025-03-08 21:57:56,103 INFO L231 Difference]: Finished difference. Result has 338 places, 545 transitions, 5017 flow [2025-03-08 21:57:56,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=4651, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=527, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=488, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5017, PETRI_PLACES=338, PETRI_TRANSITIONS=545} [2025-03-08 21:57:56,104 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 179 predicate places. [2025-03-08 21:57:56,104 INFO L471 AbstractCegarLoop]: Abstraction has has 338 places, 545 transitions, 5017 flow [2025-03-08 21:57:56,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:56,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:56,104 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:56,110 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-08 21:57:56,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:57:56,305 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:57:56,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:56,306 INFO L85 PathProgramCache]: Analyzing trace with hash -522124029, now seen corresponding path program 6 times [2025-03-08 21:57:56,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:56,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68840863] [2025-03-08 21:57:56,306 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 21:57:56,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:56,321 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 159 statements into 11 equivalence classes. [2025-03-08 21:57:56,327 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-03-08 21:57:56,327 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-08 21:57:56,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:56,564 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-08 21:57:56,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:56,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68840863] [2025-03-08 21:57:56,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68840863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:56,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:56,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 21:57:56,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128547579] [2025-03-08 21:57:56,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:56,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 21:57:56,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:56,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 21:57:56,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 21:57:57,497 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-08 21:57:57,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 545 transitions, 5017 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:57,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:57,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-08 21:57:57,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:59,754 INFO L124 PetriNetUnfolderBase]: 3770/13637 cut-off events. [2025-03-08 21:57:59,754 INFO L125 PetriNetUnfolderBase]: For 51778/52691 co-relation queries the response was YES. [2025-03-08 21:57:59,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49697 conditions, 13637 events. 3770/13637 cut-off events. For 51778/52691 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 137997 event pairs, 416 based on Foata normal form. 153/13668 useless extension candidates. Maximal degree in co-relation 49372. Up to 2177 conditions per place. [2025-03-08 21:57:59,899 INFO L140 encePairwiseOnDemand]: 145/159 looper letters, 158 selfloop transitions, 53 changer transitions 0/620 dead transitions. [2025-03-08 21:57:59,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 620 transitions, 6229 flow [2025-03-08 21:57:59,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:57:59,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 21:57:59,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1286 transitions. [2025-03-08 21:57:59,901 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8986722571628232 [2025-03-08 21:57:59,901 INFO L175 Difference]: Start difference. First operand has 338 places, 545 transitions, 5017 flow. Second operand 9 states and 1286 transitions. [2025-03-08 21:57:59,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 620 transitions, 6229 flow [2025-03-08 21:58:00,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 620 transitions, 6141 flow, removed 19 selfloop flow, removed 3 redundant places. [2025-03-08 21:58:00,153 INFO L231 Difference]: Finished difference. Result has 350 places, 568 transitions, 5486 flow [2025-03-08 21:58:00,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=4951, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=501, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5486, PETRI_PLACES=350, PETRI_TRANSITIONS=568} [2025-03-08 21:58:00,154 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 191 predicate places. [2025-03-08 21:58:00,154 INFO L471 AbstractCegarLoop]: Abstraction has has 350 places, 568 transitions, 5486 flow [2025-03-08 21:58:00,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:00,154 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:00,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, 1, 1, 1, 1, 1] [2025-03-08 21:58:00,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 21:58:00,155 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:58:00,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:00,156 INFO L85 PathProgramCache]: Analyzing trace with hash -702967217, now seen corresponding path program 7 times [2025-03-08 21:58:00,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:00,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134119189] [2025-03-08 21:58:00,156 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 21:58:00,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:00,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 21:58:00,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 21:58:00,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:58:00,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:00,355 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-08 21:58:00,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:00,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134119189] [2025-03-08 21:58:00,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134119189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:00,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:00,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 21:58:00,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738282652] [2025-03-08 21:58:00,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:00,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 21:58:00,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:00,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 21:58:00,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 21:58:00,796 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-08 21:58:00,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 568 transitions, 5486 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:00,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:00,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-08 21:58:00,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:03,167 INFO L124 PetriNetUnfolderBase]: 4376/15596 cut-off events. [2025-03-08 21:58:03,167 INFO L125 PetriNetUnfolderBase]: For 65697/66731 co-relation queries the response was YES. [2025-03-08 21:58:03,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58157 conditions, 15596 events. 4376/15596 cut-off events. For 65697/66731 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 163209 event pairs, 427 based on Foata normal form. 184/15644 useless extension candidates. Maximal degree in co-relation 57826. Up to 2559 conditions per place. [2025-03-08 21:58:03,341 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 185 selfloop transitions, 58 changer transitions 0/652 dead transitions. [2025-03-08 21:58:03,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 652 transitions, 6901 flow [2025-03-08 21:58:03,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:58:03,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 21:58:03,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1288 transitions. [2025-03-08 21:58:03,343 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9000698812019566 [2025-03-08 21:58:03,343 INFO L175 Difference]: Start difference. First operand has 350 places, 568 transitions, 5486 flow. Second operand 9 states and 1288 transitions. [2025-03-08 21:58:03,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 652 transitions, 6901 flow [2025-03-08 21:58:03,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 652 transitions, 6803 flow, removed 49 selfloop flow, removed 0 redundant places. [2025-03-08 21:58:03,666 INFO L231 Difference]: Finished difference. Result has 365 places, 586 transitions, 5906 flow [2025-03-08 21:58:03,666 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=5388, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=515, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5906, PETRI_PLACES=365, PETRI_TRANSITIONS=586} [2025-03-08 21:58:03,667 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 206 predicate places. [2025-03-08 21:58:03,667 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 586 transitions, 5906 flow [2025-03-08 21:58:03,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:03,667 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:03,668 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:58:03,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 21:58:03,668 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:58:03,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:03,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1403960185, now seen corresponding path program 8 times [2025-03-08 21:58:03,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:03,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613168280] [2025-03-08 21:58:03,669 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:58:03,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:03,677 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 159 statements into 2 equivalence classes. [2025-03-08 21:58:03,684 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-03-08 21:58:03,684 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:58:03,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:03,822 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-08 21:58:03,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:03,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613168280] [2025-03-08 21:58:03,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613168280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:03,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:03,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 21:58:03,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358542257] [2025-03-08 21:58:03,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:03,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 21:58:03,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:03,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 21:58:03,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 21:58:04,434 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-08 21:58:04,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 586 transitions, 5906 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:04,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:04,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-08 21:58:04,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:06,912 INFO L124 PetriNetUnfolderBase]: 4386/15633 cut-off events. [2025-03-08 21:58:06,912 INFO L125 PetriNetUnfolderBase]: For 72248/73424 co-relation queries the response was YES. [2025-03-08 21:58:07,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59365 conditions, 15633 events. 4386/15633 cut-off events. For 72248/73424 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 163949 event pairs, 378 based on Foata normal form. 281/15799 useless extension candidates. Maximal degree in co-relation 59026. Up to 2511 conditions per place. [2025-03-08 21:58:07,106 INFO L140 encePairwiseOnDemand]: 143/159 looper letters, 193 selfloop transitions, 75 changer transitions 2/679 dead transitions. [2025-03-08 21:58:07,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 679 transitions, 7320 flow [2025-03-08 21:58:07,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:58:07,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 21:58:07,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1279 transitions. [2025-03-08 21:58:07,108 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.893780573025856 [2025-03-08 21:58:07,108 INFO L175 Difference]: Start difference. First operand has 365 places, 586 transitions, 5906 flow. Second operand 9 states and 1279 transitions. [2025-03-08 21:58:07,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 679 transitions, 7320 flow [2025-03-08 21:58:07,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 679 transitions, 7230 flow, removed 45 selfloop flow, removed 0 redundant places. [2025-03-08 21:58:07,475 INFO L231 Difference]: Finished difference. Result has 377 places, 598 transitions, 6178 flow [2025-03-08 21:58:07,476 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=5818, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=515, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6178, PETRI_PLACES=377, PETRI_TRANSITIONS=598} [2025-03-08 21:58:07,476 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 218 predicate places. [2025-03-08 21:58:07,476 INFO L471 AbstractCegarLoop]: Abstraction has has 377 places, 598 transitions, 6178 flow [2025-03-08 21:58:07,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:07,476 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:07,477 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:58:07,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 21:58:07,477 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:58:07,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:07,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1762530997, now seen corresponding path program 9 times [2025-03-08 21:58:07,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:07,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640566902] [2025-03-08 21:58:07,478 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 21:58:07,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:07,487 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 159 statements into 11 equivalence classes. [2025-03-08 21:58:07,491 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-03-08 21:58:07,491 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 21:58:07,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:07,641 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-08 21:58:07,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:07,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640566902] [2025-03-08 21:58:07,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640566902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:07,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:07,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 21:58:07,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337079117] [2025-03-08 21:58:07,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:07,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 21:58:07,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:07,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 21:58:07,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 21:58:08,350 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-08 21:58:08,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 598 transitions, 6178 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:08,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:08,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-08 21:58:08,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:10,780 INFO L124 PetriNetUnfolderBase]: 4105/14817 cut-off events. [2025-03-08 21:58:10,781 INFO L125 PetriNetUnfolderBase]: For 73672/74743 co-relation queries the response was YES. [2025-03-08 21:58:10,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57107 conditions, 14817 events. 4105/14817 cut-off events. For 73672/74743 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 153497 event pairs, 370 based on Foata normal form. 244/14955 useless extension candidates. Maximal degree in co-relation 56763. Up to 2341 conditions per place. [2025-03-08 21:58:10,973 INFO L140 encePairwiseOnDemand]: 145/159 looper letters, 194 selfloop transitions, 71 changer transitions 2/676 dead transitions. [2025-03-08 21:58:10,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 676 transitions, 7478 flow [2025-03-08 21:58:10,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:58:10,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 21:58:10,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1277 transitions. [2025-03-08 21:58:10,974 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8923829489867225 [2025-03-08 21:58:10,974 INFO L175 Difference]: Start difference. First operand has 377 places, 598 transitions, 6178 flow. Second operand 9 states and 1277 transitions. [2025-03-08 21:58:10,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 676 transitions, 7478 flow [2025-03-08 21:58:11,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 676 transitions, 7262 flow, removed 52 selfloop flow, removed 4 redundant places. [2025-03-08 21:58:11,326 INFO L231 Difference]: Finished difference. Result has 384 places, 601 transitions, 6210 flow [2025-03-08 21:58:11,326 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=5974, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=596, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6210, PETRI_PLACES=384, PETRI_TRANSITIONS=601} [2025-03-08 21:58:11,326 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 225 predicate places. [2025-03-08 21:58:11,327 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 601 transitions, 6210 flow [2025-03-08 21:58:11,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:11,327 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:11,327 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:58:11,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 21:58:11,327 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:58:11,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:11,329 INFO L85 PathProgramCache]: Analyzing trace with hash -892664877, now seen corresponding path program 10 times [2025-03-08 21:58:11,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:11,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939502471] [2025-03-08 21:58:11,329 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 21:58:11,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:11,339 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 159 statements into 2 equivalence classes. [2025-03-08 21:58:11,346 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 21:58:11,346 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 21:58:11,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:11,776 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-08 21:58:11,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:11,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939502471] [2025-03-08 21:58:11,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939502471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:11,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:11,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 21:58:11,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006519572] [2025-03-08 21:58:11,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:11,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 21:58:11,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:11,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 21:58:11,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-08 21:58:12,515 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 159 [2025-03-08 21:58:12,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 601 transitions, 6210 flow. Second operand has 15 states, 15 states have (on average 118.46666666666667) internal successors, (1777), 15 states have internal predecessors, (1777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:12,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:12,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 159 [2025-03-08 21:58:12,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:16,671 INFO L124 PetriNetUnfolderBase]: 6452/19074 cut-off events. [2025-03-08 21:58:16,671 INFO L125 PetriNetUnfolderBase]: For 127202/128477 co-relation queries the response was YES. [2025-03-08 21:58:16,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85166 conditions, 19074 events. 6452/19074 cut-off events. For 127202/128477 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 188051 event pairs, 1066 based on Foata normal form. 453/19393 useless extension candidates. Maximal degree in co-relation 84819. Up to 5840 conditions per place. [2025-03-08 21:58:16,891 INFO L140 encePairwiseOnDemand]: 132/159 looper letters, 745 selfloop transitions, 315 changer transitions 3/1235 dead transitions. [2025-03-08 21:58:16,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 1235 transitions, 15081 flow [2025-03-08 21:58:16,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 21:58:16,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-08 21:58:16,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2615 transitions. [2025-03-08 21:58:16,893 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8223270440251572 [2025-03-08 21:58:16,893 INFO L175 Difference]: Start difference. First operand has 384 places, 601 transitions, 6210 flow. Second operand 20 states and 2615 transitions. [2025-03-08 21:58:16,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 1235 transitions, 15081 flow [2025-03-08 21:58:17,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 1235 transitions, 14855 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-03-08 21:58:17,352 INFO L231 Difference]: Finished difference. Result has 413 places, 796 transitions, 9926 flow [2025-03-08 21:58:17,352 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=6078, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=601, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=9926, PETRI_PLACES=413, PETRI_TRANSITIONS=796} [2025-03-08 21:58:17,353 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 254 predicate places. [2025-03-08 21:58:17,353 INFO L471 AbstractCegarLoop]: Abstraction has has 413 places, 796 transitions, 9926 flow [2025-03-08 21:58:17,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 118.46666666666667) internal successors, (1777), 15 states have internal predecessors, (1777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:17,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:17,353 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:58:17,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 21:58:17,354 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:58:17,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:17,355 INFO L85 PathProgramCache]: Analyzing trace with hash 663405053, now seen corresponding path program 11 times [2025-03-08 21:58:17,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:17,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095425903] [2025-03-08 21:58:17,355 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 21:58:17,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:17,364 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 159 statements into 11 equivalence classes. [2025-03-08 21:58:17,371 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 21:58:17,371 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-08 21:58:17,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:17,697 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-03-08 21:58:17,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:17,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095425903] [2025-03-08 21:58:17,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095425903] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:58:17,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818223542] [2025-03-08 21:58:17,698 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 21:58:17,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:58:17,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:58:17,700 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-08 21:58:17,701 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-08 21:58:17,768 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 159 statements into 11 equivalence classes. [2025-03-08 21:58:17,818 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 21:58:17,818 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-08 21:58:17,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:17,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-08 21:58:17,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:58:17,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 21:58:18,031 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-08 21:58:18,031 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 21:58:18,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818223542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:18,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 21:58:18,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2025-03-08 21:58:18,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392568760] [2025-03-08 21:58:18,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:18,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 21:58:18,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:18,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 21:58:18,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-03-08 21:58:18,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-08 21:58:18,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 796 transitions, 9926 flow. Second operand has 10 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:18,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:18,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-08 21:58:18,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:22,117 INFO L124 PetriNetUnfolderBase]: 4570/16424 cut-off events. [2025-03-08 21:58:22,117 INFO L125 PetriNetUnfolderBase]: For 104535/105928 co-relation queries the response was YES. [2025-03-08 21:58:22,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67594 conditions, 16424 events. 4570/16424 cut-off events. For 104535/105928 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 173808 event pairs, 403 based on Foata normal form. 222/16507 useless extension candidates. Maximal degree in co-relation 67232. Up to 2632 conditions per place. [2025-03-08 21:58:22,323 INFO L140 encePairwiseOnDemand]: 143/159 looper letters, 217 selfloop transitions, 91 changer transitions 1/874 dead transitions. [2025-03-08 21:58:22,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 874 transitions, 11471 flow [2025-03-08 21:58:22,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 21:58:22,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-08 21:58:22,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1420 transitions. [2025-03-08 21:58:22,324 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8930817610062893 [2025-03-08 21:58:22,324 INFO L175 Difference]: Start difference. First operand has 413 places, 796 transitions, 9926 flow. Second operand 10 states and 1420 transitions. [2025-03-08 21:58:22,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 874 transitions, 11471 flow [2025-03-08 21:58:22,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 421 places, 874 transitions, 11166 flow, removed 122 selfloop flow, removed 1 redundant places. [2025-03-08 21:58:22,898 INFO L231 Difference]: Finished difference. Result has 425 places, 808 transitions, 10161 flow [2025-03-08 21:58:22,898 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=9727, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=796, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=708, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10161, PETRI_PLACES=425, PETRI_TRANSITIONS=808} [2025-03-08 21:58:22,899 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 266 predicate places. [2025-03-08 21:58:22,899 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 808 transitions, 10161 flow [2025-03-08 21:58:22,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:22,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:22,899 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:58:22,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 21:58:23,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:58:23,100 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:58:23,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:23,101 INFO L85 PathProgramCache]: Analyzing trace with hash 394643653, now seen corresponding path program 12 times [2025-03-08 21:58:23,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:23,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516031246] [2025-03-08 21:58:23,101 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 21:58:23,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:23,109 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 159 statements into 11 equivalence classes. [2025-03-08 21:58:23,113 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-03-08 21:58:23,113 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-08 21:58:23,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:23,434 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-08 21:58:23,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:23,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516031246] [2025-03-08 21:58:23,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516031246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:23,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:23,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 21:58:23,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030585542] [2025-03-08 21:58:23,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:23,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 21:58:23,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:23,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 21:58:23,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 21:58:23,966 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-08 21:58:23,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 808 transitions, 10161 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:23,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:23,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-08 21:58:23,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:27,744 INFO L124 PetriNetUnfolderBase]: 4450/16066 cut-off events. [2025-03-08 21:58:27,744 INFO L125 PetriNetUnfolderBase]: For 100929/102287 co-relation queries the response was YES. [2025-03-08 21:58:27,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65866 conditions, 16066 events. 4450/16066 cut-off events. For 100929/102287 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 169387 event pairs, 379 based on Foata normal form. 280/16215 useless extension candidates. Maximal degree in co-relation 65498. Up to 2545 conditions per place. [2025-03-08 21:58:27,893 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 197 selfloop transitions, 105 changer transitions 1/813 dead transitions. [2025-03-08 21:58:27,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 813 transitions, 10529 flow [2025-03-08 21:58:27,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:58:27,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 21:58:27,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1280 transitions. [2025-03-08 21:58:27,894 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8944793850454228 [2025-03-08 21:58:27,894 INFO L175 Difference]: Start difference. First operand has 425 places, 808 transitions, 10161 flow. Second operand 9 states and 1280 transitions. [2025-03-08 21:58:27,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 813 transitions, 10529 flow [2025-03-08 21:58:28,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 422 places, 813 transitions, 10248 flow, removed 49 selfloop flow, removed 7 redundant places. [2025-03-08 21:58:28,431 INFO L231 Difference]: Finished difference. Result has 424 places, 745 transitions, 9178 flow [2025-03-08 21:58:28,431 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=8908, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=743, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=639, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9178, PETRI_PLACES=424, PETRI_TRANSITIONS=745} [2025-03-08 21:58:28,431 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 265 predicate places. [2025-03-08 21:58:28,431 INFO L471 AbstractCegarLoop]: Abstraction has has 424 places, 745 transitions, 9178 flow [2025-03-08 21:58:28,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:28,432 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:28,432 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:58:28,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 21:58:28,432 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:58:28,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:28,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1505031011, now seen corresponding path program 13 times [2025-03-08 21:58:28,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:28,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499659118] [2025-03-08 21:58:28,433 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 21:58:28,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:28,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 21:58:28,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 21:58:28,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:58:28,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:28,617 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-08 21:58:28,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:28,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499659118] [2025-03-08 21:58:28,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499659118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:28,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:28,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 21:58:28,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805500888] [2025-03-08 21:58:28,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:28,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 21:58:28,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:28,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 21:58:28,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 21:58:29,102 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-08 21:58:29,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 745 transitions, 9178 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:29,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:29,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-08 21:58:29,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:32,442 INFO L124 PetriNetUnfolderBase]: 4432/16061 cut-off events. [2025-03-08 21:58:32,442 INFO L125 PetriNetUnfolderBase]: For 95673/96738 co-relation queries the response was YES. [2025-03-08 21:58:32,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65285 conditions, 16061 events. 4432/16061 cut-off events. For 95673/96738 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 169490 event pairs, 398 based on Foata normal form. 189/16122 useless extension candidates. Maximal degree in co-relation 64918. Up to 2556 conditions per place. [2025-03-08 21:58:32,619 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 208 selfloop transitions, 94 changer transitions 1/813 dead transitions. [2025-03-08 21:58:32,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 813 transitions, 10489 flow [2025-03-08 21:58:32,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:58:32,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 21:58:32,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1283 transitions. [2025-03-08 21:58:32,808 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.896575821104123 [2025-03-08 21:58:32,808 INFO L175 Difference]: Start difference. First operand has 424 places, 745 transitions, 9178 flow. Second operand 9 states and 1283 transitions. [2025-03-08 21:58:32,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 432 places, 813 transitions, 10489 flow [2025-03-08 21:58:33,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 813 transitions, 10269 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-03-08 21:58:33,245 INFO L231 Difference]: Finished difference. Result has 428 places, 753 transitions, 9362 flow [2025-03-08 21:58:33,245 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=8977, PETRI_DIFFERENCE_MINUEND_PLACES=416, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=745, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=654, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9362, PETRI_PLACES=428, PETRI_TRANSITIONS=753} [2025-03-08 21:58:33,246 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 269 predicate places. [2025-03-08 21:58:33,246 INFO L471 AbstractCegarLoop]: Abstraction has has 428 places, 753 transitions, 9362 flow [2025-03-08 21:58:33,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:33,246 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:33,246 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:58:33,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 21:58:33,246 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:58:33,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:33,247 INFO L85 PathProgramCache]: Analyzing trace with hash 687431925, now seen corresponding path program 14 times [2025-03-08 21:58:33,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:33,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076196829] [2025-03-08 21:58:33,247 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:58:33,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:33,256 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 159 statements into 2 equivalence classes. [2025-03-08 21:58:33,265 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-03-08 21:58:33,265 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:58:33,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:33,390 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-08 21:58:33,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:33,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076196829] [2025-03-08 21:58:33,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076196829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:33,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:33,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 21:58:33,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3373851] [2025-03-08 21:58:33,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:33,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 21:58:33,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:33,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 21:58:33,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 21:58:33,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-08 21:58:33,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 753 transitions, 9362 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:33,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:33,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-08 21:58:33,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:37,207 INFO L124 PetriNetUnfolderBase]: 4441/16165 cut-off events. [2025-03-08 21:58:37,207 INFO L125 PetriNetUnfolderBase]: For 98028/99066 co-relation queries the response was YES. [2025-03-08 21:58:37,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65877 conditions, 16165 events. 4441/16165 cut-off events. For 98028/99066 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 171196 event pairs, 383 based on Foata normal form. 194/16236 useless extension candidates. Maximal degree in co-relation 65508. Up to 2565 conditions per place. [2025-03-08 21:58:37,362 INFO L140 encePairwiseOnDemand]: 143/159 looper letters, 205 selfloop transitions, 104 changer transitions 1/820 dead transitions. [2025-03-08 21:58:37,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 820 transitions, 10708 flow [2025-03-08 21:58:37,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:58:37,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 21:58:37,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1282 transitions. [2025-03-08 21:58:37,363 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8958770090845563 [2025-03-08 21:58:37,363 INFO L175 Difference]: Start difference. First operand has 428 places, 753 transitions, 9362 flow. Second operand 9 states and 1282 transitions. [2025-03-08 21:58:37,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 820 transitions, 10708 flow [2025-03-08 21:58:37,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 820 transitions, 10523 flow, removed 21 selfloop flow, removed 4 redundant places. [2025-03-08 21:58:37,843 INFO L231 Difference]: Finished difference. Result has 435 places, 762 transitions, 9629 flow [2025-03-08 21:58:37,844 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=9185, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=753, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=652, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9629, PETRI_PLACES=435, PETRI_TRANSITIONS=762} [2025-03-08 21:58:37,844 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 276 predicate places. [2025-03-08 21:58:37,844 INFO L471 AbstractCegarLoop]: Abstraction has has 435 places, 762 transitions, 9629 flow [2025-03-08 21:58:37,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:37,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:37,845 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:58:37,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 21:58:37,845 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:58:37,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:37,847 INFO L85 PathProgramCache]: Analyzing trace with hash 649501825, now seen corresponding path program 15 times [2025-03-08 21:58:37,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:37,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110036482] [2025-03-08 21:58:37,847 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 21:58:37,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:37,856 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 159 statements into 11 equivalence classes. [2025-03-08 21:58:37,860 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-03-08 21:58:37,860 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 21:58:37,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:38,003 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-08 21:58:38,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:38,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110036482] [2025-03-08 21:58:38,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110036482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:38,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:38,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 21:58:38,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58266687] [2025-03-08 21:58:38,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:38,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 21:58:38,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:38,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 21:58:38,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 21:58:38,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-08 21:58:38,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 762 transitions, 9629 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:38,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:38,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-08 21:58:38,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:42,230 INFO L124 PetriNetUnfolderBase]: 4162/15316 cut-off events. [2025-03-08 21:58:42,231 INFO L125 PetriNetUnfolderBase]: For 92820/93882 co-relation queries the response was YES. [2025-03-08 21:58:42,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62356 conditions, 15316 events. 4162/15316 cut-off events. For 92820/93882 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 160156 event pairs, 388 based on Foata normal form. 191/15378 useless extension candidates. Maximal degree in co-relation 61984. Up to 2403 conditions per place. [2025-03-08 21:58:42,374 INFO L140 encePairwiseOnDemand]: 143/159 looper letters, 208 selfloop transitions, 99 changer transitions 1/818 dead transitions. [2025-03-08 21:58:42,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 818 transitions, 10777 flow [2025-03-08 21:58:42,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:58:42,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 21:58:42,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1285 transitions. [2025-03-08 21:58:42,376 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8979734451432565 [2025-03-08 21:58:42,376 INFO L175 Difference]: Start difference. First operand has 435 places, 762 transitions, 9629 flow. Second operand 9 states and 1285 transitions. [2025-03-08 21:58:42,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 818 transitions, 10777 flow [2025-03-08 21:58:42,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 818 transitions, 10562 flow, removed 21 selfloop flow, removed 5 redundant places. [2025-03-08 21:58:42,831 INFO L231 Difference]: Finished difference. Result has 441 places, 767 transitions, 9764 flow [2025-03-08 21:58:42,832 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=9330, PETRI_DIFFERENCE_MINUEND_PLACES=430, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=758, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=662, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9764, PETRI_PLACES=441, PETRI_TRANSITIONS=767} [2025-03-08 21:58:42,832 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 282 predicate places. [2025-03-08 21:58:42,832 INFO L471 AbstractCegarLoop]: Abstraction has has 441 places, 767 transitions, 9764 flow [2025-03-08 21:58:42,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:42,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:42,833 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:58:42,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 21:58:42,833 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:58:42,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:42,834 INFO L85 PathProgramCache]: Analyzing trace with hash 503828937, now seen corresponding path program 16 times [2025-03-08 21:58:42,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:42,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187518600] [2025-03-08 21:58:42,834 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 21:58:42,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:42,842 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 159 statements into 2 equivalence classes. [2025-03-08 21:58:42,850 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 21:58:42,850 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 21:58:42,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:43,183 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-08 21:58:43,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:43,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187518600] [2025-03-08 21:58:43,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187518600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:43,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:43,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 21:58:43,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574348308] [2025-03-08 21:58:43,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:43,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 21:58:43,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:43,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 21:58:43,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 21:58:43,971 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-08 21:58:43,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 767 transitions, 9764 flow. Second operand has 10 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:43,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:43,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-08 21:58:43,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:46,780 INFO L124 PetriNetUnfolderBase]: 3871/14326 cut-off events. [2025-03-08 21:58:46,781 INFO L125 PetriNetUnfolderBase]: For 85998/86980 co-relation queries the response was YES. [2025-03-08 21:58:46,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58138 conditions, 14326 events. 3871/14326 cut-off events. For 85998/86980 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 147109 event pairs, 378 based on Foata normal form. 164/14367 useless extension candidates. Maximal degree in co-relation 57763. Up to 2226 conditions per place. [2025-03-08 21:58:46,946 INFO L140 encePairwiseOnDemand]: 142/159 looper letters, 212 selfloop transitions, 96 changer transitions 1/780 dead transitions. [2025-03-08 21:58:46,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 780 transitions, 10239 flow [2025-03-08 21:58:46,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 21:58:46,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-08 21:58:46,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1419 transitions. [2025-03-08 21:58:46,947 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8924528301886793 [2025-03-08 21:58:46,948 INFO L175 Difference]: Start difference. First operand has 441 places, 767 transitions, 9764 flow. Second operand 10 states and 1419 transitions. [2025-03-08 21:58:46,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 449 places, 780 transitions, 10239 flow [2025-03-08 21:58:47,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 780 transitions, 9935 flow, removed 68 selfloop flow, removed 5 redundant places. [2025-03-08 21:58:47,651 INFO L231 Difference]: Finished difference. Result has 447 places, 732 transitions, 9144 flow [2025-03-08 21:58:47,652 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=8733, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=723, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9144, PETRI_PLACES=447, PETRI_TRANSITIONS=732} [2025-03-08 21:58:47,652 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 288 predicate places. [2025-03-08 21:58:47,652 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 732 transitions, 9144 flow [2025-03-08 21:58:47,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:47,653 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:47,653 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:58:47,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 21:58:47,653 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:58:47,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:47,654 INFO L85 PathProgramCache]: Analyzing trace with hash -412757507, now seen corresponding path program 17 times [2025-03-08 21:58:47,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:47,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415698538] [2025-03-08 21:58:47,654 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 21:58:47,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:47,666 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 159 statements into 11 equivalence classes. [2025-03-08 21:58:47,675 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 21:58:47,675 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-08 21:58:47,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:48,109 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-03-08 21:58:48,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:48,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415698538] [2025-03-08 21:58:48,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415698538] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:58:48,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025509834] [2025-03-08 21:58:48,110 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 21:58:48,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:58:48,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:58:48,112 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:58:48,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 21:58:48,192 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 159 statements into 11 equivalence classes. [2025-03-08 21:58:48,234 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 21:58:48,234 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-08 21:58:48,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:48,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 21:58:48,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:58:48,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 21:58:48,452 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-08 21:58:48,452 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 21:58:48,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025509834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:48,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 21:58:48,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2025-03-08 21:58:48,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754009533] [2025-03-08 21:58:48,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:48,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 21:58:48,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:48,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 21:58:48,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2025-03-08 21:58:49,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-08 21:58:49,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 732 transitions, 9144 flow. Second operand has 10 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:49,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:49,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-08 21:58:49,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand