/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_29-multiple-protecting2-vesal_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,694 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,698 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:39:55,698 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:39:55,719 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:39:55,719 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:39:55,719 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:39:55,720 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:39:55,720 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:39:55,720 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:39:55,720 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:39:55,721 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:39:55,721 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:39:55,721 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:39:55,721 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:39:55,721 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:39:55,721 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:39:55,721 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:39:55,721 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:39:55,721 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:39:55,721 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:39:55,722 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:39:55,722 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:39:55,722 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:39:55,722 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:39:55,722 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:39:55,722 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:39:55,722 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:39:55,722 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:39:55,722 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:39:55,722 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:39:55,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:39:55,722 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:39:55,722 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:39:55,722 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:39:55,722 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:39:55,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:39:55,723 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:39:55,723 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:39:55,723 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:39:55,723 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:39:55,723 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:39:55,723 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:39:55,723 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:39:55,723 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:39:55,723 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:39:55,723 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,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:39:55,950 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:39:55,953 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:39:55,954 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:39:55,956 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:39:55,957 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.i [2025-04-13 19:39:57,227 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66be3ad73/16c11d0775d642be8036e035e991b96f/FLAG5552f5327 [2025-04-13 19:39:57,479 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:39:57,479 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.i [2025-04-13 19:39:57,495 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66be3ad73/16c11d0775d642be8036e035e991b96f/FLAG5552f5327 [2025-04-13 19:39:58,227 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66be3ad73/16c11d0775d642be8036e035e991b96f [2025-04-13 19:39:58,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:39:58,231 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:39:58,231 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:39:58,232 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:39:58,235 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:39:58,236 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,236 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c990ea0 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,237 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,258 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:39:58,418 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_29-multiple-protecting2-vesal_true.i[1103,1116] [2025-04-13 19:39:58,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:39:58,574 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:39:58,589 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_29-multiple-protecting2-vesal_true.i[1103,1116] [2025-04-13 19:39:58,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:39:58,649 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:39:58,651 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,651 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:39:58,653 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:39:58,653 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:39:58,653 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:39:58,657 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,673 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,691 INFO L138 Inliner]: procedures = 162, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 82 [2025-04-13 19:39:58,691 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:39:58,692 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:39:58,692 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:39:58,692 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:39:58,698 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,698 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,702 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,716 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,716 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,717 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,723 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,727 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,728 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,729 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,729 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,736 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:39:58,736 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:39:58,736 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:39:58,736 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:39:58,737 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,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:39:58,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:39:58,765 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,767 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,786 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2025-04-13 19:39:58,786 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2025-04-13 19:39:58,786 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 19:39:58,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:39:58,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:39:58,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 19:39:58,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 19:39:58,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-13 19:39:58,787 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 19:39:58,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:39:58,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:39:58,788 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,892 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:39:58,893 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:39:59,056 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:39:59,057 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:39:59,057 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:39:59,202 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:39:59,203 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,203 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:39:59,204 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:39:59,204 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:39:59,207 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:39:59,207 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,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f1f537f 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,208 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,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f1f537f 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,208 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,209 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_29-multiple-protecting2-vesal_true.i [2025-04-13 19:39:59,219 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:39:59,220 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_29-multiple-protecting2-vesal_true.i that has 2 procedures, 39 locations, 37 edges, 1 initial locations, 0 loop locations, and 3 error locations. [2025-04-13 19:39:59,220 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:39:59,265 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-13 19:39:59,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 38 transitions, 83 flow [2025-04-13 19:39:59,316 INFO L116 PetriNetUnfolderBase]: 0/37 cut-off events. [2025-04-13 19:39:59,319 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 19:39:59,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 37 events. 0/37 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 35 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-04-13 19:39:59,320 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 38 transitions, 83 flow [2025-04-13 19:39:59,326 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 28 transitions, 59 flow [2025-04-13 19:39:59,331 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:39:59,339 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;@63253940, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:39:59,339 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 19:39:59,347 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:39:59,347 INFO L116 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-04-13 19:39:59,347 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:39:59,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:39:59,348 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:39:59,348 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 19:39:59,354 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:39:59,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1118499768, now seen corresponding path program 1 times [2025-04-13 19:39:59,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:39:59,361 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942855438] [2025-04-13 19:39:59,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:39:59,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:39:59,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 19:39:59,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 19:39:59,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:39:59,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:39:59,642 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,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:39:59,642 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942855438] [2025-04-13 19:39:59,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942855438] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:39:59,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:39:59,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:39:59,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925644665] [2025-04-13 19:39:59,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:39:59,651 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:39:59,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:39:59,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:39:59,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:39:59,674 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2025-04-13 19:39:59,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:39:59,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2025-04-13 19:39:59,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:39:59,813 INFO L116 PetriNetUnfolderBase]: 94/264 cut-off events. [2025-04-13 19:39:59,813 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:39:59,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 264 events. 94/264 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1156 event pairs, 48 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 483. Up to 148 conditions per place. [2025-04-13 19:39:59,816 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 29 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2025-04-13 19:39:59,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 40 transitions, 149 flow [2025-04-13 19:39:59,818 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:39:59,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:39:59,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2025-04-13 19:39:59,825 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5877192982456141 [2025-04-13 19:39:59,826 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 59 flow. Second operand 3 states and 67 transitions. [2025-04-13 19:39:59,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 40 transitions, 149 flow [2025-04-13 19:39:59,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 40 transitions, 148 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:39:59,833 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 84 flow [2025-04-13 19:39:59,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=35, PETRI_TRANSITIONS=30} [2025-04-13 19:39:59,836 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2025-04-13 19:39:59,836 INFO L485 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 84 flow [2025-04-13 19:39:59,837 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:39:59,837 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:39:59,837 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:39:59,837 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 19:39:59,838 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:39:59,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1118499769, now seen corresponding path program 1 times [2025-04-13 19:39:59,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:39:59,838 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875954847] [2025-04-13 19:39:59,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:39:59,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:39:59,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 19:39:59,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 19:39:59,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:39:59,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:39:59,935 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,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:39:59,936 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875954847] [2025-04-13 19:39:59,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875954847] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:39:59,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:39:59,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:39:59,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627714298] [2025-04-13 19:39:59,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:39:59,937 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:39:59,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:39:59,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:39:59,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:39:59,937 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2025-04-13 19:39:59,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:39:59,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2025-04-13 19:39:59,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:40:00,046 INFO L116 PetriNetUnfolderBase]: 114/324 cut-off events. [2025-04-13 19:40:00,046 INFO L117 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-04-13 19:40:00,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 666 conditions, 324 events. 114/324 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1635 event pairs, 37 based on Foata normal form. 0/316 useless extension candidates. Maximal degree in co-relation 654. Up to 147 conditions per place. [2025-04-13 19:40:00,049 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 32 selfloop transitions, 5 changer transitions 0/44 dead transitions. [2025-04-13 19:40:00,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 192 flow [2025-04-13 19:40:00,049 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:40:00,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:40:00,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2025-04-13 19:40:00,050 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6052631578947368 [2025-04-13 19:40:00,050 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 84 flow. Second operand 3 states and 69 transitions. [2025-04-13 19:40:00,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 44 transitions, 192 flow [2025-04-13 19:40:00,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 44 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:40:00,053 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 104 flow [2025-04-13 19:40:00,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2025-04-13 19:40:00,053 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2025-04-13 19:40:00,053 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 104 flow [2025-04-13 19:40:00,053 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:00,054 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:40:00,054 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:40:00,054 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 19:40:00,054 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:00,054 INFO L85 PathProgramCache]: Analyzing trace with hash -937976152, now seen corresponding path program 1 times [2025-04-13 19:40:00,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:00,054 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17925734] [2025-04-13 19:40:00,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:40:00,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:00,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 19:40:00,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 19:40:00,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:40:00,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:40:00,155 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,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:40:00,155 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17925734] [2025-04-13 19:40:00,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17925734] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:40:00,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:40:00,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:40:00,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819795006] [2025-04-13 19:40:00,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:40:00,155 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:40:00,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:40:00,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:40:00,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:40:00,156 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2025-04-13 19:40:00,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:40:00,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2025-04-13 19:40:00,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:40:00,233 INFO L116 PetriNetUnfolderBase]: 106/301 cut-off events. [2025-04-13 19:40:00,233 INFO L117 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-04-13 19:40:00,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 301 events. 106/301 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1440 event pairs, 64 based on Foata normal form. 10/305 useless extension candidates. Maximal degree in co-relation 619. Up to 214 conditions per place. [2025-04-13 19:40:00,237 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 26 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2025-04-13 19:40:00,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 35 transitions, 162 flow [2025-04-13 19:40:00,237 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:40:00,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:40:00,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2025-04-13 19:40:00,239 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48026315789473684 [2025-04-13 19:40:00,239 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 104 flow. Second operand 4 states and 73 transitions. [2025-04-13 19:40:00,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 35 transitions, 162 flow [2025-04-13 19:40:00,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 35 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:40:00,240 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 92 flow [2025-04-13 19:40:00,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2025-04-13 19:40:00,240 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 6 predicate places. [2025-04-13 19:40:00,241 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 92 flow [2025-04-13 19:40:00,241 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:00,241 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:40:00,241 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:40:00,241 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 19:40:00,241 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:00,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1588126107, now seen corresponding path program 1 times [2025-04-13 19:40:00,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:00,241 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770279283] [2025-04-13 19:40:00,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:40:00,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:00,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 19:40:00,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 19:40:00,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:40:00,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:40:00,327 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,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:40:00,328 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770279283] [2025-04-13 19:40:00,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770279283] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:40:00,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:40:00,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:40:00,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164652259] [2025-04-13 19:40:00,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:40:00,329 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:40:00,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:40:00,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:40:00,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:40:00,330 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2025-04-13 19:40:00,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:40:00,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2025-04-13 19:40:00,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:40:00,410 INFO L116 PetriNetUnfolderBase]: 101/299 cut-off events. [2025-04-13 19:40:00,410 INFO L117 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2025-04-13 19:40:00,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 638 conditions, 299 events. 101/299 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1452 event pairs, 38 based on Foata normal form. 0/298 useless extension candidates. Maximal degree in co-relation 623. Up to 120 conditions per place. [2025-04-13 19:40:00,412 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 33 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2025-04-13 19:40:00,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 194 flow [2025-04-13 19:40:00,413 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:40:00,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:40:00,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2025-04-13 19:40:00,414 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48947368421052634 [2025-04-13 19:40:00,414 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 92 flow. Second operand 5 states and 93 transitions. [2025-04-13 19:40:00,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 194 flow [2025-04-13 19:40:00,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 44 transitions, 191 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:40:00,416 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 99 flow [2025-04-13 19:40:00,416 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=99, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2025-04-13 19:40:00,417 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 8 predicate places. [2025-04-13 19:40:00,417 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 99 flow [2025-04-13 19:40:00,417 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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,417 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:00,417 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:40:00,417 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:40:00,417 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 19:40:00,417 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:00,417 INFO L85 PathProgramCache]: Analyzing trace with hash 616529674, now seen corresponding path program 1 times [2025-04-13 19:40:00,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:00,418 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826607672] [2025-04-13 19:40:00,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:40:00,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:00,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 19:40:00,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 19:40:00,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:40:00,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:40:00,539 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,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:40:00,540 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826607672] [2025-04-13 19:40:00,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826607672] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:40:00,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:40:00,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:40:00,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295595903] [2025-04-13 19:40:00,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:40:00,540 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:40:00,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:40:00,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:40:00,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:40:00,541 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2025-04-13 19:40:00,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 99 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:40:00,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2025-04-13 19:40:00,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:40:00,605 INFO L116 PetriNetUnfolderBase]: 58/204 cut-off events. [2025-04-13 19:40:00,605 INFO L117 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-04-13 19:40:00,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 494 conditions, 204 events. 58/204 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 871 event pairs, 23 based on Foata normal form. 19/220 useless extension candidates. Maximal degree in co-relation 478. Up to 94 conditions per place. [2025-04-13 19:40:00,606 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 22 selfloop transitions, 9 changer transitions 0/38 dead transitions. [2025-04-13 19:40:00,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 38 transitions, 188 flow [2025-04-13 19:40:00,607 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:40:00,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:40:00,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-04-13 19:40:00,607 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 19:40:00,608 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 99 flow. Second operand 4 states and 76 transitions. [2025-04-13 19:40:00,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 38 transitions, 188 flow [2025-04-13 19:40:00,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 38 transitions, 177 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-04-13 19:40:00,611 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 125 flow [2025-04-13 19:40:00,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=125, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2025-04-13 19:40:00,611 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2025-04-13 19:40:00,611 INFO L485 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 125 flow [2025-04-13 19:40:00,611 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:00,612 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:00,612 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:40:00,612 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 19:40:00,612 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:00,612 INFO L85 PathProgramCache]: Analyzing trace with hash 291650340, now seen corresponding path program 1 times [2025-04-13 19:40:00,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:00,612 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274175036] [2025-04-13 19:40:00,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:40:00,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:00,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:40:00,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:40:00,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:40:00,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:40:00,755 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,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:40:00,755 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274175036] [2025-04-13 19:40:00,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274175036] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:40:00,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:40:00,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:40:00,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356002871] [2025-04-13 19:40:00,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:40:00,755 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:40:00,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:40:00,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:40:00,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:40:00,756 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2025-04-13 19:40:00,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 125 flow. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:40:00,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2025-04-13 19:40:00,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:40:00,816 INFO L116 PetriNetUnfolderBase]: 38/154 cut-off events. [2025-04-13 19:40:00,816 INFO L117 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2025-04-13 19:40:00,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 399 conditions, 154 events. 38/154 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 521 event pairs, 7 based on Foata normal form. 14/168 useless extension candidates. Maximal degree in co-relation 382. Up to 85 conditions per place. [2025-04-13 19:40:00,818 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 25 selfloop transitions, 5 changer transitions 0/37 dead transitions. [2025-04-13 19:40:00,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 37 transitions, 207 flow [2025-04-13 19:40:00,818 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:40:00,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:40:00,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2025-04-13 19:40:00,820 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.46710526315789475 [2025-04-13 19:40:00,820 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 125 flow. Second operand 4 states and 71 transitions. [2025-04-13 19:40:00,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 37 transitions, 207 flow [2025-04-13 19:40:00,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 37 transitions, 202 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-13 19:40:00,823 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 124 flow [2025-04-13 19:40:00,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2025-04-13 19:40:00,823 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2025-04-13 19:40:00,823 INFO L485 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 124 flow [2025-04-13 19:40:00,825 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:00,825 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:00,825 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:40:00,825 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 19:40:00,825 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:00,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1640690525, now seen corresponding path program 1 times [2025-04-13 19:40:00,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:00,826 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721764026] [2025-04-13 19:40:00,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:40:00,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:00,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 19:40:00,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:40:00,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:40:00,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:40:00,924 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,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:40:00,925 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721764026] [2025-04-13 19:40:00,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721764026] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:40:00,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:40:00,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:40:00,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518317524] [2025-04-13 19:40:00,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:40:00,925 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:40:00,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:40:00,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:40:00,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:40:00,926 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2025-04-13 19:40:00,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 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,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:40:00,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2025-04-13 19:40:00,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:40:00,968 INFO L116 PetriNetUnfolderBase]: 35/140 cut-off events. [2025-04-13 19:40:00,968 INFO L117 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2025-04-13 19:40:00,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 386 conditions, 140 events. 35/140 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 480 event pairs, 27 based on Foata normal form. 6/145 useless extension candidates. Maximal degree in co-relation 370. Up to 93 conditions per place. [2025-04-13 19:40:00,969 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 0 selfloop transitions, 0 changer transitions 33/33 dead transitions. [2025-04-13 19:40:00,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 33 transitions, 187 flow [2025-04-13 19:40:00,969 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:40:00,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:40:00,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2025-04-13 19:40:00,970 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4473684210526316 [2025-04-13 19:40:00,970 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 124 flow. Second operand 4 states and 68 transitions. [2025-04-13 19:40:00,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 33 transitions, 187 flow [2025-04-13 19:40:00,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 33 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:40:00,972 INFO L231 Difference]: Finished difference. Result has 41 places, 0 transitions, 0 flow [2025-04-13 19:40:00,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=41, PETRI_TRANSITIONS=0} [2025-04-13 19:40:00,972 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2025-04-13 19:40:00,972 INFO L485 AbstractCegarLoop]: Abstraction has has 41 places, 0 transitions, 0 flow [2025-04-13 19:40:00,972 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 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,975 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 19:40:00,975 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-04-13 19:40:00,975 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-04-13 19:40:00,975 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 19:40:00,975 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 19:40:00,975 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:40:00,978 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 19:40:00,978 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 19:40:00,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 07:40:00 BasicIcfg [2025-04-13 19:40:00,983 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 19:40:00,983 INFO L158 Benchmark]: Toolchain (without parser) took 2753.08ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 89.9MB in the end (delta: 9.7MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. [2025-04-13 19:40:00,983 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 86.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:40:00,984 INFO L158 Benchmark]: CACSL2BoogieTranslator took 420.25ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 76.0MB in the end (delta: 22.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 19:40:00,984 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.95ms. Allocated memory is still 142.6MB. Free memory was 76.0MB in the beginning and 74.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:40:00,984 INFO L158 Benchmark]: Boogie Preprocessor took 43.88ms. Allocated memory is still 142.6MB. Free memory was 74.4MB in the beginning and 71.9MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:40:00,984 INFO L158 Benchmark]: RCFGBuilder took 466.45ms. Allocated memory is still 142.6MB. Free memory was 71.9MB in the beginning and 30.8MB in the end (delta: 41.1MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2025-04-13 19:40:00,984 INFO L158 Benchmark]: TraceAbstraction took 1779.18ms. Allocated memory is still 142.6MB. Free memory was 30.0MB in the beginning and 89.9MB in the end (delta: -59.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:40:00,986 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.17ms. Allocated memory is still 155.2MB. Free memory is still 86.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 420.25ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 76.0MB in the end (delta: 22.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.95ms. Allocated memory is still 142.6MB. Free memory was 76.0MB in the beginning and 74.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 43.88ms. Allocated memory is still 142.6MB. Free memory was 74.4MB in the beginning and 71.9MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 466.45ms. Allocated memory is still 142.6MB. Free memory was 71.9MB in the beginning and 30.8MB in the end (delta: 41.1MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 1779.18ms. Allocated memory is still 142.6MB. Free memory was 30.0MB in the beginning and 89.9MB in the end (delta: -59.9MB). There was no memory consumed. 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 54 locations, 53 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: 1.7s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 102 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 102 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 318 IncrementalHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 0 mSDtfsCounter, 318 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=5, InterpolantAutomatonStates: 27, 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, 0.7s InterpolantComputationTime, 104 NumberOfCodeBlocks, 104 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 97 ConstructedInterpolants, 0 QuantifiedInterpolants, 403 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 19:40:00,998 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...