/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 true -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-19 23:41:05,638 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 23:41:05,704 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-19 23:41:05,707 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 23:41:05,707 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 23:41:05,835 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 23:41:05,836 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 23:41:05,837 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 23:41:05,837 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 23:41:05,841 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 23:41:05,841 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 23:41:05,841 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 23:41:05,842 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 23:41:05,843 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 23:41:05,843 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 23:41:05,844 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 23:41:05,844 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 23:41:05,844 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 23:41:05,844 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 23:41:05,845 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 23:41:05,845 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 23:41:05,846 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 23:41:05,846 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 23:41:05,846 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 23:41:05,846 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 23:41:05,847 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 23:41:05,847 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 23:41:05,847 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 23:41:05,848 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 23:41:05,848 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 23:41:05,849 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 23:41:05,849 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 23:41:05,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 23:41:05,849 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 23:41:05,849 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 23:41:05,849 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 23:41:05,850 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 23:41:05,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 23:41:05,850 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 23:41:05,850 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 23:41:05,850 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 23:41:05,851 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 23:41:05,851 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 23:41:05,851 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 -> true [2023-12-19 23:41:06,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 23:41:06,069 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 23:41:06,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 23:41:06,073 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 23:41:06,073 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 23:41:06,074 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci05.c [2023-12-19 23:41:07,479 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 23:41:07,632 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 23:41:07,633 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci05.c [2023-12-19 23:41:07,638 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59389c559/c0efc2da9a4e4b1895b10df1c8ee6992/FLAG7ad6db53d [2023-12-19 23:41:07,652 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59389c559/c0efc2da9a4e4b1895b10df1c8ee6992 [2023-12-19 23:41:07,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 23:41:07,655 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 23:41:07,658 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 23:41:07,658 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 23:41:07,661 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 23:41:07,661 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 11:41:07" (1/1) ... [2023-12-19 23:41:07,662 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79356775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:41:07, skipping insertion in model container [2023-12-19 23:41:07,662 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 11:41:07" (1/1) ... [2023-12-19 23:41:07,677 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 23:41:07,790 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-19 23:41:07,796 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 23:41:07,803 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 23:41:07,815 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-19 23:41:07,816 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 23:41:07,829 INFO L206 MainTranslator]: Completed translation [2023-12-19 23:41:07,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:41:07 WrapperNode [2023-12-19 23:41:07,830 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 23:41:07,831 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 23:41:07,831 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 23:41:07,831 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 23:41:07,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:41:07" (1/1) ... [2023-12-19 23:41:07,840 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:41:07" (1/1) ... [2023-12-19 23:41:07,852 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2023-12-19 23:41:07,852 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 23:41:07,853 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 23:41:07,853 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 23:41:07,853 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 23:41:07,860 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:41:07" (1/1) ... [2023-12-19 23:41:07,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:41:07" (1/1) ... [2023-12-19 23:41:07,861 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:41:07" (1/1) ... [2023-12-19 23:41:07,868 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-19 23:41:07,868 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:41:07" (1/1) ... [2023-12-19 23:41:07,868 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:41:07" (1/1) ... [2023-12-19 23:41:07,871 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:41:07" (1/1) ... [2023-12-19 23:41:07,873 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:41:07" (1/1) ... [2023-12-19 23:41:07,873 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:41:07" (1/1) ... [2023-12-19 23:41:07,874 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:41:07" (1/1) ... [2023-12-19 23:41:07,875 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 23:41:07,875 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 23:41:07,875 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 23:41:07,875 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 23:41:07,876 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:41:07" (1/1) ... [2023-12-19 23:41:07,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 23:41:07,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 23:41:07,898 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-19 23:41:07,903 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-19 23:41:07,928 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2023-12-19 23:41:07,929 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2023-12-19 23:41:07,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 23:41:07,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 23:41:07,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 23:41:07,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 23:41:07,970 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 23:41:07,972 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 23:41:08,048 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 23:41:08,061 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 23:41:08,061 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-19 23:41:08,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 11:41:08 BoogieIcfgContainer [2023-12-19 23:41:08,062 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 23:41:08,063 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 23:41:08,063 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 23:41:08,065 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 23:41:08,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 11:41:07" (1/3) ... [2023-12-19 23:41:08,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46ceaa4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 11:41:08, skipping insertion in model container [2023-12-19 23:41:08,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:41:07" (2/3) ... [2023-12-19 23:41:08,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46ceaa4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 11:41:08, skipping insertion in model container [2023-12-19 23:41:08,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 11:41:08" (3/3) ... [2023-12-19 23:41:08,066 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2023-12-19 23:41:08,078 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 23:41:08,078 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 23:41:08,105 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 23:41:08,109 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;@3dd4d245, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 23:41:08,109 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 23:41:08,111 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-19 23:41:08,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-19 23:41:08,117 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 23:41:08,117 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 23:41:08,118 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 23:41:08,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 23:41:08,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1615401540, now seen corresponding path program 1 times [2023-12-19 23:41:08,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 23:41:08,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026958256] [2023-12-19 23:41:08,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 23:41:08,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 23:41:08,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:08,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 23:41:08,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:08,303 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-19 23:41:08,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 23:41:08,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026958256] [2023-12-19 23:41:08,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026958256] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 23:41:08,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 23:41:08,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 23:41:08,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851923072] [2023-12-19 23:41:08,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 23:41:08,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 23:41:08,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 23:41:08,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 23:41:08,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 23:41:08,328 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-19 23:41:08,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 23:41:08,398 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2023-12-19 23:41:08,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 23:41:08,400 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-19 23:41:08,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 23:41:08,406 INFO L225 Difference]: With dead ends: 26 [2023-12-19 23:41:08,406 INFO L226 Difference]: Without dead ends: 17 [2023-12-19 23:41:08,408 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-19 23:41:08,413 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-19 23:41:08,414 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-19 23:41:08,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-19 23:41:08,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-12-19 23:41:08,437 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-19 23:41:08,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2023-12-19 23:41:08,439 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2023-12-19 23:41:08,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 23:41:08,439 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-12-19 23:41:08,439 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-19 23:41:08,439 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2023-12-19 23:41:08,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-19 23:41:08,440 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 23:41:08,440 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 23:41:08,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 23:41:08,441 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 23:41:08,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 23:41:08,441 INFO L85 PathProgramCache]: Analyzing trace with hash -2136894566, now seen corresponding path program 1 times [2023-12-19 23:41:08,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 23:41:08,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942221168] [2023-12-19 23:41:08,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 23:41:08,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 23:41:08,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:08,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 23:41:08,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:08,513 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-19 23:41:08,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 23:41:08,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942221168] [2023-12-19 23:41:08,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942221168] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 23:41:08,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 23:41:08,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 23:41:08,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938264248] [2023-12-19 23:41:08,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 23:41:08,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 23:41:08,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 23:41:08,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 23:41:08,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 23:41:08,516 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-19 23:41:08,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 23:41:08,555 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2023-12-19 23:41:08,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 23:41:08,555 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-19 23:41:08,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 23:41:08,557 INFO L225 Difference]: With dead ends: 23 [2023-12-19 23:41:08,557 INFO L226 Difference]: Without dead ends: 19 [2023-12-19 23:41:08,558 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-19 23:41:08,559 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-19 23:41:08,560 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-19 23:41:08,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-19 23:41:08,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2023-12-19 23:41:08,575 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-19 23:41:08,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2023-12-19 23:41:08,576 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2023-12-19 23:41:08,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 23:41:08,576 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-12-19 23:41:08,576 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-19 23:41:08,576 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2023-12-19 23:41:08,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-19 23:41:08,577 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 23:41:08,577 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 23:41:08,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 23:41:08,577 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 23:41:08,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 23:41:08,578 INFO L85 PathProgramCache]: Analyzing trace with hash -338238899, now seen corresponding path program 1 times [2023-12-19 23:41:08,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 23:41:08,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717865372] [2023-12-19 23:41:08,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 23:41:08,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 23:41:08,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:08,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 23:41:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:08,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:08,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:08,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 23:41:08,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:08,732 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-19 23:41:08,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 23:41:08,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717865372] [2023-12-19 23:41:08,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717865372] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 23:41:08,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685422279] [2023-12-19 23:41:08,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 23:41:08,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 23:41:08,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 23:41:08,735 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-19 23:41:08,747 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-19 23:41:08,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:08,776 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-19 23:41:08,779 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 23:41:08,844 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-19 23:41:08,844 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 23:41:09,016 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-19 23:41:09,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685422279] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 23:41:09,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 23:41:09,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 13 [2023-12-19 23:41:09,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324502149] [2023-12-19 23:41:09,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 23:41:09,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-19 23:41:09,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 23:41:09,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-19 23:41:09,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-12-19 23:41:09,018 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-19 23:41:09,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 23:41:09,139 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2023-12-19 23:41:09,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-19 23:41:09,140 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-19 23:41:09,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 23:41:09,141 INFO L225 Difference]: With dead ends: 45 [2023-12-19 23:41:09,141 INFO L226 Difference]: Without dead ends: 28 [2023-12-19 23:41:09,142 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-19 23:41:09,142 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-19 23:41:09,143 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-19 23:41:09,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-19 23:41:09,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-12-19 23:41:09,147 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-19 23:41:09,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2023-12-19 23:41:09,148 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 22 [2023-12-19 23:41:09,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 23:41:09,148 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2023-12-19 23:41:09,148 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-19 23:41:09,149 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2023-12-19 23:41:09,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-19 23:41:09,150 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 23:41:09,150 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-19 23:41:09,158 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-19 23:41:09,355 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-19 23:41:09,355 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 23:41:09,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 23:41:09,356 INFO L85 PathProgramCache]: Analyzing trace with hash 255154638, now seen corresponding path program 1 times [2023-12-19 23:41:09,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 23:41:09,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118802758] [2023-12-19 23:41:09,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 23:41:09,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 23:41:09,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:09,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 23:41:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:09,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:09,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:09,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:09,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:09,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:41:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:09,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:41:09,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:09,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:09,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:41:09,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:09,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:09,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:09,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:41:09,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:09,766 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-19 23:41:09,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 23:41:09,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118802758] [2023-12-19 23:41:09,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118802758] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 23:41:09,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773122063] [2023-12-19 23:41:09,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 23:41:09,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 23:41:09,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 23:41:09,771 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-19 23:41:09,786 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-19 23:41:09,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:09,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-19 23:41:09,839 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 23:41:09,908 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-19 23:41:09,909 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 23:41:10,176 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-19 23:41:10,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773122063] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 23:41:10,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 23:41:10,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 18 [2023-12-19 23:41:10,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880827320] [2023-12-19 23:41:10,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 23:41:10,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-19 23:41:10,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 23:41:10,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-19 23:41:10,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2023-12-19 23:41:10,179 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-19 23:41:10,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 23:41:10,327 INFO L93 Difference]: Finished difference Result 72 states and 122 transitions. [2023-12-19 23:41:10,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 23:41:10,328 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-19 23:41:10,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 23:41:10,330 INFO L225 Difference]: With dead ends: 72 [2023-12-19 23:41:10,330 INFO L226 Difference]: Without dead ends: 43 [2023-12-19 23:41:10,331 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-19 23:41:10,331 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 41 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 23:41:10,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 73 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 23:41:10,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-19 23:41:10,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-12-19 23:41:10,337 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-19 23:41:10,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 65 transitions. [2023-12-19 23:41:10,338 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 65 transitions. Word has length 64 [2023-12-19 23:41:10,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 23:41:10,339 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 65 transitions. [2023-12-19 23:41:10,339 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-19 23:41:10,339 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 65 transitions. [2023-12-19 23:41:10,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-12-19 23:41:10,341 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 23:41:10,341 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-19 23:41:10,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-19 23:41:10,546 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-19 23:41:10,546 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 23:41:10,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 23:41:10,547 INFO L85 PathProgramCache]: Analyzing trace with hash -625058046, now seen corresponding path program 2 times [2023-12-19 23:41:10,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 23:41:10,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965490564] [2023-12-19 23:41:10,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 23:41:10,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 23:41:10,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:10,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 23:41:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:10,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:10,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:10,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:10,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:11,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:11,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:11,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:41:11,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:11,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:41:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:11,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 23:41:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:11,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:11,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:41:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:11,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-19 23:41:11,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:11,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:11,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:11,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:11,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:11,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:41:11,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:11,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:41:11,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:11,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 23:41:11,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:11,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:11,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:11,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:11,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:11,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:11,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:11,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:41:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:11,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:41:11,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:11,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 23:41:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:11,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:11,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:11,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:41:11,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:11,197 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-19 23:41:11,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 23:41:11,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965490564] [2023-12-19 23:41:11,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965490564] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 23:41:11,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926480691] [2023-12-19 23:41:11,198 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-19 23:41:11,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 23:41:11,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 23:41:11,199 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-19 23:41:11,230 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-19 23:41:11,282 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-19 23:41:11,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 23:41:11,284 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-19 23:41:11,287 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 23:41:11,370 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-19 23:41:11,370 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 23:41:12,220 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-19 23:41:12,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926480691] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 23:41:12,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 23:41:12,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 13] total 23 [2023-12-19 23:41:12,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895738806] [2023-12-19 23:41:12,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 23:41:12,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-19 23:41:12,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 23:41:12,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-19 23:41:12,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2023-12-19 23:41:12,222 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-19 23:41:12,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 23:41:12,597 INFO L93 Difference]: Finished difference Result 118 states and 222 transitions. [2023-12-19 23:41:12,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-19 23:41:12,597 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-19 23:41:12,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 23:41:12,599 INFO L225 Difference]: With dead ends: 118 [2023-12-19 23:41:12,599 INFO L226 Difference]: Without dead ends: 75 [2023-12-19 23:41:12,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 382 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=515, Invalid=1291, Unknown=0, NotChecked=0, Total=1806 [2023-12-19 23:41:12,601 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 81 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 23:41:12,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 86 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 23:41:12,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-12-19 23:41:12,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 65. [2023-12-19 23:41:12,609 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-19 23:41:12,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 104 transitions. [2023-12-19 23:41:12,610 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 104 transitions. Word has length 170 [2023-12-19 23:41:12,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 23:41:12,610 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 104 transitions. [2023-12-19 23:41:12,610 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-19 23:41:12,611 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 104 transitions. [2023-12-19 23:41:12,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2023-12-19 23:41:12,614 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 23:41:12,614 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-19 23:41:12,622 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-19 23:41:12,819 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-19 23:41:12,820 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 23:41:12,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 23:41:12,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1745181955, now seen corresponding path program 3 times [2023-12-19 23:41:12,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 23:41:12,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844320798] [2023-12-19 23:41:12,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 23:41:12,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 23:41:12,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 23:41:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:13,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:13,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:41:13,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:41:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:41:13,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:41:13,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 23:41:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:13,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:41:13,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:41:13,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-19 23:41:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:13,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:13,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:41:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:41:13,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:41:13,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:41:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-12-19 23:41:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:13,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:41:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:41:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:41:13,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:13,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:41:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 23:41:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:41:13,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:41:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-19 23:41:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:41:13,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:41:13,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:41:13,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:41:13,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:13,966 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-19 23:41:13,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 23:41:13,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844320798] [2023-12-19 23:41:13,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844320798] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 23:41:13,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123666090] [2023-12-19 23:41:13,967 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-19 23:41:13,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 23:41:13,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 23:41:13,968 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-19 23:41:13,988 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-19 23:41:14,103 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2023-12-19 23:41:14,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 23:41:14,105 INFO L262 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-19 23:41:14,111 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 23:41:14,221 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-19 23:41:14,221 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 23:41:16,007 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-19 23:41:16,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123666090] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 23:41:16,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 23:41:16,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 11, 17] total 33 [2023-12-19 23:41:16,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31689391] [2023-12-19 23:41:16,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 23:41:16,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-19 23:41:16,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 23:41:16,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-19 23:41:16,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=793, Unknown=0, NotChecked=0, Total=1056 [2023-12-19 23:41:16,010 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-19 23:41:16,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 23:41:16,407 INFO L93 Difference]: Finished difference Result 171 states and 338 transitions. [2023-12-19 23:41:16,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-19 23:41:16,408 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-19 23:41:16,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 23:41:16,410 INFO L225 Difference]: With dead ends: 171 [2023-12-19 23:41:16,410 INFO L226 Difference]: Without dead ends: 108 [2023-12-19 23:41:16,412 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-19 23:41:16,412 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 156 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 23:41:16,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 149 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 23:41:16,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-12-19 23:41:16,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 90. [2023-12-19 23:41:16,421 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-19 23:41:16,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 125 transitions. [2023-12-19 23:41:16,422 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 125 transitions. Word has length 350 [2023-12-19 23:41:16,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 23:41:16,422 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 125 transitions. [2023-12-19 23:41:16,423 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-19 23:41:16,423 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 125 transitions. [2023-12-19 23:41:16,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2023-12-19 23:41:16,429 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 23:41:16,429 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-19 23:41:16,448 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-19 23:41:16,635 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-19 23:41:16,635 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 23:41:16,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 23:41:16,635 INFO L85 PathProgramCache]: Analyzing trace with hash 225251225, now seen corresponding path program 4 times [2023-12-19 23:41:16,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 23:41:16,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812355793] [2023-12-19 23:41:16,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 23:41:16,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 23:41:16,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:17,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 23:41:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:17,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:17,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:17,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:17,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:17,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:41:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:41:18,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:41:18,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:18,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:41:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 23:41:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:18,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:41:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:41:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-19 23:41:18,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:18,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:18,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:41:18,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:41:18,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:41:18,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:41:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-12-19 23:41:18,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:18,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:18,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:18,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:41:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:41:18,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:41:18,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:18,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:41:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 23:41:18,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:41:18,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:41:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2023-12-19 23:41:18,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:18,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:18,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:18,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:41:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:41:18,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:41:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:41:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 23:41:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:18,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:18,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:41:18,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:41:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-19 23:41:18,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:18,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:18,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:18,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:41:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:41:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:41:18,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:18,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:41:18,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-12-19 23:41:18,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:18,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:18,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:18,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:41:18,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:41:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:41:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:18,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:41:18,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-12-19 23:41:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:18,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:18,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:18,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:41:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:41:18,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:41:18,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:41:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:41:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:41:18,740 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-19 23:41:18,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 23:41:18,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812355793] [2023-12-19 23:41:18,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812355793] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 23:41:18,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702721332] [2023-12-19 23:41:18,741 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-19 23:41:18,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 23:41:18,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 23:41:18,742 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-19 23:41:18,787 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-19 23:41:18,942 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-19 23:41:18,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 23:41:18,945 INFO L262 TraceCheckSpWp]: Trace formula consists of 1058 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-19 23:41:18,952 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 23:41:19,129 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-19 23:41:19,130 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 23:41:23,282 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-19 23:41:23,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702721332] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 23:41:23,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 23:41:23,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 19, 31] total 45 [2023-12-19 23:41:23,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088594053] [2023-12-19 23:41:23,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 23:41:23,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-12-19 23:41:23,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 23:41:23,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-12-19 23:41:23,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=1527, Unknown=0, NotChecked=0, Total=1980 [2023-12-19 23:41:23,286 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-19 23:41:23,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 23:41:23,815 INFO L93 Difference]: Finished difference Result 216 states and 397 transitions. [2023-12-19 23:41:23,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-12-19 23:41:23,816 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-19 23:41:23,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 23:41:23,822 INFO L225 Difference]: With dead ends: 216 [2023-12-19 23:41:23,823 INFO L226 Difference]: Without dead ends: 128 [2023-12-19 23:41:23,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1424 GetRequests, 1339 SyntacticMatches, 15 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2002 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1241, Invalid=3871, Unknown=0, NotChecked=0, Total=5112 [2023-12-19 23:41:23,826 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 221 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 23:41:23,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 200 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 23:41:23,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-12-19 23:41:23,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 108. [2023-12-19 23:41:23,842 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-19 23:41:23,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 152 transitions. [2023-12-19 23:41:23,843 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 152 transitions. Word has length 595 [2023-12-19 23:41:23,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 23:41:23,843 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 152 transitions. [2023-12-19 23:41:23,844 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-19 23:41:23,844 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 152 transitions. [2023-12-19 23:41:23,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2023-12-19 23:41:23,847 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 23:41:23,848 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-19 23:41:23,870 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-19 23:41:24,057 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-19 23:41:24,058 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 23:41:24,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 23:41:24,058 INFO L85 PathProgramCache]: Analyzing trace with hash 2068824531, now seen corresponding path program 5 times [2023-12-19 23:41:24,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 23:41:24,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112943061] [2023-12-19 23:41:24,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 23:41:24,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 23:41:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 23:41:24,101 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 23:41:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 23:41:24,195 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 23:41:24,195 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 23:41:24,196 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 23:41:24,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-19 23:41:24,199 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1] [2023-12-19 23:41:24,204 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 23:41:24,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 11:41:24 BoogieIcfgContainer [2023-12-19 23:41:24,292 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 23:41:24,293 INFO L158 Benchmark]: Toolchain (without parser) took 16637.73ms. Allocated memory was 294.6MB in the beginning and 511.7MB in the end (delta: 217.1MB). Free memory was 247.2MB in the beginning and 352.8MB in the end (delta: -105.6MB). Peak memory consumption was 111.6MB. Max. memory is 8.0GB. [2023-12-19 23:41:24,293 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 196.1MB. Free memory is still 151.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 23:41:24,293 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.14ms. Allocated memory is still 294.6MB. Free memory was 247.2MB in the beginning and 236.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-19 23:41:24,293 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.88ms. Allocated memory is still 294.6MB. Free memory was 236.6MB in the beginning and 235.3MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-19 23:41:24,293 INFO L158 Benchmark]: Boogie Preprocessor took 21.87ms. Allocated memory is still 294.6MB. Free memory was 235.2MB in the beginning and 233.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-19 23:41:24,294 INFO L158 Benchmark]: RCFGBuilder took 186.34ms. Allocated memory is still 294.6MB. Free memory was 233.5MB in the beginning and 223.8MB in the end (delta: 9.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-12-19 23:41:24,294 INFO L158 Benchmark]: TraceAbstraction took 16229.40ms. Allocated memory was 294.6MB in the beginning and 511.7MB in the end (delta: 217.1MB). Free memory was 223.1MB in the beginning and 352.8MB in the end (delta: -129.7MB). Peak memory consumption was 87.4MB. Max. memory is 8.0GB. [2023-12-19 23:41:24,295 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.42ms. Allocated memory is still 196.1MB. Free memory is still 151.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 172.14ms. Allocated memory is still 294.6MB. Free memory was 247.2MB in the beginning and 236.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 21.88ms. Allocated memory is still 294.6MB. Free memory was 236.6MB in the beginning and 235.3MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.87ms. Allocated memory is still 294.6MB. Free memory was 235.2MB in the beginning and 233.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 186.34ms. Allocated memory is still 294.6MB. Free memory was 233.5MB in the beginning and 223.8MB in the end (delta: 9.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 16229.40ms. Allocated memory was 294.6MB in the beginning and 511.7MB in the end (delta: 217.1MB). Free memory was 223.1MB in the beginning and 352.8MB in the end (delta: -129.7MB). Peak memory consumption was 87.4MB. 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: 16.1s, 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, 575 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1423 IncrementalHoareTripleChecker+Invalid, 1998 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 575 mSolverCounterUnsat, 125 mSDtfsCounter, 1423 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.8s 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, 12.2s 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-19 23:41:24,320 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...