/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration false -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_7-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-eb0fd7c [2020-09-21 10:19:19,144 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-21 10:19:19,147 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-21 10:19:19,174 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-21 10:19:19,175 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-21 10:19:19,176 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-21 10:19:19,178 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-21 10:19:19,180 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-21 10:19:19,182 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-21 10:19:19,183 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-21 10:19:19,184 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-21 10:19:19,186 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-21 10:19:19,186 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-21 10:19:19,187 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-21 10:19:19,189 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-21 10:19:19,190 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-21 10:19:19,191 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-21 10:19:19,192 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-21 10:19:19,194 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-21 10:19:19,199 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-21 10:19:19,201 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-21 10:19:19,203 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-21 10:19:19,204 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-21 10:19:19,206 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-21 10:19:19,209 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-21 10:19:19,209 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-21 10:19:19,209 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-21 10:19:19,210 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-21 10:19:19,211 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-21 10:19:19,212 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-21 10:19:19,212 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-21 10:19:19,213 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-21 10:19:19,214 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-21 10:19:19,215 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-21 10:19:19,217 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-21 10:19:19,217 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-21 10:19:19,218 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-21 10:19:19,218 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-21 10:19:19,218 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-21 10:19:19,220 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-21 10:19:19,221 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-21 10:19:19,221 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-21 10:19:19,249 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-21 10:19:19,249 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-21 10:19:19,251 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-21 10:19:19,251 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-21 10:19:19,251 INFO L138 SettingsManager]: * Use SBE=true [2020-09-21 10:19:19,251 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-21 10:19:19,251 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-21 10:19:19,252 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-21 10:19:19,252 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-21 10:19:19,252 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-21 10:19:19,252 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-21 10:19:19,252 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-21 10:19:19,253 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-21 10:19:19,253 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-21 10:19:19,253 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-21 10:19:19,253 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-21 10:19:19,253 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-21 10:19:19,254 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-21 10:19:19,254 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-21 10:19:19,254 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-21 10:19:19,254 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-21 10:19:19,254 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-21 10:19:19,255 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-21 10:19:19,255 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-21 10:19:19,255 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-21 10:19:19,255 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-21 10:19:19,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-21 10:19:19,256 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-21 10:19:19,256 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-21 10:19:19,256 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> false [2020-09-21 10:19:19,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-21 10:19:19,729 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-21 10:19:19,733 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-21 10:19:19,735 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-21 10:19:19,736 INFO L275 PluginConnector]: CDTParser initialized [2020-09-21 10:19:19,737 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_7-2.c [2020-09-21 10:19:19,823 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/70aa3802b/b890f6d7b55c4475a29b557c200e7c6d/FLAGe478206c9 [2020-09-21 10:19:20,407 INFO L306 CDTParser]: Found 1 translation units. [2020-09-21 10:19:20,408 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/fibo_7-2.c [2020-09-21 10:19:20,417 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/70aa3802b/b890f6d7b55c4475a29b557c200e7c6d/FLAGe478206c9 [2020-09-21 10:19:20,769 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/70aa3802b/b890f6d7b55c4475a29b557c200e7c6d [2020-09-21 10:19:20,783 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-21 10:19:20,790 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-21 10:19:20,791 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-21 10:19:20,791 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-21 10:19:20,796 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-21 10:19:20,797 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 10:19:20" (1/1) ... [2020-09-21 10:19:20,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33a1f811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:20, skipping insertion in model container [2020-09-21 10:19:20,802 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 10:19:20" (1/1) ... [2020-09-21 10:19:20,811 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-21 10:19:20,837 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-21 10:19:21,063 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 10:19:21,068 INFO L203 MainTranslator]: Completed pre-run [2020-09-21 10:19:21,085 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 10:19:21,099 INFO L208 MainTranslator]: Completed translation [2020-09-21 10:19:21,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:21 WrapperNode [2020-09-21 10:19:21,099 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-21 10:19:21,100 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-21 10:19:21,100 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-21 10:19:21,100 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-21 10:19:21,114 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:21" (1/1) ... [2020-09-21 10:19:21,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:21" (1/1) ... [2020-09-21 10:19:21,201 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:21" (1/1) ... [2020-09-21 10:19:21,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:21" (1/1) ... [2020-09-21 10:19:21,212 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:21" (1/1) ... [2020-09-21 10:19:21,215 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:21" (1/1) ... [2020-09-21 10:19:21,216 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:21" (1/1) ... [2020-09-21 10:19:21,218 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-21 10:19:21,218 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-21 10:19:21,218 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-21 10:19:21,218 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-21 10:19:21,219 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:21" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-21 10:19:21,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-21 10:19:21,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-21 10:19:21,297 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-09-21 10:19:21,297 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-21 10:19:21,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-21 10:19:21,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-21 10:19:21,297 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-09-21 10:19:21,298 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-21 10:19:21,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-21 10:19:21,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-21 10:19:21,499 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-21 10:19:21,500 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-21 10:19:21,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 10:19:21 BoogieIcfgContainer [2020-09-21 10:19:21,506 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-21 10:19:21,507 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-21 10:19:21,508 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-21 10:19:21,515 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-21 10:19:21,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 10:19:20" (1/3) ... [2020-09-21 10:19:21,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58a78c53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 10:19:21, skipping insertion in model container [2020-09-21 10:19:21,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:21" (2/3) ... [2020-09-21 10:19:21,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58a78c53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 10:19:21, skipping insertion in model container [2020-09-21 10:19:21,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 10:19:21" (3/3) ... [2020-09-21 10:19:21,525 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_7-2.c [2020-09-21 10:19:21,557 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-21 10:19:21,579 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-21 10:19:21,612 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-21 10:19:21,658 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-21 10:19:21,659 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-21 10:19:21,659 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-21 10:19:21,659 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-21 10:19:21,660 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-21 10:19:21,660 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-21 10:19:21,660 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-21 10:19:21,660 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-21 10:19:21,686 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-09-21 10:19:21,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-09-21 10:19:21,693 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:21,695 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:21,695 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:21,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:21,702 INFO L82 PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times [2020-09-21 10:19:21,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:21,712 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [516828826] [2020-09-21 10:19:21,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:21,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:21,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:21,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:21,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:21,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:21,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:19:21,991 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [516828826] [2020-09-21 10:19:21,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:19:21,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-21 10:19:21,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044239883] [2020-09-21 10:19:22,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 10:19:22,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:22,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 10:19:22,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:19:22,018 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-09-21 10:19:22,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:22,134 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-09-21 10:19:22,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 10:19:22,136 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-09-21 10:19:22,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:22,150 INFO L225 Difference]: With dead ends: 35 [2020-09-21 10:19:22,150 INFO L226 Difference]: Without dead ends: 21 [2020-09-21 10:19:22,155 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-21 10:19:22,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-09-21 10:19:22,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-09-21 10:19:22,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-09-21 10:19:22,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-09-21 10:19:22,208 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-09-21 10:19:22,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:22,209 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-09-21 10:19:22,209 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 10:19:22,209 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-09-21 10:19:22,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-09-21 10:19:22,212 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:22,212 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:22,212 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-21 10:19:22,213 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:22,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:22,213 INFO L82 PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times [2020-09-21 10:19:22,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:22,214 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [290107105] [2020-09-21 10:19:22,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:22,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:22,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:22,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:22,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:19:22,290 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [290107105] [2020-09-21 10:19:22,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:19:22,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-21 10:19:22,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201967519] [2020-09-21 10:19:22,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 10:19:22,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:22,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 10:19:22,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:19:22,295 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-09-21 10:19:22,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:22,361 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-09-21 10:19:22,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 10:19:22,362 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-09-21 10:19:22,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:22,364 INFO L225 Difference]: With dead ends: 27 [2020-09-21 10:19:22,364 INFO L226 Difference]: Without dead ends: 23 [2020-09-21 10:19:22,366 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-21 10:19:22,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-09-21 10:19:22,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-09-21 10:19:22,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-09-21 10:19:22,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-09-21 10:19:22,375 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-09-21 10:19:22,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:22,375 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-09-21 10:19:22,376 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 10:19:22,376 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-09-21 10:19:22,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-09-21 10:19:22,377 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:22,378 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:22,378 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-21 10:19:22,378 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:22,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:22,379 INFO L82 PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times [2020-09-21 10:19:22,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:22,380 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1021855333] [2020-09-21 10:19:22,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:22,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:22,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:22,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:22,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:22,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-09-21 10:19:22,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:22,554 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-21 10:19:22,554 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1021855333] [2020-09-21 10:19:22,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:22,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-21 10:19:22,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232380766] [2020-09-21 10:19:22,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 10:19:22,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:22,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 10:19:22,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-21 10:19:22,557 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 7 states. [2020-09-21 10:19:22,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:22,664 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-09-21 10:19:22,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-21 10:19:22,665 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2020-09-21 10:19:22,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:22,666 INFO L225 Difference]: With dead ends: 38 [2020-09-21 10:19:22,667 INFO L226 Difference]: Without dead ends: 23 [2020-09-21 10:19:22,668 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-09-21 10:19:22,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-09-21 10:19:22,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-09-21 10:19:22,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-09-21 10:19:22,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-09-21 10:19:22,678 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-09-21 10:19:22,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:22,678 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-09-21 10:19:22,678 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 10:19:22,679 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-09-21 10:19:22,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-09-21 10:19:22,680 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:22,681 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:22,681 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-21 10:19:22,681 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:22,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:22,683 INFO L82 PathProgramCache]: Analyzing trace with hash -983862936, now seen corresponding path program 1 times [2020-09-21 10:19:22,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:22,683 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [585515205] [2020-09-21 10:19:22,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:22,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:22,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:22,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:22,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:22,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:22,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:22,835 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-09-21 10:19:22,839 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [585515205] [2020-09-21 10:19:22,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:22,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-21 10:19:22,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768798694] [2020-09-21 10:19:22,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-21 10:19:22,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:22,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-21 10:19:22,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-21 10:19:22,845 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-09-21 10:19:22,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:22,987 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-09-21 10:19:22,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-21 10:19:22,987 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-09-21 10:19:22,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:22,990 INFO L225 Difference]: With dead ends: 41 [2020-09-21 10:19:22,990 INFO L226 Difference]: Without dead ends: 37 [2020-09-21 10:19:22,991 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-09-21 10:19:22,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-09-21 10:19:23,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-09-21 10:19:23,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-09-21 10:19:23,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-09-21 10:19:23,004 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-09-21 10:19:23,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:23,004 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-09-21 10:19:23,004 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-21 10:19:23,005 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-09-21 10:19:23,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-09-21 10:19:23,007 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:23,007 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:23,007 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-21 10:19:23,008 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:23,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:23,008 INFO L82 PathProgramCache]: Analyzing trace with hash 146085807, now seen corresponding path program 2 times [2020-09-21 10:19:23,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:23,009 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [544894602] [2020-09-21 10:19:23,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:23,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:23,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:23,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:23,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:23,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:23,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:23,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:23,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:23,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:19:23,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:23,282 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-09-21 10:19:23,283 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [544894602] [2020-09-21 10:19:23,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:23,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-21 10:19:23,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101754714] [2020-09-21 10:19:23,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-21 10:19:23,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:23,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-21 10:19:23,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-21 10:19:23,285 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 8 states. [2020-09-21 10:19:23,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:23,458 INFO L93 Difference]: Finished difference Result 79 states and 124 transitions. [2020-09-21 10:19:23,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-21 10:19:23,459 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-09-21 10:19:23,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:23,462 INFO L225 Difference]: With dead ends: 79 [2020-09-21 10:19:23,462 INFO L226 Difference]: Without dead ends: 48 [2020-09-21 10:19:23,463 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-09-21 10:19:23,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-09-21 10:19:23,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2020-09-21 10:19:23,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-09-21 10:19:23,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2020-09-21 10:19:23,476 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 57 transitions. Word has length 40 [2020-09-21 10:19:23,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:23,477 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 57 transitions. [2020-09-21 10:19:23,477 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-21 10:19:23,477 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2020-09-21 10:19:23,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-09-21 10:19:23,479 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:23,480 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:23,480 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-21 10:19:23,480 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:23,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:23,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1111873851, now seen corresponding path program 3 times [2020-09-21 10:19:23,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:23,481 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2111600771] [2020-09-21 10:19:23,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:23,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:23,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:23,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:23,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:23,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:23,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:23,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:23,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:23,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:19:23,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:23,617 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-09-21 10:19:23,618 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2111600771] [2020-09-21 10:19:23,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:23,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-21 10:19:23,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061663975] [2020-09-21 10:19:23,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 10:19:23,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:23,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 10:19:23,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-21 10:19:23,621 INFO L87 Difference]: Start difference. First operand 42 states and 57 transitions. Second operand 7 states. [2020-09-21 10:19:23,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:23,741 INFO L93 Difference]: Finished difference Result 65 states and 93 transitions. [2020-09-21 10:19:23,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-21 10:19:23,742 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-09-21 10:19:23,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:23,744 INFO L225 Difference]: With dead ends: 65 [2020-09-21 10:19:23,744 INFO L226 Difference]: Without dead ends: 61 [2020-09-21 10:19:23,745 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-09-21 10:19:23,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-09-21 10:19:23,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2020-09-21 10:19:23,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-09-21 10:19:23,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 84 transitions. [2020-09-21 10:19:23,763 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 84 transitions. Word has length 41 [2020-09-21 10:19:23,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:23,764 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 84 transitions. [2020-09-21 10:19:23,764 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 10:19:23,764 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 84 transitions. [2020-09-21 10:19:23,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-09-21 10:19:23,768 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:23,768 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:23,768 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-21 10:19:23,769 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:23,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:23,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1986920854, now seen corresponding path program 4 times [2020-09-21 10:19:23,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:23,770 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [577809126] [2020-09-21 10:19:23,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:23,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:23,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:23,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:23,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:23,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:23,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:23,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:23,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:23,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:23,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:23,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:23,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:19:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:23,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:19:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:23,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:24,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:24,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:24,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:24,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:24,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:19:24,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:24,106 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 77 proven. 104 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-09-21 10:19:24,106 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [577809126] [2020-09-21 10:19:24,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:24,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-21 10:19:24,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363603993] [2020-09-21 10:19:24,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-21 10:19:24,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:24,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-21 10:19:24,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-09-21 10:19:24,109 INFO L87 Difference]: Start difference. First operand 58 states and 84 transitions. Second operand 11 states. [2020-09-21 10:19:24,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:24,459 INFO L93 Difference]: Finished difference Result 107 states and 178 transitions. [2020-09-21 10:19:24,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-21 10:19:24,460 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 82 [2020-09-21 10:19:24,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:24,463 INFO L225 Difference]: With dead ends: 107 [2020-09-21 10:19:24,463 INFO L226 Difference]: Without dead ends: 57 [2020-09-21 10:19:24,466 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2020-09-21 10:19:24,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-09-21 10:19:24,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2020-09-21 10:19:24,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-09-21 10:19:24,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2020-09-21 10:19:24,477 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 82 [2020-09-21 10:19:24,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:24,478 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 70 transitions. [2020-09-21 10:19:24,478 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-21 10:19:24,478 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2020-09-21 10:19:24,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-09-21 10:19:24,480 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:24,481 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:24,481 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-21 10:19:24,481 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:24,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:24,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1040445716, now seen corresponding path program 5 times [2020-09-21 10:19:24,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:24,482 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [704958401] [2020-09-21 10:19:24,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:24,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:24,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:24,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:24,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:24,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:24,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:24,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:24,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:24,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:24,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:24,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:24,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:24,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:19:24,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:24,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:19:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:24,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:24,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:24,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:24,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:24,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-21 10:19:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:24,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:24,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:24,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:24,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:24,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:24,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:24,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:19:24,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:24,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:19:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:24,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:24,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:25,023 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 193 proven. 313 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2020-09-21 10:19:25,023 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [704958401] [2020-09-21 10:19:25,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:25,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-09-21 10:19:25,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329539505] [2020-09-21 10:19:25,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-21 10:19:25,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:25,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-21 10:19:25,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-09-21 10:19:25,028 INFO L87 Difference]: Start difference. First operand 54 states and 70 transitions. Second operand 13 states. [2020-09-21 10:19:25,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:25,627 INFO L93 Difference]: Finished difference Result 115 states and 189 transitions. [2020-09-21 10:19:25,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-21 10:19:25,628 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 136 [2020-09-21 10:19:25,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:25,634 INFO L225 Difference]: With dead ends: 115 [2020-09-21 10:19:25,634 INFO L226 Difference]: Without dead ends: 74 [2020-09-21 10:19:25,637 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2020-09-21 10:19:25,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-09-21 10:19:25,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2020-09-21 10:19:25,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-09-21 10:19:25,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 92 transitions. [2020-09-21 10:19:25,662 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 92 transitions. Word has length 136 [2020-09-21 10:19:25,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:25,664 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 92 transitions. [2020-09-21 10:19:25,664 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-21 10:19:25,665 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 92 transitions. [2020-09-21 10:19:25,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-09-21 10:19:25,675 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:25,676 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:25,676 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-21 10:19:25,676 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:25,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:25,677 INFO L82 PathProgramCache]: Analyzing trace with hash 259499213, now seen corresponding path program 6 times [2020-09-21 10:19:25,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:25,678 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1819073185] [2020-09-21 10:19:25,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:25,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:25,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:25,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:25,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:25,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:26,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:26,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:26,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:26,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:26,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:26,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:26,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:26,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:26,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:19:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:26,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:19:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:26,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:26,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:26,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:26,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-21 10:19:26,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:26,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:26,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:26,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:26,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:26,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:26,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:19:26,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:26,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-21 10:19:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:26,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:26,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:26,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:26,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:26,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:19:26,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:26,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:19:26,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:26,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:26,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:26,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:26,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:26,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2020-09-21 10:19:26,367 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1819073185] [2020-09-21 10:19:26,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:26,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-21 10:19:26,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844536709] [2020-09-21 10:19:26,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-21 10:19:26,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:26,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-21 10:19:26,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-09-21 10:19:26,378 INFO L87 Difference]: Start difference. First operand 70 states and 92 transitions. Second operand 10 states. [2020-09-21 10:19:26,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:26,621 INFO L93 Difference]: Finished difference Result 186 states and 273 transitions. [2020-09-21 10:19:26,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-21 10:19:26,622 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-09-21 10:19:26,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:26,626 INFO L225 Difference]: With dead ends: 186 [2020-09-21 10:19:26,627 INFO L226 Difference]: Without dead ends: 182 [2020-09-21 10:19:26,628 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-09-21 10:19:26,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2020-09-21 10:19:26,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 170. [2020-09-21 10:19:26,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-09-21 10:19:26,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 250 transitions. [2020-09-21 10:19:26,653 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 250 transitions. Word has length 177 [2020-09-21 10:19:26,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:26,653 INFO L479 AbstractCegarLoop]: Abstraction has 170 states and 250 transitions. [2020-09-21 10:19:26,654 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-21 10:19:26,654 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 250 transitions. [2020-09-21 10:19:26,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2020-09-21 10:19:26,659 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:26,660 INFO L422 BasicCegarLoop]: trace histogram [47, 47, 38, 23, 23, 23, 23, 23, 23, 23, 15, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:26,660 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-21 10:19:26,660 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:26,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:26,661 INFO L82 PathProgramCache]: Analyzing trace with hash -530192014, now seen corresponding path program 7 times [2020-09-21 10:19:26,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:26,662 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [232140356] [2020-09-21 10:19:26,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:26,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:26,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:26,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:26,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:27,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:27,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:27,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:19:27,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:19:27,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:27,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:27,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-21 10:19:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:19:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-21 10:19:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:27,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:27,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:19:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:19:27,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:27,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:27,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-09-21 10:19:27,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:27,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:27,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:27,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:27,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:19:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:19:27,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:27,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-21 10:19:27,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:27,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:19:27,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-21 10:19:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:27,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:27,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:19:27,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:28,079 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 1358 proven. 1342 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2020-09-21 10:19:28,079 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [232140356] [2020-09-21 10:19:28,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:28,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-09-21 10:19:28,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805979160] [2020-09-21 10:19:28,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-21 10:19:28,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:28,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-21 10:19:28,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2020-09-21 10:19:28,082 INFO L87 Difference]: Start difference. First operand 170 states and 250 transitions. Second operand 17 states. [2020-09-21 10:19:28,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:28,966 INFO L93 Difference]: Finished difference Result 281 states and 495 transitions. [2020-09-21 10:19:28,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-09-21 10:19:28,967 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 327 [2020-09-21 10:19:28,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:28,971 INFO L225 Difference]: With dead ends: 281 [2020-09-21 10:19:28,971 INFO L226 Difference]: Without dead ends: 125 [2020-09-21 10:19:28,976 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=320, Invalid=1240, Unknown=0, NotChecked=0, Total=1560 [2020-09-21 10:19:28,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-09-21 10:19:29,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 101. [2020-09-21 10:19:29,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-09-21 10:19:29,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 141 transitions. [2020-09-21 10:19:29,013 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 141 transitions. Word has length 327 [2020-09-21 10:19:29,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:29,015 INFO L479 AbstractCegarLoop]: Abstraction has 101 states and 141 transitions. [2020-09-21 10:19:29,016 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-21 10:19:29,016 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 141 transitions. [2020-09-21 10:19:29,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-09-21 10:19:29,025 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:29,025 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:29,025 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-21 10:19:29,026 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:29,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:29,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1425621089, now seen corresponding path program 8 times [2020-09-21 10:19:29,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:29,027 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [284164596] [2020-09-21 10:19:29,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:29,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-21 10:19:29,132 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-21 10:19:29,133 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-21 10:19:29,142 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-21 10:19:29,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 10:19:29 BoogieIcfgContainer [2020-09-21 10:19:29,203 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-21 10:19:29,208 INFO L168 Benchmark]: Toolchain (without parser) took 8419.78 ms. Allocated memory was 140.0 MB in the beginning and 354.9 MB in the end (delta: 215.0 MB). Free memory was 103.4 MB in the beginning and 292.5 MB in the end (delta: -189.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2020-09-21 10:19:29,209 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-21 10:19:29,210 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.89 ms. Allocated memory is still 140.0 MB. Free memory was 102.7 MB in the beginning and 93.6 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2020-09-21 10:19:29,214 INFO L168 Benchmark]: Boogie Preprocessor took 117.57 ms. Allocated memory was 140.0 MB in the beginning and 202.4 MB in the end (delta: 62.4 MB). Free memory was 93.6 MB in the beginning and 181.5 MB in the end (delta: -87.9 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. [2020-09-21 10:19:29,217 INFO L168 Benchmark]: RCFGBuilder took 287.91 ms. Allocated memory is still 202.4 MB. Free memory was 181.5 MB in the beginning and 169.4 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. [2020-09-21 10:19:29,218 INFO L168 Benchmark]: TraceAbstraction took 7695.36 ms. Allocated memory was 202.4 MB in the beginning and 354.9 MB in the end (delta: 152.6 MB). Free memory was 168.7 MB in the beginning and 292.5 MB in the end (delta: -123.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 7.1 GB. [2020-09-21 10:19:29,229 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 308.89 ms. Allocated memory is still 140.0 MB. Free memory was 102.7 MB in the beginning and 93.6 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 117.57 ms. Allocated memory was 140.0 MB in the beginning and 202.4 MB in the end (delta: 62.4 MB). Free memory was 93.6 MB in the beginning and 181.5 MB in the end (delta: -87.9 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 287.91 ms. Allocated memory is still 202.4 MB. Free memory was 181.5 MB in the beginning and 169.4 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7695.36 ms. Allocated memory was 202.4 MB in the beginning and 354.9 MB in the end (delta: 152.6 MB). Free memory was 168.7 MB in the beginning and 292.5 MB in the end (delta: -123.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 27]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L24] int x = 7; [L25] CALL, EXPR fibo(x) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L25] RET, EXPR fibo(x) [L25] int result = fibo(x); [L26] COND TRUE result == 13 [L27] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7.4s, OverallIterations: 11, TraceHistogramMax: 47, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 212 SDtfs, 486 SDslu, 631 SDs, 0 SdLazy, 1130 SolverSat, 454 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 426 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=170occurred in iteration=9, 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, 10 MinimizatonAttempts, 54 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1169 NumberOfCodeBlocks, 1169 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 873 ConstructedInterpolants, 0 QuantifiedInterpolants, 275931 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 6712/9044 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! Received shutdown request...