/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:37:36,017 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:37:36,071 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 19:37:36,075 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:37:36,075 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:37:36,097 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:37:36,097 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:37:36,098 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:37:36,098 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:37:36,098 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:37:36,098 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:37:36,098 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:37:36,098 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:37:36,098 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:37:36,098 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:37:36,098 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:37:36,098 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:37:36,099 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:37:36,099 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:37:36,099 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:37:36,099 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:37:36,099 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:37:36,099 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:37:36,099 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:37:36,099 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:37:36,099 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:37:36,099 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:37:36,099 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:37:36,099 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:37:36,099 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:37:36,099 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:37:36,100 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:37:36,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:37:36,101 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:37:36,101 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:37:36,101 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:37:36,101 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:37:36,101 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:37:36,101 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:37:36,101 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:37:36,101 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:37:36,101 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:37:36,101 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:37:36,101 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:37:36,101 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:37:36,101 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:37:36,101 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:37:36,101 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 19:37:36,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:37:36,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:37:36,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:37:36,347 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:37:36,348 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:37:36,349 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_tso.i [2025-04-13 19:37:37,574 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a0e20943/7aa2c07a1a48454f984b33659089027c/FLAG7979dcc0e [2025-04-13 19:37:37,814 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:37:37,814 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_tso.i [2025-04-13 19:37:37,827 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a0e20943/7aa2c07a1a48454f984b33659089027c/FLAG7979dcc0e [2025-04-13 19:37:38,624 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a0e20943/7aa2c07a1a48454f984b33659089027c [2025-04-13 19:37:38,626 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:37:38,627 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:37:38,628 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:37:38,628 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:37:38,631 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:37:38,631 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:37:38" (1/1) ... [2025-04-13 19:37:38,632 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1380fdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:38, skipping insertion in model container [2025-04-13 19:37:38,632 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:37:38" (1/1) ... [2025-04-13 19:37:38,654 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:37:38,826 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_tso.i[945,958] [2025-04-13 19:37:38,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:37:38,975 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:37:38,997 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_tso.i[945,958] [2025-04-13 19:37:39,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:37:39,067 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:37:39,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:39 WrapperNode [2025-04-13 19:37:39,068 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:37:39,069 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:37:39,069 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:37:39,069 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:37:39,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:39" (1/1) ... [2025-04-13 19:37:39,087 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:39" (1/1) ... [2025-04-13 19:37:39,100 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 56 [2025-04-13 19:37:39,101 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:37:39,101 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:37:39,101 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:37:39,101 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:37:39,107 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:39" (1/1) ... [2025-04-13 19:37:39,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:39" (1/1) ... [2025-04-13 19:37:39,109 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:39" (1/1) ... [2025-04-13 19:37:39,124 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 19:37:39,125 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:39" (1/1) ... [2025-04-13 19:37:39,125 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:39" (1/1) ... [2025-04-13 19:37:39,131 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:39" (1/1) ... [2025-04-13 19:37:39,131 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:39" (1/1) ... [2025-04-13 19:37:39,133 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:39" (1/1) ... [2025-04-13 19:37:39,133 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:39" (1/1) ... [2025-04-13 19:37:39,134 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:39" (1/1) ... [2025-04-13 19:37:39,136 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:37:39,137 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:37:39,137 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:37:39,137 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:37:39,137 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:39" (1/1) ... [2025-04-13 19:37:39,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:37:39,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:37:39,160 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-04-13 19:37:39,162 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-04-13 19:37:39,177 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 19:37:39,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:37:39,178 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-13 19:37:39,178 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-13 19:37:39,178 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-13 19:37:39,178 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-13 19:37:39,178 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-13 19:37:39,178 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-13 19:37:39,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:37:39,178 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 19:37:39,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:37:39,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:37:39,179 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 19:37:39,275 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:37:39,276 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:37:39,369 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:37:39,370 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:37:39,370 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:37:39,444 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:37:39,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:37:39 BoogieIcfgContainer [2025-04-13 19:37:39,445 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:37:39,446 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:37:39,446 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:37:39,450 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:37:39,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:37:38" (1/3) ... [2025-04-13 19:37:39,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129e23e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:37:39, skipping insertion in model container [2025-04-13 19:37:39,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:39" (2/3) ... [2025-04-13 19:37:39,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129e23e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:37:39, skipping insertion in model container [2025-04-13 19:37:39,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:37:39" (3/3) ... [2025-04-13 19:37:39,452 INFO L128 eAbstractionObserver]: Analyzing ICFG safe030_tso.i [2025-04-13 19:37:39,462 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:37:39,463 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe030_tso.i that has 4 procedures, 35 locations, 31 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-13 19:37:39,463 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:37:39,499 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:37:39,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 34 transitions, 80 flow [2025-04-13 19:37:39,545 INFO L116 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-04-13 19:37:39,549 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:37:39,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 31 events. 0/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 55 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-13 19:37:39,551 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 34 transitions, 80 flow [2025-04-13 19:37:39,552 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 30 transitions, 69 flow [2025-04-13 19:37:39,564 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:37:39,573 INFO L340 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;@3a097421, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:37:39,574 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 19:37:39,583 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:37:39,583 INFO L116 PetriNetUnfolderBase]: 0/29 cut-off events. [2025-04-13 19:37:39,583 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:37:39,583 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:39,584 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:37:39,585 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:37:39,589 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:39,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1909578269, now seen corresponding path program 1 times [2025-04-13 19:37:39,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:39,595 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800777072] [2025-04-13 19:37:39,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:39,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:39,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 19:37:39,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 19:37:39,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:39,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:40,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:37:40,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:40,032 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800777072] [2025-04-13 19:37:40,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800777072] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:40,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:40,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:37:40,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764751937] [2025-04-13 19:37:40,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:40,039 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:37:40,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:40,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:37:40,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:37:40,077 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 34 [2025-04-13 19:37:40,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 69 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-04-13 19:37:40,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:40,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 34 [2025-04-13 19:37:40,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:40,369 INFO L116 PetriNetUnfolderBase]: 1152/2062 cut-off events. [2025-04-13 19:37:40,370 INFO L117 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-04-13 19:37:40,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3880 conditions, 2062 events. 1152/2062 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 13222 event pairs, 452 based on Foata normal form. 94/2117 useless extension candidates. Maximal degree in co-relation 3869. Up to 908 conditions per place. [2025-04-13 19:37:40,381 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 28 selfloop transitions, 7 changer transitions 19/65 dead transitions. [2025-04-13 19:37:40,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 65 transitions, 253 flow [2025-04-13 19:37:40,383 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:37:40,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:37:40,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2025-04-13 19:37:40,394 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7411764705882353 [2025-04-13 19:37:40,396 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 69 flow. Second operand 5 states and 126 transitions. [2025-04-13 19:37:40,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 65 transitions, 253 flow [2025-04-13 19:37:40,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 65 transitions, 248 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-13 19:37:40,405 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 136 flow [2025-04-13 19:37:40,406 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=136, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2025-04-13 19:37:40,409 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2025-04-13 19:37:40,409 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 136 flow [2025-04-13 19:37:40,409 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-04-13 19:37:40,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:40,409 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:37:40,409 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:37:40,410 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:37:40,410 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:40,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1135813694, now seen corresponding path program 1 times [2025-04-13 19:37:40,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:40,410 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814051248] [2025-04-13 19:37:40,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:40,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:40,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 19:37:40,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:37:40,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:40,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:40,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:37:40,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:40,616 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814051248] [2025-04-13 19:37:40,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814051248] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:40,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:40,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:37:40,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725457528] [2025-04-13 19:37:40,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:40,617 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:37:40,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:40,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:37:40,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:37:40,630 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 34 [2025-04-13 19:37:40,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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-04-13 19:37:40,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:40,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 34 [2025-04-13 19:37:40,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:40,851 INFO L116 PetriNetUnfolderBase]: 1027/1963 cut-off events. [2025-04-13 19:37:40,851 INFO L117 PetriNetUnfolderBase]: For 1625/1631 co-relation queries the response was YES. [2025-04-13 19:37:40,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5474 conditions, 1963 events. 1027/1963 cut-off events. For 1625/1631 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 12850 event pairs, 147 based on Foata normal form. 90/2043 useless extension candidates. Maximal degree in co-relation 5460. Up to 844 conditions per place. [2025-04-13 19:37:40,862 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 38 selfloop transitions, 11 changer transitions 28/88 dead transitions. [2025-04-13 19:37:40,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 88 transitions, 522 flow [2025-04-13 19:37:40,863 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:37:40,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:37:40,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2025-04-13 19:37:40,864 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7184873949579832 [2025-04-13 19:37:40,865 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 136 flow. Second operand 7 states and 171 transitions. [2025-04-13 19:37:40,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 88 transitions, 522 flow [2025-04-13 19:37:40,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 88 transitions, 478 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:37:40,876 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 226 flow [2025-04-13 19:37:40,876 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=226, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2025-04-13 19:37:40,876 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places. [2025-04-13 19:37:40,877 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 226 flow [2025-04-13 19:37:40,877 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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-04-13 19:37:40,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:40,877 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:37:40,877 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:37:40,877 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:37:40,878 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:40,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1130093822, now seen corresponding path program 1 times [2025-04-13 19:37:40,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:40,878 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138555761] [2025-04-13 19:37:40,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:40,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:40,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 19:37:40,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:37:40,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:40,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:41,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:37:41,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:41,040 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138555761] [2025-04-13 19:37:41,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138555761] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:41,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:41,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:37:41,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840007109] [2025-04-13 19:37:41,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:41,041 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:37:41,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:41,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:37:41,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:37:41,054 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 34 [2025-04-13 19:37:41,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 226 flow. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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-04-13 19:37:41,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:41,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 34 [2025-04-13 19:37:41,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:41,255 INFO L116 PetriNetUnfolderBase]: 953/1826 cut-off events. [2025-04-13 19:37:41,255 INFO L117 PetriNetUnfolderBase]: For 4179/4181 co-relation queries the response was YES. [2025-04-13 19:37:41,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5935 conditions, 1826 events. 953/1826 cut-off events. For 4179/4181 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 11742 event pairs, 186 based on Foata normal form. 66/1860 useless extension candidates. Maximal degree in co-relation 5915. Up to 806 conditions per place. [2025-04-13 19:37:41,268 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 43 selfloop transitions, 17 changer transitions 24/95 dead transitions. [2025-04-13 19:37:41,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 95 transitions, 668 flow [2025-04-13 19:37:41,269 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:37:41,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:37:41,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 169 transitions. [2025-04-13 19:37:41,270 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7100840336134454 [2025-04-13 19:37:41,270 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 226 flow. Second operand 7 states and 169 transitions. [2025-04-13 19:37:41,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 95 transitions, 668 flow [2025-04-13 19:37:41,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 95 transitions, 658 flow, removed 5 selfloop flow, removed 0 redundant places. [2025-04-13 19:37:41,283 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 382 flow [2025-04-13 19:37:41,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=382, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2025-04-13 19:37:41,283 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 22 predicate places. [2025-04-13 19:37:41,283 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 382 flow [2025-04-13 19:37:41,283 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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-04-13 19:37:41,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:41,284 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:37:41,284 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:37:41,284 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:37:41,284 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:41,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1028695221, now seen corresponding path program 1 times [2025-04-13 19:37:41,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:41,284 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048773764] [2025-04-13 19:37:41,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:41,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:41,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 19:37:41,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 19:37:41,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:41,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:41,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:37:41,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:41,431 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048773764] [2025-04-13 19:37:41,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048773764] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:41,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:41,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:37:41,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047292232] [2025-04-13 19:37:41,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:41,431 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:37:41,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:41,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:37:41,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:37:41,443 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 34 [2025-04-13 19:37:41,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 52 transitions, 382 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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-04-13 19:37:41,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:41,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 34 [2025-04-13 19:37:41,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:41,640 INFO L116 PetriNetUnfolderBase]: 893/1717 cut-off events. [2025-04-13 19:37:41,640 INFO L117 PetriNetUnfolderBase]: For 6655/6657 co-relation queries the response was YES. [2025-04-13 19:37:41,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6588 conditions, 1717 events. 893/1717 cut-off events. For 6655/6657 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 11021 event pairs, 99 based on Foata normal form. 47/1751 useless extension candidates. Maximal degree in co-relation 6560. Up to 766 conditions per place. [2025-04-13 19:37:41,650 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 42 selfloop transitions, 22 changer transitions 19/94 dead transitions. [2025-04-13 19:37:41,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 94 transitions, 836 flow [2025-04-13 19:37:41,651 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:37:41,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:37:41,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 161 transitions. [2025-04-13 19:37:41,652 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6764705882352942 [2025-04-13 19:37:41,652 INFO L175 Difference]: Start difference. First operand has 62 places, 52 transitions, 382 flow. Second operand 7 states and 161 transitions. [2025-04-13 19:37:41,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 94 transitions, 836 flow [2025-04-13 19:37:41,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 94 transitions, 816 flow, removed 10 selfloop flow, removed 2 redundant places. [2025-04-13 19:37:41,664 INFO L231 Difference]: Finished difference. Result has 69 places, 60 transitions, 562 flow [2025-04-13 19:37:41,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=562, PETRI_PLACES=69, PETRI_TRANSITIONS=60} [2025-04-13 19:37:41,665 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 29 predicate places. [2025-04-13 19:37:41,665 INFO L485 AbstractCegarLoop]: Abstraction has has 69 places, 60 transitions, 562 flow [2025-04-13 19:37:41,665 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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-04-13 19:37:41,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:41,665 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:37:41,665 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:37:41,665 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:37:41,666 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:41,666 INFO L85 PathProgramCache]: Analyzing trace with hash -935777767, now seen corresponding path program 1 times [2025-04-13 19:37:41,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:41,666 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244303504] [2025-04-13 19:37:41,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:41,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:41,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 19:37:41,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 19:37:41,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:41,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:41,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:37:41,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:41,772 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244303504] [2025-04-13 19:37:41,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244303504] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:41,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:41,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:37:41,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727981678] [2025-04-13 19:37:41,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:41,772 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:37:41,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:41,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:37:41,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:37:41,782 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 34 [2025-04-13 19:37:41,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 60 transitions, 562 flow. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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-04-13 19:37:41,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:41,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 34 [2025-04-13 19:37:41,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:42,044 INFO L116 PetriNetUnfolderBase]: 1050/2068 cut-off events. [2025-04-13 19:37:42,045 INFO L117 PetriNetUnfolderBase]: For 12338/12338 co-relation queries the response was YES. [2025-04-13 19:37:42,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8649 conditions, 2068 events. 1050/2068 cut-off events. For 12338/12338 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 14511 event pairs, 213 based on Foata normal form. 50/2068 useless extension candidates. Maximal degree in co-relation 8615. Up to 594 conditions per place. [2025-04-13 19:37:42,059 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 45 selfloop transitions, 26 changer transitions 22/104 dead transitions. [2025-04-13 19:37:42,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 104 transitions, 1048 flow [2025-04-13 19:37:42,060 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:37:42,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:37:42,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2025-04-13 19:37:42,061 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6974789915966386 [2025-04-13 19:37:42,061 INFO L175 Difference]: Start difference. First operand has 69 places, 60 transitions, 562 flow. Second operand 7 states and 166 transitions. [2025-04-13 19:37:42,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 104 transitions, 1048 flow [2025-04-13 19:37:42,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 104 transitions, 1024 flow, removed 12 selfloop flow, removed 3 redundant places. [2025-04-13 19:37:42,077 INFO L231 Difference]: Finished difference. Result has 75 places, 60 transitions, 674 flow [2025-04-13 19:37:42,077 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=674, PETRI_PLACES=75, PETRI_TRANSITIONS=60} [2025-04-13 19:37:42,078 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 35 predicate places. [2025-04-13 19:37:42,078 INFO L485 AbstractCegarLoop]: Abstraction has has 75 places, 60 transitions, 674 flow [2025-04-13 19:37:42,078 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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-04-13 19:37:42,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:42,078 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:37:42,078 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:37:42,078 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:37:42,079 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:42,079 INFO L85 PathProgramCache]: Analyzing trace with hash 732620803, now seen corresponding path program 1 times [2025-04-13 19:37:42,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:42,079 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666771151] [2025-04-13 19:37:42,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:42,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:42,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 19:37:42,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 19:37:42,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:42,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:42,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:37:42,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:42,175 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666771151] [2025-04-13 19:37:42,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666771151] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:42,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:42,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:37:42,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784646834] [2025-04-13 19:37:42,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:42,175 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:37:42,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:42,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:37:42,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:37:42,183 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 34 [2025-04-13 19:37:42,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 60 transitions, 674 flow. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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-04-13 19:37:42,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:42,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 34 [2025-04-13 19:37:42,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:42,431 INFO L116 PetriNetUnfolderBase]: 1196/2472 cut-off events. [2025-04-13 19:37:42,431 INFO L117 PetriNetUnfolderBase]: For 16685/16685 co-relation queries the response was YES. [2025-04-13 19:37:42,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10683 conditions, 2472 events. 1196/2472 cut-off events. For 16685/16685 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 18938 event pairs, 226 based on Foata normal form. 50/2447 useless extension candidates. Maximal degree in co-relation 10659. Up to 782 conditions per place. [2025-04-13 19:37:42,447 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 43 selfloop transitions, 25 changer transitions 24/103 dead transitions. [2025-04-13 19:37:42,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 103 transitions, 1220 flow [2025-04-13 19:37:42,447 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:37:42,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:37:42,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 164 transitions. [2025-04-13 19:37:42,448 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6890756302521008 [2025-04-13 19:37:42,448 INFO L175 Difference]: Start difference. First operand has 75 places, 60 transitions, 674 flow. Second operand 7 states and 164 transitions. [2025-04-13 19:37:42,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 103 transitions, 1220 flow [2025-04-13 19:37:42,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 103 transitions, 1188 flow, removed 16 selfloop flow, removed 3 redundant places. [2025-04-13 19:37:42,467 INFO L231 Difference]: Finished difference. Result has 81 places, 59 transitions, 772 flow [2025-04-13 19:37:42,467 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=772, PETRI_PLACES=81, PETRI_TRANSITIONS=59} [2025-04-13 19:37:42,467 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 41 predicate places. [2025-04-13 19:37:42,467 INFO L485 AbstractCegarLoop]: Abstraction has has 81 places, 59 transitions, 772 flow [2025-04-13 19:37:42,467 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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-04-13 19:37:42,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:42,468 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:37:42,468 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:37:42,468 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:37:42,468 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:42,468 INFO L85 PathProgramCache]: Analyzing trace with hash -861070495, now seen corresponding path program 1 times [2025-04-13 19:37:42,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:42,468 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20949366] [2025-04-13 19:37:42,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:42,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:42,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 19:37:42,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 19:37:42,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:42,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:42,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:37:42,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:42,558 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20949366] [2025-04-13 19:37:42,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20949366] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:42,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:42,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:37:42,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226355213] [2025-04-13 19:37:42,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:42,559 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:37:42,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:42,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:37:42,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:37:42,564 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 34 [2025-04-13 19:37:42,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 59 transitions, 772 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-04-13 19:37:42,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:42,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 34 [2025-04-13 19:37:42,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:42,782 INFO L116 PetriNetUnfolderBase]: 907/2166 cut-off events. [2025-04-13 19:37:42,783 INFO L117 PetriNetUnfolderBase]: For 15703/16014 co-relation queries the response was YES. [2025-04-13 19:37:42,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8306 conditions, 2166 events. 907/2166 cut-off events. For 15703/16014 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 18590 event pairs, 325 based on Foata normal form. 85/2091 useless extension candidates. Maximal degree in co-relation 8279. Up to 691 conditions per place. [2025-04-13 19:37:42,800 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 22 selfloop transitions, 8 changer transitions 12/74 dead transitions. [2025-04-13 19:37:42,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 74 transitions, 940 flow [2025-04-13 19:37:42,800 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:37:42,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:37:42,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2025-04-13 19:37:42,801 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7176470588235294 [2025-04-13 19:37:42,801 INFO L175 Difference]: Start difference. First operand has 81 places, 59 transitions, 772 flow. Second operand 5 states and 122 transitions. [2025-04-13 19:37:42,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 74 transitions, 940 flow [2025-04-13 19:37:42,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 74 transitions, 895 flow, removed 12 selfloop flow, removed 4 redundant places. [2025-04-13 19:37:42,820 INFO L231 Difference]: Finished difference. Result has 81 places, 56 transitions, 712 flow [2025-04-13 19:37:42,820 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=712, PETRI_PLACES=81, PETRI_TRANSITIONS=56} [2025-04-13 19:37:42,821 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 41 predicate places. [2025-04-13 19:37:42,821 INFO L485 AbstractCegarLoop]: Abstraction has has 81 places, 56 transitions, 712 flow [2025-04-13 19:37:42,822 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-04-13 19:37:42,822 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:42,822 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:37:42,822 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 19:37:42,822 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:37:42,822 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:42,822 INFO L85 PathProgramCache]: Analyzing trace with hash -963810458, now seen corresponding path program 1 times [2025-04-13 19:37:42,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:42,822 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920028577] [2025-04-13 19:37:42,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:42,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:42,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 19:37:42,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 19:37:42,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:42,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:42,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:37:42,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:42,899 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920028577] [2025-04-13 19:37:42,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920028577] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:42,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:42,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:37:42,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698013936] [2025-04-13 19:37:42,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:42,900 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:37:42,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:42,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:37:42,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:37:42,910 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 34 [2025-04-13 19:37:42,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 56 transitions, 712 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-04-13 19:37:42,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:42,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 34 [2025-04-13 19:37:42,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:43,174 INFO L116 PetriNetUnfolderBase]: 2279/4207 cut-off events. [2025-04-13 19:37:43,174 INFO L117 PetriNetUnfolderBase]: For 7170/7314 co-relation queries the response was YES. [2025-04-13 19:37:43,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10355 conditions, 4207 events. 2279/4207 cut-off events. For 7170/7314 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 32631 event pairs, 616 based on Foata normal form. 259/4214 useless extension candidates. Maximal degree in co-relation 10328. Up to 1973 conditions per place. [2025-04-13 19:37:43,189 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 26 selfloop transitions, 5 changer transitions 0/71 dead transitions. [2025-04-13 19:37:43,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 71 transitions, 808 flow [2025-04-13 19:37:43,190 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:37:43,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:37:43,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2025-04-13 19:37:43,190 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7426470588235294 [2025-04-13 19:37:43,190 INFO L175 Difference]: Start difference. First operand has 81 places, 56 transitions, 712 flow. Second operand 4 states and 101 transitions. [2025-04-13 19:37:43,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 71 transitions, 808 flow [2025-04-13 19:37:43,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 71 transitions, 762 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-04-13 19:37:43,201 INFO L231 Difference]: Finished difference. Result has 79 places, 60 transitions, 704 flow [2025-04-13 19:37:43,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=704, PETRI_PLACES=79, PETRI_TRANSITIONS=60} [2025-04-13 19:37:43,202 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 39 predicate places. [2025-04-13 19:37:43,202 INFO L485 AbstractCegarLoop]: Abstraction has has 79 places, 60 transitions, 704 flow [2025-04-13 19:37:43,202 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-04-13 19:37:43,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:43,202 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] [2025-04-13 19:37:43,202 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 19:37:43,202 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:37:43,202 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:43,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1310909773, now seen corresponding path program 1 times [2025-04-13 19:37:43,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:43,202 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415252341] [2025-04-13 19:37:43,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:43,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:43,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 19:37:43,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 19:37:43,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:43,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:43,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:37:43,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:43,270 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415252341] [2025-04-13 19:37:43,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415252341] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:43,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:43,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:37:43,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361888641] [2025-04-13 19:37:43,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:43,270 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:37:43,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:43,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:37:43,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:37:43,277 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 34 [2025-04-13 19:37:43,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 60 transitions, 704 flow. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 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-04-13 19:37:43,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:43,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 34 [2025-04-13 19:37:43,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:43,532 INFO L116 PetriNetUnfolderBase]: 1908/3590 cut-off events. [2025-04-13 19:37:43,533 INFO L117 PetriNetUnfolderBase]: For 3145/4297 co-relation queries the response was YES. [2025-04-13 19:37:43,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9774 conditions, 3590 events. 1908/3590 cut-off events. For 3145/4297 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 27142 event pairs, 169 based on Foata normal form. 275/3666 useless extension candidates. Maximal degree in co-relation 9748. Up to 1820 conditions per place. [2025-04-13 19:37:43,544 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 30 selfloop transitions, 8 changer transitions 3/81 dead transitions. [2025-04-13 19:37:43,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 81 transitions, 849 flow [2025-04-13 19:37:43,545 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:37:43,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:37:43,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2025-04-13 19:37:43,546 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7529411764705882 [2025-04-13 19:37:43,546 INFO L175 Difference]: Start difference. First operand has 79 places, 60 transitions, 704 flow. Second operand 5 states and 128 transitions. [2025-04-13 19:37:43,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 81 transitions, 849 flow [2025-04-13 19:37:43,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 81 transitions, 830 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-04-13 19:37:43,553 INFO L231 Difference]: Finished difference. Result has 82 places, 64 transitions, 740 flow [2025-04-13 19:37:43,553 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=740, PETRI_PLACES=82, PETRI_TRANSITIONS=64} [2025-04-13 19:37:43,554 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 42 predicate places. [2025-04-13 19:37:43,554 INFO L485 AbstractCegarLoop]: Abstraction has has 82 places, 64 transitions, 740 flow [2025-04-13 19:37:43,554 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 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-04-13 19:37:43,554 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:43,554 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] [2025-04-13 19:37:43,554 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 19:37:43,554 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:37:43,554 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:43,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1002652886, now seen corresponding path program 1 times [2025-04-13 19:37:43,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:43,555 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85725568] [2025-04-13 19:37:43,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:43,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:43,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 19:37:43,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:37:43,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:43,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:43,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:37:43,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:43,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85725568] [2025-04-13 19:37:43,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85725568] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:43,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:43,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:37:43,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246113232] [2025-04-13 19:37:43,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:43,634 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:37:43,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:43,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:37:43,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:37:43,638 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 34 [2025-04-13 19:37:43,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 64 transitions, 740 flow. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 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-04-13 19:37:43,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:43,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 34 [2025-04-13 19:37:43,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:43,876 INFO L116 PetriNetUnfolderBase]: 1652/3062 cut-off events. [2025-04-13 19:37:43,877 INFO L117 PetriNetUnfolderBase]: For 5624/7205 co-relation queries the response was YES. [2025-04-13 19:37:43,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10039 conditions, 3062 events. 1652/3062 cut-off events. For 5624/7205 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 22155 event pairs, 91 based on Foata normal form. 246/3126 useless extension candidates. Maximal degree in co-relation 10013. Up to 1324 conditions per place. [2025-04-13 19:37:43,886 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 0 selfloop transitions, 0 changer transitions 81/81 dead transitions. [2025-04-13 19:37:43,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 81 transitions, 855 flow [2025-04-13 19:37:43,887 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:37:43,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:37:43,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2025-04-13 19:37:43,888 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7156862745098039 [2025-04-13 19:37:43,888 INFO L175 Difference]: Start difference. First operand has 82 places, 64 transitions, 740 flow. Second operand 6 states and 146 transitions. [2025-04-13 19:37:43,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 81 transitions, 855 flow [2025-04-13 19:37:43,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 81 transitions, 813 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-13 19:37:43,893 INFO L231 Difference]: Finished difference. Result has 79 places, 0 transitions, 0 flow [2025-04-13 19:37:43,894 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=79, PETRI_TRANSITIONS=0} [2025-04-13 19:37:43,895 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 39 predicate places. [2025-04-13 19:37:43,895 INFO L485 AbstractCegarLoop]: Abstraction has has 79 places, 0 transitions, 0 flow [2025-04-13 19:37:43,895 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 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-04-13 19:37:43,897 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 19:37:43,897 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 19:37:43,897 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 19:37:43,897 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 19:37:43,897 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 19:37:43,898 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:37:43,900 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 19:37:43,900 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 19:37:43,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 07:37:43 BasicIcfg [2025-04-13 19:37:43,904 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 19:37:43,905 INFO L158 Benchmark]: Toolchain (without parser) took 5278.29ms. Allocated memory was 125.8MB in the beginning and 423.6MB in the end (delta: 297.8MB). Free memory was 86.7MB in the beginning and 337.5MB in the end (delta: -250.8MB). Peak memory consumption was 171.2MB. Max. memory is 8.0GB. [2025-04-13 19:37:43,905 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 155.2MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:37:43,905 INFO L158 Benchmark]: CACSL2BoogieTranslator took 440.61ms. Allocated memory is still 125.8MB. Free memory was 86.7MB in the beginning and 63.1MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 19:37:43,905 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.93ms. Allocated memory is still 125.8MB. Free memory was 63.1MB in the beginning and 61.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:37:43,905 INFO L158 Benchmark]: Boogie Preprocessor took 35.13ms. Allocated memory is still 125.8MB. Free memory was 61.3MB in the beginning and 59.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:37:43,906 INFO L158 Benchmark]: RCFGBuilder took 308.11ms. Allocated memory is still 125.8MB. Free memory was 59.0MB in the beginning and 38.9MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 19:37:43,906 INFO L158 Benchmark]: TraceAbstraction took 4458.45ms. Allocated memory was 125.8MB in the beginning and 423.6MB in the end (delta: 297.8MB). Free memory was 38.1MB in the beginning and 337.5MB in the end (delta: -299.5MB). Peak memory consumption was 120.8MB. Max. memory is 8.0GB. [2025-04-13 19:37:43,907 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 155.2MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 440.61ms. Allocated memory is still 125.8MB. Free memory was 86.7MB in the beginning and 63.1MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.93ms. Allocated memory is still 125.8MB. Free memory was 63.1MB in the beginning and 61.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 35.13ms. Allocated memory is still 125.8MB. Free memory was 61.3MB in the beginning and 59.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 308.11ms. Allocated memory is still 125.8MB. Free memory was 59.0MB in the beginning and 38.9MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 4458.45ms. Allocated memory was 125.8MB in the beginning and 423.6MB in the end (delta: 297.8MB). Free memory was 38.1MB in the beginning and 337.5MB in the end (delta: -299.5MB). Peak memory consumption was 120.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 59 locations, 55 edges, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.4s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 346 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 311 mSDsluCounter, 160 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 94 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 654 IncrementalHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 66 mSDtfsCounter, 654 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=772occurred in iteration=6, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 160 ConstructedInterpolants, 0 QuantifiedInterpolants, 691 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 19:37:43,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...