./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 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 14:23:18,481 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 14:23:18,570 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 14:23:18,577 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 14:23:18,578 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 14:23:18,609 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 14:23:18,610 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 14:23:18,610 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 14:23:18,611 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 14:23:18,612 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 14:23:18,612 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 14:23:18,612 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 14:23:18,613 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 14:23:18,614 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 14:23:18,615 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 14:23:18,616 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 14:23:18,616 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 14:23:18,616 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 14:23:18,617 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 14:23:18,617 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 14:23:18,617 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 14:23:18,620 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 14:23:18,620 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 14:23:18,620 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 14:23:18,620 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 14:23:18,620 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 14:23:18,621 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 14:23:18,621 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 14:23:18,621 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 14:23:18,622 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 14:23:18,622 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 14:23:18,623 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 14:23:18,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 14:23:18,623 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 14:23:18,624 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 14:23:18,624 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 14:23:18,624 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 14:23:18,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 14:23:18,624 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 14:23:18,624 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 14:23:18,625 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 14:23:18,625 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 14:23:18,626 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 [2024-11-18 14:23:18,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 14:23:18,923 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 14:23:18,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 14:23:18,927 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 14:23:18,928 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 14:23:18,929 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 [2024-11-18 14:23:20,437 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 14:23:20,628 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 14:23:20,629 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_10-1.c [2024-11-18 14:23:20,647 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1e540982/2e45ad8dd17948c8adb47ea928e0163d/FLAG20accf276 [2024-11-18 14:23:20,668 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1e540982/2e45ad8dd17948c8adb47ea928e0163d [2024-11-18 14:23:20,671 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 14:23:20,673 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 14:23:20,677 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 14:23:20,677 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 14:23:20,684 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 14:23:20,685 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:23:20" (1/1) ... [2024-11-18 14:23:20,686 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@361e7f0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:23:20, skipping insertion in model container [2024-11-18 14:23:20,686 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:23:20" (1/1) ... [2024-11-18 14:23:20,708 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 14:23:20,901 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] [2024-11-18 14:23:20,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 14:23:20,918 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 14:23:20,933 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] [2024-11-18 14:23:20,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 14:23:20,951 INFO L204 MainTranslator]: Completed translation [2024-11-18 14:23:20,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:23:20 WrapperNode [2024-11-18 14:23:20,953 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 14:23:20,954 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 14:23:20,954 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 14:23:20,954 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 14:23:20,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:23:20" (1/1) ... [2024-11-18 14:23:20,968 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:23:20" (1/1) ... [2024-11-18 14:23:20,984 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2024-11-18 14:23:20,985 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 14:23:20,986 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 14:23:20,986 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 14:23:20,986 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 14:23:20,997 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:23:20" (1/1) ... [2024-11-18 14:23:20,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:23:20" (1/1) ... [2024-11-18 14:23:20,999 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:23:20" (1/1) ... [2024-11-18 14:23:21,015 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]. [2024-11-18 14:23:21,015 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:23:20" (1/1) ... [2024-11-18 14:23:21,015 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:23:20" (1/1) ... [2024-11-18 14:23:21,018 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:23:20" (1/1) ... [2024-11-18 14:23:21,021 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:23:20" (1/1) ... [2024-11-18 14:23:21,022 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:23:20" (1/1) ... [2024-11-18 14:23:21,023 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:23:20" (1/1) ... [2024-11-18 14:23:21,025 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 14:23:21,029 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 14:23:21,029 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 14:23:21,029 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 14:23:21,030 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:23:20" (1/1) ... [2024-11-18 14:23:21,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 14:23:21,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:23:21,068 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) [2024-11-18 14:23:21,075 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 [2024-11-18 14:23:21,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 14:23:21,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 14:23:21,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 14:23:21,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 14:23:21,122 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2024-11-18 14:23:21,123 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2024-11-18 14:23:21,184 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 14:23:21,187 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 14:23:21,321 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-11-18 14:23:21,322 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 14:23:21,334 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 14:23:21,335 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-18 14:23:21,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:23:21 BoogieIcfgContainer [2024-11-18 14:23:21,336 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 14:23:21,340 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 14:23:21,340 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 14:23:21,344 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 14:23:21,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 02:23:20" (1/3) ... [2024-11-18 14:23:21,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c7b0e96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:23:21, skipping insertion in model container [2024-11-18 14:23:21,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:23:20" (2/3) ... [2024-11-18 14:23:21,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c7b0e96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:23:21, skipping insertion in model container [2024-11-18 14:23:21,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:23:21" (3/3) ... [2024-11-18 14:23:21,349 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2024-11-18 14:23:21,367 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 14:23:21,368 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 14:23:21,444 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 14:23:21,453 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;@15a4b783, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 14:23:21,453 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 14:23:21,457 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) [2024-11-18 14:23:21,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-18 14:23:21,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:23:21,466 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:23:21,466 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:23:21,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:23:21,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1755511548, now seen corresponding path program 1 times [2024-11-18 14:23:21,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:23:21,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260694452] [2024-11-18 14:23:21,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:23:21,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:23:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:23:21,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:23:21,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:23:21,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260694452] [2024-11-18 14:23:21,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260694452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:23:21,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:23:21,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 14:23:21,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266155456] [2024-11-18 14:23:21,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:23:21,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 14:23:21,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:23:21,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 14:23:21,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 14:23:21,876 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) [2024-11-18 14:23:21,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:23:21,939 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2024-11-18 14:23:21,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 14:23:21,942 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 [2024-11-18 14:23:21,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:23:21,952 INFO L225 Difference]: With dead ends: 30 [2024-11-18 14:23:21,952 INFO L226 Difference]: Without dead ends: 18 [2024-11-18 14:23:21,955 INFO L431 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 [2024-11-18 14:23:21,962 INFO L432 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 [2024-11-18 14:23:21,964 INFO L433 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] [2024-11-18 14:23:21,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-18 14:23:21,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-18 14:23:21,997 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) [2024-11-18 14:23:21,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-11-18 14:23:21,999 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2024-11-18 14:23:21,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:23:21,999 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-11-18 14:23:21,999 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) [2024-11-18 14:23:22,000 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-11-18 14:23:22,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-18 14:23:22,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:23:22,001 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:23:22,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 14:23:22,001 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:23:22,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:23:22,002 INFO L85 PathProgramCache]: Analyzing trace with hash 2128459596, now seen corresponding path program 1 times [2024-11-18 14:23:22,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:23:22,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237956008] [2024-11-18 14:23:22,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:23:22,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:23:22,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:23:22,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:23:22,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:23:22,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237956008] [2024-11-18 14:23:22,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237956008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:23:22,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:23:22,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 14:23:22,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522476066] [2024-11-18 14:23:22,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:23:22,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 14:23:22,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:23:22,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 14:23:22,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 14:23:22,089 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) [2024-11-18 14:23:22,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:23:22,107 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2024-11-18 14:23:22,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 14:23:22,107 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 [2024-11-18 14:23:22,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:23:22,108 INFO L225 Difference]: With dead ends: 24 [2024-11-18 14:23:22,109 INFO L226 Difference]: Without dead ends: 20 [2024-11-18 14:23:22,109 INFO L431 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 [2024-11-18 14:23:22,110 INFO L432 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 [2024-11-18 14:23:22,111 INFO L433 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] [2024-11-18 14:23:22,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-18 14:23:22,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2024-11-18 14:23:22,116 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) [2024-11-18 14:23:22,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-11-18 14:23:22,118 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2024-11-18 14:23:22,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:23:22,118 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-11-18 14:23:22,118 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) [2024-11-18 14:23:22,118 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-11-18 14:23:22,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-18 14:23:22,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:23:22,120 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:23:22,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 14:23:22,120 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:23:22,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:23:22,122 INFO L85 PathProgramCache]: Analyzing trace with hash -42544313, now seen corresponding path program 1 times [2024-11-18 14:23:22,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:23:22,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407699551] [2024-11-18 14:23:22,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:23:22,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:23:22,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:23:22,287 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-18 14:23:22,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:23:22,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407699551] [2024-11-18 14:23:22,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407699551] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:23:22,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711457059] [2024-11-18 14:23:22,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:23:22,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:23:22,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:23:22,290 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) [2024-11-18 14:23:22,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 14:23:22,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:23:22,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-18 14:23:22,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:23:22,460 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-18 14:23:22,460 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 14:23:22,685 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-18 14:23:22,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711457059] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 14:23:22,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 14:23:22,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 11 [2024-11-18 14:23:22,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480985289] [2024-11-18 14:23:22,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 14:23:22,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-18 14:23:22,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:23:22,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-18 14:23:22,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-18 14:23:22,689 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) [2024-11-18 14:23:22,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:23:22,786 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2024-11-18 14:23:22,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-18 14:23:22,792 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 [2024-11-18 14:23:22,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:23:22,793 INFO L225 Difference]: With dead ends: 35 [2024-11-18 14:23:22,793 INFO L226 Difference]: Without dead ends: 20 [2024-11-18 14:23:22,794 INFO L431 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 [2024-11-18 14:23:22,797 INFO L432 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.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:23:22,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 48 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:23:22,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-18 14:23:22,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-18 14:23:22,806 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) [2024-11-18 14:23:22,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-11-18 14:23:22,809 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2024-11-18 14:23:22,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:23:22,810 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-11-18 14:23:22,810 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) [2024-11-18 14:23:22,811 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-11-18 14:23:22,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-18 14:23:22,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:23:22,813 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:23:22,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-18 14:23:23,018 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 [2024-11-18 14:23:23,019 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:23:23,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:23:23,020 INFO L85 PathProgramCache]: Analyzing trace with hash 170813287, now seen corresponding path program 1 times [2024-11-18 14:23:23,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:23:23,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445594072] [2024-11-18 14:23:23,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:23:23,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:23:23,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:23:23,123 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-18 14:23:23,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:23:23,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445594072] [2024-11-18 14:23:23,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445594072] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:23:23,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057492789] [2024-11-18 14:23:23,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:23:23,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:23:23,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:23:23,128 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) [2024-11-18 14:23:23,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 14:23:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:23:23,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-18 14:23:23,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:23:23,209 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-18 14:23:23,209 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 14:23:23,424 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-18 14:23:23,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057492789] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 14:23:23,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 14:23:23,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2024-11-18 14:23:23,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278337691] [2024-11-18 14:23:23,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 14:23:23,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-18 14:23:23,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:23:23,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-18 14:23:23,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-18 14:23:23,427 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) [2024-11-18 14:23:23,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:23:23,506 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2024-11-18 14:23:23,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 14:23:23,507 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 [2024-11-18 14:23:23,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:23:23,508 INFO L225 Difference]: With dead ends: 29 [2024-11-18 14:23:23,508 INFO L226 Difference]: Without dead ends: 25 [2024-11-18 14:23:23,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-18 14:23:23,511 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:23:23,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 37 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:23:23,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-18 14:23:23,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-18 14:23:23,522 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) [2024-11-18 14:23:23,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2024-11-18 14:23:23,524 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 24 [2024-11-18 14:23:23,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:23:23,524 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2024-11-18 14:23:23,524 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) [2024-11-18 14:23:23,524 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2024-11-18 14:23:23,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-18 14:23:23,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:23:23,526 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:23:23,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-18 14:23:23,726 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 [2024-11-18 14:23:23,727 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:23:23,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:23:23,728 INFO L85 PathProgramCache]: Analyzing trace with hash -187634876, now seen corresponding path program 2 times [2024-11-18 14:23:23,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:23:23,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725971320] [2024-11-18 14:23:23,728 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 14:23:23,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:23:23,759 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 14:23:23,759 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 14:23:24,017 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-18 14:23:24,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:23:24,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725971320] [2024-11-18 14:23:24,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725971320] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:23:24,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094920139] [2024-11-18 14:23:24,018 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 14:23:24,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:23:24,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:23:24,021 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) [2024-11-18 14:23:24,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-18 14:23:24,069 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 14:23:24,069 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 14:23:24,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-18 14:23:24,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:23:24,191 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-18 14:23:24,192 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 14:23:24,585 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-18 14:23:24,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094920139] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 14:23:24,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 14:23:24,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 20 [2024-11-18 14:23:24,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545948301] [2024-11-18 14:23:24,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 14:23:24,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-18 14:23:24,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:23:24,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-18 14:23:24,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2024-11-18 14:23:24,589 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) [2024-11-18 14:23:24,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:23:24,911 INFO L93 Difference]: Finished difference Result 46 states and 83 transitions. [2024-11-18 14:23:24,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-18 14:23:24,912 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 [2024-11-18 14:23:24,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:23:24,914 INFO L225 Difference]: With dead ends: 46 [2024-11-18 14:23:24,914 INFO L226 Difference]: Without dead ends: 42 [2024-11-18 14:23:24,915 INFO L431 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 [2024-11-18 14:23:24,916 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 14:23:24,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 95 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 14:23:24,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-18 14:23:24,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2024-11-18 14:23:24,927 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) [2024-11-18 14:23:24,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 46 transitions. [2024-11-18 14:23:24,928 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 46 transitions. Word has length 37 [2024-11-18 14:23:24,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:23:24,928 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 46 transitions. [2024-11-18 14:23:24,929 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) [2024-11-18 14:23:24,929 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 46 transitions. [2024-11-18 14:23:24,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-18 14:23:24,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:23:24,932 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 8, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:23:24,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-18 14:23:25,132 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 [2024-11-18 14:23:25,133 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:23:25,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:23:25,133 INFO L85 PathProgramCache]: Analyzing trace with hash 710953508, now seen corresponding path program 3 times [2024-11-18 14:23:25,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:23:25,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389310138] [2024-11-18 14:23:25,134 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-18 14:23:25,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:23:25,159 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-18 14:23:25,160 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 14:23:25,307 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 167 proven. 27 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-11-18 14:23:25,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:23:25,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389310138] [2024-11-18 14:23:25,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389310138] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:23:25,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574220176] [2024-11-18 14:23:25,308 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-18 14:23:25,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:23:25,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:23:25,310 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) [2024-11-18 14:23:25,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-18 14:23:25,367 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-18 14:23:25,367 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 14:23:25,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-18 14:23:25,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:23:25,415 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 207 proven. 12 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2024-11-18 14:23:25,415 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 14:23:25,885 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 169 proven. 25 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-11-18 14:23:25,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574220176] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 14:23:25,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 14:23:25,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 13 [2024-11-18 14:23:25,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753333650] [2024-11-18 14:23:25,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 14:23:25,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-18 14:23:25,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:23:25,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-18 14:23:25,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-18 14:23:25,890 INFO L87 Difference]: Start difference. First operand 30 states and 46 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 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) [2024-11-18 14:23:26,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:23:26,014 INFO L93 Difference]: Finished difference Result 62 states and 110 transitions. [2024-11-18 14:23:26,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 14:23:26,014 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 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 90 [2024-11-18 14:23:26,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:23:26,016 INFO L225 Difference]: With dead ends: 62 [2024-11-18 14:23:26,016 INFO L226 Difference]: Without dead ends: 35 [2024-11-18 14:23:26,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 172 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-11-18 14:23:26,018 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:23:26,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 62 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:23:26,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-18 14:23:26,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2024-11-18 14:23:26,025 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) [2024-11-18 14:23:26,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2024-11-18 14:23:26,026 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 90 [2024-11-18 14:23:26,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:23:26,027 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2024-11-18 14:23:26,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 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) [2024-11-18 14:23:26,027 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2024-11-18 14:23:26,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-18 14:23:26,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:23:26,029 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:23:26,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-18 14:23:26,232 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 [2024-11-18 14:23:26,233 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:23:26,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:23:26,233 INFO L85 PathProgramCache]: Analyzing trace with hash -2015531204, now seen corresponding path program 4 times [2024-11-18 14:23:26,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:23:26,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740673155] [2024-11-18 14:23:26,233 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-18 14:23:26,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:23:26,243 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-18 14:23:26,244 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 14:23:26,339 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-18 14:23:26,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:23:26,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740673155] [2024-11-18 14:23:26,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740673155] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:23:26,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744455778] [2024-11-18 14:23:26,340 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-18 14:23:26,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:23:26,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:23:26,342 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) [2024-11-18 14:23:26,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-18 14:23:26,401 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-18 14:23:26,402 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 14:23:26,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-18 14:23:26,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:23:26,455 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-18 14:23:26,455 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 14:23:26,981 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 103 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-18 14:23:26,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744455778] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 14:23:26,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 14:23:26,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2024-11-18 14:23:26,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851358586] [2024-11-18 14:23:26,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 14:23:26,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-18 14:23:26,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:23:26,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-18 14:23:26,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-18 14:23:26,984 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) [2024-11-18 14:23:27,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:23:27,104 INFO L93 Difference]: Finished difference Result 41 states and 63 transitions. [2024-11-18 14:23:27,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-18 14:23:27,105 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 65 [2024-11-18 14:23:27,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:23:27,107 INFO L225 Difference]: With dead ends: 41 [2024-11-18 14:23:27,107 INFO L226 Difference]: Without dead ends: 37 [2024-11-18 14:23:27,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 124 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2024-11-18 14:23:27,109 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 27 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:23:27,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 65 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:23:27,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-18 14:23:27,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-18 14:23:27,116 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) [2024-11-18 14:23:27,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 59 transitions. [2024-11-18 14:23:27,117 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 59 transitions. Word has length 65 [2024-11-18 14:23:27,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:23:27,118 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 59 transitions. [2024-11-18 14:23:27,118 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) [2024-11-18 14:23:27,118 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 59 transitions. [2024-11-18 14:23:27,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-18 14:23:27,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:23:27,121 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 14, 8, 8, 8, 8, 8, 8, 8, 6, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:23:27,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-18 14:23:27,322 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 [2024-11-18 14:23:27,322 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:23:27,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:23:27,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1108497964, now seen corresponding path program 5 times [2024-11-18 14:23:27,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:23:27,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416175028] [2024-11-18 14:23:27,323 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-18 14:23:27,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:23:27,350 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-11-18 14:23:27,354 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 14:23:27,548 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 135 proven. 258 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2024-11-18 14:23:27,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:23:27,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416175028] [2024-11-18 14:23:27,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416175028] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:23:27,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369618113] [2024-11-18 14:23:27,549 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-18 14:23:27,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:23:27,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:23:27,551 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) [2024-11-18 14:23:27,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-18 14:23:27,618 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-11-18 14:23:27,619 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 14:23:27,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-18 14:23:27,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:23:27,705 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 422 proven. 118 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2024-11-18 14:23:27,705 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 14:23:28,570 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 133 proven. 274 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2024-11-18 14:23:28,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369618113] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 14:23:28,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 14:23:28,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 14] total 21 [2024-11-18 14:23:28,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505929740] [2024-11-18 14:23:28,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 14:23:28,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-18 14:23:28,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:23:28,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-18 14:23:28,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2024-11-18 14:23:28,574 INFO L87 Difference]: Start difference. First operand 37 states and 59 transitions. Second operand has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 states have internal predecessors, (66), 13 states have call successors, (20), 2 states have call predecessors, (20), 8 states have return successors, (24), 9 states have call predecessors, (24), 13 states have call successors, (24) [2024-11-18 14:23:28,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:23:28,840 INFO L93 Difference]: Finished difference Result 80 states and 141 transitions. [2024-11-18 14:23:28,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-18 14:23:28,841 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 states have internal predecessors, (66), 13 states have call successors, (20), 2 states have call predecessors, (20), 8 states have return successors, (24), 9 states have call predecessors, (24), 13 states have call successors, (24) Word has length 120 [2024-11-18 14:23:28,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:23:28,842 INFO L225 Difference]: With dead ends: 80 [2024-11-18 14:23:28,842 INFO L226 Difference]: Without dead ends: 46 [2024-11-18 14:23:28,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 228 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=304, Invalid=752, Unknown=0, NotChecked=0, Total=1056 [2024-11-18 14:23:28,844 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 49 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:23:28,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 107 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:23:28,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-18 14:23:28,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-18 14:23:28,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (16), 9 states have call predecessors, (16), 7 states have call successors, (16) [2024-11-18 14:23:28,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2024-11-18 14:23:28,851 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 120 [2024-11-18 14:23:28,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:23:28,852 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2024-11-18 14:23:28,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 states have internal predecessors, (66), 13 states have call successors, (20), 2 states have call predecessors, (20), 8 states have return successors, (24), 9 states have call predecessors, (24), 13 states have call successors, (24) [2024-11-18 14:23:28,852 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2024-11-18 14:23:28,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-18 14:23:28,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:23:28,854 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:23:28,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-18 14:23:29,058 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 [2024-11-18 14:23:29,059 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:23:29,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:23:29,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1447005449, now seen corresponding path program 6 times [2024-11-18 14:23:29,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:23:29,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778257285] [2024-11-18 14:23:29,060 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-18 14:23:29,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:23:29,086 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2024-11-18 14:23:29,087 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 14:23:29,264 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 55 proven. 317 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-18 14:23:29,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:23:29,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778257285] [2024-11-18 14:23:29,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778257285] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:23:29,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795505344] [2024-11-18 14:23:29,265 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-18 14:23:29,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:23:29,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:23:29,267 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) [2024-11-18 14:23:29,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-18 14:23:29,352 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2024-11-18 14:23:29,353 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 14:23:29,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-18 14:23:29,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:23:29,426 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 52 proven. 326 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2024-11-18 14:23:29,426 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 14:23:30,303 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 52 proven. 352 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2024-11-18 14:23:30,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795505344] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 14:23:30,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 14:23:30,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 16 [2024-11-18 14:23:30,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578405821] [2024-11-18 14:23:30,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 14:23:30,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-18 14:23:30,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:23:30,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-18 14:23:30,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2024-11-18 14:23:30,309 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand has 16 states, 14 states have (on average 3.5) internal successors, (49), 16 states have internal predecessors, (49), 12 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 7 states have call predecessors, (18), 12 states have call successors, (18) [2024-11-18 14:23:30,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:23:30,429 INFO L93 Difference]: Finished difference Result 55 states and 74 transitions. [2024-11-18 14:23:30,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-18 14:23:30,429 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.5) internal successors, (49), 16 states have internal predecessors, (49), 12 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 7 states have call predecessors, (18), 12 states have call successors, (18) Word has length 133 [2024-11-18 14:23:30,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:23:30,431 INFO L225 Difference]: With dead ends: 55 [2024-11-18 14:23:30,431 INFO L226 Difference]: Without dead ends: 51 [2024-11-18 14:23:30,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 258 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2024-11-18 14:23:30,432 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 36 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:23:30,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 65 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:23:30,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-18 14:23:30,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-18 14:23:30,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (24), 11 states have call predecessors, (24), 8 states have call successors, (24) [2024-11-18 14:23:30,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2024-11-18 14:23:30,448 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 133 [2024-11-18 14:23:30,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:23:30,449 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2024-11-18 14:23:30,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.5) internal successors, (49), 16 states have internal predecessors, (49), 12 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 7 states have call predecessors, (18), 12 states have call successors, (18) [2024-11-18 14:23:30,451 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2024-11-18 14:23:30,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-18 14:23:30,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:23:30,454 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 28, 17, 17, 17, 17, 17, 17, 17, 11, 7, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:23:30,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-18 14:23:30,658 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 [2024-11-18 14:23:30,660 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:23:30,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:23:30,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1830341289, now seen corresponding path program 7 times [2024-11-18 14:23:30,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:23:30,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380591806] [2024-11-18 14:23:30,661 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-18 14:23:30,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:23:30,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:23:31,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3302 backedges. 139 proven. 815 refuted. 0 times theorem prover too weak. 2348 trivial. 0 not checked. [2024-11-18 14:23:31,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:23:31,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380591806] [2024-11-18 14:23:31,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380591806] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:23:31,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994732809] [2024-11-18 14:23:31,004 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-18 14:23:31,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:23:31,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:23:31,006 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) [2024-11-18 14:23:31,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-18 14:23:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:23:31,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-18 14:23:31,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:23:31,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3302 backedges. 139 proven. 815 refuted. 0 times theorem prover too weak. 2348 trivial. 0 not checked. [2024-11-18 14:23:31,217 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 14:23:32,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3302 backedges. 139 proven. 855 refuted. 0 times theorem prover too weak. 2308 trivial. 0 not checked. [2024-11-18 14:23:32,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994732809] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 14:23:32,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 14:23:32,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 17 [2024-11-18 14:23:32,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255195894] [2024-11-18 14:23:32,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 14:23:32,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-18 14:23:32,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:23:32,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-18 14:23:32,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2024-11-18 14:23:32,638 INFO L87 Difference]: Start difference. First operand 51 states and 70 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) [2024-11-18 14:23:32,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:23:32,793 INFO L93 Difference]: Finished difference Result 60 states and 88 transitions. [2024-11-18 14:23:32,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-18 14:23:32,794 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 242 [2024-11-18 14:23:32,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:23:32,796 INFO L225 Difference]: With dead ends: 60 [2024-11-18 14:23:32,796 INFO L226 Difference]: Without dead ends: 56 [2024-11-18 14:23:32,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 476 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2024-11-18 14:23:32,797 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 57 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:23:32,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 86 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:23:32,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-18 14:23:32,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-18 14:23:32,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 9 states have call successors, (9), 5 states have call predecessors, (9), 8 states have return successors, (34), 13 states have call predecessors, (34), 9 states have call successors, (34) [2024-11-18 14:23:32,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 84 transitions. [2024-11-18 14:23:32,815 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 84 transitions. Word has length 242 [2024-11-18 14:23:32,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:23:32,816 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 84 transitions. [2024-11-18 14:23:32,817 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) [2024-11-18 14:23:32,817 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 84 transitions. [2024-11-18 14:23:32,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2024-11-18 14:23:32,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:23:32,824 INFO L215 NwaCegarLoop]: trace histogram [65, 65, 53, 32, 32, 32, 32, 32, 32, 32, 21, 12, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:23:32,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-18 14:23:33,024 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 [2024-11-18 14:23:33,025 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:23:33,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:23:33,025 INFO L85 PathProgramCache]: Analyzing trace with hash 2121548198, now seen corresponding path program 8 times [2024-11-18 14:23:33,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:23:33,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794346587] [2024-11-18 14:23:33,026 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 14:23:33,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:23:33,095 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 14:23:33,095 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 14:23:33,595 INFO L134 CoverageAnalysis]: Checked inductivity of 11682 backedges. 333 proven. 1918 refuted. 0 times theorem prover too weak. 9431 trivial. 0 not checked. [2024-11-18 14:23:33,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:23:33,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794346587] [2024-11-18 14:23:33,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794346587] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:23:33,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747573530] [2024-11-18 14:23:33,596 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 14:23:33,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:23:33,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:23:33,598 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) [2024-11-18 14:23:33,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-18 14:23:33,792 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 14:23:33,792 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 14:23:33,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 1012 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-18 14:23:33,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:23:33,888 INFO L134 CoverageAnalysis]: Checked inductivity of 11682 backedges. 333 proven. 1918 refuted. 0 times theorem prover too weak. 9431 trivial. 0 not checked. [2024-11-18 14:23:33,889 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 14:23:36,244 INFO L134 CoverageAnalysis]: Checked inductivity of 11682 backedges. 333 proven. 1975 refuted. 0 times theorem prover too weak. 9374 trivial. 0 not checked. [2024-11-18 14:23:36,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747573530] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 14:23:36,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 14:23:36,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 19 [2024-11-18 14:23:36,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021766995] [2024-11-18 14:23:36,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 14:23:36,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-18 14:23:36,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:23:36,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-18 14:23:36,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-18 14:23:36,247 INFO L87 Difference]: Start difference. First operand 56 states and 84 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) [2024-11-18 14:23:36,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:23:36,412 INFO L93 Difference]: Finished difference Result 65 states and 104 transitions. [2024-11-18 14:23:36,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-18 14:23:36,413 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 447 [2024-11-18 14:23:36,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:23:36,415 INFO L225 Difference]: With dead ends: 65 [2024-11-18 14:23:36,415 INFO L226 Difference]: Without dead ends: 61 [2024-11-18 14:23:36,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 915 GetRequests, 885 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2024-11-18 14:23:36,416 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 69 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:23:36,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 89 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:23:36,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-18 14:23:36,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-18 14:23:36,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 10 states have call successors, (10), 5 states have call predecessors, (10), 9 states have return successors, (46), 15 states have call predecessors, (46), 10 states have call successors, (46) [2024-11-18 14:23:36,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 100 transitions. [2024-11-18 14:23:36,426 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 100 transitions. Word has length 447 [2024-11-18 14:23:36,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:23:36,427 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 100 transitions. [2024-11-18 14:23:36,428 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) [2024-11-18 14:23:36,428 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 100 transitions. [2024-11-18 14:23:36,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2024-11-18 14:23:36,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:23:36,437 INFO L215 NwaCegarLoop]: trace histogram [77, 77, 62, 38, 38, 38, 38, 38, 38, 38, 24, 15, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:23:36,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-18 14:23:36,637 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 [2024-11-18 14:23:36,637 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:23:36,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:23:36,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1970146836, now seen corresponding path program 9 times [2024-11-18 14:23:36,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:23:36,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724175277] [2024-11-18 14:23:36,638 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-18 14:23:36,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:23:36,699 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2024-11-18 14:23:36,700 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 14:23:36,960 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 1612 proven. 274 refuted. 0 times theorem prover too weak. 14521 trivial. 0 not checked. [2024-11-18 14:23:36,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:23:36,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724175277] [2024-11-18 14:23:36,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724175277] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:23:36,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262022610] [2024-11-18 14:23:36,962 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-18 14:23:36,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:23:36,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:23:36,964 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) [2024-11-18 14:23:36,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-18 14:23:37,142 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2024-11-18 14:23:37,142 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 14:23:37,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-18 14:23:37,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:23:37,217 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 1662 proven. 279 refuted. 0 times theorem prover too weak. 14466 trivial. 0 not checked. [2024-11-18 14:23:37,219 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 14:23:39,023 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 1668 proven. 305 refuted. 0 times theorem prover too weak. 14434 trivial. 0 not checked. [2024-11-18 14:23:39,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262022610] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 14:23:39,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 14:23:39,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 13] total 17 [2024-11-18 14:23:39,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674290266] [2024-11-18 14:23:39,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 14:23:39,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-18 14:23:39,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:23:39,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-18 14:23:39,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2024-11-18 14:23:39,027 INFO L87 Difference]: Start difference. First operand 61 states and 100 transitions. Second operand has 17 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 17 states have internal predecessors, (50), 9 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 10 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-18 14:23:39,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:23:39,212 INFO L93 Difference]: Finished difference Result 164 states and 358 transitions. [2024-11-18 14:23:39,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-18 14:23:39,217 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 17 states have internal predecessors, (50), 9 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 10 states have call predecessors, (18), 9 states have call successors, (18) Word has length 528 [2024-11-18 14:23:39,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:23:39,222 INFO L225 Difference]: With dead ends: 164 [2024-11-18 14:23:39,222 INFO L226 Difference]: Without dead ends: 105 [2024-11-18 14:23:39,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1073 GetRequests, 1047 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=338, Unknown=0, NotChecked=0, Total=506 [2024-11-18 14:23:39,224 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 81 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:23:39,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 68 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:23:39,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-18 14:23:39,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 76. [2024-11-18 14:23:39,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 50 states have internal predecessors, (56), 14 states have call successors, (14), 7 states have call predecessors, (14), 10 states have return successors, (63), 18 states have call predecessors, (63), 14 states have call successors, (63) [2024-11-18 14:23:39,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 133 transitions. [2024-11-18 14:23:39,248 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 133 transitions. Word has length 528 [2024-11-18 14:23:39,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:23:39,250 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 133 transitions. [2024-11-18 14:23:39,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 17 states have internal predecessors, (50), 9 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 10 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-18 14:23:39,250 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 133 transitions. [2024-11-18 14:23:39,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2024-11-18 14:23:39,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:23:39,254 INFO L215 NwaCegarLoop]: trace histogram [83, 83, 67, 41, 41, 41, 41, 41, 41, 41, 26, 16, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:23:39,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-18 14:23:39,454 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 [2024-11-18 14:23:39,455 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:23:39,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:23:39,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1550468663, now seen corresponding path program 10 times [2024-11-18 14:23:39,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:23:39,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101650963] [2024-11-18 14:23:39,456 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-18 14:23:39,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:23:39,532 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-18 14:23:39,532 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 14:23:40,094 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 401 proven. 2942 refuted. 0 times theorem prover too weak. 15760 trivial. 0 not checked. [2024-11-18 14:23:40,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:23:40,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101650963] [2024-11-18 14:23:40,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101650963] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:23:40,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805989682] [2024-11-18 14:23:40,096 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-18 14:23:40,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:23:40,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:23:40,098 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) [2024-11-18 14:23:40,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-18 14:23:40,331 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-18 14:23:40,332 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 14:23:40,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 1012 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-18 14:23:40,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:23:40,444 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 401 proven. 2942 refuted. 0 times theorem prover too weak. 15760 trivial. 0 not checked. [2024-11-18 14:23:40,445 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 14:23:43,393 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 401 proven. 3019 refuted. 0 times theorem prover too weak. 15683 trivial. 0 not checked. [2024-11-18 14:23:43,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805989682] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 14:23:43,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 14:23:43,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 21 [2024-11-18 14:23:43,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689945759] [2024-11-18 14:23:43,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 14:23:43,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-18 14:23:43,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:23:43,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-18 14:23:43,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2024-11-18 14:23:43,397 INFO L87 Difference]: Start difference. First operand 76 states and 133 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) [2024-11-18 14:23:43,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:23:43,609 INFO L93 Difference]: Finished difference Result 92 states and 170 transitions. [2024-11-18 14:23:43,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-18 14:23:43,610 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 569 [2024-11-18 14:23:43,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:23:43,613 INFO L225 Difference]: With dead ends: 92 [2024-11-18 14:23:43,613 INFO L226 Difference]: Without dead ends: 88 [2024-11-18 14:23:43,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1162 GetRequests, 1128 SyntacticMatches, 8 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=238, Invalid=518, Unknown=0, NotChecked=0, Total=756 [2024-11-18 14:23:43,614 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 93 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:23:43,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 90 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:23:43,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-18 14:23:43,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2024-11-18 14:23:43,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 53 states have internal predecessors, (59), 15 states have call successors, (15), 7 states have call predecessors, (15), 11 states have return successors, (76), 20 states have call predecessors, (76), 15 states have call successors, (76) [2024-11-18 14:23:43,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 150 transitions. [2024-11-18 14:23:43,631 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 150 transitions. Word has length 569 [2024-11-18 14:23:43,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:23:43,632 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 150 transitions. [2024-11-18 14:23:43,632 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) [2024-11-18 14:23:43,632 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 150 transitions. [2024-11-18 14:23:43,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1114 [2024-11-18 14:23:43,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:23:43,652 INFO L215 NwaCegarLoop]: trace histogram [163, 163, 131, 81, 81, 81, 81, 81, 81, 81, 50, 32, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:23:43,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-18 14:23:43,853 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 [2024-11-18 14:23:43,853 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:23:43,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:23:43,854 INFO L85 PathProgramCache]: Analyzing trace with hash -386939895, now seen corresponding path program 11 times [2024-11-18 14:23:43,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:23:43,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575514140] [2024-11-18 14:23:43,854 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-18 14:23:43,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:23:43,988 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 58 check-sat command(s) [2024-11-18 14:23:43,988 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 14:23:44,664 INFO L134 CoverageAnalysis]: Checked inductivity of 74287 backedges. 3534 proven. 5404 refuted. 0 times theorem prover too weak. 65349 trivial. 0 not checked. [2024-11-18 14:23:44,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:23:44,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575514140] [2024-11-18 14:23:44,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575514140] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:23:44,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495728641] [2024-11-18 14:23:44,665 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-18 14:23:44,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:23:44,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:23:44,667 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) [2024-11-18 14:23:44,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-18 14:23:45,012 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 58 check-sat command(s) [2024-11-18 14:23:45,012 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 14:23:45,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 1092 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-18 14:23:45,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:23:45,126 INFO L134 CoverageAnalysis]: Checked inductivity of 74287 backedges. 40049 proven. 948 refuted. 0 times theorem prover too weak. 33290 trivial. 0 not checked. [2024-11-18 14:23:45,126 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 14:23:49,539 INFO L134 CoverageAnalysis]: Checked inductivity of 74287 backedges. 3521 proven. 5444 refuted. 0 times theorem prover too weak. 65322 trivial. 0 not checked. [2024-11-18 14:23:49,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495728641] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 14:23:49,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 14:23:49,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 21] total 25 [2024-11-18 14:23:49,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837449768] [2024-11-18 14:23:49,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 14:23:49,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-18 14:23:49,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:23:49,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-18 14:23:49,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2024-11-18 14:23:49,543 INFO L87 Difference]: Start difference. First operand 81 states and 150 transitions. Second operand has 25 states, 25 states have (on average 3.44) internal successors, (86), 25 states have internal predecessors, (86), 20 states have call successors, (27), 2 states have call predecessors, (27), 11 states have return successors, (36), 14 states have call predecessors, (36), 20 states have call successors, (36) [2024-11-18 14:23:49,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:23:49,882 INFO L93 Difference]: Finished difference Result 221 states and 538 transitions. [2024-11-18 14:23:49,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-18 14:23:49,883 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.44) internal successors, (86), 25 states have internal predecessors, (86), 20 states have call successors, (27), 2 states have call predecessors, (27), 11 states have return successors, (36), 14 states have call predecessors, (36), 20 states have call successors, (36) Word has length 1113 [2024-11-18 14:23:49,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:23:49,887 INFO L225 Difference]: With dead ends: 221 [2024-11-18 14:23:49,888 INFO L226 Difference]: Without dead ends: 130 [2024-11-18 14:23:49,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2259 GetRequests, 2213 SyntacticMatches, 10 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=382, Invalid=1024, Unknown=0, NotChecked=0, Total=1406 [2024-11-18 14:23:49,891 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 42 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 14:23:49,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 195 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 14:23:49,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-18 14:23:49,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2024-11-18 14:23:49,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 90 states have (on average 1.0444444444444445) internal successors, (94), 86 states have internal predecessors, (94), 24 states have call successors, (24), 18 states have call predecessors, (24), 12 states have return successors, (93), 22 states have call predecessors, (93), 24 states have call successors, (93) [2024-11-18 14:23:49,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 211 transitions. [2024-11-18 14:23:49,920 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 211 transitions. Word has length 1113 [2024-11-18 14:23:49,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:23:49,921 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 211 transitions. [2024-11-18 14:23:49,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.44) internal successors, (86), 25 states have internal predecessors, (86), 20 states have call successors, (27), 2 states have call predecessors, (27), 11 states have return successors, (36), 14 states have call predecessors, (36), 20 states have call successors, (36) [2024-11-18 14:23:49,921 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 211 transitions. [2024-11-18 14:23:49,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 856 [2024-11-18 14:23:49,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:23:49,933 INFO L215 NwaCegarLoop]: trace histogram [125, 125, 101, 62, 62, 62, 62, 62, 62, 62, 39, 24, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:23:49,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-18 14:23:50,133 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 [2024-11-18 14:23:50,135 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:23:50,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:23:50,136 INFO L85 PathProgramCache]: Analyzing trace with hash -551187722, now seen corresponding path program 12 times [2024-11-18 14:23:50,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:23:50,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708244232] [2024-11-18 14:23:50,136 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-18 14:23:50,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:23:50,217 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2024-11-18 14:23:50,220 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 14:23:50,465 INFO L134 CoverageAnalysis]: Checked inductivity of 43614 backedges. 1377 proven. 3746 refuted. 0 times theorem prover too weak. 38491 trivial. 0 not checked. [2024-11-18 14:23:50,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:23:50,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708244232] [2024-11-18 14:23:50,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708244232] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:23:50,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893803090] [2024-11-18 14:23:50,466 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-18 14:23:50,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:23:50,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:23:50,469 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) [2024-11-18 14:23:50,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-18 14:23:50,741 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2024-11-18 14:23:50,742 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 14:23:50,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-18 14:23:50,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:23:50,870 INFO L134 CoverageAnalysis]: Checked inductivity of 43614 backedges. 1377 proven. 3746 refuted. 0 times theorem prover too weak. 38491 trivial. 0 not checked. [2024-11-18 14:23:50,870 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 14:23:54,200 INFO L134 CoverageAnalysis]: Checked inductivity of 43614 backedges. 1383 proven. 3812 refuted. 0 times theorem prover too weak. 38419 trivial. 0 not checked. [2024-11-18 14:23:54,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893803090] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 14:23:54,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 14:23:54,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 20 [2024-11-18 14:23:54,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546078636] [2024-11-18 14:23:54,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 14:23:54,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-18 14:23:54,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:23:54,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-18 14:23:54,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2024-11-18 14:23:54,203 INFO L87 Difference]: Start difference. First operand 127 states and 211 transitions. Second operand has 20 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 20 states have internal predecessors, (63), 15 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (25), 12 states have call predecessors, (25), 15 states have call successors, (25) [2024-11-18 14:23:54,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:23:54,372 INFO L93 Difference]: Finished difference Result 144 states and 266 transitions. [2024-11-18 14:23:54,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-18 14:23:54,372 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 20 states have internal predecessors, (63), 15 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (25), 12 states have call predecessors, (25), 15 states have call successors, (25) Word has length 855 [2024-11-18 14:23:54,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:23:54,376 INFO L225 Difference]: With dead ends: 144 [2024-11-18 14:23:54,376 INFO L226 Difference]: Without dead ends: 140 [2024-11-18 14:23:54,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1734 GetRequests, 1700 SyntacticMatches, 9 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=235, Invalid=467, Unknown=0, NotChecked=0, Total=702 [2024-11-18 14:23:54,378 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 72 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:23:54,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 90 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:23:54,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-18 14:23:54,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 127. [2024-11-18 14:23:54,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 90 states have (on average 1.0444444444444445) internal successors, (94), 86 states have internal predecessors, (94), 24 states have call successors, (24), 18 states have call predecessors, (24), 12 states have return successors, (93), 22 states have call predecessors, (93), 24 states have call successors, (93) [2024-11-18 14:23:54,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 211 transitions. [2024-11-18 14:23:54,392 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 211 transitions. Word has length 855 [2024-11-18 14:23:54,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:23:54,393 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 211 transitions. [2024-11-18 14:23:54,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 20 states have internal predecessors, (63), 15 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (25), 12 states have call predecessors, (25), 15 states have call successors, (25) [2024-11-18 14:23:54,393 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 211 transitions. [2024-11-18 14:23:54,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1414 [2024-11-18 14:23:54,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:23:54,431 INFO L215 NwaCegarLoop]: trace histogram [207, 207, 167, 103, 103, 103, 103, 103, 103, 103, 64, 40, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:23:54,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-18 14:23:54,632 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 [2024-11-18 14:23:54,632 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:23:54,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:23:54,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1291649513, now seen corresponding path program 13 times [2024-11-18 14:23:54,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:23:54,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667420694] [2024-11-18 14:23:54,633 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-18 14:23:54,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:23:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:23:56,631 INFO L134 CoverageAnalysis]: Checked inductivity of 120157 backedges. 1065 proven. 8899 refuted. 0 times theorem prover too weak. 110193 trivial. 0 not checked. [2024-11-18 14:23:56,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:23:56,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667420694] [2024-11-18 14:23:56,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667420694] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:23:56,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894458258] [2024-11-18 14:23:56,631 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-18 14:23:56,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:23:56,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:23:56,633 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) [2024-11-18 14:23:56,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-18 14:23:57,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:23:57,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 3157 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-18 14:23:57,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:23:57,266 INFO L134 CoverageAnalysis]: Checked inductivity of 120157 backedges. 1065 proven. 8899 refuted. 0 times theorem prover too weak. 110193 trivial. 0 not checked. [2024-11-18 14:23:57,266 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 14:24:02,728 INFO L134 CoverageAnalysis]: Checked inductivity of 120157 backedges. 1065 proven. 8999 refuted. 0 times theorem prover too weak. 110093 trivial. 0 not checked. [2024-11-18 14:24:02,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894458258] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 14:24:02,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 14:24:02,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 21] total 22 [2024-11-18 14:24:02,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092195147] [2024-11-18 14:24:02,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 14:24:02,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-18 14:24:02,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:24:02,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-18 14:24:02,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-11-18 14:24:02,733 INFO L87 Difference]: Start difference. First operand 127 states and 211 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) [2024-11-18 14:24:02,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:24:02,901 INFO L93 Difference]: Finished difference Result 149 states and 290 transitions. [2024-11-18 14:24:02,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-18 14:24:02,902 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 1413 [2024-11-18 14:24:02,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:24:02,906 INFO L225 Difference]: With dead ends: 149 [2024-11-18 14:24:02,906 INFO L226 Difference]: Without dead ends: 145 [2024-11-18 14:24:02,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2853 GetRequests, 2815 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=291, Invalid=579, Unknown=0, NotChecked=0, Total=870 [2024-11-18 14:24:02,907 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 54 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:24:02,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 103 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:24:02,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-18 14:24:02,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 132. [2024-11-18 14:24:02,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 93 states have (on average 1.043010752688172) internal successors, (97), 89 states have internal predecessors, (97), 25 states have call successors, (25), 18 states have call predecessors, (25), 13 states have return successors, (108), 24 states have call predecessors, (108), 25 states have call successors, (108) [2024-11-18 14:24:02,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 230 transitions. [2024-11-18 14:24:02,930 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 230 transitions. Word has length 1413 [2024-11-18 14:24:02,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:24:02,931 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 230 transitions. [2024-11-18 14:24:02,931 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) [2024-11-18 14:24:02,932 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 230 transitions. [2024-11-18 14:24:02,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1699 [2024-11-18 14:24:02,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:24:02,949 INFO L215 NwaCegarLoop]: trace histogram [249, 249, 200, 124, 124, 124, 124, 124, 124, 124, 76, 49, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:24:02,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-18 14:24:03,149 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 [2024-11-18 14:24:03,150 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:24:03,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:24:03,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1709848122, now seen corresponding path program 14 times [2024-11-18 14:24:03,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:24:03,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157586337] [2024-11-18 14:24:03,151 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 14:24:03,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:24:03,419 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 14:24:03,419 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 14:24:05,251 INFO L134 CoverageAnalysis]: Checked inductivity of 173908 backedges. 2278 proven. 7548 refuted. 0 times theorem prover too weak. 164082 trivial. 0 not checked. [2024-11-18 14:24:05,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:24:05,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157586337] [2024-11-18 14:24:05,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157586337] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:24:05,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621792637] [2024-11-18 14:24:05,252 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 14:24:05,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:24:05,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:24:05,254 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) [2024-11-18 14:24:05,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-18 14:24:05,876 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 14:24:05,877 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 14:24:05,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 3790 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-18 14:24:05,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:24:06,040 INFO L134 CoverageAnalysis]: Checked inductivity of 173908 backedges. 2584 proven. 9489 refuted. 0 times theorem prover too weak. 161835 trivial. 0 not checked. [2024-11-18 14:24:06,041 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 14:24:12,148 INFO L134 CoverageAnalysis]: Checked inductivity of 173908 backedges. 2596 proven. 9571 refuted. 0 times theorem prover too weak. 161741 trivial. 0 not checked. [2024-11-18 14:24:12,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621792637] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 14:24:12,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 14:24:12,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 21] total 25 [2024-11-18 14:24:12,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119367401] [2024-11-18 14:24:12,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 14:24:12,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-18 14:24:12,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:24:12,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-18 14:24:12,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=431, Unknown=0, NotChecked=0, Total=600 [2024-11-18 14:24:12,152 INFO L87 Difference]: Start difference. First operand 132 states and 230 transitions. Second operand has 25 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 25 states have internal predecessors, (74), 18 states have call successors, (23), 1 states have call predecessors, (23), 10 states have return successors, (31), 14 states have call predecessors, (31), 18 states have call successors, (31) [2024-11-18 14:24:12,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:24:12,334 INFO L93 Difference]: Finished difference Result 189 states and 497 transitions. [2024-11-18 14:24:12,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-18 14:24:12,334 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 25 states have internal predecessors, (74), 18 states have call successors, (23), 1 states have call predecessors, (23), 10 states have return successors, (31), 14 states have call predecessors, (31), 18 states have call successors, (31) Word has length 1698 [2024-11-18 14:24:12,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:24:12,338 INFO L225 Difference]: With dead ends: 189 [2024-11-18 14:24:12,338 INFO L226 Difference]: Without dead ends: 130 [2024-11-18 14:24:12,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3421 GetRequests, 3380 SyntacticMatches, 10 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=360, Invalid=696, Unknown=0, NotChecked=0, Total=1056 [2024-11-18 14:24:12,341 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:24:12,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 167 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:24:12,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-18 14:24:12,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 115. [2024-11-18 14:24:12,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 80 states have (on average 1.0375) internal successors, (83), 77 states have internal predecessors, (83), 21 states have call successors, (21), 14 states have call predecessors, (21), 13 states have return successors, (57), 23 states have call predecessors, (57), 21 states have call successors, (57) [2024-11-18 14:24:12,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 161 transitions. [2024-11-18 14:24:12,353 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 161 transitions. Word has length 1698 [2024-11-18 14:24:12,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:24:12,354 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 161 transitions. [2024-11-18 14:24:12,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 25 states have internal predecessors, (74), 18 states have call successors, (23), 1 states have call predecessors, (23), 10 states have return successors, (31), 14 states have call predecessors, (31), 18 states have call successors, (31) [2024-11-18 14:24:12,354 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 161 transitions. [2024-11-18 14:24:12,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1537 [2024-11-18 14:24:12,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:24:12,368 INFO L215 NwaCegarLoop]: trace histogram [225, 225, 182, 112, 112, 112, 112, 112, 112, 112, 70, 43, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:24:12,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-18 14:24:12,572 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 [2024-11-18 14:24:12,573 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:24:12,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:24:12,573 INFO L85 PathProgramCache]: Analyzing trace with hash -560456310, now seen corresponding path program 15 times [2024-11-18 14:24:12,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:24:12,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606335163] [2024-11-18 14:24:12,573 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-18 14:24:12,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:24:12,724 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 86 check-sat command(s) [2024-11-18 14:24:12,724 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 14:24:13,204 INFO L134 CoverageAnalysis]: Checked inductivity of 142135 backedges. 6274 proven. 914 refuted. 0 times theorem prover too weak. 134947 trivial. 0 not checked. [2024-11-18 14:24:13,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:24:13,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606335163] [2024-11-18 14:24:13,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606335163] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:24:13,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813431976] [2024-11-18 14:24:13,205 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-18 14:24:13,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:24:13,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:24:13,208 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) [2024-11-18 14:24:13,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-18 14:24:13,745 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 86 check-sat command(s) [2024-11-18 14:24:13,746 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 14:24:13,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 1442 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-18 14:24:13,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:24:13,855 INFO L134 CoverageAnalysis]: Checked inductivity of 142135 backedges. 6264 proven. 919 refuted. 0 times theorem prover too weak. 134952 trivial. 0 not checked. [2024-11-18 14:24:13,856 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 14:24:18,185 INFO L134 CoverageAnalysis]: Checked inductivity of 142135 backedges. 6264 proven. 974 refuted. 0 times theorem prover too weak. 134897 trivial. 0 not checked. [2024-11-18 14:24:18,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813431976] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 14:24:18,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 14:24:18,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 15] total 18 [2024-11-18 14:24:18,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281504236] [2024-11-18 14:24:18,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 14:24:18,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-18 14:24:18,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:24:18,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-18 14:24:18,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-11-18 14:24:18,188 INFO L87 Difference]: Start difference. First operand 115 states and 161 transitions. Second operand has 18 states, 17 states have (on average 3.235294117647059) internal successors, (55), 18 states have internal predecessors, (55), 8 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 13 states have call predecessors, (19), 8 states have call successors, (19) [2024-11-18 14:24:18,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:24:18,339 INFO L93 Difference]: Finished difference Result 233 states and 321 transitions. [2024-11-18 14:24:18,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-18 14:24:18,339 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.235294117647059) internal successors, (55), 18 states have internal predecessors, (55), 8 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 13 states have call predecessors, (19), 8 states have call successors, (19) Word has length 1536 [2024-11-18 14:24:18,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:24:18,342 INFO L225 Difference]: With dead ends: 233 [2024-11-18 14:24:18,342 INFO L226 Difference]: Without dead ends: 158 [2024-11-18 14:24:18,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3091 GetRequests, 3063 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=176, Invalid=330, Unknown=0, NotChecked=0, Total=506 [2024-11-18 14:24:18,343 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 24 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:24:18,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 131 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:24:18,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-18 14:24:18,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 148. [2024-11-18 14:24:18,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 103 states have (on average 1.029126213592233) internal successors, (106), 100 states have internal predecessors, (106), 30 states have call successors, (30), 20 states have call predecessors, (30), 14 states have return successors, (78), 27 states have call predecessors, (78), 30 states have call successors, (78) [2024-11-18 14:24:18,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 214 transitions. [2024-11-18 14:24:18,357 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 214 transitions. Word has length 1536 [2024-11-18 14:24:18,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:24:18,358 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 214 transitions. [2024-11-18 14:24:18,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.235294117647059) internal successors, (55), 18 states have internal predecessors, (55), 8 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 13 states have call predecessors, (19), 8 states have call successors, (19) [2024-11-18 14:24:18,358 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 214 transitions. [2024-11-18 14:24:18,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1360 [2024-11-18 14:24:18,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:24:18,370 INFO L215 NwaCegarLoop]: trace histogram [199, 199, 161, 99, 99, 99, 99, 99, 99, 99, 62, 38, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:24:18,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-18 14:24:18,570 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 [2024-11-18 14:24:18,571 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:24:18,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:24:18,571 INFO L85 PathProgramCache]: Analyzing trace with hash -491993383, now seen corresponding path program 16 times [2024-11-18 14:24:18,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:24:18,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296654599] [2024-11-18 14:24:18,572 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-18 14:24:18,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:24:18,713 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-18 14:24:18,713 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 14:24:19,741 INFO L134 CoverageAnalysis]: Checked inductivity of 111088 backedges. 5819 proven. 3060 refuted. 0 times theorem prover too weak. 102209 trivial. 0 not checked. [2024-11-18 14:24:19,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:24:19,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296654599] [2024-11-18 14:24:19,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296654599] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:24:19,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606095294] [2024-11-18 14:24:19,742 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-18 14:24:19,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:24:19,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:24:19,744 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) [2024-11-18 14:24:19,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-18 14:24:20,285 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-18 14:24:20,286 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 14:24:20,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 2418 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-18 14:24:20,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:24:20,431 INFO L134 CoverageAnalysis]: Checked inductivity of 111088 backedges. 6858 proven. 3769 refuted. 0 times theorem prover too weak. 100461 trivial. 0 not checked. [2024-11-18 14:24:20,432 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 14:24:26,594 INFO L134 CoverageAnalysis]: Checked inductivity of 111088 backedges. 6858 proven. 3886 refuted. 0 times theorem prover too weak. 100344 trivial. 0 not checked. [2024-11-18 14:24:26,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606095294] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 14:24:26,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 14:24:26,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 23] total 27 [2024-11-18 14:24:26,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039195272] [2024-11-18 14:24:26,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 14:24:26,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-18 14:24:26,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:24:26,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-18 14:24:26,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=506, Unknown=0, NotChecked=0, Total=702 [2024-11-18 14:24:26,598 INFO L87 Difference]: Start difference. First operand 148 states and 214 transitions. Second operand has 27 states, 26 states have (on average 3.076923076923077) internal successors, (80), 27 states have internal predecessors, (80), 21 states have call successors, (25), 1 states have call predecessors, (25), 11 states have return successors, (34), 14 states have call predecessors, (34), 21 states have call successors, (34) [2024-11-18 14:24:26,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:24:26,856 INFO L93 Difference]: Finished difference Result 182 states and 277 transitions. [2024-11-18 14:24:26,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-18 14:24:26,856 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.076923076923077) internal successors, (80), 27 states have internal predecessors, (80), 21 states have call successors, (25), 1 states have call predecessors, (25), 11 states have return successors, (34), 14 states have call predecessors, (34), 21 states have call successors, (34) Word has length 1359 [2024-11-18 14:24:26,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:24:26,863 INFO L225 Difference]: With dead ends: 182 [2024-11-18 14:24:26,863 INFO L226 Difference]: Without dead ends: 165 [2024-11-18 14:24:26,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2746 GetRequests, 2701 SyntacticMatches, 11 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=429, Invalid=831, Unknown=0, NotChecked=0, Total=1260 [2024-11-18 14:24:26,865 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 7 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:24:26,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 225 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:24:26,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-18 14:24:26,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 159. [2024-11-18 14:24:26,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 110 states have (on average 1.0272727272727273) internal successors, (113), 107 states have internal predecessors, (113), 31 states have call successors, (31), 20 states have call predecessors, (31), 17 states have return successors, (77), 31 states have call predecessors, (77), 31 states have call successors, (77) [2024-11-18 14:24:26,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 221 transitions. [2024-11-18 14:24:26,890 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 221 transitions. Word has length 1359 [2024-11-18 14:24:26,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:24:26,891 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 221 transitions. [2024-11-18 14:24:26,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.076923076923077) internal successors, (80), 27 states have internal predecessors, (80), 21 states have call successors, (25), 1 states have call predecessors, (25), 11 states have return successors, (34), 14 states have call predecessors, (34), 21 states have call successors, (34) [2024-11-18 14:24:26,892 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 221 transitions. [2024-11-18 14:24:26,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1210 [2024-11-18 14:24:26,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:24:26,912 INFO L215 NwaCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 55, 34, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:24:26,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-18 14:24:27,112 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 [2024-11-18 14:24:27,113 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:24:27,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:24:27,114 INFO L85 PathProgramCache]: Analyzing trace with hash 15284780, now seen corresponding path program 17 times [2024-11-18 14:24:27,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:24:27,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466030972] [2024-11-18 14:24:27,114 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-18 14:24:27,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:24:27,503 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 144 check-sat command(s) [2024-11-18 14:24:27,504 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-18 14:24:27,504 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 14:24:27,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 14:24:27,817 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 14:24:27,817 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 14:24:27,818 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 14:24:27,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-18 14:24:27,824 INFO L407 BasicCegarLoop]: Path program histogram: [17, 1, 1, 1] [2024-11-18 14:24:27,994 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 14:24:27,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 02:24:27 BoogieIcfgContainer [2024-11-18 14:24:27,997 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 14:24:27,997 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 14:24:27,997 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 14:24:28,000 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 14:24:28,001 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:23:21" (3/4) ... [2024-11-18 14:24:28,002 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-18 14:24:28,154 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 14:24:28,154 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 14:24:28,155 INFO L158 Benchmark]: Toolchain (without parser) took 67482.03ms. Allocated memory was 161.5MB in the beginning and 1.1GB in the end (delta: 971.0MB). Free memory was 91.3MB in the beginning and 728.0MB in the end (delta: -636.7MB). Peak memory consumption was 337.8MB. Max. memory is 16.1GB. [2024-11-18 14:24:28,155 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 117.4MB. Free memory was 80.2MB in the beginning and 80.0MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 14:24:28,156 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.13ms. Allocated memory is still 161.5MB. Free memory was 91.3MB in the beginning and 79.2MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-18 14:24:28,156 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.31ms. Allocated memory is still 161.5MB. Free memory was 79.2MB in the beginning and 77.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 14:24:28,156 INFO L158 Benchmark]: Boogie Preprocessor took 42.07ms. Allocated memory is still 161.5MB. Free memory was 77.7MB in the beginning and 76.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 14:24:28,156 INFO L158 Benchmark]: RCFGBuilder took 307.79ms. Allocated memory is still 161.5MB. Free memory was 76.3MB in the beginning and 65.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-18 14:24:28,157 INFO L158 Benchmark]: TraceAbstraction took 66656.79ms. Allocated memory was 161.5MB in the beginning and 1.1GB in the end (delta: 971.0MB). Free memory was 65.2MB in the beginning and 747.9MB in the end (delta: -682.8MB). Peak memory consumption was 289.5MB. Max. memory is 16.1GB. [2024-11-18 14:24:28,157 INFO L158 Benchmark]: Witness Printer took 157.19ms. Allocated memory is still 1.1GB. Free memory was 747.9MB in the beginning and 728.0MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-18 14:24:28,158 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.12ms. Allocated memory is still 117.4MB. Free memory was 80.2MB in the beginning and 80.0MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.13ms. Allocated memory is still 161.5MB. Free memory was 91.3MB in the beginning and 79.2MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.31ms. Allocated memory is still 161.5MB. Free memory was 79.2MB in the beginning and 77.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.07ms. Allocated memory is still 161.5MB. Free memory was 77.7MB in the beginning and 76.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 307.79ms. Allocated memory is still 161.5MB. Free memory was 76.3MB in the beginning and 65.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 66656.79ms. Allocated memory was 161.5MB in the beginning and 1.1GB in the end (delta: 971.0MB). Free memory was 65.2MB in the beginning and 747.9MB in the end (delta: -682.8MB). Peak memory consumption was 289.5MB. Max. memory is 16.1GB. * Witness Printer took 157.19ms. Allocated memory is still 1.1GB. Free memory was 747.9MB in the beginning and 728.0MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. 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, 1 error locations. Started 1 CEGAR loops. OverallTime: 66.4s, OverallIterations: 20, TraceHistogramMax: 249, PathProgramHistogramMax: 17, EmptinessCheckTime: 0.2s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 811 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 701 mSDsluCounter, 1876 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1498 mSDsCounter, 942 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2409 IncrementalHoareTripleChecker+Invalid, 3351 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 942 mSolverCounterUnsat, 378 mSDtfsCounter, 2409 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20855 GetRequests, 20349 SyntacticMatches, 109 SemanticMatches, 397 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2831 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=19, InterpolantAutomatonStates: 223, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 113 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 52.5s InterpolantComputationTime, 21734 NumberOfCodeBlocks, 15962 NumberOfCodeBlocksAsserted, 600 NumberOfCheckSat, 30724 ConstructedInterpolants, 0 QuantifiedInterpolants, 36497 SizeOfPredicates, 86 NumberOfNonLiveVariables, 16374 ConjunctsInSsa, 237 ConjunctsInUnsatCore, 53 InterpolantComputations, 2 PerfectInterpolantSequences, 2043898/2154072 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-18 14:24:28,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- 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