/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-72570d3 [2020-08-22 22:07:46,951 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 22:07:46,954 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 22:07:46,980 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 22:07:46,980 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 22:07:46,982 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 22:07:46,983 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 22:07:46,985 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 22:07:46,987 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 22:07:46,988 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 22:07:46,989 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 22:07:46,990 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 22:07:46,990 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 22:07:46,991 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 22:07:46,992 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 22:07:46,994 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 22:07:46,994 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 22:07:46,995 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 22:07:46,997 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 22:07:46,999 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 22:07:47,001 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 22:07:47,002 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 22:07:47,003 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 22:07:47,004 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 22:07:47,007 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 22:07:47,007 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 22:07:47,007 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 22:07:47,008 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 22:07:47,008 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 22:07:47,010 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 22:07:47,010 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 22:07:47,011 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 22:07:47,011 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 22:07:47,012 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 22:07:47,013 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 22:07:47,013 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 22:07:47,014 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 22:07:47,014 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 22:07:47,014 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 22:07:47,015 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 22:07:47,016 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 22:07:47,017 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-08-22 22:07:47,027 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 22:07:47,028 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 22:07:47,029 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 22:07:47,029 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 22:07:47,029 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 22:07:47,030 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 22:07:47,030 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 22:07:47,030 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 22:07:47,030 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 22:07:47,030 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 22:07:47,031 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 22:07:47,031 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 22:07:47,031 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 22:07:47,031 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 22:07:47,031 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 22:07:47,032 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-08-22 22:07:47,032 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 22:07:47,032 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 22:07:47,032 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 22:07:47,032 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 22:07:47,033 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-08-22 22:07:47,033 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 22:07:47,033 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-08-22 22:07:47,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 22:07:47,464 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 22:07:47,469 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 22:07:47,475 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 22:07:47,476 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 22:07:47,476 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_5-2.c [2020-08-22 22:07:47,549 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aeadf4dea/ad6d2bca076e4761a59f129b1e7904a6/FLAG674cfe203 [2020-08-22 22:07:48,009 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 22:07:48,010 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_5-2.c [2020-08-22 22:07:48,017 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aeadf4dea/ad6d2bca076e4761a59f129b1e7904a6/FLAG674cfe203 [2020-08-22 22:07:48,421 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aeadf4dea/ad6d2bca076e4761a59f129b1e7904a6 [2020-08-22 22:07:48,431 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 22:07:48,433 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 22:07:48,434 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 22:07:48,434 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 22:07:48,439 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 22:07:48,440 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 10:07:48" (1/1) ... [2020-08-22 22:07:48,444 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bfdf7d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:07:48, skipping insertion in model container [2020-08-22 22:07:48,445 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 10:07:48" (1/1) ... [2020-08-22 22:07:48,455 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 22:07:48,481 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 22:07:48,696 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 22:07:48,701 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 22:07:48,721 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 22:07:48,738 INFO L208 MainTranslator]: Completed translation [2020-08-22 22:07:48,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:07:48 WrapperNode [2020-08-22 22:07:48,739 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 22:07:48,740 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 22:07:48,740 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 22:07:48,740 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 22:07:48,756 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:07:48" (1/1) ... [2020-08-22 22:07:48,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:07:48" (1/1) ... [2020-08-22 22:07:48,896 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:07:48" (1/1) ... [2020-08-22 22:07:48,899 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:07:48" (1/1) ... [2020-08-22 22:07:48,904 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:07:48" (1/1) ... [2020-08-22 22:07:48,907 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:07:48" (1/1) ... [2020-08-22 22:07:48,909 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:07:48" (1/1) ... [2020-08-22 22:07:48,911 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 22:07:48,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 22:07:48,912 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 22:07:48,912 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 22:07:48,913 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:07:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/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-08-22 22:07:49,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 22:07:49,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 22:07:49,005 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-08-22 22:07:49,005 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-08-22 22:07:49,005 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 22:07:49,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-22 22:07:49,006 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 22:07:49,006 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-08-22 22:07:49,006 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-08-22 22:07:49,006 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 22:07:49,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 22:07:49,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 22:07:49,238 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 22:07:49,239 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-22 22:07:49,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 10:07:49 BoogieIcfgContainer [2020-08-22 22:07:49,244 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 22:07:49,245 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 22:07:49,245 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 22:07:49,249 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 22:07:49,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 10:07:48" (1/3) ... [2020-08-22 22:07:49,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb92b0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 10:07:49, skipping insertion in model container [2020-08-22 22:07:49,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:07:48" (2/3) ... [2020-08-22 22:07:49,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb92b0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 10:07:49, skipping insertion in model container [2020-08-22 22:07:49,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 10:07:49" (3/3) ... [2020-08-22 22:07:49,254 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_5-2.c [2020-08-22 22:07:49,267 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-22 22:07:49,276 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 22:07:49,300 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 22:07:49,369 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 22:07:49,370 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 22:07:49,370 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-22 22:07:49,371 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 22:07:49,371 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 22:07:49,371 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 22:07:49,371 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 22:07:49,372 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 22:07:49,397 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2020-08-22 22:07:49,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-08-22 22:07:49,413 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:07:49,415 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 22:07:49,415 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:07:49,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:07:49,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1089710179, now seen corresponding path program 1 times [2020-08-22 22:07:49,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:07:49,440 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [515323647] [2020-08-22 22:07:49,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:07:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:49,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:07:49,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:49,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:07:49,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:49,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 22:07:49,645 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [515323647] [2020-08-22 22:07:49,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:07:49,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 22:07:49,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081540850] [2020-08-22 22:07:49,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 22:07:49,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:07:49,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 22:07:49,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 22:07:49,674 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 5 states. [2020-08-22 22:07:49,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:07:49,816 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2020-08-22 22:07:49,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 22:07:49,820 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-08-22 22:07:49,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:07:49,832 INFO L225 Difference]: With dead ends: 58 [2020-08-22 22:07:49,832 INFO L226 Difference]: Without dead ends: 42 [2020-08-22 22:07:49,836 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-08-22 22:07:49,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-08-22 22:07:49,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-08-22 22:07:49,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-08-22 22:07:49,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-08-22 22:07:49,896 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 16 [2020-08-22 22:07:49,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:07:49,897 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-08-22 22:07:49,897 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 22:07:49,898 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-08-22 22:07:49,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-08-22 22:07:49,900 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:07:49,901 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 22:07:49,901 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 22:07:49,901 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:07:49,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:07:49,902 INFO L82 PathProgramCache]: Analyzing trace with hash -653728005, now seen corresponding path program 1 times [2020-08-22 22:07:49,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:07:49,903 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2084383800] [2020-08-22 22:07:49,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:07:49,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:49,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:07:49,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:49,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:07:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:49,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 22:07:49,973 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2084383800] [2020-08-22 22:07:49,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:07:49,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 22:07:49,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983018358] [2020-08-22 22:07:49,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 22:07:49,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:07:49,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 22:07:49,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 22:07:49,978 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 5 states. [2020-08-22 22:07:50,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:07:50,065 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2020-08-22 22:07:50,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 22:07:50,066 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-08-22 22:07:50,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:07:50,068 INFO L225 Difference]: With dead ends: 50 [2020-08-22 22:07:50,069 INFO L226 Difference]: Without dead ends: 44 [2020-08-22 22:07:50,070 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-08-22 22:07:50,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-08-22 22:07:50,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-08-22 22:07:50,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-08-22 22:07:50,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-08-22 22:07:50,086 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 17 [2020-08-22 22:07:50,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:07:50,087 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-08-22 22:07:50,087 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 22:07:50,087 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-08-22 22:07:50,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-08-22 22:07:50,089 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:07:50,090 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-08-22 22:07:50,090 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 22:07:50,090 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:07:50,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:07:50,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1617834856, now seen corresponding path program 1 times [2020-08-22 22:07:50,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:07:50,092 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [781256399] [2020-08-22 22:07:50,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:07:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:50,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:07:50,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:50,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:07:50,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:50,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:50,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:50,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 22:07:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:50,259 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-08-22 22:07:50,260 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [781256399] [2020-08-22 22:07:50,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:07:50,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-22 22:07:50,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274986047] [2020-08-22 22:07:50,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 22:07:50,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:07:50,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 22:07:50,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-22 22:07:50,263 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 7 states. [2020-08-22 22:07:50,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:07:50,379 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2020-08-22 22:07:50,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-22 22:07:50,380 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-08-22 22:07:50,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:07:50,382 INFO L225 Difference]: With dead ends: 82 [2020-08-22 22:07:50,382 INFO L226 Difference]: Without dead ends: 46 [2020-08-22 22:07:50,384 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-08-22 22:07:50,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-08-22 22:07:50,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2020-08-22 22:07:50,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-08-22 22:07:50,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2020-08-22 22:07:50,402 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 33 [2020-08-22 22:07:50,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:07:50,402 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2020-08-22 22:07:50,402 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 22:07:50,403 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2020-08-22 22:07:50,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-08-22 22:07:50,405 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:07:50,405 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-08-22 22:07:50,406 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-22 22:07:50,406 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:07:50,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:07:50,407 INFO L82 PathProgramCache]: Analyzing trace with hash 887160861, now seen corresponding path program 1 times [2020-08-22 22:07:50,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:07:50,408 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1698761707] [2020-08-22 22:07:50,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:07:50,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:50,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:07:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:50,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:07:50,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:50,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:50,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:50,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:50,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:50,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-08-22 22:07:50,643 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1698761707] [2020-08-22 22:07:50,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:07:50,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-22 22:07:50,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143728585] [2020-08-22 22:07:50,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 22:07:50,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:07:50,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 22:07:50,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-08-22 22:07:50,647 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 7 states. [2020-08-22 22:07:50,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:07:50,858 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2020-08-22 22:07:50,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-22 22:07:50,859 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2020-08-22 22:07:50,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:07:50,862 INFO L225 Difference]: With dead ends: 74 [2020-08-22 22:07:50,862 INFO L226 Difference]: Without dead ends: 68 [2020-08-22 22:07:50,863 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-08-22 22:07:50,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-08-22 22:07:50,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2020-08-22 22:07:50,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-08-22 22:07:50,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2020-08-22 22:07:50,883 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 34 [2020-08-22 22:07:50,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:07:50,884 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2020-08-22 22:07:50,884 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 22:07:50,884 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2020-08-22 22:07:50,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-08-22 22:07:50,886 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:07:50,887 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-08-22 22:07:50,887 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-22 22:07:50,887 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:07:50,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:07:50,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1875452576, now seen corresponding path program 1 times [2020-08-22 22:07:50,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:07:50,888 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1900029692] [2020-08-22 22:07:50,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:07:50,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:50,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:07:50,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:50,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:07:50,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:50,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:50,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:50,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:50,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:50,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 22:07:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:50,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 22:07:50,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:50,990 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-08-22 22:07:50,990 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1900029692] [2020-08-22 22:07:50,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:07:50,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-22 22:07:50,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533773699] [2020-08-22 22:07:50,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-22 22:07:50,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:07:50,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-22 22:07:50,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-22 22:07:50,993 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand 6 states. [2020-08-22 22:07:51,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:07:51,087 INFO L93 Difference]: Finished difference Result 130 states and 178 transitions. [2020-08-22 22:07:51,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-22 22:07:51,088 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2020-08-22 22:07:51,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:07:51,090 INFO L225 Difference]: With dead ends: 130 [2020-08-22 22:07:51,091 INFO L226 Difference]: Without dead ends: 70 [2020-08-22 22:07:51,092 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-08-22 22:07:51,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-08-22 22:07:51,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-08-22 22:07:51,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-08-22 22:07:51,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2020-08-22 22:07:51,109 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 50 [2020-08-22 22:07:51,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:07:51,110 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2020-08-22 22:07:51,110 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-22 22:07:51,110 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2020-08-22 22:07:51,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-08-22 22:07:51,113 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:07:51,113 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-08-22 22:07:51,114 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-22 22:07:51,114 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:07:51,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:07:51,114 INFO L82 PathProgramCache]: Analyzing trace with hash 104828256, now seen corresponding path program 1 times [2020-08-22 22:07:51,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:07:51,115 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [457393931] [2020-08-22 22:07:51,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:07:51,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:51,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:07:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:51,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:07:51,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:51,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:51,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:51,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:51,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:51,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:07:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:51,254 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-08-22 22:07:51,254 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [457393931] [2020-08-22 22:07:51,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:07:51,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-22 22:07:51,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55890963] [2020-08-22 22:07:51,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-22 22:07:51,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:07:51,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-22 22:07:51,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-08-22 22:07:51,257 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand 8 states. [2020-08-22 22:07:51,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:07:51,377 INFO L93 Difference]: Finished difference Result 142 states and 197 transitions. [2020-08-22 22:07:51,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-22 22:07:51,378 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-08-22 22:07:51,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:07:51,380 INFO L225 Difference]: With dead ends: 142 [2020-08-22 22:07:51,380 INFO L226 Difference]: Without dead ends: 78 [2020-08-22 22:07:51,383 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-08-22 22:07:51,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-08-22 22:07:51,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2020-08-22 22:07:51,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-08-22 22:07:51,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2020-08-22 22:07:51,402 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 51 [2020-08-22 22:07:51,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:07:51,403 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2020-08-22 22:07:51,403 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-22 22:07:51,404 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2020-08-22 22:07:51,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-08-22 22:07:51,407 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:07:51,407 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-08-22 22:07:51,408 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-22 22:07:51,408 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:07:51,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:07:51,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1703786405, now seen corresponding path program 1 times [2020-08-22 22:07:51,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:07:51,409 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1998652839] [2020-08-22 22:07:51,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:07:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:51,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:07:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:51,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:07:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:51,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:51,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:51,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:51,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:51,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:07:51,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:51,618 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-08-22 22:07:51,619 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1998652839] [2020-08-22 22:07:51,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:07:51,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-22 22:07:51,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778940627] [2020-08-22 22:07:51,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-22 22:07:51,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:07:51,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-22 22:07:51,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-08-22 22:07:51,623 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand 8 states. [2020-08-22 22:07:51,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:07:51,854 INFO L93 Difference]: Finished difference Result 118 states and 158 transitions. [2020-08-22 22:07:51,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-22 22:07:51,854 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2020-08-22 22:07:51,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:07:51,857 INFO L225 Difference]: With dead ends: 118 [2020-08-22 22:07:51,857 INFO L226 Difference]: Without dead ends: 112 [2020-08-22 22:07:51,858 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-08-22 22:07:51,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-08-22 22:07:51,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2020-08-22 22:07:51,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-08-22 22:07:51,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 145 transitions. [2020-08-22 22:07:51,882 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 145 transitions. Word has length 52 [2020-08-22 22:07:51,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:07:51,883 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 145 transitions. [2020-08-22 22:07:51,883 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-22 22:07:51,883 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 145 transitions. [2020-08-22 22:07:51,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-08-22 22:07:51,887 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:07:51,887 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-08-22 22:07:51,887 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-22 22:07:51,887 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:07:51,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:07:51,888 INFO L82 PathProgramCache]: Analyzing trace with hash -521446491, now seen corresponding path program 1 times [2020-08-22 22:07:51,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:07:51,888 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1739877381] [2020-08-22 22:07:51,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:07:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:51,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:07:51,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:51,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:07:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:51,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:51,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:51,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:51,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:52,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:52,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:52,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:52,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:52,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:07:52,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:52,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-08-22 22:07:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:52,064 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-08-22 22:07:52,065 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1739877381] [2020-08-22 22:07:52,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:07:52,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-22 22:07:52,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593157709] [2020-08-22 22:07:52,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-22 22:07:52,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:07:52,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-22 22:07:52,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-08-22 22:07:52,067 INFO L87 Difference]: Start difference. First operand 106 states and 145 transitions. Second operand 8 states. [2020-08-22 22:07:52,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:07:52,209 INFO L93 Difference]: Finished difference Result 227 states and 348 transitions. [2020-08-22 22:07:52,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-22 22:07:52,210 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2020-08-22 22:07:52,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:07:52,213 INFO L225 Difference]: With dead ends: 227 [2020-08-22 22:07:52,213 INFO L226 Difference]: Without dead ends: 127 [2020-08-22 22:07:52,215 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-08-22 22:07:52,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-08-22 22:07:52,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2020-08-22 22:07:52,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-08-22 22:07:52,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 161 transitions. [2020-08-22 22:07:52,241 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 161 transitions. Word has length 69 [2020-08-22 22:07:52,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:07:52,242 INFO L479 AbstractCegarLoop]: Abstraction has 115 states and 161 transitions. [2020-08-22 22:07:52,242 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-22 22:07:52,242 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 161 transitions. [2020-08-22 22:07:52,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-08-22 22:07:52,244 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:07:52,244 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-08-22 22:07:52,245 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-22 22:07:52,245 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:07:52,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:07:52,245 INFO L82 PathProgramCache]: Analyzing trace with hash -439633211, now seen corresponding path program 1 times [2020-08-22 22:07:52,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:07:52,246 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1178085223] [2020-08-22 22:07:52,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:07:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:52,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:07:52,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:52,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:07:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:52,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:52,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:52,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:52,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:52,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:52,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:52,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:07:52,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:52,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 22:07:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:52,390 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-08-22 22:07:52,391 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1178085223] [2020-08-22 22:07:52,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:07:52,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-22 22:07:52,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908431112] [2020-08-22 22:07:52,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 22:07:52,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:07:52,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 22:07:52,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-08-22 22:07:52,393 INFO L87 Difference]: Start difference. First operand 115 states and 161 transitions. Second operand 10 states. [2020-08-22 22:07:52,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:07:52,634 INFO L93 Difference]: Finished difference Result 257 states and 400 transitions. [2020-08-22 22:07:52,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-22 22:07:52,635 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2020-08-22 22:07:52,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:07:52,638 INFO L225 Difference]: With dead ends: 257 [2020-08-22 22:07:52,638 INFO L226 Difference]: Without dead ends: 151 [2020-08-22 22:07:52,640 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-08-22 22:07:52,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-08-22 22:07:52,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 133. [2020-08-22 22:07:52,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-08-22 22:07:52,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 191 transitions. [2020-08-22 22:07:52,667 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 191 transitions. Word has length 70 [2020-08-22 22:07:52,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:07:52,668 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 191 transitions. [2020-08-22 22:07:52,668 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 22:07:52,668 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 191 transitions. [2020-08-22 22:07:52,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-08-22 22:07:52,671 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:07:52,671 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-08-22 22:07:52,671 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-22 22:07:52,671 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:07:52,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:07:52,672 INFO L82 PathProgramCache]: Analyzing trace with hash 307755032, now seen corresponding path program 2 times [2020-08-22 22:07:52,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:07:52,672 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [706083171] [2020-08-22 22:07:52,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:07:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:52,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:07:52,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:52,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:07:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:52,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:52,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:52,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:52,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:52,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:52,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:52,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:07:52,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:52,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 22:07:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:52,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:52,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:52,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:52,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:52,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:52,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:07:52,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:52,917 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 36 proven. 59 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2020-08-22 22:07:52,918 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [706083171] [2020-08-22 22:07:52,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:07:52,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-22 22:07:52,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277839679] [2020-08-22 22:07:52,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-22 22:07:52,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:07:52,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-22 22:07:52,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-08-22 22:07:52,920 INFO L87 Difference]: Start difference. First operand 133 states and 191 transitions. Second operand 12 states. [2020-08-22 22:07:53,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:07:53,346 INFO L93 Difference]: Finished difference Result 265 states and 420 transitions. [2020-08-22 22:07:53,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-08-22 22:07:53,346 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2020-08-22 22:07:53,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:07:53,352 INFO L225 Difference]: With dead ends: 265 [2020-08-22 22:07:53,353 INFO L226 Difference]: Without dead ends: 116 [2020-08-22 22:07:53,356 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-08-22 22:07:53,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-08-22 22:07:53,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 95. [2020-08-22 22:07:53,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-08-22 22:07:53,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 117 transitions. [2020-08-22 22:07:53,378 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 117 transitions. Word has length 105 [2020-08-22 22:07:53,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:07:53,380 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 117 transitions. [2020-08-22 22:07:53,381 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-22 22:07:53,381 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2020-08-22 22:07:53,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-08-22 22:07:53,383 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:07:53,383 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-08-22 22:07:53,383 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-22 22:07:53,384 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:07:53,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:07:53,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1534580400, now seen corresponding path program 1 times [2020-08-22 22:07:53,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:07:53,385 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2014720834] [2020-08-22 22:07:53,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:07:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:53,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:07:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:53,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:07:53,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:53,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:53,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:53,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:53,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:53,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:53,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:53,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:53,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:53,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:53,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:07:53,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:53,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 22:07:53,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:53,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 22:07:53,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:53,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:53,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:53,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:53,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:53,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:53,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:07:53,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:53,640 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 50 proven. 67 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2020-08-22 22:07:53,640 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2014720834] [2020-08-22 22:07:53,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:07:53,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-22 22:07:53,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585470950] [2020-08-22 22:07:53,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 22:07:53,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:07:53,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 22:07:53,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-08-22 22:07:53,643 INFO L87 Difference]: Start difference. First operand 95 states and 117 transitions. Second operand 10 states. [2020-08-22 22:07:53,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:07:53,901 INFO L93 Difference]: Finished difference Result 193 states and 255 transitions. [2020-08-22 22:07:53,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-22 22:07:53,902 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 123 [2020-08-22 22:07:53,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:07:53,907 INFO L225 Difference]: With dead ends: 193 [2020-08-22 22:07:53,907 INFO L226 Difference]: Without dead ends: 105 [2020-08-22 22:07:53,910 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-08-22 22:07:53,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-08-22 22:07:53,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2020-08-22 22:07:53,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-08-22 22:07:53,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 127 transitions. [2020-08-22 22:07:53,960 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 127 transitions. Word has length 123 [2020-08-22 22:07:53,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:07:53,961 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 127 transitions. [2020-08-22 22:07:53,962 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 22:07:53,962 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 127 transitions. [2020-08-22 22:07:53,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-08-22 22:07:53,964 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:07:53,964 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-08-22 22:07:53,965 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-22 22:07:53,965 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:07:53,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:07:53,965 INFO L82 PathProgramCache]: Analyzing trace with hash 822116120, now seen corresponding path program 2 times [2020-08-22 22:07:53,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:07:53,967 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [479398666] [2020-08-22 22:07:53,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:07:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:54,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:07:54,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:54,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:07:54,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:54,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:54,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:54,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:54,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:54,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:54,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:54,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:54,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:54,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:07:54,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:54,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 22:07:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:54,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:54,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:54,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:54,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:07:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:54,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-08-22 22:07:54,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:54,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:54,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:54,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:54,428 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 72 proven. 111 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2020-08-22 22:07:54,428 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [479398666] [2020-08-22 22:07:54,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:07:54,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-22 22:07:54,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777679622] [2020-08-22 22:07:54,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-22 22:07:54,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:07:54,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-22 22:07:54,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-08-22 22:07:54,432 INFO L87 Difference]: Start difference. First operand 105 states and 127 transitions. Second operand 12 states. [2020-08-22 22:07:54,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:07:54,875 INFO L93 Difference]: Finished difference Result 241 states and 326 transitions. [2020-08-22 22:07:54,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-22 22:07:54,876 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 140 [2020-08-22 22:07:54,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:07:54,879 INFO L225 Difference]: With dead ends: 241 [2020-08-22 22:07:54,879 INFO L226 Difference]: Without dead ends: 141 [2020-08-22 22:07:54,881 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-08-22 22:07:54,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-08-22 22:07:54,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 123. [2020-08-22 22:07:54,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-08-22 22:07:54,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 149 transitions. [2020-08-22 22:07:54,900 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 149 transitions. Word has length 140 [2020-08-22 22:07:54,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:07:54,901 INFO L479 AbstractCegarLoop]: Abstraction has 123 states and 149 transitions. [2020-08-22 22:07:54,901 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-22 22:07:54,901 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 149 transitions. [2020-08-22 22:07:54,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-08-22 22:07:54,903 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:07:54,903 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-08-22 22:07:54,904 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-22 22:07:54,904 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:07:54,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:07:54,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1260071360, now seen corresponding path program 2 times [2020-08-22 22:07:54,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:07:54,905 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [950501132] [2020-08-22 22:07:54,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:07:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-22 22:07:54,923 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-08-22 22:07:54,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-22 22:07:54,940 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-08-22 22:07:54,972 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-22 22:07:54,972 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-22 22:07:54,972 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-22 22:07:55,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 10:07:55 BoogieIcfgContainer [2020-08-22 22:07:55,057 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-22 22:07:55,065 INFO L168 Benchmark]: Toolchain (without parser) took 6626.89 ms. Allocated memory was 138.9 MB in the beginning and 308.3 MB in the end (delta: 169.3 MB). Free memory was 103.6 MB in the beginning and 241.4 MB in the end (delta: -137.8 MB). Peak memory consumption was 31.5 MB. Max. memory is 7.1 GB. [2020-08-22 22:07:55,067 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 121.5 MB in the beginning and 121.1 MB in the end (delta: 420.0 kB). Peak memory consumption was 420.0 kB. Max. memory is 7.1 GB. [2020-08-22 22:07:55,068 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.24 ms. Allocated memory is still 138.9 MB. Free memory was 103.2 MB in the beginning and 93.6 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-08-22 22:07:55,069 INFO L168 Benchmark]: Boogie Preprocessor took 171.05 ms. Allocated memory was 138.9 MB in the beginning and 200.3 MB in the end (delta: 61.3 MB). Free memory was 93.6 MB in the beginning and 178.6 MB in the end (delta: -85.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-08-22 22:07:55,069 INFO L168 Benchmark]: RCFGBuilder took 332.54 ms. Allocated memory is still 200.3 MB. Free memory was 178.6 MB in the beginning and 163.8 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2020-08-22 22:07:55,077 INFO L168 Benchmark]: TraceAbstraction took 5811.91 ms. Allocated memory was 200.3 MB in the beginning and 308.3 MB in the end (delta: 108.0 MB). Free memory was 163.8 MB in the beginning and 241.4 MB in the end (delta: -77.6 MB). Peak memory consumption was 30.4 MB. Max. memory is 7.1 GB. [2020-08-22 22:07:55,080 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.21 ms. Allocated memory is still 138.9 MB. Free memory was 121.5 MB in the beginning and 121.1 MB in the end (delta: 420.0 kB). Peak memory consumption was 420.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 305.24 ms. Allocated memory is still 138.9 MB. Free memory was 103.2 MB in the beginning and 93.6 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 171.05 ms. Allocated memory was 138.9 MB in the beginning and 200.3 MB in the end (delta: 61.3 MB). Free memory was 93.6 MB in the beginning and 178.6 MB in the end (delta: -85.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 332.54 ms. Allocated memory is still 200.3 MB. Free memory was 178.6 MB in the beginning and 163.8 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5811.91 ms. Allocated memory was 200.3 MB in the beginning and 308.3 MB in the end (delta: 108.0 MB). Free memory was 163.8 MB in the beginning and 241.4 MB in the end (delta: -77.6 MB). Peak memory consumption was 30.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.6s, OverallIterations: 13, TraceHistogramMax: 9, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 527 SDtfs, 548 SDslu, 2199 SDs, 0 SdLazy, 1538 SolverSat, 176 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 327 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.2s 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...