/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_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:18:51,806 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:18:51,856 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-14 00:18:51,866 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:18:51,866 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:18:51,887 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:18:51,887 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:18:51,889 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:18:51,889 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:18:51,889 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:18:51,890 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:18:51,890 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:18:51,890 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:18:51,890 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:18:51,890 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:18:51,890 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:18:51,890 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:18:51,890 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:18:51,891 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:18:51,891 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:18:51,891 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:18:51,891 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:18:51,891 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:18:51,891 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:18:51,891 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:18:51,891 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:18:51,891 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:18:51,891 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:18:51,891 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:18:51,891 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:18:51,891 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:18:51,891 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:18:51,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:18:51,891 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:18:51,891 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:18:51,891 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:18:51,891 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:18:51,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:18:51,892 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:18:51,892 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:18:51,892 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:18:51,892 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:18:51,892 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:18:51,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:18:51,892 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:18:51,892 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:18:51,892 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:18:51,892 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 00:18:52,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:18:52,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:18:52,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:18:52,134 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:18:52,134 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:18:52,135 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i [2025-04-14 00:18:53,448 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74d0bb563/8d307601ee7f42b2a0a3cd927e6d12cf/FLAGa75076983 [2025-04-14 00:18:53,672 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:18:53,672 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i [2025-04-14 00:18:53,680 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74d0bb563/8d307601ee7f42b2a0a3cd927e6d12cf/FLAGa75076983 [2025-04-14 00:18:54,499 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74d0bb563/8d307601ee7f42b2a0a3cd927e6d12cf [2025-04-14 00:18:54,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:18:54,502 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:18:54,503 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:18:54,503 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:18:54,506 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:18:54,507 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:18:54" (1/1) ... [2025-04-14 00:18:54,508 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cc289a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:18:54, skipping insertion in model container [2025-04-14 00:18:54,508 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:18:54" (1/1) ... [2025-04-14 00:18:54,535 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:18:54,679 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/36-apron_21-traces-cluster-based_true.i[1092,1105] [2025-04-14 00:18:54,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:18:54,811 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:18:54,829 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/36-apron_21-traces-cluster-based_true.i[1092,1105] [2025-04-14 00:18:54,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:18:54,880 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:18:54,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:18:54 WrapperNode [2025-04-14 00:18:54,881 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:18:54,882 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:18:54,882 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:18:54,882 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:18:54,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:18:54" (1/1) ... [2025-04-14 00:18:54,894 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:18:54" (1/1) ... [2025-04-14 00:18:54,909 INFO L138 Inliner]: procedures = 165, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 137 [2025-04-14 00:18:54,911 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:18:54,911 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:18:54,911 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:18:54,911 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:18:54,917 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:18:54" (1/1) ... [2025-04-14 00:18:54,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:18:54" (1/1) ... [2025-04-14 00:18:54,924 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:18:54" (1/1) ... [2025-04-14 00:18:54,939 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 5, 5]. 42 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5]. The 0 writes are split as follows [0, 0, 0]. [2025-04-14 00:18:54,940 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:18:54" (1/1) ... [2025-04-14 00:18:54,940 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:18:54" (1/1) ... [2025-04-14 00:18:54,946 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:18:54" (1/1) ... [2025-04-14 00:18:54,947 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:18:54" (1/1) ... [2025-04-14 00:18:54,948 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:18:54" (1/1) ... [2025-04-14 00:18:54,948 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:18:54" (1/1) ... [2025-04-14 00:18:54,953 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:18:54,954 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:18:54,954 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:18:54,954 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:18:54,954 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:18:54" (1/1) ... [2025-04-14 00:18:54,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:18:54,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:18:54,982 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-14 00:18:54,984 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-14 00:18:55,000 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2025-04-14 00:18:55,000 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2025-04-14 00:18:55,000 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-14 00:18:55,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:18:55,000 INFO L130 BoogieDeclarations]: Found specification of procedure t3_fun [2025-04-14 00:18:55,000 INFO L138 BoogieDeclarations]: Found implementation of procedure t3_fun [2025-04-14 00:18:55,000 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-14 00:18:55,001 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-14 00:18:55,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:18:55,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 00:18:55,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-14 00:18:55,001 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-14 00:18:55,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:18:55,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:18:55,002 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 00:18:55,094 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:18:55,095 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:18:55,297 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:18:55,298 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:18:55,299 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:18:55,499 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:18:55,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:18:55 BoogieIcfgContainer [2025-04-14 00:18:55,499 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:18:55,501 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:18:55,501 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:18:55,505 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:18:55,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:18:54" (1/3) ... [2025-04-14 00:18:55,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b7a3d2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:18:55, skipping insertion in model container [2025-04-14 00:18:55,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:18:54" (2/3) ... [2025-04-14 00:18:55,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b7a3d2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:18:55, skipping insertion in model container [2025-04-14 00:18:55,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:18:55" (3/3) ... [2025-04-14 00:18:55,507 INFO L128 eAbstractionObserver]: Analyzing ICFG 36-apron_21-traces-cluster-based_true.i [2025-04-14 00:18:55,519 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:18:55,521 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 36-apron_21-traces-cluster-based_true.i that has 4 procedures, 50 locations, 47 edges, 1 initial locations, 0 loop locations, and 4 error locations. [2025-04-14 00:18:55,521 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:18:55,563 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 00:18:55,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 50 transitions, 112 flow [2025-04-14 00:18:55,616 INFO L116 PetriNetUnfolderBase]: 1/47 cut-off events. [2025-04-14 00:18:55,617 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:18:55,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 47 events. 1/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 104 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2025-04-14 00:18:55,619 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 50 transitions, 112 flow [2025-04-14 00:18:55,622 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 47 transitions, 103 flow [2025-04-14 00:18:55,630 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:18:55,642 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;@41284a44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:18:55,644 INFO L341 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-04-14 00:18:55,652 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:18:55,652 INFO L116 PetriNetUnfolderBase]: 0/21 cut-off events. [2025-04-14 00:18:55,652 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:18:55,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:18:55,653 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:18:55,653 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-04-14 00:18:55,658 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:18:55,658 INFO L85 PathProgramCache]: Analyzing trace with hash -2032050752, now seen corresponding path program 1 times [2025-04-14 00:18:55,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:18:55,663 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323948104] [2025-04-14 00:18:55,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:18:55,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:18:55,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-14 00:18:55,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-14 00:18:55,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:18:55,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:18:55,960 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-14 00:18:55,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:18:55,961 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323948104] [2025-04-14 00:18:55,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323948104] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:18:55,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:18:55,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:18:55,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549119486] [2025-04-14 00:18:55,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:18:55,969 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:18:55,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:18:55,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:18:55,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:18:55,990 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-04-14 00:18:55,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 103 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-14 00:18:55,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:18:55,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-04-14 00:18:55,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:18:57,972 INFO L116 PetriNetUnfolderBase]: 21506/31053 cut-off events. [2025-04-14 00:18:57,973 INFO L117 PetriNetUnfolderBase]: For 83/83 co-relation queries the response was YES. [2025-04-14 00:18:58,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61267 conditions, 31053 events. 21506/31053 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 774. Compared 194895 event pairs, 6557 based on Foata normal form. 0/27544 useless extension candidates. Maximal degree in co-relation 61256. Up to 8865 conditions per place. [2025-04-14 00:18:58,152 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 116 selfloop transitions, 5 changer transitions 0/127 dead transitions. [2025-04-14 00:18:58,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 127 transitions, 517 flow [2025-04-14 00:18:58,153 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:18:58,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:18:58,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions. [2025-04-14 00:18:58,166 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.672 [2025-04-14 00:18:58,167 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 103 flow. Second operand 5 states and 168 transitions. [2025-04-14 00:18:58,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 127 transitions, 517 flow [2025-04-14 00:18:58,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 127 transitions, 510 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-14 00:18:58,174 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 134 flow [2025-04-14 00:18:58,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=134, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2025-04-14 00:18:58,180 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 5 predicate places. [2025-04-14 00:18:58,180 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 134 flow [2025-04-14 00:18:58,180 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-14 00:18:58,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:18:58,180 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:18:58,181 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:18:58,181 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-04-14 00:18:58,182 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:18:58,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1584562821, now seen corresponding path program 1 times [2025-04-14 00:18:58,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:18:58,183 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692903836] [2025-04-14 00:18:58,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:18:58,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:18:58,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-14 00:18:58,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-14 00:18:58,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:18:58,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:18:58,344 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-14 00:18:58,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:18:58,345 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692903836] [2025-04-14 00:18:58,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692903836] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:18:58,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:18:58,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:18:58,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500563575] [2025-04-14 00:18:58,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:18:58,346 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:18:58,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:18:58,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:18:58,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:18:58,346 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-04-14 00:18:58,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-14 00:18:58,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:18:58,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-04-14 00:18:58,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:00,036 INFO L116 PetriNetUnfolderBase]: 21296/31434 cut-off events. [2025-04-14 00:19:00,037 INFO L117 PetriNetUnfolderBase]: For 6592/6592 co-relation queries the response was YES. [2025-04-14 00:19:00,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67586 conditions, 31434 events. 21296/31434 cut-off events. For 6592/6592 co-relation queries the response was YES. Maximal size of possible extension queue 811. Compared 203478 event pairs, 4604 based on Foata normal form. 0/29514 useless extension candidates. Maximal degree in co-relation 67572. Up to 12285 conditions per place. [2025-04-14 00:19:00,192 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 104 selfloop transitions, 7 changer transitions 0/117 dead transitions. [2025-04-14 00:19:00,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 117 transitions, 530 flow [2025-04-14 00:19:00,193 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:19:00,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:19:00,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2025-04-14 00:19:00,196 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.616 [2025-04-14 00:19:00,196 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 134 flow. Second operand 5 states and 154 transitions. [2025-04-14 00:19:00,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 117 transitions, 530 flow [2025-04-14 00:19:00,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 117 transitions, 530 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 00:19:00,228 INFO L231 Difference]: Finished difference. Result has 68 places, 53 transitions, 176 flow [2025-04-14 00:19:00,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=176, PETRI_PLACES=68, PETRI_TRANSITIONS=53} [2025-04-14 00:19:00,229 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 12 predicate places. [2025-04-14 00:19:00,229 INFO L485 AbstractCegarLoop]: Abstraction has has 68 places, 53 transitions, 176 flow [2025-04-14 00:19:00,229 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-14 00:19:00,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:00,229 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:00,229 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:19:00,230 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-04-14 00:19:00,230 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:00,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1861839045, now seen corresponding path program 1 times [2025-04-14 00:19:00,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:00,230 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308816826] [2025-04-14 00:19:00,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:19:00,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:00,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 00:19:00,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:19:00,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:19:00,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:00,405 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-14 00:19:00,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:00,405 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308816826] [2025-04-14 00:19:00,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308816826] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:19:00,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:19:00,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:19:00,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046564840] [2025-04-14 00:19:00,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:19:00,406 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:19:00,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:00,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:19:00,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:19:00,406 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-04-14 00:19:00,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 53 transitions, 176 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-14 00:19:00,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:00,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-04-14 00:19:00,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:02,618 INFO L116 PetriNetUnfolderBase]: 25655/37819 cut-off events. [2025-04-14 00:19:02,619 INFO L117 PetriNetUnfolderBase]: For 17173/17173 co-relation queries the response was YES. [2025-04-14 00:19:02,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88771 conditions, 37819 events. 25655/37819 cut-off events. For 17173/17173 co-relation queries the response was YES. Maximal size of possible extension queue 1039. Compared 249253 event pairs, 8951 based on Foata normal form. 0/36684 useless extension candidates. Maximal degree in co-relation 88751. Up to 18669 conditions per place. [2025-04-14 00:19:02,770 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 107 selfloop transitions, 7 changer transitions 2/122 dead transitions. [2025-04-14 00:19:02,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 122 transitions, 622 flow [2025-04-14 00:19:02,770 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:19:02,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:19:02,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2025-04-14 00:19:02,771 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.612 [2025-04-14 00:19:02,771 INFO L175 Difference]: Start difference. First operand has 68 places, 53 transitions, 176 flow. Second operand 5 states and 153 transitions. [2025-04-14 00:19:02,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 122 transitions, 622 flow [2025-04-14 00:19:02,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 122 transitions, 622 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 00:19:02,822 INFO L231 Difference]: Finished difference. Result has 76 places, 56 transitions, 226 flow [2025-04-14 00:19:02,822 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=226, PETRI_PLACES=76, PETRI_TRANSITIONS=56} [2025-04-14 00:19:02,823 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 20 predicate places. [2025-04-14 00:19:02,823 INFO L485 AbstractCegarLoop]: Abstraction has has 76 places, 56 transitions, 226 flow [2025-04-14 00:19:02,823 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-14 00:19:02,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:02,823 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:02,823 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:19:02,823 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-04-14 00:19:02,824 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:02,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1735826555, now seen corresponding path program 1 times [2025-04-14 00:19:02,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:02,824 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736363063] [2025-04-14 00:19:02,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:19:02,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:02,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 00:19:02,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 00:19:02,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:19:02,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:02,901 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-14 00:19:02,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:02,901 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736363063] [2025-04-14 00:19:02,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736363063] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:19:02,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:19:02,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:19:02,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111635663] [2025-04-14 00:19:02,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:19:02,902 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:19:02,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:02,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:19:02,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:19:02,902 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-04-14 00:19:02,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 56 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-14 00:19:02,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:02,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-04-14 00:19:02,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:04,141 INFO L116 PetriNetUnfolderBase]: 16708/25242 cut-off events. [2025-04-14 00:19:04,142 INFO L117 PetriNetUnfolderBase]: For 18620/18620 co-relation queries the response was YES. [2025-04-14 00:19:04,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66621 conditions, 25242 events. 16708/25242 cut-off events. For 18620/18620 co-relation queries the response was YES. Maximal size of possible extension queue 746. Compared 166654 event pairs, 6605 based on Foata normal form. 1860/27008 useless extension candidates. Maximal degree in co-relation 66595. Up to 14071 conditions per place. [2025-04-14 00:19:04,462 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 80 selfloop transitions, 13 changer transitions 0/99 dead transitions. [2025-04-14 00:19:04,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 99 transitions, 598 flow [2025-04-14 00:19:04,463 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:19:04,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:19:04,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2025-04-14 00:19:04,463 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6866666666666666 [2025-04-14 00:19:04,463 INFO L175 Difference]: Start difference. First operand has 76 places, 56 transitions, 226 flow. Second operand 3 states and 103 transitions. [2025-04-14 00:19:04,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 99 transitions, 598 flow [2025-04-14 00:19:04,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 99 transitions, 598 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 00:19:04,609 INFO L231 Difference]: Finished difference. Result has 79 places, 64 transitions, 297 flow [2025-04-14 00:19:04,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=297, PETRI_PLACES=79, PETRI_TRANSITIONS=64} [2025-04-14 00:19:04,609 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 23 predicate places. [2025-04-14 00:19:04,609 INFO L485 AbstractCegarLoop]: Abstraction has has 79 places, 64 transitions, 297 flow [2025-04-14 00:19:04,610 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-14 00:19:04,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:04,610 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:04,610 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:19:04,610 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-04-14 00:19:04,610 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:04,610 INFO L85 PathProgramCache]: Analyzing trace with hash -2117177225, now seen corresponding path program 1 times [2025-04-14 00:19:04,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:04,610 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680604578] [2025-04-14 00:19:04,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:19:04,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:04,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 00:19:04,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 00:19:04,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:19:04,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:04,824 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-14 00:19:04,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:04,825 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680604578] [2025-04-14 00:19:04,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680604578] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:19:04,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:19:04,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:19:04,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689830987] [2025-04-14 00:19:04,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:19:04,825 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:19:04,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:04,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:19:04,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:19:04,826 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-04-14 00:19:04,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 64 transitions, 297 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-14 00:19:04,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:04,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-04-14 00:19:04,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:05,772 INFO L116 PetriNetUnfolderBase]: 9051/14760 cut-off events. [2025-04-14 00:19:05,772 INFO L117 PetriNetUnfolderBase]: For 13761/13999 co-relation queries the response was YES. [2025-04-14 00:19:05,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43230 conditions, 14760 events. 9051/14760 cut-off events. For 13761/13999 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 96833 event pairs, 2504 based on Foata normal form. 867/15615 useless extension candidates. Maximal degree in co-relation 43202. Up to 9032 conditions per place. [2025-04-14 00:19:05,835 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 75 selfloop transitions, 10 changer transitions 0/91 dead transitions. [2025-04-14 00:19:05,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 91 transitions, 581 flow [2025-04-14 00:19:05,836 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:19:05,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:19:05,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2025-04-14 00:19:05,837 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49 [2025-04-14 00:19:05,837 INFO L175 Difference]: Start difference. First operand has 79 places, 64 transitions, 297 flow. Second operand 4 states and 98 transitions. [2025-04-14 00:19:05,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 91 transitions, 581 flow [2025-04-14 00:19:05,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 91 transitions, 564 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:19:05,902 INFO L231 Difference]: Finished difference. Result has 81 places, 64 transitions, 304 flow [2025-04-14 00:19:05,902 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=304, PETRI_PLACES=81, PETRI_TRANSITIONS=64} [2025-04-14 00:19:05,902 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 25 predicate places. [2025-04-14 00:19:05,903 INFO L485 AbstractCegarLoop]: Abstraction has has 81 places, 64 transitions, 304 flow [2025-04-14 00:19:05,903 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-14 00:19:05,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:05,903 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-14 00:19:05,903 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:19:05,903 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-04-14 00:19:05,903 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:05,903 INFO L85 PathProgramCache]: Analyzing trace with hash -2137719584, now seen corresponding path program 1 times [2025-04-14 00:19:05,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:05,903 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895979704] [2025-04-14 00:19:05,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:19:05,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:05,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-14 00:19:05,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 00:19:05,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:19:05,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:05,978 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-14 00:19:05,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:05,978 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895979704] [2025-04-14 00:19:05,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895979704] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:19:05,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:19:05,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:19:05,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015864641] [2025-04-14 00:19:05,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:19:05,979 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:19:05,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:05,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:19:05,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:19:05,979 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-04-14 00:19:05,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 64 transitions, 304 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 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-14 00:19:05,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:05,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-04-14 00:19:05,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:07,033 INFO L116 PetriNetUnfolderBase]: 8339/13282 cut-off events. [2025-04-14 00:19:07,033 INFO L117 PetriNetUnfolderBase]: For 12815/12931 co-relation queries the response was YES. [2025-04-14 00:19:07,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39430 conditions, 13282 events. 8339/13282 cut-off events. For 12815/12931 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 82759 event pairs, 2038 based on Foata normal form. 330/13601 useless extension candidates. Maximal degree in co-relation 39401. Up to 5803 conditions per place. [2025-04-14 00:19:07,099 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 126 selfloop transitions, 10 changer transitions 8/150 dead transitions. [2025-04-14 00:19:07,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 150 transitions, 978 flow [2025-04-14 00:19:07,100 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:19:07,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:19:07,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 163 transitions. [2025-04-14 00:19:07,101 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5433333333333333 [2025-04-14 00:19:07,101 INFO L175 Difference]: Start difference. First operand has 81 places, 64 transitions, 304 flow. Second operand 6 states and 163 transitions. [2025-04-14 00:19:07,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 150 transitions, 978 flow [2025-04-14 00:19:07,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 150 transitions, 942 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-14 00:19:07,171 INFO L231 Difference]: Finished difference. Result has 81 places, 66 transitions, 329 flow [2025-04-14 00:19:07,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=329, PETRI_PLACES=81, PETRI_TRANSITIONS=66} [2025-04-14 00:19:07,172 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 25 predicate places. [2025-04-14 00:19:07,172 INFO L485 AbstractCegarLoop]: Abstraction has has 81 places, 66 transitions, 329 flow [2025-04-14 00:19:07,172 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 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-14 00:19:07,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:07,172 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] [2025-04-14 00:19:07,172 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:19:07,172 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-04-14 00:19:07,173 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:07,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1834554278, now seen corresponding path program 1 times [2025-04-14 00:19:07,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:07,173 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455231083] [2025-04-14 00:19:07,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:19:07,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:07,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 00:19:07,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:19:07,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:19:07,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:07,306 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-14 00:19:07,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:07,307 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455231083] [2025-04-14 00:19:07,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455231083] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:19:07,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:19:07,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:19:07,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484765594] [2025-04-14 00:19:07,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:19:07,307 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:19:07,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:07,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:19:07,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:19:07,308 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-04-14 00:19:07,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 66 transitions, 329 flow. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-14 00:19:07,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:07,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-04-14 00:19:07,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:08,147 INFO L116 PetriNetUnfolderBase]: 7523/12318 cut-off events. [2025-04-14 00:19:08,147 INFO L117 PetriNetUnfolderBase]: For 9974/10006 co-relation queries the response was YES. [2025-04-14 00:19:08,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35609 conditions, 12318 events. 7523/12318 cut-off events. For 9974/10006 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 77114 event pairs, 1809 based on Foata normal form. 168/12451 useless extension candidates. Maximal degree in co-relation 35581. Up to 3640 conditions per place. [2025-04-14 00:19:08,213 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 125 selfloop transitions, 16 changer transitions 15/162 dead transitions. [2025-04-14 00:19:08,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 162 transitions, 1014 flow [2025-04-14 00:19:08,214 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:19:08,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:19:08,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 194 transitions. [2025-04-14 00:19:08,214 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.485 [2025-04-14 00:19:08,214 INFO L175 Difference]: Start difference. First operand has 81 places, 66 transitions, 329 flow. Second operand 8 states and 194 transitions. [2025-04-14 00:19:08,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 162 transitions, 1014 flow [2025-04-14 00:19:08,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 162 transitions, 1005 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-14 00:19:08,282 INFO L231 Difference]: Finished difference. Result has 88 places, 69 transitions, 381 flow [2025-04-14 00:19:08,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=381, PETRI_PLACES=88, PETRI_TRANSITIONS=69} [2025-04-14 00:19:08,282 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 32 predicate places. [2025-04-14 00:19:08,282 INFO L485 AbstractCegarLoop]: Abstraction has has 88 places, 69 transitions, 381 flow [2025-04-14 00:19:08,283 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-14 00:19:08,283 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:08,283 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] [2025-04-14 00:19:08,283 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 00:19:08,283 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-04-14 00:19:08,283 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:08,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1732835174, now seen corresponding path program 1 times [2025-04-14 00:19:08,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:08,283 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565840329] [2025-04-14 00:19:08,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:19:08,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:08,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 00:19:08,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 00:19:08,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:19:08,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:08,406 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-14 00:19:08,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:08,406 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565840329] [2025-04-14 00:19:08,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565840329] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:19:08,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:19:08,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:19:08,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390375103] [2025-04-14 00:19:08,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:19:08,406 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:19:08,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:08,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:19:08,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:19:08,407 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-04-14 00:19:08,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 69 transitions, 381 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-14 00:19:08,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:08,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-04-14 00:19:08,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:09,150 INFO L116 PetriNetUnfolderBase]: 6824/11441 cut-off events. [2025-04-14 00:19:09,150 INFO L117 PetriNetUnfolderBase]: For 13344/13356 co-relation queries the response was YES. [2025-04-14 00:19:09,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34045 conditions, 11441 events. 6824/11441 cut-off events. For 13344/13356 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 72633 event pairs, 2149 based on Foata normal form. 206/11626 useless extension candidates. Maximal degree in co-relation 34015. Up to 3570 conditions per place. [2025-04-14 00:19:09,184 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 53 selfloop transitions, 6 changer transitions 97/161 dead transitions. [2025-04-14 00:19:09,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 161 transitions, 1064 flow [2025-04-14 00:19:09,184 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:19:09,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:19:09,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 194 transitions. [2025-04-14 00:19:09,185 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.485 [2025-04-14 00:19:09,185 INFO L175 Difference]: Start difference. First operand has 88 places, 69 transitions, 381 flow. Second operand 8 states and 194 transitions. [2025-04-14 00:19:09,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 161 transitions, 1064 flow [2025-04-14 00:19:09,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 161 transitions, 1034 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-04-14 00:19:09,217 INFO L231 Difference]: Finished difference. Result has 88 places, 45 transitions, 215 flow [2025-04-14 00:19:09,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=215, PETRI_PLACES=88, PETRI_TRANSITIONS=45} [2025-04-14 00:19:09,218 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 32 predicate places. [2025-04-14 00:19:09,218 INFO L485 AbstractCegarLoop]: Abstraction has has 88 places, 45 transitions, 215 flow [2025-04-14 00:19:09,218 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-14 00:19:09,218 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:09,218 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-14 00:19:09,218 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 00:19:09,218 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-04-14 00:19:09,218 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:09,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1218346006, now seen corresponding path program 1 times [2025-04-14 00:19:09,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:09,219 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939347959] [2025-04-14 00:19:09,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:19:09,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:09,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-14 00:19:09,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 00:19:09,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:19:09,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:09,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-14 00:19:09,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:09,327 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939347959] [2025-04-14 00:19:09,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939347959] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:19:09,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:19:09,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:19:09,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312268083] [2025-04-14 00:19:09,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:19:09,328 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:19:09,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:09,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:19:09,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:19:09,328 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-04-14 00:19:09,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 45 transitions, 215 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-14 00:19:09,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:09,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-04-14 00:19:09,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:09,437 INFO L116 PetriNetUnfolderBase]: 645/1128 cut-off events. [2025-04-14 00:19:09,437 INFO L117 PetriNetUnfolderBase]: For 651/685 co-relation queries the response was YES. [2025-04-14 00:19:09,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3013 conditions, 1128 events. 645/1128 cut-off events. For 651/685 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4601 event pairs, 275 based on Foata normal form. 56/1169 useless extension candidates. Maximal degree in co-relation 3001. Up to 664 conditions per place. [2025-04-14 00:19:09,440 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 0 selfloop transitions, 0 changer transitions 51/51 dead transitions. [2025-04-14 00:19:09,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 51 transitions, 292 flow [2025-04-14 00:19:09,440 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:19:09,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:19:09,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2025-04-14 00:19:09,441 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42 [2025-04-14 00:19:09,441 INFO L175 Difference]: Start difference. First operand has 88 places, 45 transitions, 215 flow. Second operand 4 states and 84 transitions. [2025-04-14 00:19:09,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 51 transitions, 292 flow [2025-04-14 00:19:09,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 51 transitions, 254 flow, removed 4 selfloop flow, removed 17 redundant places. [2025-04-14 00:19:09,443 INFO L231 Difference]: Finished difference. Result has 60 places, 0 transitions, 0 flow [2025-04-14 00:19:09,443 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=60, PETRI_TRANSITIONS=0} [2025-04-14 00:19:09,444 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 4 predicate places. [2025-04-14 00:19:09,444 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 0 transitions, 0 flow [2025-04-14 00:19:09,444 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-14 00:19:09,456 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2025-04-14 00:19:09,457 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2025-04-14 00:19:09,457 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2025-04-14 00:19:09,457 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 9 remaining) [2025-04-14 00:19:09,457 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2025-04-14 00:19:09,457 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2025-04-14 00:19:09,457 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2025-04-14 00:19:09,457 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2025-04-14 00:19:09,457 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2025-04-14 00:19:09,457 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 00:19:09,457 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:09,461 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:19:09,461 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:19:09,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:19:09 BasicIcfg [2025-04-14 00:19:09,464 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:19:09,465 INFO L158 Benchmark]: Toolchain (without parser) took 14963.48ms. Allocated memory was 142.6MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 98.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2025-04-14 00:19:09,465 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 167.8MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:19:09,465 INFO L158 Benchmark]: CACSL2BoogieTranslator took 377.96ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 75.1MB in the end (delta: 23.8MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-14 00:19:09,465 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.24ms. Allocated memory is still 142.6MB. Free memory was 75.1MB in the beginning and 72.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:19:09,466 INFO L158 Benchmark]: Boogie Preprocessor took 41.95ms. Allocated memory is still 142.6MB. Free memory was 72.9MB in the beginning and 70.9MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:19:09,466 INFO L158 Benchmark]: IcfgBuilder took 545.88ms. Allocated memory is still 142.6MB. Free memory was 70.9MB in the beginning and 90.1MB in the end (delta: -19.2MB). Peak memory consumption was 52.7MB. Max. memory is 8.0GB. [2025-04-14 00:19:09,466 INFO L158 Benchmark]: TraceAbstraction took 13963.63ms. Allocated memory was 142.6MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 89.4MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2025-04-14 00:19:09,467 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 167.8MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 377.96ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 75.1MB in the end (delta: 23.8MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.24ms. Allocated memory is still 142.6MB. Free memory was 75.1MB in the beginning and 72.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 41.95ms. Allocated memory is still 142.6MB. Free memory was 72.9MB in the beginning and 70.9MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 545.88ms. Allocated memory is still 142.6MB. Free memory was 70.9MB in the beginning and 90.1MB in the end (delta: -19.2MB). Peak memory consumption was 52.7MB. Max. memory is 8.0GB. * TraceAbstraction took 13963.63ms. Allocated memory was 142.6MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 89.4MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.6GB. 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 7 procedures, 85 locations, 83 edges, 9 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: 13.9s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 577 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 577 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1492 IncrementalHoareTripleChecker+Invalid, 1534 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 0 mSDtfsCounter, 1492 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=381occurred in iteration=7, InterpolantAutomatonStates: 48, 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, 168 NumberOfCodeBlocks, 168 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 159 ConstructedInterpolants, 0 QuantifiedInterpolants, 543 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-14 00:19:09,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...