./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_10-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/fibo_10-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash acde98dd01af02b5a508b32116f1b2c3612f1f84e6ba2fe02fc76c333a1d32d3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:42:49,683 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:42:49,732 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:42:49,738 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:42:49,740 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:42:49,753 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:42:49,753 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:42:49,754 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:42:49,754 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:42:49,754 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:42:49,754 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:42:49,754 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:42:49,754 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:42:49,754 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:42:49,755 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:42:49,755 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:42:49,755 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:42:49,755 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:42:49,755 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:42:49,755 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:42:49,755 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:42:49,755 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:42:49,755 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:42:49,755 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:42:49,755 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:42:49,756 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:42:49,756 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:42:49,756 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:42:49,756 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:42:49,756 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:42:49,756 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:42:49,756 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:42:49,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:42:49,756 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:42:49,756 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:42:49,756 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:42:49,757 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:42:49,757 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:42:49,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:42:49,757 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:42:49,757 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:42:49,757 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:42:49,757 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:42:49,757 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> acde98dd01af02b5a508b32116f1b2c3612f1f84e6ba2fe02fc76c333a1d32d3 [2025-03-08 05:42:49,957 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:42:49,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:42:49,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:42:49,966 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:42:49,966 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:42:49,967 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_10-1.c [2025-03-08 05:42:51,092 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45f711edf/c43f2be8c83d4b7a8b205e2d298ce901/FLAG051e91c23 [2025-03-08 05:42:51,266 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:42:51,266 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_10-1.c [2025-03-08 05:42:51,272 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45f711edf/c43f2be8c83d4b7a8b205e2d298ce901/FLAG051e91c23 [2025-03-08 05:42:51,642 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45f711edf/c43f2be8c83d4b7a8b205e2d298ce901 [2025-03-08 05:42:51,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:42:51,644 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:42:51,645 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:42:51,645 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:42:51,648 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:42:51,649 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:42:51" (1/1) ... [2025-03-08 05:42:51,650 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3993ea07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:51, skipping insertion in model container [2025-03-08 05:42:51,650 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:42:51" (1/1) ... [2025-03-08 05:42:51,658 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:42:51,750 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_10-1.c[743,756] [2025-03-08 05:42:51,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:42:51,760 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:42:51,770 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_10-1.c[743,756] [2025-03-08 05:42:51,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:42:51,780 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:42:51,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:51 WrapperNode [2025-03-08 05:42:51,781 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:42:51,782 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:42:51,782 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:42:51,782 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:42:51,787 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:51" (1/1) ... [2025-03-08 05:42:51,792 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:51" (1/1) ... [2025-03-08 05:42:51,801 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2025-03-08 05:42:51,803 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:42:51,803 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:42:51,804 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:42:51,804 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:42:51,809 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:51" (1/1) ... [2025-03-08 05:42:51,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:51" (1/1) ... [2025-03-08 05:42:51,811 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:51" (1/1) ... [2025-03-08 05:42:51,818 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 05:42:51,818 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:51" (1/1) ... [2025-03-08 05:42:51,818 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:51" (1/1) ... [2025-03-08 05:42:51,823 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:51" (1/1) ... [2025-03-08 05:42:51,823 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:51" (1/1) ... [2025-03-08 05:42:51,824 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:51" (1/1) ... [2025-03-08 05:42:51,824 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:51" (1/1) ... [2025-03-08 05:42:51,825 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:42:51,825 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:42:51,825 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:42:51,825 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:42:51,826 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:51" (1/1) ... [2025-03-08 05:42:51,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:42:51,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:51,853 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:42:51,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:42:51,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:42:51,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:42:51,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:42:51,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:42:51,878 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2025-03-08 05:42:51,879 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2025-03-08 05:42:51,919 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:42:51,921 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:42:51,984 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13: havoc #t~ret4;havoc #t~ret5; [2025-03-08 05:42:51,989 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-08 05:42:51,989 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:42:51,995 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:42:51,995 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:42:51,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:42:51 BoogieIcfgContainer [2025-03-08 05:42:51,996 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:42:51,997 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:42:51,997 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:42:52,001 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:42:52,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:42:51" (1/3) ... [2025-03-08 05:42:52,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518e5307 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:42:52, skipping insertion in model container [2025-03-08 05:42:52,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:51" (2/3) ... [2025-03-08 05:42:52,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518e5307 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:42:52, skipping insertion in model container [2025-03-08 05:42:52,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:42:51" (3/3) ... [2025-03-08 05:42:52,003 INFO L128 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2025-03-08 05:42:52,014 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:42:52,015 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fibo_10-1.c that has 2 procedures, 20 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-08 05:42:52,048 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:42:52,055 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@54b6bbc2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:42:52,056 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:42:52,059 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 05:42:52,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 05:42:52,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:52,063 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:52,063 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:52,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:52,067 INFO L85 PathProgramCache]: Analyzing trace with hash 402921910, now seen corresponding path program 1 times [2025-03-08 05:42:52,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:52,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697156733] [2025-03-08 05:42:52,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:52,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:52,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 05:42:52,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 05:42:52,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:52,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:52,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:42:52,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:52,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697156733] [2025-03-08 05:42:52,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697156733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:42:52,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:42:52,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:42:52,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399712406] [2025-03-08 05:42:52,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:42:52,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:42:52,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:52,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:42:52,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:42:52,294 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:42:52,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:52,334 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2025-03-08 05:42:52,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:42:52,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2025-03-08 05:42:52,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:52,340 INFO L225 Difference]: With dead ends: 30 [2025-03-08 05:42:52,340 INFO L226 Difference]: Without dead ends: 18 [2025-03-08 05:42:52,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:42:52,343 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:52,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:42:52,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-08 05:42:52,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-08 05:42:52,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 05:42:52,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-03-08 05:42:52,371 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2025-03-08 05:42:52,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:52,372 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-03-08 05:42:52,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:42:52,373 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-03-08 05:42:52,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 05:42:52,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:52,374 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:52,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:42:52,374 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:52,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:52,375 INFO L85 PathProgramCache]: Analyzing trace with hash -2143228819, now seen corresponding path program 1 times [2025-03-08 05:42:52,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:52,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340085469] [2025-03-08 05:42:52,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:52,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:52,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 05:42:52,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 05:42:52,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:52,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:52,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:42:52,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:52,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340085469] [2025-03-08 05:42:52,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340085469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:42:52,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:42:52,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:42:52,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62834159] [2025-03-08 05:42:52,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:42:52,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:42:52,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:52,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:42:52,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:42:52,450 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:42:52,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:52,467 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2025-03-08 05:42:52,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:42:52,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-03-08 05:42:52,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:52,468 INFO L225 Difference]: With dead ends: 24 [2025-03-08 05:42:52,468 INFO L226 Difference]: Without dead ends: 20 [2025-03-08 05:42:52,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:42:52,470 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:52,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:42:52,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-08 05:42:52,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2025-03-08 05:42:52,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 05:42:52,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-03-08 05:42:52,476 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2025-03-08 05:42:52,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:52,476 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-03-08 05:42:52,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:42:52,476 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-03-08 05:42:52,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 05:42:52,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:52,478 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:52,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:42:52,478 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:52,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:52,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1857137997, now seen corresponding path program 1 times [2025-03-08 05:42:52,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:52,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164271649] [2025-03-08 05:42:52,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:52,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:52,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 05:42:52,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 05:42:52,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:52,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:52,588 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:42:52,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:52,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164271649] [2025-03-08 05:42:52,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164271649] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:52,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333215798] [2025-03-08 05:42:52,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:52,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:52,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:52,590 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:42:52,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 05:42:52,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 05:42:52,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 05:42:52,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:52,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:52,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:42:52,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:52,720 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:42:52,721 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:52,935 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:42:52,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333215798] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:52,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:52,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 11 [2025-03-08 05:42:52,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214010134] [2025-03-08 05:42:52,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:52,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 05:42:52,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:52,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 05:42:52,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:42:52,936 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 11 states, 8 states have (on average 3.5) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 05:42:53,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:53,008 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2025-03-08 05:42:53,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:42:53,010 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 3.5) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 23 [2025-03-08 05:42:53,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:53,010 INFO L225 Difference]: With dead ends: 35 [2025-03-08 05:42:53,010 INFO L226 Difference]: Without dead ends: 20 [2025-03-08 05:42:53,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:42:53,011 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 15 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:53,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 48 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:42:53,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-08 05:42:53,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-08 05:42:53,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 05:42:53,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2025-03-08 05:42:53,019 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2025-03-08 05:42:53,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:53,020 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2025-03-08 05:42:53,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 3.5) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 05:42:53,020 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2025-03-08 05:42:53,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 05:42:53,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:53,022 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:53,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 05:42:53,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:53,223 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:53,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:53,223 INFO L85 PathProgramCache]: Analyzing trace with hash -318077138, now seen corresponding path program 1 times [2025-03-08 05:42:53,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:53,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898012973] [2025-03-08 05:42:53,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:53,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:53,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 05:42:53,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 05:42:53,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:53,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:53,313 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 05:42:53,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:53,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898012973] [2025-03-08 05:42:53,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898012973] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:53,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136666811] [2025-03-08 05:42:53,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:53,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:53,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:53,315 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:42:53,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 05:42:53,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 05:42:53,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 05:42:53,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:53,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:53,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:42:53,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:53,370 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 05:42:53,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:53,501 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:42:53,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136666811] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:53,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:53,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2025-03-08 05:42:53,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051029518] [2025-03-08 05:42:53,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:53,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 05:42:53,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:53,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 05:42:53,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:42:53,503 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 05:42:53,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:53,561 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2025-03-08 05:42:53,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:42:53,562 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) Word has length 24 [2025-03-08 05:42:53,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:53,562 INFO L225 Difference]: With dead ends: 29 [2025-03-08 05:42:53,562 INFO L226 Difference]: Without dead ends: 25 [2025-03-08 05:42:53,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:42:53,563 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:53,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 37 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:42:53,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-08 05:42:53,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-08 05:42:53,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-08 05:42:53,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2025-03-08 05:42:53,571 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 24 [2025-03-08 05:42:53,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:53,571 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2025-03-08 05:42:53,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 05:42:53,571 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2025-03-08 05:42:53,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 05:42:53,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:53,573 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:53,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 05:42:53,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-08 05:42:53,777 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:53,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:53,777 INFO L85 PathProgramCache]: Analyzing trace with hash -896080901, now seen corresponding path program 2 times [2025-03-08 05:42:53,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:53,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313443584] [2025-03-08 05:42:53,778 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:42:53,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:53,782 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-08 05:42:53,787 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 05:42:53,787 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:42:53,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:53,974 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 05:42:53,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:53,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313443584] [2025-03-08 05:42:53,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313443584] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:53,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756814523] [2025-03-08 05:42:53,975 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:42:53,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:53,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:53,977 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:42:53,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 05:42:54,001 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-08 05:42:54,016 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 05:42:54,016 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:42:54,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:54,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:42:54,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:54,109 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 05:42:54,109 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:54,405 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 05:42:54,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756814523] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:54,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:54,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 20 [2025-03-08 05:42:54,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752359314] [2025-03-08 05:42:54,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:54,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 05:42:54,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:54,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 05:42:54,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2025-03-08 05:42:54,407 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 20 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 10 states have call successors, (11), 1 states have call predecessors, (11), 7 states have return successors, (13), 8 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-08 05:42:54,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:54,652 INFO L93 Difference]: Finished difference Result 46 states and 83 transitions. [2025-03-08 05:42:54,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 05:42:54,653 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 10 states have call successors, (11), 1 states have call predecessors, (11), 7 states have return successors, (13), 8 states have call predecessors, (13), 10 states have call successors, (13) Word has length 37 [2025-03-08 05:42:54,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:54,656 INFO L225 Difference]: With dead ends: 46 [2025-03-08 05:42:54,656 INFO L226 Difference]: Without dead ends: 42 [2025-03-08 05:42:54,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=749, Unknown=0, NotChecked=0, Total=930 [2025-03-08 05:42:54,658 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 24 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:54,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 95 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:54,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-08 05:42:54,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2025-03-08 05:42:54,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (20), 7 states have call predecessors, (20), 5 states have call successors, (20) [2025-03-08 05:42:54,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 46 transitions. [2025-03-08 05:42:54,668 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 46 transitions. Word has length 37 [2025-03-08 05:42:54,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:54,668 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 46 transitions. [2025-03-08 05:42:54,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 10 states have call successors, (11), 1 states have call predecessors, (11), 7 states have return successors, (13), 8 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-08 05:42:54,668 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 46 transitions. [2025-03-08 05:42:54,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 05:42:54,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:54,670 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 9, 6, 6, 6, 6, 6, 6, 6, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:54,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 05:42:54,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:54,870 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:54,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:54,871 INFO L85 PathProgramCache]: Analyzing trace with hash 525573421, now seen corresponding path program 3 times [2025-03-08 05:42:54,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:54,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77033353] [2025-03-08 05:42:54,871 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:42:54,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:54,877 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 91 statements into 12 equivalence classes. [2025-03-08 05:42:54,897 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 54 of 91 statements. [2025-03-08 05:42:54,897 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-08 05:42:54,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:55,010 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 167 proven. 29 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2025-03-08 05:42:55,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:55,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77033353] [2025-03-08 05:42:55,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77033353] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:55,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013357003] [2025-03-08 05:42:55,010 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:42:55,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:55,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:55,013 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:42:55,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 05:42:55,044 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 91 statements into 12 equivalence classes. [2025-03-08 05:42:55,060 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 54 of 91 statements. [2025-03-08 05:42:55,060 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-08 05:42:55,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:55,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:42:55,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:55,102 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 215 proven. 12 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2025-03-08 05:42:55,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:55,446 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 169 proven. 27 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2025-03-08 05:42:55,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013357003] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:55,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:55,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 13 [2025-03-08 05:42:55,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521899895] [2025-03-08 05:42:55,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:55,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 05:42:55,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:55,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 05:42:55,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:42:55,448 INFO L87 Difference]: Start difference. First operand 30 states and 46 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) [2025-03-08 05:42:55,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:55,544 INFO L93 Difference]: Finished difference Result 62 states and 110 transitions. [2025-03-08 05:42:55,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:42:55,545 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) Word has length 91 [2025-03-08 05:42:55,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:55,545 INFO L225 Difference]: With dead ends: 62 [2025-03-08 05:42:55,546 INFO L226 Difference]: Without dead ends: 35 [2025-03-08 05:42:55,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 174 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-08 05:42:55,546 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 15 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:55,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 68 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:55,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-08 05:42:55,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2025-03-08 05:42:55,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (18), 7 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-08 05:42:55,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2025-03-08 05:42:55,553 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 91 [2025-03-08 05:42:55,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:55,553 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2025-03-08 05:42:55,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) [2025-03-08 05:42:55,553 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2025-03-08 05:42:55,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 05:42:55,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:55,554 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:55,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 05:42:55,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:55,755 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:55,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:55,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1467785241, now seen corresponding path program 4 times [2025-03-08 05:42:55,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:55,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800029820] [2025-03-08 05:42:55,756 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 05:42:55,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:55,764 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 93 statements into 2 equivalence classes. [2025-03-08 05:42:55,770 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 78 of 93 statements. [2025-03-08 05:42:55,770 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 05:42:55,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:55,841 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-03-08 05:42:55,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:55,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800029820] [2025-03-08 05:42:55,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800029820] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:55,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637975033] [2025-03-08 05:42:55,841 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 05:42:55,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:55,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:55,843 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:42:55,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 05:42:55,874 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 93 statements into 2 equivalence classes. [2025-03-08 05:42:55,891 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 78 of 93 statements. [2025-03-08 05:42:55,891 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 05:42:55,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:55,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 05:42:55,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:55,933 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-03-08 05:42:55,933 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:56,352 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 181 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2025-03-08 05:42:56,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637975033] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:56,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:56,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2025-03-08 05:42:56,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488996984] [2025-03-08 05:42:56,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:56,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 05:42:56,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:56,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 05:42:56,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:42:56,355 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 13 states have internal predecessors, (40), 10 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 5 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-08 05:42:56,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:56,417 INFO L93 Difference]: Finished difference Result 41 states and 63 transitions. [2025-03-08 05:42:56,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:42:56,417 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 13 states have internal predecessors, (40), 10 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 5 states have call predecessors, (13), 10 states have call successors, (13) Word has length 93 [2025-03-08 05:42:56,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:56,418 INFO L225 Difference]: With dead ends: 41 [2025-03-08 05:42:56,418 INFO L226 Difference]: Without dead ends: 37 [2025-03-08 05:42:56,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 180 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-03-08 05:42:56,419 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:56,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 63 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:42:56,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-08 05:42:56,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-08 05:42:56,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (27), 9 states have call predecessors, (27), 6 states have call successors, (27) [2025-03-08 05:42:56,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 59 transitions. [2025-03-08 05:42:56,430 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 59 transitions. Word has length 93 [2025-03-08 05:42:56,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:56,431 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 59 transitions. [2025-03-08 05:42:56,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 13 states have internal predecessors, (40), 10 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 5 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-08 05:42:56,431 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 59 transitions. [2025-03-08 05:42:56,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-08 05:42:56,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:56,434 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 25, 14, 14, 14, 14, 14, 14, 14, 11, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:56,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 05:42:56,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:56,635 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:56,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:56,635 INFO L85 PathProgramCache]: Analyzing trace with hash -398227603, now seen corresponding path program 5 times [2025-03-08 05:42:56,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:56,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739356545] [2025-03-08 05:42:56,635 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 05:42:56,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:56,642 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 203 statements into 24 equivalence classes. [2025-03-08 05:42:56,651 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 81 of 203 statements. [2025-03-08 05:42:56,652 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-08 05:42:56,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:56,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 259 proven. 360 refuted. 0 times theorem prover too weak. 1669 trivial. 0 not checked. [2025-03-08 05:42:56,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:56,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739356545] [2025-03-08 05:42:56,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739356545] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:56,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724041827] [2025-03-08 05:42:56,747 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 05:42:56,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:56,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:56,749 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:42:56,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 05:42:56,785 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 203 statements into 24 equivalence classes. [2025-03-08 05:42:56,801 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 81 of 203 statements. [2025-03-08 05:42:56,801 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-08 05:42:56,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:56,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 05:42:56,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:56,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 1311 proven. 33 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2025-03-08 05:42:56,868 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:57,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 281 proven. 428 refuted. 0 times theorem prover too weak. 1579 trivial. 0 not checked. [2025-03-08 05:42:57,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724041827] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:57,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:57,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 11] total 16 [2025-03-08 05:42:57,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490237033] [2025-03-08 05:42:57,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:57,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 05:42:57,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:57,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 05:42:57,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-03-08 05:42:57,548 INFO L87 Difference]: Start difference. First operand 37 states and 59 transitions. Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 9 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (18), 6 states have call predecessors, (18), 9 states have call successors, (18) [2025-03-08 05:42:57,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:57,661 INFO L93 Difference]: Finished difference Result 85 states and 174 transitions. [2025-03-08 05:42:57,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 05:42:57,662 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 9 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (18), 6 states have call predecessors, (18), 9 states have call successors, (18) Word has length 203 [2025-03-08 05:42:57,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:57,663 INFO L225 Difference]: With dead ends: 85 [2025-03-08 05:42:57,664 INFO L226 Difference]: Without dead ends: 51 [2025-03-08 05:42:57,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 396 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2025-03-08 05:42:57,667 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:57,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 105 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:57,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-08 05:42:57,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2025-03-08 05:42:57,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 7 states have call successors, (7), 3 states have call predecessors, (7), 7 states have return successors, (35), 11 states have call predecessors, (35), 7 states have call successors, (35) [2025-03-08 05:42:57,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 74 transitions. [2025-03-08 05:42:57,680 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 74 transitions. Word has length 203 [2025-03-08 05:42:57,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:57,680 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 74 transitions. [2025-03-08 05:42:57,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 9 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (18), 6 states have call predecessors, (18), 9 states have call successors, (18) [2025-03-08 05:42:57,681 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 74 transitions. [2025-03-08 05:42:57,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-08 05:42:57,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:57,686 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 23, 13, 13, 13, 13, 13, 13, 13, 10, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:57,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 05:42:57,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:57,890 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:57,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:57,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1403071511, now seen corresponding path program 6 times [2025-03-08 05:42:57,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:57,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019006171] [2025-03-08 05:42:57,891 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 05:42:57,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:57,899 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 189 statements into 22 equivalence classes. [2025-03-08 05:42:57,909 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 92 of 189 statements. [2025-03-08 05:42:57,910 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-03-08 05:42:57,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:58,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 612 proven. 39 refuted. 0 times theorem prover too weak. 1318 trivial. 0 not checked. [2025-03-08 05:42:58,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:58,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019006171] [2025-03-08 05:42:58,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019006171] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:58,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615239682] [2025-03-08 05:42:58,090 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 05:42:58,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:58,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:58,092 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:42:58,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 05:42:58,141 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 189 statements into 22 equivalence classes. [2025-03-08 05:42:58,165 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 92 of 189 statements. [2025-03-08 05:42:58,165 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-03-08 05:42:58,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:58,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 05:42:58,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:58,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 586 proven. 43 refuted. 0 times theorem prover too weak. 1340 trivial. 0 not checked. [2025-03-08 05:42:58,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:58,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 586 proven. 46 refuted. 0 times theorem prover too weak. 1337 trivial. 0 not checked. [2025-03-08 05:42:58,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615239682] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:58,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:58,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 11] total 15 [2025-03-08 05:42:58,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636688478] [2025-03-08 05:42:58,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:58,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 05:42:58,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:58,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 05:42:58,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-08 05:42:58,811 INFO L87 Difference]: Start difference. First operand 45 states and 74 transitions. Second operand has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 9 states have call successors, (11), 1 states have call predecessors, (11), 6 states have return successors, (14), 6 states have call predecessors, (14), 9 states have call successors, (14) [2025-03-08 05:42:58,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:58,907 INFO L93 Difference]: Finished difference Result 87 states and 152 transitions. [2025-03-08 05:42:58,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 05:42:58,908 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 9 states have call successors, (11), 1 states have call predecessors, (11), 6 states have return successors, (14), 6 states have call predecessors, (14), 9 states have call successors, (14) Word has length 189 [2025-03-08 05:42:58,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:58,908 INFO L225 Difference]: With dead ends: 87 [2025-03-08 05:42:58,908 INFO L226 Difference]: Without dead ends: 45 [2025-03-08 05:42:58,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 372 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=320, Unknown=0, NotChecked=0, Total=462 [2025-03-08 05:42:58,909 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 27 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:58,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 75 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:58,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-08 05:42:58,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-08 05:42:58,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 30 states have internal predecessors, (35), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2025-03-08 05:42:58,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2025-03-08 05:42:58,913 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 189 [2025-03-08 05:42:58,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:58,914 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2025-03-08 05:42:58,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 9 states have call successors, (11), 1 states have call predecessors, (11), 6 states have return successors, (14), 6 states have call predecessors, (14), 9 states have call successors, (14) [2025-03-08 05:42:58,914 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2025-03-08 05:42:58,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 05:42:58,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:58,915 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:58,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 05:42:59,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:59,119 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:59,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:59,119 INFO L85 PathProgramCache]: Analyzing trace with hash -240813463, now seen corresponding path program 7 times [2025-03-08 05:42:59,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:59,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293415566] [2025-03-08 05:42:59,119 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 05:42:59,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:59,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 05:42:59,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 05:42:59,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:59,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:59,248 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 52 proven. 326 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2025-03-08 05:42:59,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:59,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293415566] [2025-03-08 05:42:59,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293415566] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:59,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677053416] [2025-03-08 05:42:59,248 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 05:42:59,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:59,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:59,250 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:42:59,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 05:42:59,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 05:42:59,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 05:42:59,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:59,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:59,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 05:42:59,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:59,347 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 52 proven. 326 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2025-03-08 05:42:59,347 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:59,957 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 52 proven. 352 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2025-03-08 05:42:59,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677053416] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:59,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:59,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 15 [2025-03-08 05:42:59,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933659030] [2025-03-08 05:42:59,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:59,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 05:42:59,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:59,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 05:42:59,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-03-08 05:42:59,959 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand has 15 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 15 states have internal predecessors, (46), 12 states have call successors, (13), 1 states have call predecessors, (13), 6 states have return successors, (16), 6 states have call predecessors, (16), 12 states have call successors, (16) [2025-03-08 05:43:00,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:43:00,038 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2025-03-08 05:43:00,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:43:00,039 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 15 states have internal predecessors, (46), 12 states have call successors, (13), 1 states have call predecessors, (13), 6 states have return successors, (16), 6 states have call predecessors, (16), 12 states have call successors, (16) Word has length 133 [2025-03-08 05:43:00,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:43:00,040 INFO L225 Difference]: With dead ends: 54 [2025-03-08 05:43:00,040 INFO L226 Difference]: Without dead ends: 50 [2025-03-08 05:43:00,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 259 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2025-03-08 05:43:00,040 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 39 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:43:00,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 73 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:43:00,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-08 05:43:00,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-08 05:43:00,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 33 states have internal predecessors, (38), 7 states have call successors, (7), 5 states have call predecessors, (7), 7 states have return successors, (24), 11 states have call predecessors, (24), 7 states have call successors, (24) [2025-03-08 05:43:00,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 69 transitions. [2025-03-08 05:43:00,048 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 69 transitions. Word has length 133 [2025-03-08 05:43:00,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:43:00,049 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 69 transitions. [2025-03-08 05:43:00,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 15 states have internal predecessors, (46), 12 states have call successors, (13), 1 states have call predecessors, (13), 6 states have return successors, (16), 6 states have call predecessors, (16), 12 states have call successors, (16) [2025-03-08 05:43:00,049 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 69 transitions. [2025-03-08 05:43:00,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-08 05:43:00,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:43:00,051 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:43:00,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 05:43:00,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 05:43:00,251 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:43:00,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:43:00,252 INFO L85 PathProgramCache]: Analyzing trace with hash -555793953, now seen corresponding path program 8 times [2025-03-08 05:43:00,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:43:00,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731671509] [2025-03-08 05:43:00,252 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:43:00,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:43:00,258 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 215 statements into 2 equivalence classes. [2025-03-08 05:43:00,267 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 05:43:00,268 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:43:00,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:00,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 108 proven. 716 refuted. 0 times theorem prover too weak. 1756 trivial. 0 not checked. [2025-03-08 05:43:00,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:43:00,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731671509] [2025-03-08 05:43:00,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731671509] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:43:00,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856086357] [2025-03-08 05:43:00,439 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:43:00,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:43:00,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:43:00,441 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:43:00,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 05:43:00,490 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 215 statements into 2 equivalence classes. [2025-03-08 05:43:00,525 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 05:43:00,525 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:43:00,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:00,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 05:43:00,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:43:00,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 108 proven. 716 refuted. 0 times theorem prover too weak. 1756 trivial. 0 not checked. [2025-03-08 05:43:00,579 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:43:01,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 108 proven. 756 refuted. 0 times theorem prover too weak. 1716 trivial. 0 not checked. [2025-03-08 05:43:01,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856086357] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:43:01,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:43:01,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 17 [2025-03-08 05:43:01,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453790318] [2025-03-08 05:43:01,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:43:01,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 05:43:01,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:43:01,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 05:43:01,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2025-03-08 05:43:01,520 INFO L87 Difference]: Start difference. First operand 50 states and 69 transitions. Second operand has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 14 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 7 states have call predecessors, (19), 14 states have call successors, (19) [2025-03-08 05:43:01,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:43:01,615 INFO L93 Difference]: Finished difference Result 59 states and 87 transitions. [2025-03-08 05:43:01,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:43:01,616 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 14 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 7 states have call predecessors, (19), 14 states have call successors, (19) Word has length 215 [2025-03-08 05:43:01,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:43:01,617 INFO L225 Difference]: With dead ends: 59 [2025-03-08 05:43:01,617 INFO L226 Difference]: Without dead ends: 55 [2025-03-08 05:43:01,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 422 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2025-03-08 05:43:01,617 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 33 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:43:01,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 81 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:43:01,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-08 05:43:01,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-08 05:43:01,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 36 states have internal predecessors, (41), 8 states have call successors, (8), 5 states have call predecessors, (8), 8 states have return successors, (34), 13 states have call predecessors, (34), 8 states have call successors, (34) [2025-03-08 05:43:01,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 83 transitions. [2025-03-08 05:43:01,622 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 83 transitions. Word has length 215 [2025-03-08 05:43:01,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:43:01,623 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 83 transitions. [2025-03-08 05:43:01,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 14 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 7 states have call predecessors, (19), 14 states have call successors, (19) [2025-03-08 05:43:01,623 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 83 transitions. [2025-03-08 05:43:01,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-03-08 05:43:01,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:43:01,628 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 42, 25, 25, 25, 25, 25, 25, 25, 17, 9, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:43:01,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-08 05:43:01,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:43:01,832 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:43:01,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:43:01,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1141176494, now seen corresponding path program 9 times [2025-03-08 05:43:01,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:43:01,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340140564] [2025-03-08 05:43:01,833 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:43:01,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:43:01,855 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 352 statements into 45 equivalence classes. [2025-03-08 05:43:01,870 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 131 of 352 statements. [2025-03-08 05:43:01,870 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-03-08 05:43:01,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:01,957 INFO L134 CoverageAnalysis]: Checked inductivity of 7161 backedges. 1156 proven. 178 refuted. 0 times theorem prover too weak. 5827 trivial. 0 not checked. [2025-03-08 05:43:01,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:43:01,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340140564] [2025-03-08 05:43:01,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340140564] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:43:01,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933881898] [2025-03-08 05:43:01,958 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:43:01,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:43:01,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:43:01,960 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:43:01,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 05:43:02,024 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 352 statements into 45 equivalence classes. [2025-03-08 05:43:02,052 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 131 of 352 statements. [2025-03-08 05:43:02,052 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-03-08 05:43:02,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:02,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 05:43:02,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:43:02,103 INFO L134 CoverageAnalysis]: Checked inductivity of 7161 backedges. 2348 proven. 66 refuted. 0 times theorem prover too weak. 4747 trivial. 0 not checked. [2025-03-08 05:43:02,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:43:02,889 INFO L134 CoverageAnalysis]: Checked inductivity of 7161 backedges. 1156 proven. 182 refuted. 0 times theorem prover too weak. 5823 trivial. 0 not checked. [2025-03-08 05:43:02,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933881898] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:43:02,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:43:02,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 15 [2025-03-08 05:43:02,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575864551] [2025-03-08 05:43:02,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:43:02,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 05:43:02,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:43:02,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 05:43:02,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-08 05:43:02,890 INFO L87 Difference]: Start difference. First operand 55 states and 83 transitions. Second operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 7 states have call successors, (15), 2 states have call predecessors, (15), 7 states have return successors, (20), 9 states have call predecessors, (20), 7 states have call successors, (20) [2025-03-08 05:43:03,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:43:03,023 INFO L93 Difference]: Finished difference Result 120 states and 203 transitions. [2025-03-08 05:43:03,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 05:43:03,024 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 7 states have call successors, (15), 2 states have call predecessors, (15), 7 states have return successors, (20), 9 states have call predecessors, (20), 7 states have call successors, (20) Word has length 352 [2025-03-08 05:43:03,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:43:03,025 INFO L225 Difference]: With dead ends: 120 [2025-03-08 05:43:03,025 INFO L226 Difference]: Without dead ends: 65 [2025-03-08 05:43:03,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 724 GetRequests, 695 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=203, Invalid=447, Unknown=0, NotChecked=0, Total=650 [2025-03-08 05:43:03,026 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 46 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:43:03,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 78 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:43:03,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-08 05:43:03,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2025-03-08 05:43:03,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 41 states have internal predecessors, (47), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (30), 13 states have call predecessors, (30), 9 states have call successors, (30) [2025-03-08 05:43:03,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 86 transitions. [2025-03-08 05:43:03,036 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 86 transitions. Word has length 352 [2025-03-08 05:43:03,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:43:03,037 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 86 transitions. [2025-03-08 05:43:03,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 7 states have call successors, (15), 2 states have call predecessors, (15), 7 states have return successors, (20), 9 states have call predecessors, (20), 7 states have call successors, (20) [2025-03-08 05:43:03,037 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 86 transitions. [2025-03-08 05:43:03,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-03-08 05:43:03,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:43:03,042 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 43, 26, 26, 26, 26, 26, 26, 26, 17, 10, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:43:03,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 05:43:03,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 05:43:03,242 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:43:03,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:43:03,243 INFO L85 PathProgramCache]: Analyzing trace with hash 851115205, now seen corresponding path program 10 times [2025-03-08 05:43:03,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:43:03,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846734657] [2025-03-08 05:43:03,243 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 05:43:03,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:43:03,251 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 365 statements into 2 equivalence classes. [2025-03-08 05:43:03,270 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 310 of 365 statements. [2025-03-08 05:43:03,270 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 05:43:03,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:03,485 INFO L134 CoverageAnalysis]: Checked inductivity of 7715 backedges. 240 proven. 1545 refuted. 0 times theorem prover too weak. 5930 trivial. 0 not checked. [2025-03-08 05:43:03,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:43:03,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846734657] [2025-03-08 05:43:03,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846734657] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:43:03,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743275862] [2025-03-08 05:43:03,486 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 05:43:03,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:43:03,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:43:03,488 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:43:03,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 05:43:03,557 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 365 statements into 2 equivalence classes. [2025-03-08 05:43:03,602 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 310 of 365 statements. [2025-03-08 05:43:03,602 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 05:43:03,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:03,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 05:43:03,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:43:03,666 INFO L134 CoverageAnalysis]: Checked inductivity of 7715 backedges. 240 proven. 1545 refuted. 0 times theorem prover too weak. 5930 trivial. 0 not checked. [2025-03-08 05:43:03,669 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:43:05,136 INFO L134 CoverageAnalysis]: Checked inductivity of 7715 backedges. 240 proven. 1602 refuted. 0 times theorem prover too weak. 5873 trivial. 0 not checked. [2025-03-08 05:43:05,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743275862] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:43:05,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:43:05,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 19 [2025-03-08 05:43:05,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931976542] [2025-03-08 05:43:05,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:43:05,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 05:43:05,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:43:05,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 05:43:05,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2025-03-08 05:43:05,138 INFO L87 Difference]: Start difference. First operand 62 states and 86 transitions. Second operand has 19 states, 17 states have (on average 3.411764705882353) internal successors, (58), 19 states have internal predecessors, (58), 16 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2025-03-08 05:43:05,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:43:05,271 INFO L93 Difference]: Finished difference Result 71 states and 105 transitions. [2025-03-08 05:43:05,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 05:43:05,272 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.411764705882353) internal successors, (58), 19 states have internal predecessors, (58), 16 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) Word has length 365 [2025-03-08 05:43:05,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:43:05,273 INFO L225 Difference]: With dead ends: 71 [2025-03-08 05:43:05,273 INFO L226 Difference]: Without dead ends: 67 [2025-03-08 05:43:05,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 751 GetRequests, 721 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2025-03-08 05:43:05,274 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 111 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:43:05,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 92 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:43:05,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-08 05:43:05,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-08 05:43:05,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 44 states have internal predecessors, (50), 10 states have call successors, (10), 7 states have call predecessors, (10), 9 states have return successors, (41), 15 states have call predecessors, (41), 10 states have call successors, (41) [2025-03-08 05:43:05,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 101 transitions. [2025-03-08 05:43:05,281 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 101 transitions. Word has length 365 [2025-03-08 05:43:05,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:43:05,299 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 101 transitions. [2025-03-08 05:43:05,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.411764705882353) internal successors, (58), 19 states have internal predecessors, (58), 16 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2025-03-08 05:43:05,299 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 101 transitions. [2025-03-08 05:43:05,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 760 [2025-03-08 05:43:05,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:43:05,304 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 89, 55, 55, 55, 55, 55, 55, 55, 34, 22, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:43:05,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-08 05:43:05,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 05:43:05,505 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:43:05,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:43:05,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1000639375, now seen corresponding path program 11 times [2025-03-08 05:43:05,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:43:05,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966915461] [2025-03-08 05:43:05,506 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 05:43:05,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:43:05,522 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 759 statements into 90 equivalence classes. [2025-03-08 05:43:05,547 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) and asserted 240 of 759 statements. [2025-03-08 05:43:05,547 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2025-03-08 05:43:05,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:05,834 INFO L134 CoverageAnalysis]: Checked inductivity of 34276 backedges. 2098 proven. 3230 refuted. 0 times theorem prover too weak. 28948 trivial. 0 not checked. [2025-03-08 05:43:05,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:43:05,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966915461] [2025-03-08 05:43:05,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966915461] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:43:05,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233633188] [2025-03-08 05:43:05,834 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 05:43:05,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:43:05,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:43:05,838 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:43:05,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 05:43:05,944 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 759 statements into 90 equivalence classes. [2025-03-08 05:43:05,990 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) and asserted 240 of 759 statements. [2025-03-08 05:43:05,990 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2025-03-08 05:43:05,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:05,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 05:43:05,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:43:06,090 INFO L134 CoverageAnalysis]: Checked inductivity of 34276 backedges. 18559 proven. 356 refuted. 0 times theorem prover too weak. 15361 trivial. 0 not checked. [2025-03-08 05:43:06,090 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:43:08,325 INFO L134 CoverageAnalysis]: Checked inductivity of 34276 backedges. 2224 proven. 3496 refuted. 0 times theorem prover too weak. 28556 trivial. 0 not checked. [2025-03-08 05:43:08,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233633188] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:43:08,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:43:08,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 19] total 28 [2025-03-08 05:43:08,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750813378] [2025-03-08 05:43:08,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:43:08,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 05:43:08,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:43:08,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 05:43:08,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2025-03-08 05:43:08,327 INFO L87 Difference]: Start difference. First operand 67 states and 101 transitions. Second operand has 28 states, 27 states have (on average 3.185185185185185) internal successors, (86), 28 states have internal predecessors, (86), 21 states have call successors, (26), 2 states have call predecessors, (26), 11 states have return successors, (34), 12 states have call predecessors, (34), 21 states have call successors, (34) [2025-03-08 05:43:08,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:43:08,578 INFO L93 Difference]: Finished difference Result 140 states and 245 transitions. [2025-03-08 05:43:08,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 05:43:08,578 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.185185185185185) internal successors, (86), 28 states have internal predecessors, (86), 21 states have call successors, (26), 2 states have call predecessors, (26), 11 states have return successors, (34), 12 states have call predecessors, (34), 21 states have call successors, (34) Word has length 759 [2025-03-08 05:43:08,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:43:08,579 INFO L225 Difference]: With dead ends: 140 [2025-03-08 05:43:08,579 INFO L226 Difference]: Without dead ends: 78 [2025-03-08 05:43:08,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1553 GetRequests, 1502 SyntacticMatches, 9 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=485, Invalid=1407, Unknown=0, NotChecked=0, Total=1892 [2025-03-08 05:43:08,580 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 115 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:43:08,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 120 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:43:08,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-08 05:43:08,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 71. [2025-03-08 05:43:08,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.06) internal successors, (53), 47 states have internal predecessors, (53), 11 states have call successors, (11), 8 states have call predecessors, (11), 9 states have return successors, (38), 15 states have call predecessors, (38), 11 states have call successors, (38) [2025-03-08 05:43:08,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 102 transitions. [2025-03-08 05:43:08,589 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 102 transitions. Word has length 759 [2025-03-08 05:43:08,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:43:08,589 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 102 transitions. [2025-03-08 05:43:08,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.185185185185185) internal successors, (86), 28 states have internal predecessors, (86), 21 states have call successors, (26), 2 states have call predecessors, (26), 11 states have return successors, (34), 12 states have call predecessors, (34), 21 states have call successors, (34) [2025-03-08 05:43:08,589 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 102 transitions. [2025-03-08 05:43:08,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-03-08 05:43:08,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:43:08,591 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 67, 41, 41, 41, 41, 41, 41, 41, 26, 16, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:43:08,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-08 05:43:08,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 05:43:08,792 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:43:08,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:43:08,792 INFO L85 PathProgramCache]: Analyzing trace with hash 2121070825, now seen corresponding path program 12 times [2025-03-08 05:43:08,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:43:08,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658201732] [2025-03-08 05:43:08,793 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 05:43:08,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:43:08,803 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 569 statements into 78 equivalence classes. [2025-03-08 05:43:08,820 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) and asserted 147 of 569 statements. [2025-03-08 05:43:08,820 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2025-03-08 05:43:08,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:08,949 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 718 proven. 2242 refuted. 0 times theorem prover too weak. 16143 trivial. 0 not checked. [2025-03-08 05:43:08,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:43:08,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658201732] [2025-03-08 05:43:08,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658201732] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:43:08,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154858843] [2025-03-08 05:43:08,949 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 05:43:08,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:43:08,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:43:08,951 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:43:08,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-08 05:43:09,062 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 569 statements into 78 equivalence classes. [2025-03-08 05:43:09,096 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) and asserted 147 of 569 statements. [2025-03-08 05:43:09,096 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2025-03-08 05:43:09,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:09,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 05:43:09,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:43:09,172 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 709 proven. 2234 refuted. 0 times theorem prover too weak. 16160 trivial. 0 not checked. [2025-03-08 05:43:09,172 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:43:10,802 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 715 proven. 2285 refuted. 0 times theorem prover too weak. 16103 trivial. 0 not checked. [2025-03-08 05:43:10,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154858843] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:43:10,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:43:10,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 17] total 20 [2025-03-08 05:43:10,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314671520] [2025-03-08 05:43:10,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:43:10,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 05:43:10,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:43:10,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 05:43:10,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2025-03-08 05:43:10,805 INFO L87 Difference]: Start difference. First operand 71 states and 102 transitions. Second operand has 20 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 20 states have internal predecessors, (62), 16 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (24), 10 states have call predecessors, (24), 16 states have call successors, (24) [2025-03-08 05:43:10,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:43:10,970 INFO L93 Difference]: Finished difference Result 258 states and 452 transitions. [2025-03-08 05:43:10,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 05:43:10,970 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 20 states have internal predecessors, (62), 16 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (24), 10 states have call predecessors, (24), 16 states have call successors, (24) Word has length 569 [2025-03-08 05:43:10,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:43:10,973 INFO L225 Difference]: With dead ends: 258 [2025-03-08 05:43:10,973 INFO L226 Difference]: Without dead ends: 254 [2025-03-08 05:43:10,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1160 GetRequests, 1128 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=228, Invalid=474, Unknown=0, NotChecked=0, Total=702 [2025-03-08 05:43:10,975 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 69 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:43:10,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 111 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:43:10,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-08 05:43:10,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 183. [2025-03-08 05:43:10,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 126 states have (on average 1.0634920634920635) internal successors, (134), 119 states have internal predecessors, (134), 35 states have call successors, (35), 20 states have call predecessors, (35), 21 states have return successors, (108), 43 states have call predecessors, (108), 35 states have call successors, (108) [2025-03-08 05:43:11,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 277 transitions. [2025-03-08 05:43:11,001 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 277 transitions. Word has length 569 [2025-03-08 05:43:11,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:43:11,002 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 277 transitions. [2025-03-08 05:43:11,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 20 states have internal predecessors, (62), 16 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (24), 10 states have call predecessors, (24), 16 states have call successors, (24) [2025-03-08 05:43:11,002 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 277 transitions. [2025-03-08 05:43:11,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2025-03-08 05:43:11,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:43:11,005 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 77, 47, 47, 47, 47, 47, 47, 47, 30, 18, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:43:11,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-08 05:43:11,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 05:43:11,206 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:43:11,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:43:11,206 INFO L85 PathProgramCache]: Analyzing trace with hash -169539397, now seen corresponding path program 13 times [2025-03-08 05:43:11,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:43:11,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365734344] [2025-03-08 05:43:11,207 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 05:43:11,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:43:11,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 651 statements into 1 equivalence classes. [2025-03-08 05:43:11,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 651 of 651 statements. [2025-03-08 05:43:11,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:43:11,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:11,741 INFO L134 CoverageAnalysis]: Checked inductivity of 25110 backedges. 473 proven. 3406 refuted. 0 times theorem prover too weak. 21231 trivial. 0 not checked. [2025-03-08 05:43:11,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:43:11,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365734344] [2025-03-08 05:43:11,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365734344] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:43:11,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336180559] [2025-03-08 05:43:11,741 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 05:43:11,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:43:11,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:43:11,743 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:43:11,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-08 05:43:11,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 651 statements into 1 equivalence classes. [2025-03-08 05:43:11,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 651 of 651 statements. [2025-03-08 05:43:11,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:43:11,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:11,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 1465 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 05:43:11,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:43:12,037 INFO L134 CoverageAnalysis]: Checked inductivity of 25110 backedges. 473 proven. 3406 refuted. 0 times theorem prover too weak. 21231 trivial. 0 not checked. [2025-03-08 05:43:12,037 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:43:14,269 INFO L134 CoverageAnalysis]: Checked inductivity of 25110 backedges. 473 proven. 3483 refuted. 0 times theorem prover too weak. 21154 trivial. 0 not checked. [2025-03-08 05:43:14,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336180559] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:43:14,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:43:14,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 21 [2025-03-08 05:43:14,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042119224] [2025-03-08 05:43:14,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:43:14,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 05:43:14,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:43:14,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 05:43:14,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2025-03-08 05:43:14,271 INFO L87 Difference]: Start difference. First operand 183 states and 277 transitions. Second operand has 21 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 21 states have internal predecessors, (64), 18 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (25), 9 states have call predecessors, (25), 18 states have call successors, (25) [2025-03-08 05:43:14,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:43:14,409 INFO L93 Difference]: Finished difference Result 284 states and 548 transitions. [2025-03-08 05:43:14,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 05:43:14,410 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 21 states have internal predecessors, (64), 18 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (25), 9 states have call predecessors, (25), 18 states have call successors, (25) Word has length 651 [2025-03-08 05:43:14,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:43:14,413 INFO L225 Difference]: With dead ends: 284 [2025-03-08 05:43:14,413 INFO L226 Difference]: Without dead ends: 280 [2025-03-08 05:43:14,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1326 GetRequests, 1292 SyntacticMatches, 8 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=238, Invalid=518, Unknown=0, NotChecked=0, Total=756 [2025-03-08 05:43:14,415 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 93 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:43:14,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 97 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:43:14,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-03-08 05:43:14,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 195. [2025-03-08 05:43:14,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 133 states have (on average 1.0601503759398496) internal successors, (141), 126 states have internal predecessors, (141), 38 states have call successors, (38), 20 states have call predecessors, (38), 23 states have return successors, (134), 48 states have call predecessors, (134), 38 states have call successors, (134) [2025-03-08 05:43:14,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 313 transitions. [2025-03-08 05:43:14,435 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 313 transitions. Word has length 651 [2025-03-08 05:43:14,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:43:14,436 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 313 transitions. [2025-03-08 05:43:14,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 21 states have internal predecessors, (64), 18 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (25), 9 states have call predecessors, (25), 18 states have call successors, (25) [2025-03-08 05:43:14,436 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 313 transitions. [2025-03-08 05:43:14,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 870 [2025-03-08 05:43:14,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:43:14,441 INFO L218 NwaCegarLoop]: trace histogram [127, 127, 103, 63, 63, 63, 63, 63, 63, 63, 40, 24, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:43:14,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-08 05:43:14,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:43:14,645 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:43:14,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:43:14,645 INFO L85 PathProgramCache]: Analyzing trace with hash -188142433, now seen corresponding path program 14 times [2025-03-08 05:43:14,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:43:14,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751370655] [2025-03-08 05:43:14,645 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:43:14,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:43:14,659 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 869 statements into 2 equivalence classes. [2025-03-08 05:43:14,722 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 869 of 869 statements. [2025-03-08 05:43:14,722 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:43:14,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:15,391 INFO L134 CoverageAnalysis]: Checked inductivity of 45069 backedges. 788 proven. 5160 refuted. 0 times theorem prover too weak. 39121 trivial. 0 not checked. [2025-03-08 05:43:15,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:43:15,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751370655] [2025-03-08 05:43:15,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751370655] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:43:15,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789519585] [2025-03-08 05:43:15,391 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:43:15,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:43:15,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:43:15,393 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:43:15,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-08 05:43:15,550 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 869 statements into 2 equivalence classes. [2025-03-08 05:43:15,701 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 869 of 869 statements. [2025-03-08 05:43:15,701 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:43:15,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:15,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 1949 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 05:43:15,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:43:15,777 INFO L134 CoverageAnalysis]: Checked inductivity of 45069 backedges. 788 proven. 5160 refuted. 0 times theorem prover too weak. 39121 trivial. 0 not checked. [2025-03-08 05:43:15,777 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:43:18,847 INFO L134 CoverageAnalysis]: Checked inductivity of 45069 backedges. 788 proven. 5260 refuted. 0 times theorem prover too weak. 39021 trivial. 0 not checked. [2025-03-08 05:43:18,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789519585] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:43:18,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:43:18,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 21] total 22 [2025-03-08 05:43:18,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938622167] [2025-03-08 05:43:18,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:43:18,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 05:43:18,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:43:18,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 05:43:18,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-03-08 05:43:18,849 INFO L87 Difference]: Start difference. First operand 195 states and 313 transitions. Second operand has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 22 states have internal predecessors, (69), 19 states have call successors, (20), 1 states have call predecessors, (20), 10 states have return successors, (27), 10 states have call predecessors, (27), 19 states have call successors, (27) [2025-03-08 05:43:19,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:43:19,026 INFO L93 Difference]: Finished difference Result 311 states and 655 transitions. [2025-03-08 05:43:19,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 05:43:19,026 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 22 states have internal predecessors, (69), 19 states have call successors, (20), 1 states have call predecessors, (20), 10 states have return successors, (27), 10 states have call predecessors, (27), 19 states have call successors, (27) Word has length 869 [2025-03-08 05:43:19,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:43:19,029 INFO L225 Difference]: With dead ends: 311 [2025-03-08 05:43:19,029 INFO L226 Difference]: Without dead ends: 307 [2025-03-08 05:43:19,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1765 GetRequests, 1727 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=291, Invalid=579, Unknown=0, NotChecked=0, Total=870 [2025-03-08 05:43:19,031 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 117 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:43:19,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 93 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:43:19,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-03-08 05:43:19,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 200. [2025-03-08 05:43:19,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 136 states have (on average 1.0588235294117647) internal successors, (144), 129 states have internal predecessors, (144), 39 states have call successors, (39), 20 states have call predecessors, (39), 24 states have return successors, (148), 50 states have call predecessors, (148), 39 states have call successors, (148) [2025-03-08 05:43:19,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 331 transitions. [2025-03-08 05:43:19,054 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 331 transitions. Word has length 869 [2025-03-08 05:43:19,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:43:19,054 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 331 transitions. [2025-03-08 05:43:19,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 22 states have internal predecessors, (69), 19 states have call successors, (20), 1 states have call predecessors, (20), 10 states have return successors, (27), 10 states have call predecessors, (27), 19 states have call successors, (27) [2025-03-08 05:43:19,055 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 331 transitions. [2025-03-08 05:43:19,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1565 [2025-03-08 05:43:19,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:43:19,066 INFO L218 NwaCegarLoop]: trace histogram [229, 229, 186, 114, 114, 114, 114, 114, 114, 114, 72, 43, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:43:19,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-08 05:43:19,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 05:43:19,266 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:43:19,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:43:19,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1428154044, now seen corresponding path program 15 times [2025-03-08 05:43:19,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:43:19,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456414077] [2025-03-08 05:43:19,267 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:43:19,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:43:19,290 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1564 statements into 203 equivalence classes. [2025-03-08 05:43:19,312 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) and asserted 253 of 1564 statements. [2025-03-08 05:43:19,314 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2025-03-08 05:43:19,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:19,465 INFO L134 CoverageAnalysis]: Checked inductivity of 147393 backedges. 8469 proven. 314 refuted. 0 times theorem prover too weak. 138610 trivial. 0 not checked. [2025-03-08 05:43:19,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:43:19,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456414077] [2025-03-08 05:43:19,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456414077] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:43:19,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666572202] [2025-03-08 05:43:19,465 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:43:19,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:43:19,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:43:19,467 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:43:19,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-08 05:43:19,713 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1564 statements into 203 equivalence classes. [2025-03-08 05:43:19,775 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) and asserted 253 of 1564 statements. [2025-03-08 05:43:19,775 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2025-03-08 05:43:19,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:19,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 05:43:19,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:43:19,844 INFO L134 CoverageAnalysis]: Checked inductivity of 147393 backedges. 8459 proven. 322 refuted. 0 times theorem prover too weak. 138612 trivial. 0 not checked. [2025-03-08 05:43:19,844 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:43:23,071 INFO L134 CoverageAnalysis]: Checked inductivity of 147393 backedges. 8459 proven. 338 refuted. 0 times theorem prover too weak. 138596 trivial. 0 not checked. [2025-03-08 05:43:23,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666572202] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:43:23,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:43:23,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 15] total 19 [2025-03-08 05:43:23,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494608735] [2025-03-08 05:43:23,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:43:23,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 05:43:23,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:43:23,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 05:43:23,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2025-03-08 05:43:23,074 INFO L87 Difference]: Start difference. First operand 200 states and 331 transitions. Second operand has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 8 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (20), 13 states have call predecessors, (20), 8 states have call successors, (20) [2025-03-08 05:43:23,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:43:23,318 INFO L93 Difference]: Finished difference Result 521 states and 1024 transitions. [2025-03-08 05:43:23,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 05:43:23,319 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 8 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (20), 13 states have call predecessors, (20), 8 states have call successors, (20) Word has length 1564 [2025-03-08 05:43:23,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:43:23,321 INFO L225 Difference]: With dead ends: 521 [2025-03-08 05:43:23,322 INFO L226 Difference]: Without dead ends: 317 [2025-03-08 05:43:23,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3159 GetRequests, 3118 SyntacticMatches, 7 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=361, Invalid=899, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 05:43:23,324 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 88 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:43:23,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 96 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:43:23,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-03-08 05:43:23,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 270. [2025-03-08 05:43:23,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 181 states have (on average 1.0662983425414365) internal successors, (193), 178 states have internal predecessors, (193), 62 states have call successors, (62), 31 states have call predecessors, (62), 26 states have return successors, (199), 60 states have call predecessors, (199), 62 states have call successors, (199) [2025-03-08 05:43:23,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 454 transitions. [2025-03-08 05:43:23,342 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 454 transitions. Word has length 1564 [2025-03-08 05:43:23,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:43:23,343 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 454 transitions. [2025-03-08 05:43:23,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 8 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (20), 13 states have call predecessors, (20), 8 states have call successors, (20) [2025-03-08 05:43:23,343 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 454 transitions. [2025-03-08 05:43:23,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1537 [2025-03-08 05:43:23,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:43:23,353 INFO L218 NwaCegarLoop]: trace histogram [225, 225, 182, 112, 112, 112, 112, 112, 112, 112, 70, 43, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:43:23,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-08 05:43:23,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 05:43:23,554 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:43:23,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:43:23,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1268483072, now seen corresponding path program 16 times [2025-03-08 05:43:23,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:43:23,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066234611] [2025-03-08 05:43:23,554 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 05:43:23,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:43:23,576 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1536 statements into 2 equivalence classes. [2025-03-08 05:43:23,729 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 1309 of 1536 statements. [2025-03-08 05:43:23,729 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 05:43:23,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:24,755 INFO L134 CoverageAnalysis]: Checked inductivity of 142135 backedges. 4138 proven. 5949 refuted. 0 times theorem prover too weak. 132048 trivial. 0 not checked. [2025-03-08 05:43:24,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:43:24,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066234611] [2025-03-08 05:43:24,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066234611] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:43:24,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194182044] [2025-03-08 05:43:24,755 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 05:43:24,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:43:24,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:43:24,757 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:43:24,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-08 05:43:24,953 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1536 statements into 2 equivalence classes. [2025-03-08 05:43:25,114 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 1309 of 1536 statements. [2025-03-08 05:43:25,114 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 05:43:25,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:25,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 2733 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 05:43:25,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:43:25,229 INFO L134 CoverageAnalysis]: Checked inductivity of 142135 backedges. 4898 proven. 7595 refuted. 0 times theorem prover too weak. 129642 trivial. 0 not checked. [2025-03-08 05:43:25,229 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:43:30,327 INFO L134 CoverageAnalysis]: Checked inductivity of 142135 backedges. 4900 proven. 7710 refuted. 0 times theorem prover too weak. 129525 trivial. 0 not checked. [2025-03-08 05:43:30,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194182044] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:43:30,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:43:30,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 23] total 27 [2025-03-08 05:43:30,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329242197] [2025-03-08 05:43:30,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:43:30,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-08 05:43:30,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:43:30,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-08 05:43:30,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=506, Unknown=0, NotChecked=0, Total=702 [2025-03-08 05:43:30,330 INFO L87 Difference]: Start difference. First operand 270 states and 454 transitions. Second operand has 27 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 27 states have internal predecessors, (82), 22 states have call successors, (27), 1 states have call predecessors, (27), 11 states have return successors, (36), 15 states have call predecessors, (36), 22 states have call successors, (36) [2025-03-08 05:43:30,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:43:30,527 INFO L93 Difference]: Finished difference Result 602 states and 1533 transitions. [2025-03-08 05:43:30,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 05:43:30,528 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 27 states have internal predecessors, (82), 22 states have call successors, (27), 1 states have call predecessors, (27), 11 states have return successors, (36), 15 states have call predecessors, (36), 22 states have call successors, (36) Word has length 1536 [2025-03-08 05:43:30,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:43:30,531 INFO L225 Difference]: With dead ends: 602 [2025-03-08 05:43:30,531 INFO L226 Difference]: Without dead ends: 235 [2025-03-08 05:43:30,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3100 GetRequests, 3055 SyntacticMatches, 11 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=429, Invalid=831, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 05:43:30,536 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 15 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:43:30,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 194 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:43:30,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-08 05:43:30,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 221. [2025-03-08 05:43:30,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 148 states have (on average 1.0608108108108107) internal successors, (157), 145 states have internal predecessors, (157), 45 states have call successors, (45), 22 states have call predecessors, (45), 27 states have return successors, (191), 53 states have call predecessors, (191), 45 states have call successors, (191) [2025-03-08 05:43:30,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 393 transitions. [2025-03-08 05:43:30,552 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 393 transitions. Word has length 1536 [2025-03-08 05:43:30,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:43:30,553 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 393 transitions. [2025-03-08 05:43:30,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 27 states have internal predecessors, (82), 22 states have call successors, (27), 1 states have call predecessors, (27), 11 states have return successors, (36), 15 states have call predecessors, (36), 22 states have call successors, (36) [2025-03-08 05:43:30,553 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 393 transitions. [2025-03-08 05:43:30,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1427 [2025-03-08 05:43:30,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:43:30,563 INFO L218 NwaCegarLoop]: trace histogram [209, 209, 168, 104, 104, 104, 104, 104, 104, 104, 64, 41, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:43:30,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-08 05:43:30,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:43:30,763 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:43:30,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:43:30,764 INFO L85 PathProgramCache]: Analyzing trace with hash 131832384, now seen corresponding path program 17 times [2025-03-08 05:43:30,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:43:30,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095053722] [2025-03-08 05:43:30,764 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 05:43:30,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:43:30,784 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1426 statements into 157 equivalence classes. [2025-03-08 05:43:30,804 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 34 check-sat command(s) and asserted 293 of 1426 statements. [2025-03-08 05:43:30,805 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 34 check-sat command(s) [2025-03-08 05:43:30,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:30,939 INFO L134 CoverageAnalysis]: Checked inductivity of 122396 backedges. 3303 proven. 6719 refuted. 0 times theorem prover too weak. 112374 trivial. 0 not checked. [2025-03-08 05:43:30,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:43:30,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095053722] [2025-03-08 05:43:30,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095053722] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:43:30,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673962013] [2025-03-08 05:43:30,940 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 05:43:30,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:43:30,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:43:30,942 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:43:30,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-08 05:43:31,188 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1426 statements into 157 equivalence classes. [2025-03-08 05:43:31,239 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 34 check-sat command(s) and asserted 293 of 1426 statements. [2025-03-08 05:43:31,239 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 34 check-sat command(s) [2025-03-08 05:43:31,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:31,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 05:43:31,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:43:31,298 INFO L134 CoverageAnalysis]: Checked inductivity of 122396 backedges. 52031 proven. 138 refuted. 0 times theorem prover too weak. 70227 trivial. 0 not checked. [2025-03-08 05:43:31,298 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:43:34,472 INFO L134 CoverageAnalysis]: Checked inductivity of 122396 backedges. 3293 proven. 6741 refuted. 0 times theorem prover too weak. 112362 trivial. 0 not checked. [2025-03-08 05:43:34,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673962013] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:43:34,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:43:34,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 15] total 18 [2025-03-08 05:43:34,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414571130] [2025-03-08 05:43:34,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:43:34,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 05:43:34,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:43:34,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 05:43:34,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2025-03-08 05:43:34,474 INFO L87 Difference]: Start difference. First operand 221 states and 393 transitions. Second operand has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 states have internal predecessors, (66), 13 states have call successors, (20), 2 states have call predecessors, (20), 8 states have return successors, (25), 10 states have call predecessors, (25), 13 states have call successors, (25) [2025-03-08 05:43:34,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:43:34,626 INFO L93 Difference]: Finished difference Result 424 states and 801 transitions. [2025-03-08 05:43:34,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 05:43:34,626 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 states have internal predecessors, (66), 13 states have call successors, (20), 2 states have call predecessors, (20), 8 states have return successors, (25), 10 states have call predecessors, (25), 13 states have call successors, (25) Word has length 1426 [2025-03-08 05:43:34,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:43:34,629 INFO L225 Difference]: With dead ends: 424 [2025-03-08 05:43:34,629 INFO L226 Difference]: Without dead ends: 196 [2025-03-08 05:43:34,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2872 GetRequests, 2842 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=172, Invalid=428, Unknown=0, NotChecked=0, Total=600 [2025-03-08 05:43:34,631 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 24 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:43:34,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 131 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:43:34,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-08 05:43:34,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 190. [2025-03-08 05:43:34,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 130 states have (on average 1.0461538461538462) internal successors, (136), 126 states have internal predecessors, (136), 36 states have call successors, (36), 21 states have call predecessors, (36), 23 states have return successors, (129), 42 states have call predecessors, (129), 36 states have call successors, (129) [2025-03-08 05:43:34,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 301 transitions. [2025-03-08 05:43:34,647 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 301 transitions. Word has length 1426 [2025-03-08 05:43:34,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:43:34,647 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 301 transitions. [2025-03-08 05:43:34,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 states have internal predecessors, (66), 13 states have call successors, (20), 2 states have call predecessors, (20), 8 states have return successors, (25), 10 states have call predecessors, (25), 13 states have call successors, (25) [2025-03-08 05:43:34,647 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 301 transitions. [2025-03-08 05:43:34,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1578 [2025-03-08 05:43:34,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:43:34,658 INFO L218 NwaCegarLoop]: trace histogram [231, 231, 187, 115, 115, 115, 115, 115, 115, 115, 72, 44, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:43:34,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-08 05:43:34,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:43:34,859 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:43:34,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:43:34,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1073581993, now seen corresponding path program 18 times [2025-03-08 05:43:34,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:43:34,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399820849] [2025-03-08 05:43:34,860 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 05:43:34,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:43:34,881 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 1577 statements into 193 equivalence classes. [2025-03-08 05:43:34,944 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 79 check-sat command(s) and asserted 610 of 1577 statements. [2025-03-08 05:43:34,945 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 79 check-sat command(s) [2025-03-08 05:43:34,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:35,541 INFO L134 CoverageAnalysis]: Checked inductivity of 149871 backedges. 2444 proven. 14181 refuted. 0 times theorem prover too weak. 133246 trivial. 0 not checked. [2025-03-08 05:43:35,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:43:35,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399820849] [2025-03-08 05:43:35,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399820849] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:43:35,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219597385] [2025-03-08 05:43:35,542 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 05:43:35,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:43:35,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:43:35,544 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:43:35,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-08 05:43:35,808 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 1577 statements into 193 equivalence classes. [2025-03-08 05:43:35,962 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 79 check-sat command(s) and asserted 610 of 1577 statements. [2025-03-08 05:43:35,962 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 79 check-sat command(s) [2025-03-08 05:43:35,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:35,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 1368 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-08 05:43:35,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:43:36,238 INFO L134 CoverageAnalysis]: Checked inductivity of 149871 backedges. 50742 proven. 1388 refuted. 0 times theorem prover too weak. 97741 trivial. 0 not checked. [2025-03-08 05:43:36,239 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:43:41,587 INFO L134 CoverageAnalysis]: Checked inductivity of 149871 backedges. 2398 proven. 14344 refuted. 0 times theorem prover too weak. 133129 trivial. 0 not checked. [2025-03-08 05:43:41,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219597385] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:43:41,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:43:41,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 26] total 45 [2025-03-08 05:43:41,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910050701] [2025-03-08 05:43:41,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:43:41,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-08 05:43:41,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:43:41,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-08 05:43:41,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=1628, Unknown=0, NotChecked=0, Total=1980 [2025-03-08 05:43:41,590 INFO L87 Difference]: Start difference. First operand 190 states and 301 transitions. Second operand has 45 states, 45 states have (on average 3.0) internal successors, (135), 45 states have internal predecessors, (135), 36 states have call successors, (42), 2 states have call predecessors, (42), 24 states have return successors, (60), 25 states have call predecessors, (60), 36 states have call successors, (60) [2025-03-08 05:43:41,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:43:41,984 INFO L93 Difference]: Finished difference Result 405 states and 720 transitions. [2025-03-08 05:43:41,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-08 05:43:41,984 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.0) internal successors, (135), 45 states have internal predecessors, (135), 36 states have call successors, (42), 2 states have call predecessors, (42), 24 states have return successors, (60), 25 states have call predecessors, (60), 36 states have call successors, (60) Word has length 1577 [2025-03-08 05:43:41,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:43:41,986 INFO L225 Difference]: With dead ends: 405 [2025-03-08 05:43:41,986 INFO L226 Difference]: Without dead ends: 211 [2025-03-08 05:43:41,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3202 GetRequests, 3124 SyntacticMatches, 12 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1577 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1070, Invalid=3486, Unknown=0, NotChecked=0, Total=4556 [2025-03-08 05:43:41,989 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 170 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:43:41,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 253 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:43:41,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-08 05:43:41,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 180. [2025-03-08 05:43:41,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 127 states have (on average 1.031496062992126) internal successors, (131), 123 states have internal predecessors, (131), 35 states have call successors, (35), 26 states have call predecessors, (35), 17 states have return successors, (87), 30 states have call predecessors, (87), 35 states have call successors, (87) [2025-03-08 05:43:42,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 253 transitions. [2025-03-08 05:43:42,000 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 253 transitions. Word has length 1577 [2025-03-08 05:43:42,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:43:42,001 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 253 transitions. [2025-03-08 05:43:42,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.0) internal successors, (135), 45 states have internal predecessors, (135), 36 states have call successors, (42), 2 states have call predecessors, (42), 24 states have return successors, (60), 25 states have call predecessors, (60), 36 states have call successors, (60) [2025-03-08 05:43:42,001 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 253 transitions. [2025-03-08 05:43:42,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1210 [2025-03-08 05:43:42,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:43:42,008 INFO L218 NwaCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 55, 34, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:43:42,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-08 05:43:42,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:43:42,212 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:43:42,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:43:42,212 INFO L85 PathProgramCache]: Analyzing trace with hash -686723943, now seen corresponding path program 19 times [2025-03-08 05:43:42,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:43:42,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71405575] [2025-03-08 05:43:42,212 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 05:43:42,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:43:42,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1209 statements into 1 equivalence classes. [2025-03-08 05:43:42,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1209 of 1209 statements. [2025-03-08 05:43:42,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:43:42,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 05:43:42,354 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 05:43:42,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1209 statements into 1 equivalence classes. [2025-03-08 05:43:42,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1209 of 1209 statements. [2025-03-08 05:43:42,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:43:42,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 05:43:42,534 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 05:43:42,534 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 05:43:42,535 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 05:43:42,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 05:43:42,538 INFO L422 BasicCegarLoop]: Path program histogram: [19, 1, 1, 1] [2025-03-08 05:43:42,648 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 05:43:42,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:43:42 BoogieIcfgContainer [2025-03-08 05:43:42,650 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 05:43:42,650 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 05:43:42,650 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 05:43:42,651 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 05:43:42,651 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:42:51" (3/4) ... [2025-03-08 05:43:42,652 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 05:43:42,747 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 676. [2025-03-08 05:43:42,919 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 05:43:42,920 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 05:43:42,921 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 05:43:42,921 INFO L158 Benchmark]: Toolchain (without parser) took 51276.95ms. Allocated memory was 142.6MB in the beginning and 880.8MB in the end (delta: 738.2MB). Free memory was 112.2MB in the beginning and 561.8MB in the end (delta: -449.6MB). Peak memory consumption was 287.7MB. Max. memory is 16.1GB. [2025-03-08 05:43:42,922 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:43:42,922 INFO L158 Benchmark]: CACSL2BoogieTranslator took 136.63ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 101.7MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:43:42,922 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.87ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 100.7MB in the end (delta: 944.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:43:42,922 INFO L158 Benchmark]: Boogie Preprocessor took 21.26ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 99.8MB in the end (delta: 916.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:43:42,922 INFO L158 Benchmark]: IcfgBuilder took 170.40ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 90.3MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:43:42,924 INFO L158 Benchmark]: TraceAbstraction took 50652.75ms. Allocated memory was 142.6MB in the beginning and 880.8MB in the end (delta: 738.2MB). Free memory was 89.4MB in the beginning and 599.6MB in the end (delta: -510.1MB). Peak memory consumption was 220.6MB. Max. memory is 16.1GB. [2025-03-08 05:43:42,924 INFO L158 Benchmark]: Witness Printer took 270.33ms. Allocated memory is still 880.8MB. Free memory was 599.6MB in the beginning and 561.8MB in the end (delta: 37.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-08 05:43:42,925 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.46ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 136.63ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 101.7MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.87ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 100.7MB in the end (delta: 944.0kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.26ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 99.8MB in the end (delta: 916.2kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 170.40ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 90.3MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 50652.75ms. Allocated memory was 142.6MB in the beginning and 880.8MB in the end (delta: 738.2MB). Free memory was 89.4MB in the beginning and 599.6MB in the end (delta: -510.1MB). Peak memory consumption was 220.6MB. Max. memory is 16.1GB. * Witness Printer took 270.33ms. Allocated memory is still 880.8MB. Free memory was 599.6MB in the beginning and 561.8MB in the end (delta: 37.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 29]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] int x = 10; VAL [x=10] [L27] CALL, EXPR fibo(x) VAL [\old(n)=10] [L8] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L10] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=9] [L8] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L10] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, n=7] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=8, n=8] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=9, n=9] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, n=7] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=9, n=9] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=10, n=10] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, n=7] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=8, n=8] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=10, n=10] [L13] return fibo(n-1) + fibo(n-2); [L27] RET, EXPR fibo(x) VAL [x=10] [L27] int result = fibo(x); [L28] COND TRUE result == 55 VAL [x=10] [L29] reach_error() VAL [x=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 27 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 50.5s, OverallIterations: 22, TraceHistogramMax: 231, PathProgramHistogramMax: 19, EmptinessCheckTime: 0.1s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1161 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1054 mSDsluCounter, 2063 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1651 mSDsCounter, 1244 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2880 IncrementalHoareTripleChecker+Invalid, 4124 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1244 mSolverCounterUnsat, 412 mSDtfsCounter, 2880 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21770 GetRequests, 21166 SyntacticMatches, 119 SemanticMatches, 485 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4348 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=270occurred in iteration=18, InterpolantAutomatonStates: 279, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 394 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 39.0s InterpolantComputationTime, 22582 NumberOfCodeBlocks, 12330 NumberOfCodeBlocksAsserted, 507 NumberOfCheckSat, 31990 ConstructedInterpolants, 0 QuantifiedInterpolants, 38243 SizeOfPredicates, 90 NumberOfNonLiveVariables, 12358 ConjunctsInSsa, 257 ConjunctsInUnsatCore, 59 InterpolantComputations, 2 PerfectInterpolantSequences, 2011319/2126718 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 RESULT: Ultimate proved your program to be incorrect! [2025-03-08 05:43:42,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE