/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/recursive/Fibonacci05.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 10:14:02,306 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 10:14:02,347 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-21 10:14:02,350 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 10:14:02,350 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 10:14:02,364 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 10:14:02,365 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 10:14:02,365 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 10:14:02,365 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 10:14:02,365 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 10:14:02,366 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 10:14:02,366 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 10:14:02,366 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 10:14:02,366 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 10:14:02,367 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 10:14:02,367 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 10:14:02,367 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 10:14:02,367 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 10:14:02,368 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 10:14:02,368 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 10:14:02,368 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 10:14:02,368 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 10:14:02,369 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 10:14:02,369 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 10:14:02,369 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 10:14:02,369 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 10:14:02,369 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 10:14:02,369 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 10:14:02,370 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 10:14:02,370 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 10:14:02,370 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 10:14:02,370 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 10:14:02,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 10:14:02,371 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 10:14:02,371 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 10:14:02,371 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 10:14:02,371 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 10:14:02,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 10:14:02,371 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 10:14:02,372 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 10:14:02,372 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 10:14:02,372 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 10:14:02,372 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 10:14:02,372 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: Use bitabs translation -> false [2023-12-21 10:14:02,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 10:14:02,559 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 10:14:02,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 10:14:02,564 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 10:14:02,564 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 10:14:02,565 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci05.c [2023-12-21 10:14:03,533 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 10:14:03,649 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 10:14:03,650 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci05.c [2023-12-21 10:14:03,657 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30c62c93b/fa9dc2d6f58849e59cc2b3a34e7b70da/FLAGf9d6e0cf3 [2023-12-21 10:14:03,666 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30c62c93b/fa9dc2d6f58849e59cc2b3a34e7b70da [2023-12-21 10:14:03,668 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 10:14:03,669 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 10:14:03,670 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 10:14:03,670 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 10:14:03,674 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 10:14:03,674 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:14:03" (1/1) ... [2023-12-21 10:14:03,675 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@347ff561 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:03, skipping insertion in model container [2023-12-21 10:14:03,675 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:14:03" (1/1) ... [2023-12-21 10:14:03,691 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 10:14:03,785 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci05.c[746,759] [2023-12-21 10:14:03,788 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 10:14:03,794 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 10:14:03,803 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci05.c[746,759] [2023-12-21 10:14:03,803 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 10:14:03,812 INFO L206 MainTranslator]: Completed translation [2023-12-21 10:14:03,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:03 WrapperNode [2023-12-21 10:14:03,812 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 10:14:03,813 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 10:14:03,813 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 10:14:03,813 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 10:14:03,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:03" (1/1) ... [2023-12-21 10:14:03,821 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:03" (1/1) ... [2023-12-21 10:14:03,830 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2023-12-21 10:14:03,831 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 10:14:03,831 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 10:14:03,831 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 10:14:03,831 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 10:14:03,838 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:03" (1/1) ... [2023-12-21 10:14:03,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:03" (1/1) ... [2023-12-21 10:14:03,838 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:03" (1/1) ... [2023-12-21 10:14:03,845 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]. [2023-12-21 10:14:03,845 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:03" (1/1) ... [2023-12-21 10:14:03,845 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:03" (1/1) ... [2023-12-21 10:14:03,847 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:03" (1/1) ... [2023-12-21 10:14:03,848 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:03" (1/1) ... [2023-12-21 10:14:03,848 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:03" (1/1) ... [2023-12-21 10:14:03,849 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:03" (1/1) ... [2023-12-21 10:14:03,849 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 10:14:03,850 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 10:14:03,850 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 10:14:03,850 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 10:14:03,851 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:03" (1/1) ... [2023-12-21 10:14:03,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 10:14:03,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 10:14:03,882 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) [2023-12-21 10:14:03,891 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 [2023-12-21 10:14:03,907 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2023-12-21 10:14:03,907 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2023-12-21 10:14:03,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 10:14:03,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 10:14:03,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 10:14:03,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 10:14:03,952 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 10:14:03,953 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 10:14:04,096 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 10:14:04,117 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 10:14:04,117 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-21 10:14:04,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:14:04 BoogieIcfgContainer [2023-12-21 10:14:04,117 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 10:14:04,119 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 10:14:04,119 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 10:14:04,121 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 10:14:04,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 10:14:03" (1/3) ... [2023-12-21 10:14:04,122 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71d2765a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 10:14:04, skipping insertion in model container [2023-12-21 10:14:04,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:03" (2/3) ... [2023-12-21 10:14:04,122 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71d2765a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 10:14:04, skipping insertion in model container [2023-12-21 10:14:04,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:14:04" (3/3) ... [2023-12-21 10:14:04,123 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2023-12-21 10:14:04,135 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 10:14:04,136 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 10:14:04,177 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 10:14:04,183 INFO L357 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, mHoare=true, 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;@744c9139, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 10:14:04,184 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 10:14:04,187 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 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) [2023-12-21 10:14:04,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-21 10:14:04,193 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 10:14:04,194 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 10:14:04,194 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 10:14:04,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 10:14:04,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1615401540, now seen corresponding path program 1 times [2023-12-21 10:14:04,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 10:14:04,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257842454] [2023-12-21 10:14:04,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 10:14:04,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 10:14:04,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:04,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 10:14:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:04,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 10:14:04,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 10:14:04,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257842454] [2023-12-21 10:14:04,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257842454] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 10:14:04,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 10:14:04,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 10:14:04,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43212831] [2023-12-21 10:14:04,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 10:14:04,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 10:14:04,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 10:14:04,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 10:14:04,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 10:14:04,393 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 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.4) internal successors, (7), 5 states have internal predecessors, (7), 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) [2023-12-21 10:14:04,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 10:14:04,476 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2023-12-21 10:14:04,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 10:14:04,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 9 [2023-12-21 10:14:04,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 10:14:04,484 INFO L225 Difference]: With dead ends: 26 [2023-12-21 10:14:04,484 INFO L226 Difference]: Without dead ends: 17 [2023-12-21 10:14:04,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 10:14:04,490 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 10:14:04,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 26 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 10:14:04,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-21 10:14:04,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-12-21 10:14:04,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 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) [2023-12-21 10:14:04,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2023-12-21 10:14:04,519 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2023-12-21 10:14:04,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 10:14:04,520 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-12-21 10:14:04,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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) [2023-12-21 10:14:04,520 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2023-12-21 10:14:04,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-21 10:14:04,521 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 10:14:04,521 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 10:14:04,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 10:14:04,522 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 10:14:04,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 10:14:04,523 INFO L85 PathProgramCache]: Analyzing trace with hash -2136894566, now seen corresponding path program 1 times [2023-12-21 10:14:04,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 10:14:04,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542904589] [2023-12-21 10:14:04,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 10:14:04,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 10:14:04,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:04,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 10:14:04,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:04,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 10:14:04,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 10:14:04,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542904589] [2023-12-21 10:14:04,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542904589] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 10:14:04,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 10:14:04,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 10:14:04,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777655380] [2023-12-21 10:14:04,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 10:14:04,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 10:14:04,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 10:14:04,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 10:14:04,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 10:14:04,661 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 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) [2023-12-21 10:14:04,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 10:14:04,704 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2023-12-21 10:14:04,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 10:14:04,705 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 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 [2023-12-21 10:14:04,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 10:14:04,706 INFO L225 Difference]: With dead ends: 23 [2023-12-21 10:14:04,706 INFO L226 Difference]: Without dead ends: 19 [2023-12-21 10:14:04,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 10:14:04,708 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 10:14:04,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 26 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 10:14:04,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-21 10:14:04,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2023-12-21 10:14:04,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 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) [2023-12-21 10:14:04,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2023-12-21 10:14:04,718 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2023-12-21 10:14:04,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 10:14:04,718 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-12-21 10:14:04,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 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) [2023-12-21 10:14:04,719 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2023-12-21 10:14:04,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-21 10:14:04,720 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 10:14:04,720 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 10:14:04,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 10:14:04,720 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 10:14:04,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 10:14:04,721 INFO L85 PathProgramCache]: Analyzing trace with hash -338238899, now seen corresponding path program 1 times [2023-12-21 10:14:04,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 10:14:04,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413557102] [2023-12-21 10:14:04,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 10:14:04,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 10:14:04,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:04,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 10:14:04,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:04,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:04,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:04,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 10:14:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:04,874 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 10:14:04,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 10:14:04,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413557102] [2023-12-21 10:14:04,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413557102] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 10:14:04,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080888940] [2023-12-21 10:14:04,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 10:14:04,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 10:14:04,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 10:14:04,879 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) [2023-12-21 10:14:04,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-21 10:14:04,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:04,926 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 10:14:04,929 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 10:14:04,997 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 10:14:04,997 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 10:14:05,186 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 10:14:05,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080888940] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 10:14:05,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 10:14:05,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 13 [2023-12-21 10:14:05,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689205457] [2023-12-21 10:14:05,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 10:14:05,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-21 10:14:05,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 10:14:05,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-21 10:14:05,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-12-21 10:14:05,195 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2023-12-21 10:14:05,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 10:14:05,349 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2023-12-21 10:14:05,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 10:14:05,349 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) Word has length 22 [2023-12-21 10:14:05,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 10:14:05,350 INFO L225 Difference]: With dead ends: 45 [2023-12-21 10:14:05,350 INFO L226 Difference]: Without dead ends: 28 [2023-12-21 10:14:05,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2023-12-21 10:14:05,351 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 29 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 10:14:05,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 54 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 10:14:05,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-21 10:14:05,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-12-21 10:14:05,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2023-12-21 10:14:05,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2023-12-21 10:14:05,356 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 22 [2023-12-21 10:14:05,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 10:14:05,356 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2023-12-21 10:14:05,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2023-12-21 10:14:05,357 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2023-12-21 10:14:05,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-21 10:14:05,358 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 10:14:05,358 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1] [2023-12-21 10:14:05,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-21 10:14:05,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 10:14:05,563 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 10:14:05,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 10:14:05,564 INFO L85 PathProgramCache]: Analyzing trace with hash 255154638, now seen corresponding path program 1 times [2023-12-21 10:14:05,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 10:14:05,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006792508] [2023-12-21 10:14:05,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 10:14:05,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 10:14:05,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:05,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 10:14:05,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:05,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:05,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:05,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:05,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:05,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:05,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:14:05,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:05,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:05,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:05,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:05,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:05,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:05,904 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 44 proven. 63 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2023-12-21 10:14:05,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 10:14:05,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006792508] [2023-12-21 10:14:05,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006792508] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 10:14:05,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779375892] [2023-12-21 10:14:05,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 10:14:05,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 10:14:05,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 10:14:05,906 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) [2023-12-21 10:14:05,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-21 10:14:05,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:05,962 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-21 10:14:05,964 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 10:14:06,003 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2023-12-21 10:14:06,003 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 10:14:06,304 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 82 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-21 10:14:06,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779375892] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 10:14:06,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 10:14:06,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 18 [2023-12-21 10:14:06,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090083396] [2023-12-21 10:14:06,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 10:14:06,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-21 10:14:06,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 10:14:06,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-21 10:14:06,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2023-12-21 10:14:06,308 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2023-12-21 10:14:06,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 10:14:06,457 INFO L93 Difference]: Finished difference Result 72 states and 122 transitions. [2023-12-21 10:14:06,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-21 10:14:06,457 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) Word has length 64 [2023-12-21 10:14:06,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 10:14:06,462 INFO L225 Difference]: With dead ends: 72 [2023-12-21 10:14:06,462 INFO L226 Difference]: Without dead ends: 43 [2023-12-21 10:14:06,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 137 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2023-12-21 10:14:06,464 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 41 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 10:14:06,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 73 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 10:14:06,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-21 10:14:06,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-12-21 10:14:06,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (24), 9 states have call predecessors, (24), 7 states have call successors, (24) [2023-12-21 10:14:06,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 65 transitions. [2023-12-21 10:14:06,481 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 65 transitions. Word has length 64 [2023-12-21 10:14:06,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 10:14:06,482 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 65 transitions. [2023-12-21 10:14:06,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2023-12-21 10:14:06,482 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 65 transitions. [2023-12-21 10:14:06,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-12-21 10:14:06,489 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 10:14:06,489 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 17, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1] [2023-12-21 10:14:06,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-21 10:14:06,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-12-21 10:14:06,692 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 10:14:06,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 10:14:06,693 INFO L85 PathProgramCache]: Analyzing trace with hash -625058046, now seen corresponding path program 2 times [2023-12-21 10:14:06,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 10:14:06,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479552562] [2023-12-21 10:14:06,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 10:14:06,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 10:14:06,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:06,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 10:14:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:06,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:06,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:06,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:07,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:07,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:07,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:07,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:07,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:07,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:07,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:14:07,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:07,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-21 10:14:07,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:07,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:07,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:07,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:07,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-21 10:14:07,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:07,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:07,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:07,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:07,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:07,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:07,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:07,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:07,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:14:07,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:07,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-21 10:14:07,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:07,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:07,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:07,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:07,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:07,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:07,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:07,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:07,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:14:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:07,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-21 10:14:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:07,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:07,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:07,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 253 proven. 368 refuted. 0 times theorem prover too weak. 979 trivial. 0 not checked. [2023-12-21 10:14:07,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 10:14:07,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479552562] [2023-12-21 10:14:07,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479552562] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 10:14:07,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887726348] [2023-12-21 10:14:07,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 10:14:07,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 10:14:07,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 10:14:07,209 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) [2023-12-21 10:14:07,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-21 10:14:07,292 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 10:14:07,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 10:14:07,294 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-21 10:14:07,306 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 10:14:07,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 67 proven. 459 refuted. 0 times theorem prover too weak. 1074 trivial. 0 not checked. [2023-12-21 10:14:07,400 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 10:14:08,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 67 proven. 485 refuted. 0 times theorem prover too weak. 1048 trivial. 0 not checked. [2023-12-21 10:14:08,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887726348] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 10:14:08,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 10:14:08,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 13] total 23 [2023-12-21 10:14:08,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351336239] [2023-12-21 10:14:08,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 10:14:08,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-21 10:14:08,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 10:14:08,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-21 10:14:08,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2023-12-21 10:14:08,082 INFO L87 Difference]: Start difference. First operand 43 states and 65 transitions. Second operand has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 15 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2023-12-21 10:14:08,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 10:14:08,394 INFO L93 Difference]: Finished difference Result 118 states and 222 transitions. [2023-12-21 10:14:08,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-21 10:14:08,395 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 15 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) Word has length 170 [2023-12-21 10:14:08,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 10:14:08,399 INFO L225 Difference]: With dead ends: 118 [2023-12-21 10:14:08,400 INFO L226 Difference]: Without dead ends: 75 [2023-12-21 10:14:08,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 382 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=515, Invalid=1291, Unknown=0, NotChecked=0, Total=1806 [2023-12-21 10:14:08,403 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 81 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 10:14:08,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 86 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 10:14:08,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-12-21 10:14:08,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 65. [2023-12-21 10:14:08,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 12 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (37), 13 states have call predecessors, (37), 12 states have call successors, (37) [2023-12-21 10:14:08,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 104 transitions. [2023-12-21 10:14:08,418 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 104 transitions. Word has length 170 [2023-12-21 10:14:08,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 10:14:08,419 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 104 transitions. [2023-12-21 10:14:08,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 15 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2023-12-21 10:14:08,420 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 104 transitions. [2023-12-21 10:14:08,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2023-12-21 10:14:08,424 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 10:14:08,424 INFO L195 NwaCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1] [2023-12-21 10:14:08,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-21 10:14:08,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 10:14:08,632 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 10:14:08,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 10:14:08,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1745181955, now seen corresponding path program 3 times [2023-12-21 10:14:08,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 10:14:08,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138486275] [2023-12-21 10:14:08,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 10:14:08,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 10:14:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:08,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 10:14:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:09,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:09,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:09,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:14:09,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:14:09,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:09,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:09,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-21 10:14:09,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:09,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:09,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:14:09,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-21 10:14:09,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:09,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:09,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:09,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:14:09,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:14:09,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:09,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:09,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-12-21 10:14:09,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:09,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:09,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:09,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:09,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:14:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:14:09,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:09,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:09,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-21 10:14:09,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:09,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:09,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:09,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:14:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-21 10:14:09,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:09,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:09,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:09,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:09,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:14:09,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:14:09,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:09,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:09,759 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 844 proven. 1612 refuted. 0 times theorem prover too weak. 4664 trivial. 0 not checked. [2023-12-21 10:14:09,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 10:14:09,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138486275] [2023-12-21 10:14:09,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138486275] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 10:14:09,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220542368] [2023-12-21 10:14:09,760 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 10:14:09,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 10:14:09,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 10:14:09,761 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) [2023-12-21 10:14:09,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-21 10:14:09,891 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2023-12-21 10:14:09,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 10:14:09,893 INFO L262 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-21 10:14:09,897 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 10:14:09,980 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 214 proven. 1491 refuted. 0 times theorem prover too weak. 5415 trivial. 0 not checked. [2023-12-21 10:14:09,980 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 10:14:11,629 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 214 proven. 1548 refuted. 0 times theorem prover too weak. 5358 trivial. 0 not checked. [2023-12-21 10:14:11,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220542368] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 10:14:11,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 10:14:11,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 11, 17] total 33 [2023-12-21 10:14:11,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802842897] [2023-12-21 10:14:11,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 10:14:11,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-21 10:14:11,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 10:14:11,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-21 10:14:11,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=793, Unknown=0, NotChecked=0, Total=1056 [2023-12-21 10:14:11,631 INFO L87 Difference]: Start difference. First operand 65 states and 104 transitions. Second operand has 33 states, 33 states have (on average 2.484848484848485) internal successors, (82), 33 states have internal predecessors, (82), 24 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (42), 23 states have call predecessors, (42), 24 states have call successors, (42) [2023-12-21 10:14:12,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 10:14:12,021 INFO L93 Difference]: Finished difference Result 171 states and 338 transitions. [2023-12-21 10:14:12,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-21 10:14:12,021 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.484848484848485) internal successors, (82), 33 states have internal predecessors, (82), 24 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (42), 23 states have call predecessors, (42), 24 states have call successors, (42) Word has length 350 [2023-12-21 10:14:12,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 10:14:12,023 INFO L225 Difference]: With dead ends: 171 [2023-12-21 10:14:12,023 INFO L226 Difference]: Without dead ends: 108 [2023-12-21 10:14:12,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 842 GetRequests, 785 SyntacticMatches, 8 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 909 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=654, Invalid=1896, Unknown=0, NotChecked=0, Total=2550 [2023-12-21 10:14:12,025 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 156 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 10:14:12,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 149 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 10:14:12,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-12-21 10:14:12,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 90. [2023-12-21 10:14:12,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 61 states have internal predecessors, (70), 17 states have call successors, (17), 12 states have call predecessors, (17), 9 states have return successors, (38), 16 states have call predecessors, (38), 17 states have call successors, (38) [2023-12-21 10:14:12,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 125 transitions. [2023-12-21 10:14:12,033 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 125 transitions. Word has length 350 [2023-12-21 10:14:12,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 10:14:12,033 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 125 transitions. [2023-12-21 10:14:12,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.484848484848485) internal successors, (82), 33 states have internal predecessors, (82), 24 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (42), 23 states have call predecessors, (42), 24 states have call successors, (42) [2023-12-21 10:14:12,033 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 125 transitions. [2023-12-21 10:14:12,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2023-12-21 10:14:12,039 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 10:14:12,039 INFO L195 NwaCegarLoop]: trace histogram [87, 87, 70, 43, 43, 43, 43, 43, 43, 43, 27, 17, 1, 1, 1, 1, 1, 1] [2023-12-21 10:14:12,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-21 10:14:12,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 10:14:12,245 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 10:14:12,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 10:14:12,246 INFO L85 PathProgramCache]: Analyzing trace with hash 225251225, now seen corresponding path program 4 times [2023-12-21 10:14:12,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 10:14:12,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067267903] [2023-12-21 10:14:12,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 10:14:12,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 10:14:12,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:12,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 10:14:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:13,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:13,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:13,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:13,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:13,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:13,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:13,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:13,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:13,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:13,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:13,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:13,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:13,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:14:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:13,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:14:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:13,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:13,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:13,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:13,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-21 10:14:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:13,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:13,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:13,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:13,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:13,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:14:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:13,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-21 10:14:13,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:13,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:13,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:13,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:13,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:13,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:13,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:13,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:14:13,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:13,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:14:13,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:13,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:13,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:13,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:13,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-12-21 10:14:13,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:13,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:13,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:13,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:13,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:13,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:13,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:13,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:13,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:13,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:13,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:13,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:14:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:13,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:14:13,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:13,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:13,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:13,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:13,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:13,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-21 10:14:13,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:13,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:13,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:13,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:13,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:14:13,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:13,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2023-12-21 10:14:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:13,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:14,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:14,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:14,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:14,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:14,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:14,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:14,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:14,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:14,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:14,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:14,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:14,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:14:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:14,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:14:14,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:14,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:14,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:14,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:14,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-21 10:14:14,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:14,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:14,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:14,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:14,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:14,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:14,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:14,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:14:14,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:14,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-21 10:14:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:14,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:14,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:14,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:14,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:14,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:14,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:14,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:14:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:14,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:14:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:14,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:14,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:14,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-12-21 10:14:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:14,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:14,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:14,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:14,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:14,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:14,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:14,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:14,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:14,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:14:14,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:14,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:14:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:14,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:14,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:14,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:14,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:14,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-12-21 10:14:14,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:14,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:14,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:14,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:14,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:14,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:14:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:14,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:14:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:14,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:14,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:14,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:14,334 INFO L134 CoverageAnalysis]: Checked inductivity of 20991 backedges. 3423 proven. 3437 refuted. 0 times theorem prover too weak. 14131 trivial. 0 not checked. [2023-12-21 10:14:14,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 10:14:14,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067267903] [2023-12-21 10:14:14,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067267903] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 10:14:14,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601726605] [2023-12-21 10:14:14,334 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 10:14:14,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 10:14:14,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 10:14:14,335 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) [2023-12-21 10:14:14,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-21 10:14:14,522 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 10:14:14,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 10:14:14,525 INFO L262 TraceCheckSpWp]: Trace formula consists of 1058 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-21 10:14:14,531 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 10:14:14,705 INFO L134 CoverageAnalysis]: Checked inductivity of 20991 backedges. 2164 proven. 4045 refuted. 0 times theorem prover too weak. 14782 trivial. 0 not checked. [2023-12-21 10:14:14,705 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 10:14:18,482 INFO L134 CoverageAnalysis]: Checked inductivity of 20991 backedges. 2164 proven. 4153 refuted. 0 times theorem prover too weak. 14674 trivial. 0 not checked. [2023-12-21 10:14:18,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601726605] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 10:14:18,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 10:14:18,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 19, 31] total 45 [2023-12-21 10:14:18,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913941912] [2023-12-21 10:14:18,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 10:14:18,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-12-21 10:14:18,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 10:14:18,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-12-21 10:14:18,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=1527, Unknown=0, NotChecked=0, Total=1980 [2023-12-21 10:14:18,486 INFO L87 Difference]: Start difference. First operand 90 states and 125 transitions. Second operand has 45 states, 45 states have (on average 2.7333333333333334) internal successors, (123), 45 states have internal predecessors, (123), 41 states have call successors, (46), 1 states have call predecessors, (46), 16 states have return successors, (68), 28 states have call predecessors, (68), 41 states have call successors, (68) [2023-12-21 10:14:19,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 10:14:19,033 INFO L93 Difference]: Finished difference Result 216 states and 397 transitions. [2023-12-21 10:14:19,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-12-21 10:14:19,034 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.7333333333333334) internal successors, (123), 45 states have internal predecessors, (123), 41 states have call successors, (46), 1 states have call predecessors, (46), 16 states have return successors, (68), 28 states have call predecessors, (68), 41 states have call successors, (68) Word has length 595 [2023-12-21 10:14:19,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 10:14:19,035 INFO L225 Difference]: With dead ends: 216 [2023-12-21 10:14:19,035 INFO L226 Difference]: Without dead ends: 128 [2023-12-21 10:14:19,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1424 GetRequests, 1339 SyntacticMatches, 15 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2002 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1241, Invalid=3871, Unknown=0, NotChecked=0, Total=5112 [2023-12-21 10:14:19,038 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 221 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 10:14:19,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 200 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 10:14:19,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-12-21 10:14:19,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 108. [2023-12-21 10:14:19,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 77 states have (on average 1.0389610389610389) internal successors, (80), 74 states have internal predecessors, (80), 21 states have call successors, (21), 17 states have call predecessors, (21), 9 states have return successors, (51), 16 states have call predecessors, (51), 21 states have call successors, (51) [2023-12-21 10:14:19,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 152 transitions. [2023-12-21 10:14:19,047 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 152 transitions. Word has length 595 [2023-12-21 10:14:19,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 10:14:19,047 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 152 transitions. [2023-12-21 10:14:19,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.7333333333333334) internal successors, (123), 45 states have internal predecessors, (123), 41 states have call successors, (46), 1 states have call predecessors, (46), 16 states have return successors, (68), 28 states have call predecessors, (68), 41 states have call successors, (68) [2023-12-21 10:14:19,048 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 152 transitions. [2023-12-21 10:14:19,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2023-12-21 10:14:19,051 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 10:14:19,052 INFO L195 NwaCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1] [2023-12-21 10:14:19,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-21 10:14:19,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 10:14:19,258 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 10:14:19,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 10:14:19,259 INFO L85 PathProgramCache]: Analyzing trace with hash 2068824531, now seen corresponding path program 5 times [2023-12-21 10:14:19,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 10:14:19,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435634381] [2023-12-21 10:14:19,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 10:14:19,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 10:14:19,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 10:14:19,305 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 10:14:19,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 10:14:19,386 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 10:14:19,386 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 10:14:19,387 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 10:14:19,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-21 10:14:19,390 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1] [2023-12-21 10:14:19,393 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 10:14:19,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 10:14:19 BoogieIcfgContainer [2023-12-21 10:14:19,465 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 10:14:19,466 INFO L158 Benchmark]: Toolchain (without parser) took 15796.47ms. Allocated memory was 296.7MB in the beginning and 540.0MB in the end (delta: 243.3MB). Free memory was 245.8MB in the beginning and 385.5MB in the end (delta: -139.7MB). Peak memory consumption was 104.0MB. Max. memory is 8.0GB. [2023-12-21 10:14:19,466 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 207.6MB. Free memory is still 157.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 10:14:19,466 INFO L158 Benchmark]: CACSL2BoogieTranslator took 142.55ms. Allocated memory is still 296.7MB. Free memory was 245.8MB in the beginning and 235.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-21 10:14:19,466 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.60ms. Allocated memory is still 296.7MB. Free memory was 235.3MB in the beginning and 233.9MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-21 10:14:19,466 INFO L158 Benchmark]: Boogie Preprocessor took 18.29ms. Allocated memory is still 296.7MB. Free memory was 233.9MB in the beginning and 232.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 10:14:19,466 INFO L158 Benchmark]: RCFGBuilder took 267.61ms. Allocated memory is still 296.7MB. Free memory was 232.2MB in the beginning and 222.1MB in the end (delta: 10.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-12-21 10:14:19,467 INFO L158 Benchmark]: TraceAbstraction took 15346.07ms. Allocated memory was 296.7MB in the beginning and 540.0MB in the end (delta: 243.3MB). Free memory was 221.3MB in the beginning and 385.5MB in the end (delta: -164.1MB). Peak memory consumption was 79.9MB. Max. memory is 8.0GB. [2023-12-21 10:14:19,467 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38ms. Allocated memory is still 207.6MB. Free memory is still 157.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 142.55ms. Allocated memory is still 296.7MB. Free memory was 245.8MB in the beginning and 235.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 17.60ms. Allocated memory is still 296.7MB. Free memory was 235.3MB in the beginning and 233.9MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.29ms. Allocated memory is still 296.7MB. Free memory was 233.9MB in the beginning and 232.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 267.61ms. Allocated memory is still 296.7MB. Free memory was 232.2MB in the beginning and 222.1MB in the end (delta: 10.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 15346.07ms. Allocated memory was 296.7MB in the beginning and 540.0MB in the end (delta: 243.3MB). Free memory was 221.3MB in the beginning and 385.5MB in the end (delta: -164.1MB). Peak memory consumption was 79.9MB. Max. memory is 8.0GB. * 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: 33]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] int x = __VERIFIER_nondet_int(); [L29] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L17] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L19] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L17] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L19] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, n=7] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, n=7] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, n=8] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, n=8] [L22] return fibonacci(n-1) + fibonacci(n-2); [L29] RET, EXPR fibonacci(x) VAL [x=8] [L29] int result = fibonacci(x); [L30] COND FALSE !(x < 8 || result >= 34) VAL [result=21, x=8] [L33] reach_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.2s, OverallIterations: 8, TraceHistogramMax: 87, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 560 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 544 mSDsluCounter, 614 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 489 mSDsCounter, 571 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1442 IncrementalHoareTripleChecker+Invalid, 2013 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 571 mSolverCounterUnsat, 125 mSDtfsCounter, 1442 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2934 GetRequests, 2695 SyntacticMatches, 30 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3417 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=7, InterpolantAutomatonStates: 139, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 50 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.4s InterpolantComputationTime, 2880 NumberOfCodeBlocks, 2694 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 3605 ConstructedInterpolants, 0 QuantifiedInterpolants, 5681 SizeOfPredicates, 31 NumberOfNonLiveVariables, 2275 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 17 InterpolantComputations, 2 PerfectInterpolantSequences, 71902/89736 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! [2023-12-21 10:14:19,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...