/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.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_5-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 21:53:38,848 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 21:53:38,853 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 21:53:38,893 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 21:53:38,893 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 21:53:38,905 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 21:53:38,907 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 21:53:38,912 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 21:53:38,915 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 21:53:38,918 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 21:53:38,919 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 21:53:38,921 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 21:53:38,921 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 21:53:38,924 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 21:53:38,927 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 21:53:38,929 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 21:53:38,931 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 21:53:38,932 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 21:53:38,934 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 21:53:38,942 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 21:53:38,945 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 21:53:38,946 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 21:53:38,948 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 21:53:38,948 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 21:53:38,953 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 21:53:38,953 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 21:53:38,954 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 21:53:38,957 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 21:53:38,957 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 21:53:38,960 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 21:53:38,960 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 21:53:38,961 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 21:53:38,961 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 21:53:38,962 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 21:53:38,964 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 21:53:38,964 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 21:53:38,965 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 21:53:38,965 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 21:53:38,965 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 21:53:38,966 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 21:53:38,968 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 21:53:38,969 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 21:53:38,988 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 21:53:38,989 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 21:53:38,991 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 21:53:38,991 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 21:53:38,991 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 21:53:38,992 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 21:53:38,992 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 21:53:38,992 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 21:53:38,993 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 21:53:38,993 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 21:53:38,994 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 21:53:38,994 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 21:53:38,994 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 21:53:38,994 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 21:53:38,995 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 21:53:38,995 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 21:53:38,995 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 21:53:38,996 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 21:53:38,996 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 21:53:38,996 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 21:53:38,996 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 21:53:38,996 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 21:53:38,997 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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: Use separate solver for trace checks -> true [2020-09-04 21:53:39,424 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 21:53:39,450 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 21:53:39,457 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 21:53:39,460 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 21:53:39,460 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 21:53:39,462 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_5-2.c [2020-09-04 21:53:39,541 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/398ac10e1/e4260122771a498c92f03e8554f76d59/FLAG1fefb65cd [2020-09-04 21:53:40,106 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 21:53:40,107 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/fibo_2calls_5-2.c [2020-09-04 21:53:40,117 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/398ac10e1/e4260122771a498c92f03e8554f76d59/FLAG1fefb65cd [2020-09-04 21:53:40,470 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/398ac10e1/e4260122771a498c92f03e8554f76d59 [2020-09-04 21:53:40,488 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 21:53:40,492 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 21:53:40,494 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 21:53:40,494 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 21:53:40,499 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 21:53:40,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:53:40" (1/1) ... [2020-09-04 21:53:40,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15ad6291 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:53:40, skipping insertion in model container [2020-09-04 21:53:40,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:53:40" (1/1) ... [2020-09-04 21:53:40,512 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 21:53:40,534 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 21:53:40,745 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:53:40,751 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 21:53:40,770 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:53:40,786 INFO L208 MainTranslator]: Completed translation [2020-09-04 21:53:40,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:53:40 WrapperNode [2020-09-04 21:53:40,787 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 21:53:40,788 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 21:53:40,788 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 21:53:40,788 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 21:53:40,802 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:53:40" (1/1) ... [2020-09-04 21:53:40,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:53:40" (1/1) ... [2020-09-04 21:53:40,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:53:40" (1/1) ... [2020-09-04 21:53:40,898 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:53:40" (1/1) ... [2020-09-04 21:53:40,903 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:53:40" (1/1) ... [2020-09-04 21:53:40,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:53:40" (1/1) ... [2020-09-04 21:53:40,907 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:53:40" (1/1) ... [2020-09-04 21:53:40,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 21:53:40,910 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 21:53:40,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 21:53:40,910 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 21:53:40,911 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:53:40" (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-04 21:53:40,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 21:53:40,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 21:53:40,992 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-09-04 21:53:40,992 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-09-04 21:53:40,992 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 21:53:40,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 21:53:40,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 21:53:40,992 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-09-04 21:53:40,992 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-09-04 21:53:40,993 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 21:53:40,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 21:53:40,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 21:53:41,254 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 21:53:41,255 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 21:53:41,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:53:41 BoogieIcfgContainer [2020-09-04 21:53:41,261 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 21:53:41,263 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 21:53:41,263 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 21:53:41,267 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 21:53:41,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 09:53:40" (1/3) ... [2020-09-04 21:53:41,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e0ef814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:53:41, skipping insertion in model container [2020-09-04 21:53:41,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:53:40" (2/3) ... [2020-09-04 21:53:41,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e0ef814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:53:41, skipping insertion in model container [2020-09-04 21:53:41,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:53:41" (3/3) ... [2020-09-04 21:53:41,272 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_5-2.c [2020-09-04 21:53:41,287 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 21:53:41,300 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 21:53:41,357 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 21:53:41,403 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 21:53:41,403 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 21:53:41,404 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 21:53:41,404 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 21:53:41,404 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 21:53:41,404 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 21:53:41,404 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 21:53:41,404 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 21:53:41,426 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2020-09-04 21:53:41,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-04 21:53:41,438 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:41,439 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:41,440 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:41,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:41,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1089710179, now seen corresponding path program 1 times [2020-09-04 21:53:41,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:41,457 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [864044717] [2020-09-04 21:53:41,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:41,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:41,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:41,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:41,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:41,735 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-04 21:53:41,736 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [864044717] [2020-09-04 21:53:41,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:53:41,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 21:53:41,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104004377] [2020-09-04 21:53:41,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 21:53:41,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:41,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 21:53:41,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:53:41,764 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 5 states. [2020-09-04 21:53:41,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:41,912 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2020-09-04 21:53:41,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 21:53:41,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-09-04 21:53:41,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:41,929 INFO L225 Difference]: With dead ends: 58 [2020-09-04 21:53:41,930 INFO L226 Difference]: Without dead ends: 42 [2020-09-04 21:53:41,934 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-04 21:53:41,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-09-04 21:53:41,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-09-04 21:53:41,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-09-04 21:53:41,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-09-04 21:53:42,002 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 16 [2020-09-04 21:53:42,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:42,002 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-09-04 21:53:42,003 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 21:53:42,003 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-09-04 21:53:42,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-09-04 21:53:42,006 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:42,006 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:42,006 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 21:53:42,007 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:42,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:42,007 INFO L82 PathProgramCache]: Analyzing trace with hash -653728005, now seen corresponding path program 1 times [2020-09-04 21:53:42,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:42,008 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1861784999] [2020-09-04 21:53:42,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:42,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:42,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:42,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:42,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:42,082 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-04 21:53:42,083 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1861784999] [2020-09-04 21:53:42,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:53:42,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 21:53:42,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409545747] [2020-09-04 21:53:42,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 21:53:42,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:42,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 21:53:42,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:53:42,087 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 5 states. [2020-09-04 21:53:42,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:42,167 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2020-09-04 21:53:42,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 21:53:42,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-09-04 21:53:42,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:42,170 INFO L225 Difference]: With dead ends: 50 [2020-09-04 21:53:42,170 INFO L226 Difference]: Without dead ends: 44 [2020-09-04 21:53:42,171 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-04 21:53:42,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-09-04 21:53:42,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-09-04 21:53:42,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-09-04 21:53:42,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-09-04 21:53:42,186 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 17 [2020-09-04 21:53:42,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:42,186 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-09-04 21:53:42,187 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 21:53:42,187 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-09-04 21:53:42,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-09-04 21:53:42,189 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:42,189 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:42,189 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 21:53:42,190 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:42,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:42,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1617834856, now seen corresponding path program 1 times [2020-09-04 21:53:42,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:42,191 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2004241733] [2020-09-04 21:53:42,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:42,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:42,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:42,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:42,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:42,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:42,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:42,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 21:53:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:42,332 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 21:53:42,332 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2004241733] [2020-09-04 21:53:42,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:42,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-04 21:53:42,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658219965] [2020-09-04 21:53:42,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 21:53:42,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:42,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 21:53:42,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:53:42,335 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 7 states. [2020-09-04 21:53:42,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:42,436 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2020-09-04 21:53:42,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 21:53:42,437 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-09-04 21:53:42,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:42,439 INFO L225 Difference]: With dead ends: 82 [2020-09-04 21:53:42,439 INFO L226 Difference]: Without dead ends: 46 [2020-09-04 21:53:42,441 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:53:42,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-09-04 21:53:42,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2020-09-04 21:53:42,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-09-04 21:53:42,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2020-09-04 21:53:42,456 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 33 [2020-09-04 21:53:42,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:42,457 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2020-09-04 21:53:42,457 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 21:53:42,458 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2020-09-04 21:53:42,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-09-04 21:53:42,460 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:42,460 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:42,460 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 21:53:42,461 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:42,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:42,461 INFO L82 PathProgramCache]: Analyzing trace with hash 887160861, now seen corresponding path program 1 times [2020-09-04 21:53:42,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:42,462 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [332276360] [2020-09-04 21:53:42,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:42,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:42,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:42,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:42,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:42,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:42,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:42,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:42,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:42,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:42,643 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 21:53:42,644 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [332276360] [2020-09-04 21:53:42,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:42,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-04 21:53:42,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713580732] [2020-09-04 21:53:42,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 21:53:42,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:42,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 21:53:42,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:53:42,647 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 7 states. [2020-09-04 21:53:42,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:42,839 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2020-09-04 21:53:42,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 21:53:42,840 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2020-09-04 21:53:42,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:42,843 INFO L225 Difference]: With dead ends: 74 [2020-09-04 21:53:42,843 INFO L226 Difference]: Without dead ends: 68 [2020-09-04 21:53:42,844 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-09-04 21:53:42,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-09-04 21:53:42,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2020-09-04 21:53:42,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-09-04 21:53:42,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2020-09-04 21:53:42,865 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 34 [2020-09-04 21:53:42,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:42,868 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2020-09-04 21:53:42,869 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 21:53:42,869 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2020-09-04 21:53:42,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-09-04 21:53:42,873 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:42,873 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:42,876 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 21:53:42,877 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:42,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:42,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1875452576, now seen corresponding path program 1 times [2020-09-04 21:53:42,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:42,878 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1056480029] [2020-09-04 21:53:42,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:42,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:42,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:42,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:42,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:42,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:43,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:43,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 21:53:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:43,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 21:53:43,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:43,060 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-04 21:53:43,061 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1056480029] [2020-09-04 21:53:43,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:43,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-04 21:53:43,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791306248] [2020-09-04 21:53:43,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 21:53:43,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:43,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 21:53:43,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:53:43,063 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand 6 states. [2020-09-04 21:53:43,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:43,156 INFO L93 Difference]: Finished difference Result 130 states and 178 transitions. [2020-09-04 21:53:43,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 21:53:43,156 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2020-09-04 21:53:43,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:43,159 INFO L225 Difference]: With dead ends: 130 [2020-09-04 21:53:43,159 INFO L226 Difference]: Without dead ends: 70 [2020-09-04 21:53:43,161 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:53:43,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-09-04 21:53:43,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-09-04 21:53:43,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-09-04 21:53:43,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2020-09-04 21:53:43,178 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 50 [2020-09-04 21:53:43,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:43,178 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2020-09-04 21:53:43,179 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 21:53:43,179 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2020-09-04 21:53:43,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-09-04 21:53:43,181 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:43,182 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:43,182 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 21:53:43,187 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:43,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:43,187 INFO L82 PathProgramCache]: Analyzing trace with hash 104828256, now seen corresponding path program 1 times [2020-09-04 21:53:43,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:43,188 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1025972387] [2020-09-04 21:53:43,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:43,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:43,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:43,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:43,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:43,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:43,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:43,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:43,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:43,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:43,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:43,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:43,401 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-09-04 21:53:43,402 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1025972387] [2020-09-04 21:53:43,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:43,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-04 21:53:43,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751766260] [2020-09-04 21:53:43,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 21:53:43,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:43,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 21:53:43,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:53:43,405 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand 8 states. [2020-09-04 21:53:43,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:43,533 INFO L93 Difference]: Finished difference Result 142 states and 197 transitions. [2020-09-04 21:53:43,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 21:53:43,534 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-09-04 21:53:43,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:43,536 INFO L225 Difference]: With dead ends: 142 [2020-09-04 21:53:43,537 INFO L226 Difference]: Without dead ends: 78 [2020-09-04 21:53:43,538 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:53:43,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-09-04 21:53:43,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2020-09-04 21:53:43,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-09-04 21:53:43,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2020-09-04 21:53:43,557 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 51 [2020-09-04 21:53:43,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:43,557 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2020-09-04 21:53:43,558 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 21:53:43,558 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2020-09-04 21:53:43,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-09-04 21:53:43,560 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:43,560 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:43,561 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 21:53:43,561 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:43,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:43,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1703786405, now seen corresponding path program 1 times [2020-09-04 21:53:43,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:43,562 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [560172152] [2020-09-04 21:53:43,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:43,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:43,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:43,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:43,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:43,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:43,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:43,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:43,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:43,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:43,692 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-04 21:53:43,693 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [560172152] [2020-09-04 21:53:43,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:43,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-04 21:53:43,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124938662] [2020-09-04 21:53:43,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 21:53:43,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:43,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 21:53:43,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:53:43,696 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand 8 states. [2020-09-04 21:53:43,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:43,884 INFO L93 Difference]: Finished difference Result 118 states and 158 transitions. [2020-09-04 21:53:43,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 21:53:43,885 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2020-09-04 21:53:43,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:43,889 INFO L225 Difference]: With dead ends: 118 [2020-09-04 21:53:43,889 INFO L226 Difference]: Without dead ends: 112 [2020-09-04 21:53:43,890 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-09-04 21:53:43,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-09-04 21:53:43,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2020-09-04 21:53:43,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-09-04 21:53:43,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 145 transitions. [2020-09-04 21:53:43,935 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 145 transitions. Word has length 52 [2020-09-04 21:53:43,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:43,936 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 145 transitions. [2020-09-04 21:53:43,936 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 21:53:43,936 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 145 transitions. [2020-09-04 21:53:43,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-09-04 21:53:43,941 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:43,941 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:43,941 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 21:53:43,942 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:43,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:43,942 INFO L82 PathProgramCache]: Analyzing trace with hash -521446491, now seen corresponding path program 1 times [2020-09-04 21:53:43,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:43,943 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1065467879] [2020-09-04 21:53:43,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:43,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:43,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:43,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:43,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:44,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:44,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:44,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:44,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:44,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:44,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:44,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-04 21:53:44,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:44,162 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-09-04 21:53:44,162 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1065467879] [2020-09-04 21:53:44,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:44,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-04 21:53:44,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128166849] [2020-09-04 21:53:44,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 21:53:44,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:44,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 21:53:44,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:53:44,166 INFO L87 Difference]: Start difference. First operand 106 states and 145 transitions. Second operand 8 states. [2020-09-04 21:53:44,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:44,315 INFO L93 Difference]: Finished difference Result 227 states and 348 transitions. [2020-09-04 21:53:44,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 21:53:44,316 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2020-09-04 21:53:44,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:44,318 INFO L225 Difference]: With dead ends: 227 [2020-09-04 21:53:44,318 INFO L226 Difference]: Without dead ends: 127 [2020-09-04 21:53:44,320 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:53:44,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-09-04 21:53:44,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2020-09-04 21:53:44,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-09-04 21:53:44,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 161 transitions. [2020-09-04 21:53:44,342 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 161 transitions. Word has length 69 [2020-09-04 21:53:44,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:44,343 INFO L479 AbstractCegarLoop]: Abstraction has 115 states and 161 transitions. [2020-09-04 21:53:44,343 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 21:53:44,343 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 161 transitions. [2020-09-04 21:53:44,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-09-04 21:53:44,345 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:44,345 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:44,345 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 21:53:44,345 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:44,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:44,346 INFO L82 PathProgramCache]: Analyzing trace with hash -439633211, now seen corresponding path program 1 times [2020-09-04 21:53:44,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:44,346 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [131038439] [2020-09-04 21:53:44,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:44,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:44,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:44,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:44,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:44,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:44,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:44,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:44,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:44,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:53:44,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:44,541 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-09-04 21:53:44,542 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [131038439] [2020-09-04 21:53:44,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:44,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 21:53:44,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171766725] [2020-09-04 21:53:44,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 21:53:44,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:44,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 21:53:44,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:53:44,544 INFO L87 Difference]: Start difference. First operand 115 states and 161 transitions. Second operand 10 states. [2020-09-04 21:53:44,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:44,788 INFO L93 Difference]: Finished difference Result 257 states and 400 transitions. [2020-09-04 21:53:44,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 21:53:44,789 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2020-09-04 21:53:44,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:44,792 INFO L225 Difference]: With dead ends: 257 [2020-09-04 21:53:44,792 INFO L226 Difference]: Without dead ends: 151 [2020-09-04 21:53:44,794 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-09-04 21:53:44,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-09-04 21:53:44,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 133. [2020-09-04 21:53:44,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-09-04 21:53:44,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 191 transitions. [2020-09-04 21:53:44,819 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 191 transitions. Word has length 70 [2020-09-04 21:53:44,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:44,819 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 191 transitions. [2020-09-04 21:53:44,819 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 21:53:44,819 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 191 transitions. [2020-09-04 21:53:44,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-09-04 21:53:44,822 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:44,822 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:44,823 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 21:53:44,823 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:44,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:44,823 INFO L82 PathProgramCache]: Analyzing trace with hash 307755032, now seen corresponding path program 2 times [2020-09-04 21:53:44,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:44,824 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1365992048] [2020-09-04 21:53:44,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:44,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:44,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:44,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:44,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:44,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:44,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:44,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:44,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:44,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:44,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:44,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:44,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:44,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:53:44,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:45,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:45,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:45,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:45,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:45,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:45,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:45,088 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 36 proven. 59 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2020-09-04 21:53:45,089 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1365992048] [2020-09-04 21:53:45,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:45,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-04 21:53:45,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924023220] [2020-09-04 21:53:45,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 21:53:45,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:45,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 21:53:45,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-09-04 21:53:45,092 INFO L87 Difference]: Start difference. First operand 133 states and 191 transitions. Second operand 12 states. [2020-09-04 21:53:45,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:45,542 INFO L93 Difference]: Finished difference Result 265 states and 420 transitions. [2020-09-04 21:53:45,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 21:53:45,542 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2020-09-04 21:53:45,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:45,546 INFO L225 Difference]: With dead ends: 265 [2020-09-04 21:53:45,546 INFO L226 Difference]: Without dead ends: 116 [2020-09-04 21:53:45,548 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-09-04 21:53:45,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-09-04 21:53:45,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 95. [2020-09-04 21:53:45,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-09-04 21:53:45,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 117 transitions. [2020-09-04 21:53:45,563 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 117 transitions. Word has length 105 [2020-09-04 21:53:45,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:45,564 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 117 transitions. [2020-09-04 21:53:45,564 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 21:53:45,564 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2020-09-04 21:53:45,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-09-04 21:53:45,566 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:45,566 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:45,566 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 21:53:45,566 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:45,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:45,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1534580400, now seen corresponding path program 1 times [2020-09-04 21:53:45,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:45,567 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [270417835] [2020-09-04 21:53:45,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:45,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:45,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:45,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:45,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:45,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:45,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:45,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:45,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:45,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:45,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:45,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:45,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:45,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:45,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:53:45,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:45,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 21:53:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:45,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:45,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:45,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:45,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:45,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:45,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:45,814 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 50 proven. 67 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2020-09-04 21:53:45,815 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [270417835] [2020-09-04 21:53:45,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:45,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 21:53:45,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508854045] [2020-09-04 21:53:45,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 21:53:45,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:45,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 21:53:45,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:53:45,817 INFO L87 Difference]: Start difference. First operand 95 states and 117 transitions. Second operand 10 states. [2020-09-04 21:53:46,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:46,054 INFO L93 Difference]: Finished difference Result 193 states and 255 transitions. [2020-09-04 21:53:46,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 21:53:46,055 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 123 [2020-09-04 21:53:46,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:46,057 INFO L225 Difference]: With dead ends: 193 [2020-09-04 21:53:46,057 INFO L226 Difference]: Without dead ends: 105 [2020-09-04 21:53:46,060 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-09-04 21:53:46,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-09-04 21:53:46,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2020-09-04 21:53:46,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-09-04 21:53:46,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 127 transitions. [2020-09-04 21:53:46,073 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 127 transitions. Word has length 123 [2020-09-04 21:53:46,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:46,074 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 127 transitions. [2020-09-04 21:53:46,075 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 21:53:46,075 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 127 transitions. [2020-09-04 21:53:46,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-09-04 21:53:46,076 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:46,077 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:46,077 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 21:53:46,077 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:46,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:46,078 INFO L82 PathProgramCache]: Analyzing trace with hash 822116120, now seen corresponding path program 2 times [2020-09-04 21:53:46,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:46,078 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1413377593] [2020-09-04 21:53:46,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:46,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:46,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:46,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:46,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:46,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:46,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:46,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:46,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:46,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:46,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:46,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:53:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:46,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:46,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:46,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:46,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:46,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:46,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:46,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:46,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-09-04 21:53:46,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:46,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:46,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:46,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:46,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:46,388 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 72 proven. 111 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2020-09-04 21:53:46,388 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1413377593] [2020-09-04 21:53:46,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:46,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-04 21:53:46,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457168304] [2020-09-04 21:53:46,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 21:53:46,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:46,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 21:53:46,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-09-04 21:53:46,391 INFO L87 Difference]: Start difference. First operand 105 states and 127 transitions. Second operand 12 states. [2020-09-04 21:53:46,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:46,859 INFO L93 Difference]: Finished difference Result 241 states and 326 transitions. [2020-09-04 21:53:46,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 21:53:46,859 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 140 [2020-09-04 21:53:46,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:46,862 INFO L225 Difference]: With dead ends: 241 [2020-09-04 21:53:46,862 INFO L226 Difference]: Without dead ends: 141 [2020-09-04 21:53:46,863 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-09-04 21:53:46,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-09-04 21:53:46,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 123. [2020-09-04 21:53:46,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-09-04 21:53:46,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 149 transitions. [2020-09-04 21:53:46,879 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 149 transitions. Word has length 140 [2020-09-04 21:53:46,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:46,880 INFO L479 AbstractCegarLoop]: Abstraction has 123 states and 149 transitions. [2020-09-04 21:53:46,880 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 21:53:46,880 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 149 transitions. [2020-09-04 21:53:46,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-09-04 21:53:46,882 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:46,882 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:46,882 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 21:53:46,883 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:46,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:46,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1260071360, now seen corresponding path program 2 times [2020-09-04 21:53:46,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:46,884 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1348949736] [2020-09-04 21:53:46,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 21:53:46,905 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 21:53:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 21:53:46,926 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 21:53:46,960 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-04 21:53:46,960 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 21:53:46,960 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 21:53:47,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 09:53:47 BoogieIcfgContainer [2020-09-04 21:53:47,024 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 21:53:47,027 INFO L168 Benchmark]: Toolchain (without parser) took 6534.08 ms. Allocated memory was 140.0 MB in the beginning and 307.2 MB in the end (delta: 167.2 MB). Free memory was 102.7 MB in the beginning and 198.4 MB in the end (delta: -95.7 MB). Peak memory consumption was 71.6 MB. Max. memory is 7.1 GB. [2020-09-04 21:53:47,027 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 140.0 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 21:53:47,028 INFO L168 Benchmark]: CACSL2BoogieTranslator took 293.37 ms. Allocated memory is still 140.0 MB. Free memory was 102.5 MB in the beginning and 93.0 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-09-04 21:53:47,031 INFO L168 Benchmark]: Boogie Preprocessor took 121.28 ms. Allocated memory was 140.0 MB in the beginning and 205.0 MB in the end (delta: 65.0 MB). Free memory was 93.0 MB in the beginning and 183.7 MB in the end (delta: -90.7 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2020-09-04 21:53:47,032 INFO L168 Benchmark]: RCFGBuilder took 352.11 ms. Allocated memory is still 205.0 MB. Free memory was 183.7 MB in the beginning and 169.5 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2020-09-04 21:53:47,033 INFO L168 Benchmark]: TraceAbstraction took 5760.53 ms. Allocated memory was 205.0 MB in the beginning and 307.2 MB in the end (delta: 102.2 MB). Free memory was 169.5 MB in the beginning and 198.4 MB in the end (delta: -28.9 MB). Peak memory consumption was 73.4 MB. Max. memory is 7.1 GB. [2020-09-04 21:53:47,042 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.30 ms. Allocated memory is still 140.0 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 293.37 ms. Allocated memory is still 140.0 MB. Free memory was 102.5 MB in the beginning and 93.0 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 121.28 ms. Allocated memory was 140.0 MB in the beginning and 205.0 MB in the end (delta: 65.0 MB). Free memory was 93.0 MB in the beginning and 183.7 MB in the end (delta: -90.7 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 352.11 ms. Allocated memory is still 205.0 MB. Free memory was 183.7 MB in the beginning and 169.5 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5760.53 ms. Allocated memory was 205.0 MB in the beginning and 307.2 MB in the end (delta: 102.2 MB). Free memory was 169.5 MB in the beginning and 198.4 MB in the end (delta: -28.9 MB). Peak memory consumption was 73.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 5; VAL [x=5] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); VAL [\old(n)=2, \result=1, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); VAL [\old(n)=3, \result=2, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); VAL [\old(n)=2, \result=1, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); VAL [\old(n)=4, \result=3, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); VAL [\old(n)=2, \result=1, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); VAL [\old(n)=3, \result=2, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); VAL [\old(n)=5, \result=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=5, x=5] [L37] int result = fibo1(x); VAL [fibo1(x)=5, result=5, x=5] [L38] COND TRUE result == 5 VAL [result=5, x=5] [L39] __VERIFIER_error() VAL [result=5, x=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.5s, OverallIterations: 13, TraceHistogramMax: 9, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 527 SDtfs, 548 SDslu, 2199 SDs, 0 SdLazy, 1530 SolverSat, 176 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 327 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred 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.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 87 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 900 NumberOfCodeBlocks, 900 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 748 ConstructedInterpolants, 0 QuantifiedInterpolants, 113046 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 548/825 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...