/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/goblint-regression/13-privatized_27-multiple-protecting2_true.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:39:55,636 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:39:55,675 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:39:55,678 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:39:55,678 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:39:55,699 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:39:55,699 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:39:55,699 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:39:55,699 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:39:55,699 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:39:55,699 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:39:55,699 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:39:55,700 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:39:55,700 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:39:55,700 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:39:55,700 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:39:55,700 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:39:55,700 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:39:55,700 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:39:55,700 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:39:55,700 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:39:55,700 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:39:55,700 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:39:55,700 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:39:55,700 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:39:55,700 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:39:55,700 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:39:55,700 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:39:55,701 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:39:55,701 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:39:55,701 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:39:55,701 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:39:55,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:39:55,701 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:39:55,701 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:39:55,701 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:39:55,701 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:39:55,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:39:55,701 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:39:55,701 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:39:55,701 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:39:55,702 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:39:55,703 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:39:55,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:39:55,703 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:39:55,703 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:39:55,703 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:39:55,703 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:39:55,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:39:55,893 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:39:55,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:39:55,896 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:39:55,896 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:39:55,897 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_27-multiple-protecting2_true.i [2025-04-13 19:39:57,186 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89941c726/883cee27cd454c22ae03f8735d112c93/FLAG7540662f1 [2025-04-13 19:39:57,409 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:39:57,409 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_27-multiple-protecting2_true.i [2025-04-13 19:39:57,424 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89941c726/883cee27cd454c22ae03f8735d112c93/FLAG7540662f1 [2025-04-13 19:39:58,236 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89941c726/883cee27cd454c22ae03f8735d112c93 [2025-04-13 19:39:58,238 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:39:58,239 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:39:58,240 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:39:58,240 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:39:58,243 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:39:58,244 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:39:58" (1/1) ... [2025-04-13 19:39:58,245 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ed52e29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:39:58, skipping insertion in model container [2025-04-13 19:39:58,245 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:39:58" (1/1) ... [2025-04-13 19:39:58,269 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:39:58,417 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_27-multiple-protecting2_true.i[1097,1110] [2025-04-13 19:39:58,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:39:58,557 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:39:58,574 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_27-multiple-protecting2_true.i[1097,1110] [2025-04-13 19:39:58,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:39:58,635 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:39:58,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:39:58 WrapperNode [2025-04-13 19:39:58,636 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:39:58,637 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:39:58,637 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:39:58,637 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:39:58,641 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:39:58" (1/1) ... [2025-04-13 19:39:58,650 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:39:58" (1/1) ... [2025-04-13 19:39:58,664 INFO L138 Inliner]: procedures = 163, calls = 54, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 109 [2025-04-13 19:39:58,665 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:39:58,665 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:39:58,665 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:39:58,665 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:39:58,675 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:39:58" (1/1) ... [2025-04-13 19:39:58,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:39:58" (1/1) ... [2025-04-13 19:39:58,681 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:39:58" (1/1) ... [2025-04-13 19:39:58,698 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 5, 5, 5]. 29 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 5, 5]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-04-13 19:39:58,698 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:39:58" (1/1) ... [2025-04-13 19:39:58,698 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:39:58" (1/1) ... [2025-04-13 19:39:58,704 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:39:58" (1/1) ... [2025-04-13 19:39:58,709 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:39:58" (1/1) ... [2025-04-13 19:39:58,711 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:39:58" (1/1) ... [2025-04-13 19:39:58,712 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:39:58" (1/1) ... [2025-04-13 19:39:58,712 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:39:58" (1/1) ... [2025-04-13 19:39:58,715 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:39:58,715 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:39:58,716 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:39:58,716 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:39:58,716 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:39:58" (1/1) ... [2025-04-13 19:39:58,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:39:58,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:39:58,739 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:39:58,742 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:39:58,757 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2025-04-13 19:39:58,758 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2025-04-13 19:39:58,758 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 19:39:58,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:39:58,758 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-13 19:39:58,758 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-13 19:39:58,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:39:58,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 19:39:58,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 19:39:58,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-13 19:39:58,758 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 19:39:58,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:39:58,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:39:58,759 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:39:58,856 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:39:58,858 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:39:59,067 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:39:59,068 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:39:59,068 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:39:59,224 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:39:59,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:39:59 BoogieIcfgContainer [2025-04-13 19:39:59,224 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:39:59,227 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:39:59,227 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:39:59,230 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:39:59,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:39:58" (1/3) ... [2025-04-13 19:39:59,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e05114f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:39:59, skipping insertion in model container [2025-04-13 19:39:59,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:39:58" (2/3) ... [2025-04-13 19:39:59,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e05114f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:39:59, skipping insertion in model container [2025-04-13 19:39:59,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:39:59" (3/3) ... [2025-04-13 19:39:59,231 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_27-multiple-protecting2_true.i [2025-04-13 19:39:59,242 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:39:59,243 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_27-multiple-protecting2_true.i that has 3 procedures, 65 locations, 62 edges, 1 initial locations, 0 loop locations, and 4 error locations. [2025-04-13 19:39:59,243 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:39:59,282 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 19:39:59,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 64 transitions, 142 flow [2025-04-13 19:39:59,356 INFO L116 PetriNetUnfolderBase]: 0/62 cut-off events. [2025-04-13 19:39:59,359 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 19:39:59,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 62 events. 0/62 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-04-13 19:39:59,360 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 64 transitions, 142 flow [2025-04-13 19:39:59,362 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 54 transitions, 114 flow [2025-04-13 19:39:59,370 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:39:59,378 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;@663ee46a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:39:59,378 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 19:39:59,386 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:39:59,386 INFO L116 PetriNetUnfolderBase]: 0/19 cut-off events. [2025-04-13 19:39:59,386 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:39:59,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:39:59,387 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:39:59,388 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:39:59,392 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:39:59,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1097975986, now seen corresponding path program 1 times [2025-04-13 19:39:59,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:39:59,399 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587595922] [2025-04-13 19:39:59,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:39:59,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:39:59,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 19:39:59,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 19:39:59,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:39:59,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:39:59,674 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:39:59,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:39:59,675 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587595922] [2025-04-13 19:39:59,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587595922] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:39:59,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:39:59,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:39:59,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804047626] [2025-04-13 19:39:59,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:39:59,683 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:39:59,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:39:59,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:39:59,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:39:59,701 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 64 [2025-04-13 19:39:59,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 54 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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:39:59,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:39:59,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 64 [2025-04-13 19:39:59,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:40:00,480 INFO L116 PetriNetUnfolderBase]: 4574/8077 cut-off events. [2025-04-13 19:40:00,480 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-13 19:40:00,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15348 conditions, 8077 events. 4574/8077 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 57936 event pairs, 1663 based on Foata normal form. 100/7832 useless extension candidates. Maximal degree in co-relation 15338. Up to 3766 conditions per place. [2025-04-13 19:40:00,526 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 67 selfloop transitions, 5 changer transitions 0/86 dead transitions. [2025-04-13 19:40:00,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 86 transitions, 325 flow [2025-04-13 19:40:00,528 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:40:00,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:40:00,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2025-04-13 19:40:00,539 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.671875 [2025-04-13 19:40:00,540 INFO L175 Difference]: Start difference. First operand has 61 places, 54 transitions, 114 flow. Second operand 3 states and 129 transitions. [2025-04-13 19:40:00,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 86 transitions, 325 flow [2025-04-13 19:40:00,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 86 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:40:00,550 INFO L231 Difference]: Finished difference. Result has 63 places, 57 transitions, 150 flow [2025-04-13 19:40:00,553 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=63, PETRI_TRANSITIONS=57} [2025-04-13 19:40:00,557 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 2 predicate places. [2025-04-13 19:40:00,557 INFO L485 AbstractCegarLoop]: Abstraction has has 63 places, 57 transitions, 150 flow [2025-04-13 19:40:00,557 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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:40:00,557 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:00,557 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:40:00,558 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:40:00,558 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:40:00,558 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:00,558 INFO L85 PathProgramCache]: Analyzing trace with hash -64910919, now seen corresponding path program 1 times [2025-04-13 19:40:00,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:00,558 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211388445] [2025-04-13 19:40:00,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:40:00,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:00,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 19:40:00,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:40:00,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:40:00,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:40:00,753 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:40:00,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:40:00,753 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211388445] [2025-04-13 19:40:00,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211388445] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:40:00,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:40:00,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:40:00,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202563924] [2025-04-13 19:40:00,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:40:00,754 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:40:00,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:40:00,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:40:00,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:40:00,755 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 64 [2025-04-13 19:40:00,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 57 transitions, 150 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:40:00,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:40:00,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 64 [2025-04-13 19:40:00,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:40:01,153 INFO L116 PetriNetUnfolderBase]: 1869/3708 cut-off events. [2025-04-13 19:40:01,154 INFO L117 PetriNetUnfolderBase]: For 366/366 co-relation queries the response was YES. [2025-04-13 19:40:01,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7586 conditions, 3708 events. 1869/3708 cut-off events. For 366/366 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 24419 event pairs, 591 based on Foata normal form. 190/3819 useless extension candidates. Maximal degree in co-relation 7574. Up to 2302 conditions per place. [2025-04-13 19:40:01,175 INFO L140 encePairwiseOnDemand]: 58/64 looper letters, 76 selfloop transitions, 6 changer transitions 0/96 dead transitions. [2025-04-13 19:40:01,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 96 transitions, 422 flow [2025-04-13 19:40:01,176 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:40:01,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:40:01,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2025-04-13 19:40:01,177 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5859375 [2025-04-13 19:40:01,177 INFO L175 Difference]: Start difference. First operand has 63 places, 57 transitions, 150 flow. Second operand 4 states and 150 transitions. [2025-04-13 19:40:01,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 96 transitions, 422 flow [2025-04-13 19:40:01,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 96 transitions, 404 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:40:01,184 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 169 flow [2025-04-13 19:40:01,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=65, PETRI_TRANSITIONS=60} [2025-04-13 19:40:01,184 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 4 predicate places. [2025-04-13 19:40:01,184 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 169 flow [2025-04-13 19:40:01,185 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:40:01,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:01,185 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:40:01,185 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:40:01,185 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:40:01,185 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:01,185 INFO L85 PathProgramCache]: Analyzing trace with hash 757074648, now seen corresponding path program 1 times [2025-04-13 19:40:01,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:01,185 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648064115] [2025-04-13 19:40:01,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:40:01,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:01,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:40:01,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:40:01,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:40:01,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:40:01,274 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:40:01,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:40:01,274 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648064115] [2025-04-13 19:40:01,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648064115] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:40:01,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:40:01,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:40:01,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263276154] [2025-04-13 19:40:01,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:40:01,275 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:40:01,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:40:01,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:40:01,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:40:01,275 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 64 [2025-04-13 19:40:01,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 169 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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:40:01,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:40:01,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 64 [2025-04-13 19:40:01,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:40:01,695 INFO L116 PetriNetUnfolderBase]: 2288/4555 cut-off events. [2025-04-13 19:40:01,695 INFO L117 PetriNetUnfolderBase]: For 941/941 co-relation queries the response was YES. [2025-04-13 19:40:01,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9949 conditions, 4555 events. 2288/4555 cut-off events. For 941/941 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 31706 event pairs, 858 based on Foata normal form. 0/4447 useless extension candidates. Maximal degree in co-relation 9936. Up to 2543 conditions per place. [2025-04-13 19:40:01,715 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 78 selfloop transitions, 4 changer transitions 0/96 dead transitions. [2025-04-13 19:40:01,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 96 transitions, 442 flow [2025-04-13 19:40:01,715 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:40:01,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:40:01,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2025-04-13 19:40:01,717 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.65625 [2025-04-13 19:40:01,718 INFO L175 Difference]: Start difference. First operand has 65 places, 60 transitions, 169 flow. Second operand 3 states and 126 transitions. [2025-04-13 19:40:01,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 96 transitions, 442 flow [2025-04-13 19:40:01,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 96 transitions, 441 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:40:01,720 INFO L231 Difference]: Finished difference. Result has 68 places, 62 transitions, 194 flow [2025-04-13 19:40:01,720 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=68, PETRI_TRANSITIONS=62} [2025-04-13 19:40:01,721 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 7 predicate places. [2025-04-13 19:40:01,722 INFO L485 AbstractCegarLoop]: Abstraction has has 68 places, 62 transitions, 194 flow [2025-04-13 19:40:01,722 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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:40:01,722 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:01,722 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:40:01,722 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:40:01,722 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:40:01,723 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:01,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1067442740, now seen corresponding path program 1 times [2025-04-13 19:40:01,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:01,723 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817822568] [2025-04-13 19:40:01,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:40:01,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:01,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 19:40:01,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 19:40:01,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:40:01,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:40:01,848 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:40:01,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:40:01,848 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817822568] [2025-04-13 19:40:01,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817822568] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:40:01,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:40:01,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:40:01,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066764147] [2025-04-13 19:40:01,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:40:01,849 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:40:01,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:40:01,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:40:01,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:40:01,849 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 64 [2025-04-13 19:40:01,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 62 transitions, 194 flow. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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:40:01,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:40:01,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 64 [2025-04-13 19:40:01,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:40:02,162 INFO L116 PetriNetUnfolderBase]: 2054/4221 cut-off events. [2025-04-13 19:40:02,162 INFO L117 PetriNetUnfolderBase]: For 1322/1322 co-relation queries the response was YES. [2025-04-13 19:40:02,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9607 conditions, 4221 events. 2054/4221 cut-off events. For 1322/1322 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 29670 event pairs, 1518 based on Foata normal form. 76/4279 useless extension candidates. Maximal degree in co-relation 9591. Up to 2834 conditions per place. [2025-04-13 19:40:02,180 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 69 selfloop transitions, 3 changer transitions 0/86 dead transitions. [2025-04-13 19:40:02,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 86 transitions, 411 flow [2025-04-13 19:40:02,180 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:40:02,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:40:02,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2025-04-13 19:40:02,181 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.55078125 [2025-04-13 19:40:02,181 INFO L175 Difference]: Start difference. First operand has 68 places, 62 transitions, 194 flow. Second operand 4 states and 141 transitions. [2025-04-13 19:40:02,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 86 transitions, 411 flow [2025-04-13 19:40:02,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 86 transitions, 397 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:40:02,184 INFO L231 Difference]: Finished difference. Result has 71 places, 61 transitions, 203 flow [2025-04-13 19:40:02,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=203, PETRI_PLACES=71, PETRI_TRANSITIONS=61} [2025-04-13 19:40:02,185 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 10 predicate places. [2025-04-13 19:40:02,185 INFO L485 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 203 flow [2025-04-13 19:40:02,185 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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:40:02,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:02,185 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:40:02,185 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:40:02,185 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:40:02,186 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:02,186 INFO L85 PathProgramCache]: Analyzing trace with hash -964696948, now seen corresponding path program 1 times [2025-04-13 19:40:02,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:02,186 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779488323] [2025-04-13 19:40:02,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:40:02,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:02,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 19:40:02,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:40:02,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:40:02,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:40:02,302 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:40:02,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:40:02,302 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779488323] [2025-04-13 19:40:02,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779488323] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:40:02,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:40:02,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:40:02,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121996309] [2025-04-13 19:40:02,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:40:02,302 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:40:02,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:40:02,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:40:02,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:40:02,303 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 64 [2025-04-13 19:40:02,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 203 flow. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 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:40:02,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:40:02,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 64 [2025-04-13 19:40:02,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:40:02,593 INFO L116 PetriNetUnfolderBase]: 1657/3583 cut-off events. [2025-04-13 19:40:02,593 INFO L117 PetriNetUnfolderBase]: For 1803/1803 co-relation queries the response was YES. [2025-04-13 19:40:02,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8944 conditions, 3583 events. 1657/3583 cut-off events. For 1803/1803 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 25135 event pairs, 660 based on Foata normal form. 388/3836 useless extension candidates. Maximal degree in co-relation 8926. Up to 1662 conditions per place. [2025-04-13 19:40:02,613 INFO L140 encePairwiseOnDemand]: 46/64 looper letters, 62 selfloop transitions, 19 changer transitions 1/96 dead transitions. [2025-04-13 19:40:02,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 96 transitions, 504 flow [2025-04-13 19:40:02,613 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:40:02,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:40:02,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2025-04-13 19:40:02,614 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5859375 [2025-04-13 19:40:02,614 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 203 flow. Second operand 4 states and 150 transitions. [2025-04-13 19:40:02,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 96 transitions, 504 flow [2025-04-13 19:40:02,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 96 transitions, 478 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-04-13 19:40:02,622 INFO L231 Difference]: Finished difference. Result has 72 places, 71 transitions, 293 flow [2025-04-13 19:40:02,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=293, PETRI_PLACES=72, PETRI_TRANSITIONS=71} [2025-04-13 19:40:02,626 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 11 predicate places. [2025-04-13 19:40:02,626 INFO L485 AbstractCegarLoop]: Abstraction has has 72 places, 71 transitions, 293 flow [2025-04-13 19:40:02,626 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 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:40:02,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:02,626 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:40:02,626 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:40:02,626 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:40:02,627 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:02,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1781305291, now seen corresponding path program 1 times [2025-04-13 19:40:02,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:02,627 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171671173] [2025-04-13 19:40:02,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:40:02,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:02,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 19:40:02,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:40:02,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:40:02,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:40:02,820 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:40:02,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:40:02,820 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171671173] [2025-04-13 19:40:02,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171671173] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:40:02,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:40:02,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:40:02,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279916631] [2025-04-13 19:40:02,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:40:02,821 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:40:02,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:40:02,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:40:02,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:40:02,821 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 64 [2025-04-13 19:40:02,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 71 transitions, 293 flow. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 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:40:02,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:40:02,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 64 [2025-04-13 19:40:02,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:40:03,032 INFO L116 PetriNetUnfolderBase]: 1218/2791 cut-off events. [2025-04-13 19:40:03,032 INFO L117 PetriNetUnfolderBase]: For 2122/2122 co-relation queries the response was YES. [2025-04-13 19:40:03,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7615 conditions, 2791 events. 1218/2791 cut-off events. For 2122/2122 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 18519 event pairs, 517 based on Foata normal form. 42/2773 useless extension candidates. Maximal degree in co-relation 7596. Up to 1321 conditions per place. [2025-04-13 19:40:03,041 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 64 selfloop transitions, 10 changer transitions 0/88 dead transitions. [2025-04-13 19:40:03,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 88 transitions, 517 flow [2025-04-13 19:40:03,042 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:40:03,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:40:03,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2025-04-13 19:40:03,042 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.51171875 [2025-04-13 19:40:03,042 INFO L175 Difference]: Start difference. First operand has 72 places, 71 transitions, 293 flow. Second operand 4 states and 131 transitions. [2025-04-13 19:40:03,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 88 transitions, 517 flow [2025-04-13 19:40:03,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 88 transitions, 514 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 19:40:03,045 INFO L231 Difference]: Finished difference. Result has 74 places, 68 transitions, 298 flow [2025-04-13 19:40:03,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=298, PETRI_PLACES=74, PETRI_TRANSITIONS=68} [2025-04-13 19:40:03,046 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 13 predicate places. [2025-04-13 19:40:03,046 INFO L485 AbstractCegarLoop]: Abstraction has has 74 places, 68 transitions, 298 flow [2025-04-13 19:40:03,046 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 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:40:03,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:03,046 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:40:03,046 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:40:03,046 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:40:03,046 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:03,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1363112377, now seen corresponding path program 1 times [2025-04-13 19:40:03,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:03,046 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104778888] [2025-04-13 19:40:03,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:40:03,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:03,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 19:40:03,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 19:40:03,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:40:03,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:40:03,234 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:40:03,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:40:03,235 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104778888] [2025-04-13 19:40:03,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104778888] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:40:03,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:40:03,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:40:03,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947516591] [2025-04-13 19:40:03,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:40:03,235 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:40:03,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:40:03,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:40:03,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:40:03,236 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 64 [2025-04-13 19:40:03,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 68 transitions, 298 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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:40:03,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:40:03,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 64 [2025-04-13 19:40:03,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:40:03,364 INFO L116 PetriNetUnfolderBase]: 486/1205 cut-off events. [2025-04-13 19:40:03,364 INFO L117 PetriNetUnfolderBase]: For 1128/1132 co-relation queries the response was YES. [2025-04-13 19:40:03,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3246 conditions, 1205 events. 486/1205 cut-off events. For 1128/1132 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6488 event pairs, 133 based on Foata normal form. 76/1266 useless extension candidates. Maximal degree in co-relation 3226. Up to 894 conditions per place. [2025-04-13 19:40:03,368 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 47 selfloop transitions, 5 changer transitions 10/74 dead transitions. [2025-04-13 19:40:03,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 74 transitions, 432 flow [2025-04-13 19:40:03,369 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:40:03,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:40:03,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2025-04-13 19:40:03,369 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.484375 [2025-04-13 19:40:03,369 INFO L175 Difference]: Start difference. First operand has 74 places, 68 transitions, 298 flow. Second operand 4 states and 124 transitions. [2025-04-13 19:40:03,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 74 transitions, 432 flow [2025-04-13 19:40:03,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 74 transitions, 410 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-04-13 19:40:03,374 INFO L231 Difference]: Finished difference. Result has 70 places, 52 transitions, 211 flow [2025-04-13 19:40:03,375 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=211, PETRI_PLACES=70, PETRI_TRANSITIONS=52} [2025-04-13 19:40:03,375 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 9 predicate places. [2025-04-13 19:40:03,375 INFO L485 AbstractCegarLoop]: Abstraction has has 70 places, 52 transitions, 211 flow [2025-04-13 19:40:03,375 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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:40:03,375 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:03,375 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:40:03,375 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 19:40:03,375 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:40:03,376 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:03,376 INFO L85 PathProgramCache]: Analyzing trace with hash -914395110, now seen corresponding path program 1 times [2025-04-13 19:40:03,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:03,376 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556202079] [2025-04-13 19:40:03,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:40:03,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:03,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 19:40:03,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 19:40:03,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:40:03,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:40:03,477 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:40:03,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:40:03,477 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556202079] [2025-04-13 19:40:03,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556202079] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:40:03,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:40:03,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:40:03,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820333507] [2025-04-13 19:40:03,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:40:03,477 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:40:03,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:40:03,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:40:03,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:40:03,478 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 64 [2025-04-13 19:40:03,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 52 transitions, 211 flow. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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:40:03,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:40:03,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 64 [2025-04-13 19:40:03,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:40:03,571 INFO L116 PetriNetUnfolderBase]: 414/954 cut-off events. [2025-04-13 19:40:03,571 INFO L117 PetriNetUnfolderBase]: For 848/848 co-relation queries the response was YES. [2025-04-13 19:40:03,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2589 conditions, 954 events. 414/954 cut-off events. For 848/848 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4846 event pairs, 332 based on Foata normal form. 12/958 useless extension candidates. Maximal degree in co-relation 2570. Up to 722 conditions per place. [2025-04-13 19:40:03,573 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 0 selfloop transitions, 0 changer transitions 66/66 dead transitions. [2025-04-13 19:40:03,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 66 transitions, 384 flow [2025-04-13 19:40:03,574 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:40:03,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:40:03,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2025-04-13 19:40:03,575 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.46484375 [2025-04-13 19:40:03,575 INFO L175 Difference]: Start difference. First operand has 70 places, 52 transitions, 211 flow. Second operand 4 states and 119 transitions. [2025-04-13 19:40:03,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 66 transitions, 384 flow [2025-04-13 19:40:03,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 66 transitions, 363 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-13 19:40:03,577 INFO L231 Difference]: Finished difference. Result has 61 places, 0 transitions, 0 flow [2025-04-13 19:40:03,577 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=61, PETRI_TRANSITIONS=0} [2025-04-13 19:40:03,579 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 0 predicate places. [2025-04-13 19:40:03,579 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 0 transitions, 0 flow [2025-04-13 19:40:03,579 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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:40:03,581 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-04-13 19:40:03,581 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-13 19:40:03,581 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-04-13 19:40:03,581 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 19:40:03,581 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-04-13 19:40:03,581 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2025-04-13 19:40:03,581 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 19:40:03,582 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:40:03,586 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 19:40:03,586 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 19:40:03,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 07:40:03 BasicIcfg [2025-04-13 19:40:03,593 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 19:40:03,593 INFO L158 Benchmark]: Toolchain (without parser) took 5354.25ms. Allocated memory was 167.8MB in the beginning and 453.0MB in the end (delta: 285.2MB). Free memory was 116.6MB in the beginning and 198.8MB in the end (delta: -82.2MB). Peak memory consumption was 201.5MB. Max. memory is 8.0GB. [2025-04-13 19:40:03,593 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:40:03,594 INFO L158 Benchmark]: CACSL2BoogieTranslator took 395.91ms. Allocated memory is still 167.8MB. Free memory was 116.6MB in the beginning and 93.5MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 19:40:03,594 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.06ms. Allocated memory is still 167.8MB. Free memory was 93.5MB in the beginning and 90.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:40:03,594 INFO L158 Benchmark]: Boogie Preprocessor took 49.91ms. Allocated memory is still 167.8MB. Free memory was 90.8MB in the beginning and 89.3MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:40:03,594 INFO L158 Benchmark]: RCFGBuilder took 509.81ms. Allocated memory is still 167.8MB. Free memory was 88.6MB in the beginning and 38.9MB in the end (delta: 49.7MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. [2025-04-13 19:40:03,594 INFO L158 Benchmark]: TraceAbstraction took 4366.41ms. Allocated memory was 167.8MB in the beginning and 453.0MB in the end (delta: 285.2MB). Free memory was 38.3MB in the beginning and 198.8MB in the end (delta: -160.5MB). Peak memory consumption was 121.9MB. Max. memory is 8.0GB. [2025-04-13 19:40:03,595 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.15ms. Allocated memory is still 159.4MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 395.91ms. Allocated memory is still 167.8MB. Free memory was 116.6MB in the beginning and 93.5MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.06ms. Allocated memory is still 167.8MB. Free memory was 93.5MB in the beginning and 90.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 49.91ms. Allocated memory is still 167.8MB. Free memory was 90.8MB in the beginning and 89.3MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 509.81ms. Allocated memory is still 167.8MB. Free memory was 88.6MB in the beginning and 38.9MB in the end (delta: 49.7MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. * TraceAbstraction took 4366.41ms. Allocated memory was 167.8MB in the beginning and 453.0MB in the end (delta: 285.2MB). Free memory was 38.3MB in the beginning and 198.8MB in the end (delta: -160.5MB). Peak memory consumption was 121.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: 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 5 procedures, 95 locations, 94 edges, 6 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.3s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 312 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 312 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 117 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 707 IncrementalHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 117 mSolverCounterUnsat, 0 mSDtfsCounter, 707 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=298occurred in iteration=6, InterpolantAutomatonStates: 30, 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.1s InterpolantComputationTime, 169 NumberOfCodeBlocks, 169 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 161 ConstructedInterpolants, 0 QuantifiedInterpolants, 901 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 19:40:03,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...