/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-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-72570d3 [2020-08-22 22:07:25,715 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 22:07:25,718 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 22:07:25,742 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 22:07:25,743 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 22:07:25,744 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 22:07:25,745 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 22:07:25,747 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 22:07:25,748 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 22:07:25,749 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 22:07:25,750 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 22:07:25,751 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 22:07:25,751 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 22:07:25,752 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 22:07:25,753 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 22:07:25,754 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 22:07:25,755 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 22:07:25,756 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 22:07:25,758 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 22:07:25,760 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 22:07:25,765 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 22:07:25,766 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 22:07:25,768 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 22:07:25,769 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 22:07:25,771 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 22:07:25,771 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 22:07:25,772 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 22:07:25,772 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 22:07:25,776 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 22:07:25,777 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 22:07:25,777 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 22:07:25,778 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 22:07:25,778 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 22:07:25,779 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 22:07:25,781 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 22:07:25,781 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 22:07:25,783 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 22:07:25,783 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 22:07:25,783 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 22:07:25,784 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 22:07:25,785 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 22:07:25,786 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:25,799 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 22:07:25,799 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 22:07:25,801 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 22:07:25,801 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 22:07:25,802 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 22:07:25,802 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 22:07:25,802 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 22:07:25,802 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 22:07:25,802 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 22:07:25,803 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 22:07:25,804 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 22:07:25,804 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 22:07:25,804 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 22:07:25,804 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 22:07:25,805 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 22:07:25,805 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-08-22 22:07:25,805 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 22:07:25,805 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 22:07:25,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 22:07:25,806 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 22:07:25,806 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-08-22 22:07:25,806 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 22:07:25,806 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:26,105 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 22:07:26,118 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 22:07:26,121 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 22:07:26,123 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 22:07:26,123 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 22:07:26,124 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_5-1.c [2020-08-22 22:07:26,189 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4785fb95a/003de2f1eafe46a29a3f6a89b4eb9abd/FLAG0ef884ac8 [2020-08-22 22:07:26,650 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 22:07:26,650 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_5-1.c [2020-08-22 22:07:26,658 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4785fb95a/003de2f1eafe46a29a3f6a89b4eb9abd/FLAG0ef884ac8 [2020-08-22 22:07:27,061 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4785fb95a/003de2f1eafe46a29a3f6a89b4eb9abd [2020-08-22 22:07:27,070 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 22:07:27,072 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 22:07:27,073 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 22:07:27,073 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 22:07:27,077 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 22:07:27,078 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 10:07:27" (1/1) ... [2020-08-22 22:07:27,081 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a8bd8c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:07:27, skipping insertion in model container [2020-08-22 22:07:27,081 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 10:07:27" (1/1) ... [2020-08-22 22:07:27,089 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 22:07:27,109 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 22:07:27,290 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 22:07:27,295 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 22:07:27,313 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 22:07:27,328 INFO L208 MainTranslator]: Completed translation [2020-08-22 22:07:27,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:07:27 WrapperNode [2020-08-22 22:07:27,329 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 22:07:27,330 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 22:07:27,330 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 22:07:27,330 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 22:07:27,344 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:27" (1/1) ... [2020-08-22 22:07:27,344 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:27" (1/1) ... [2020-08-22 22:07:27,440 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:27" (1/1) ... [2020-08-22 22:07:27,440 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:27" (1/1) ... [2020-08-22 22:07:27,445 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:27" (1/1) ... [2020-08-22 22:07:27,447 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:27" (1/1) ... [2020-08-22 22:07:27,452 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:27" (1/1) ... [2020-08-22 22:07:27,458 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 22:07:27,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 22:07:27,459 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 22:07:27,459 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 22:07:27,460 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:07:27" (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:27,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 22:07:27,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 22:07:27,520 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-08-22 22:07:27,520 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-08-22 22:07:27,521 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 22:07:27,521 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-22 22:07:27,521 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 22:07:27,521 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-08-22 22:07:27,521 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-08-22 22:07:27,521 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 22:07:27,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 22:07:27,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 22:07:27,719 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 22:07:27,719 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-22 22:07:27,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 10:07:27 BoogieIcfgContainer [2020-08-22 22:07:27,723 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 22:07:27,725 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 22:07:27,725 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 22:07:27,728 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 22:07:27,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 10:07:27" (1/3) ... [2020-08-22 22:07:27,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d32d5ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 10:07:27, skipping insertion in model container [2020-08-22 22:07:27,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:07:27" (2/3) ... [2020-08-22 22:07:27,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d32d5ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 10:07:27, skipping insertion in model container [2020-08-22 22:07:27,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 10:07:27" (3/3) ... [2020-08-22 22:07:27,732 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_5-1.c [2020-08-22 22:07:27,742 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-22 22:07:27,749 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 22:07:27,763 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 22:07:27,784 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 22:07:27,784 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 22:07:27,785 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-22 22:07:27,785 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 22:07:27,785 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 22:07:27,785 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 22:07:27,785 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 22:07:27,786 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 22:07:27,801 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2020-08-22 22:07:27,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-08-22 22:07:27,812 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:07:27,813 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:27,813 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:07:27,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:07:27,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1089710179, now seen corresponding path program 1 times [2020-08-22 22:07:27,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:07:27,828 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [558173164] [2020-08-22 22:07:27,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:07:27,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:27,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:07:27,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:27,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:07:27,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:28,066 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:28,068 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [558173164] [2020-08-22 22:07:28,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:07:28,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 22:07:28,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468927485] [2020-08-22 22:07:28,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 22:07:28,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:07:28,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 22:07:28,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 22:07:28,127 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 5 states. [2020-08-22 22:07:28,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:07:28,241 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2020-08-22 22:07:28,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 22:07:28,243 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-08-22 22:07:28,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:07:28,254 INFO L225 Difference]: With dead ends: 58 [2020-08-22 22:07:28,254 INFO L226 Difference]: Without dead ends: 42 [2020-08-22 22:07:28,258 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:28,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-08-22 22:07:28,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-08-22 22:07:28,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-08-22 22:07:28,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-08-22 22:07:28,309 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 16 [2020-08-22 22:07:28,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:07:28,309 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-08-22 22:07:28,310 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 22:07:28,310 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-08-22 22:07:28,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-08-22 22:07:28,312 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:07:28,312 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:28,313 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 22:07:28,313 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:07:28,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:07:28,314 INFO L82 PathProgramCache]: Analyzing trace with hash -653728005, now seen corresponding path program 1 times [2020-08-22 22:07:28,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:07:28,315 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [231473312] [2020-08-22 22:07:28,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:07:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:28,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:07:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:28,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:07:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:28,389 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:28,390 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [231473312] [2020-08-22 22:07:28,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:07:28,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 22:07:28,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190577018] [2020-08-22 22:07:28,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 22:07:28,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:07:28,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 22:07:28,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 22:07:28,394 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 5 states. [2020-08-22 22:07:28,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:07:28,463 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2020-08-22 22:07:28,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 22:07:28,464 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-08-22 22:07:28,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:07:28,466 INFO L225 Difference]: With dead ends: 50 [2020-08-22 22:07:28,466 INFO L226 Difference]: Without dead ends: 44 [2020-08-22 22:07:28,468 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:28,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-08-22 22:07:28,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-08-22 22:07:28,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-08-22 22:07:28,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-08-22 22:07:28,483 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 17 [2020-08-22 22:07:28,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:07:28,484 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-08-22 22:07:28,489 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 22:07:28,489 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-08-22 22:07:28,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-08-22 22:07:28,492 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:07:28,492 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:28,493 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 22:07:28,493 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:07:28,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:07:28,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1617834856, now seen corresponding path program 1 times [2020-08-22 22:07:28,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:07:28,494 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [712194948] [2020-08-22 22:07:28,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:07:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:28,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:07:28,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:28,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:07:28,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:28,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:28,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 22:07:28,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:28,610 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:28,610 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [712194948] [2020-08-22 22:07:28,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:07:28,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-22 22:07:28,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218822221] [2020-08-22 22:07:28,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 22:07:28,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:07:28,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 22:07:28,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-22 22:07:28,613 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 7 states. [2020-08-22 22:07:28,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:07:28,703 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2020-08-22 22:07:28,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-22 22:07:28,704 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-08-22 22:07:28,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:07:28,706 INFO L225 Difference]: With dead ends: 82 [2020-08-22 22:07:28,707 INFO L226 Difference]: Without dead ends: 46 [2020-08-22 22:07:28,708 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:28,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-08-22 22:07:28,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2020-08-22 22:07:28,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-08-22 22:07:28,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2020-08-22 22:07:28,730 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 33 [2020-08-22 22:07:28,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:07:28,730 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2020-08-22 22:07:28,730 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 22:07:28,730 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2020-08-22 22:07:28,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-08-22 22:07:28,735 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:07:28,735 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:28,736 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-22 22:07:28,736 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:07:28,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:07:28,737 INFO L82 PathProgramCache]: Analyzing trace with hash 887160861, now seen corresponding path program 1 times [2020-08-22 22:07:28,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:07:28,738 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1255678539] [2020-08-22 22:07:28,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:07:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:28,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:07:28,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:28,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:07:28,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:28,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:28,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:28,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:28,906 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:28,906 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1255678539] [2020-08-22 22:07:28,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:07:28,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-22 22:07:28,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900159190] [2020-08-22 22:07:28,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 22:07:28,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:07:28,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 22:07:28,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-08-22 22:07:28,909 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 7 states. [2020-08-22 22:07:29,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:07:29,141 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2020-08-22 22:07:29,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-22 22:07:29,143 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2020-08-22 22:07:29,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:07:29,149 INFO L225 Difference]: With dead ends: 74 [2020-08-22 22:07:29,150 INFO L226 Difference]: Without dead ends: 68 [2020-08-22 22:07:29,150 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:29,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-08-22 22:07:29,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2020-08-22 22:07:29,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-08-22 22:07:29,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2020-08-22 22:07:29,180 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 34 [2020-08-22 22:07:29,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:07:29,184 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2020-08-22 22:07:29,184 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 22:07:29,184 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2020-08-22 22:07:29,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-08-22 22:07:29,187 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:07:29,187 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:29,187 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-22 22:07:29,188 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:07:29,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:07:29,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1875452576, now seen corresponding path program 1 times [2020-08-22 22:07:29,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:07:29,189 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [281701907] [2020-08-22 22:07:29,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:07:29,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:29,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:07:29,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:29,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:07:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:29,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:29,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:29,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 22:07:29,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:29,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 22:07:29,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:29,292 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:29,293 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [281701907] [2020-08-22 22:07:29,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:07:29,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-22 22:07:29,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819966508] [2020-08-22 22:07:29,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-22 22:07:29,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:07:29,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-22 22:07:29,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-22 22:07:29,296 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand 6 states. [2020-08-22 22:07:29,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:07:29,369 INFO L93 Difference]: Finished difference Result 130 states and 178 transitions. [2020-08-22 22:07:29,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-22 22:07:29,370 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2020-08-22 22:07:29,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:07:29,372 INFO L225 Difference]: With dead ends: 130 [2020-08-22 22:07:29,372 INFO L226 Difference]: Without dead ends: 70 [2020-08-22 22:07:29,374 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:29,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-08-22 22:07:29,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-08-22 22:07:29,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-08-22 22:07:29,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2020-08-22 22:07:29,390 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 50 [2020-08-22 22:07:29,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:07:29,391 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2020-08-22 22:07:29,391 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-22 22:07:29,391 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2020-08-22 22:07:29,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-08-22 22:07:29,394 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:07:29,394 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:29,394 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-22 22:07:29,394 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:07:29,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:07:29,395 INFO L82 PathProgramCache]: Analyzing trace with hash 104828256, now seen corresponding path program 1 times [2020-08-22 22:07:29,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:07:29,395 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1467176850] [2020-08-22 22:07:29,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:07:29,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:29,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:07:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:29,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:07:29,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:29,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:29,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:29,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:29,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:29,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:29,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:29,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:07:29,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:29,581 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:29,582 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1467176850] [2020-08-22 22:07:29,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:07:29,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-22 22:07:29,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757457185] [2020-08-22 22:07:29,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-22 22:07:29,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:07:29,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-22 22:07:29,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-08-22 22:07:29,585 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand 8 states. [2020-08-22 22:07:29,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:07:29,704 INFO L93 Difference]: Finished difference Result 142 states and 197 transitions. [2020-08-22 22:07:29,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-22 22:07:29,705 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-08-22 22:07:29,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:07:29,707 INFO L225 Difference]: With dead ends: 142 [2020-08-22 22:07:29,707 INFO L226 Difference]: Without dead ends: 78 [2020-08-22 22:07:29,708 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:29,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-08-22 22:07:29,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2020-08-22 22:07:29,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-08-22 22:07:29,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2020-08-22 22:07:29,724 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 51 [2020-08-22 22:07:29,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:07:29,725 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2020-08-22 22:07:29,725 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-22 22:07:29,725 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2020-08-22 22:07:29,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-08-22 22:07:29,728 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:07:29,728 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:29,728 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-22 22:07:29,728 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:07:29,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:07:29,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1703786405, now seen corresponding path program 1 times [2020-08-22 22:07:29,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:07:29,729 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1088401375] [2020-08-22 22:07:29,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:07:29,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:29,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:07:29,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:29,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:07:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:29,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:29,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:29,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:29,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:07:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:29,892 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:29,892 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1088401375] [2020-08-22 22:07:29,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:07:29,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-22 22:07:29,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026139121] [2020-08-22 22:07:29,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-22 22:07:29,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:07:29,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-22 22:07:29,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-08-22 22:07:29,896 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand 8 states. [2020-08-22 22:07:30,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:07:30,101 INFO L93 Difference]: Finished difference Result 118 states and 158 transitions. [2020-08-22 22:07:30,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-22 22:07:30,102 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2020-08-22 22:07:30,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:07:30,105 INFO L225 Difference]: With dead ends: 118 [2020-08-22 22:07:30,105 INFO L226 Difference]: Without dead ends: 112 [2020-08-22 22:07:30,106 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:30,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-08-22 22:07:30,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2020-08-22 22:07:30,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-08-22 22:07:30,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 145 transitions. [2020-08-22 22:07:30,129 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 145 transitions. Word has length 52 [2020-08-22 22:07:30,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:07:30,129 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 145 transitions. [2020-08-22 22:07:30,129 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-22 22:07:30,130 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 145 transitions. [2020-08-22 22:07:30,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-08-22 22:07:30,132 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:07:30,132 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:30,132 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-22 22:07:30,132 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:07:30,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:07:30,133 INFO L82 PathProgramCache]: Analyzing trace with hash -521446491, now seen corresponding path program 1 times [2020-08-22 22:07:30,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:07:30,133 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1795665055] [2020-08-22 22:07:30,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:07:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:30,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:07:30,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:30,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:07:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:30,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:30,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:30,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:30,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:30,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:30,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:30,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:30,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:07:30,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:30,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-08-22 22:07:30,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:30,272 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:30,272 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1795665055] [2020-08-22 22:07:30,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:07:30,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-22 22:07:30,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057328165] [2020-08-22 22:07:30,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-22 22:07:30,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:07:30,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-22 22:07:30,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-08-22 22:07:30,274 INFO L87 Difference]: Start difference. First operand 106 states and 145 transitions. Second operand 8 states. [2020-08-22 22:07:30,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:07:30,398 INFO L93 Difference]: Finished difference Result 227 states and 348 transitions. [2020-08-22 22:07:30,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-22 22:07:30,399 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2020-08-22 22:07:30,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:07:30,401 INFO L225 Difference]: With dead ends: 227 [2020-08-22 22:07:30,402 INFO L226 Difference]: Without dead ends: 127 [2020-08-22 22:07:30,403 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:30,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-08-22 22:07:30,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2020-08-22 22:07:30,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-08-22 22:07:30,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 161 transitions. [2020-08-22 22:07:30,430 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 161 transitions. Word has length 69 [2020-08-22 22:07:30,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:07:30,431 INFO L479 AbstractCegarLoop]: Abstraction has 115 states and 161 transitions. [2020-08-22 22:07:30,431 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-22 22:07:30,431 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 161 transitions. [2020-08-22 22:07:30,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-08-22 22:07:30,434 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:07:30,435 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:30,435 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-22 22:07:30,435 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:07:30,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:07:30,435 INFO L82 PathProgramCache]: Analyzing trace with hash -439633211, now seen corresponding path program 1 times [2020-08-22 22:07:30,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:07:30,436 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [764445607] [2020-08-22 22:07:30,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:07:30,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:30,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:07:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:30,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:07:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:30,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:30,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:30,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:30,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:30,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:30,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:30,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:07:30,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:30,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 22:07:30,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:30,628 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:30,628 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [764445607] [2020-08-22 22:07:30,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:07:30,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-22 22:07:30,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655512952] [2020-08-22 22:07:30,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 22:07:30,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:07:30,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 22:07:30,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-08-22 22:07:30,631 INFO L87 Difference]: Start difference. First operand 115 states and 161 transitions. Second operand 10 states. [2020-08-22 22:07:30,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:07:30,858 INFO L93 Difference]: Finished difference Result 257 states and 400 transitions. [2020-08-22 22:07:30,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-22 22:07:30,859 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2020-08-22 22:07:30,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:07:30,862 INFO L225 Difference]: With dead ends: 257 [2020-08-22 22:07:30,862 INFO L226 Difference]: Without dead ends: 151 [2020-08-22 22:07:30,864 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:30,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-08-22 22:07:30,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 133. [2020-08-22 22:07:30,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-08-22 22:07:30,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 191 transitions. [2020-08-22 22:07:30,888 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 191 transitions. Word has length 70 [2020-08-22 22:07:30,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:07:30,889 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 191 transitions. [2020-08-22 22:07:30,889 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 22:07:30,889 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 191 transitions. [2020-08-22 22:07:30,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-08-22 22:07:30,891 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:07:30,892 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:30,892 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-22 22:07:30,892 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:07:30,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:07:30,892 INFO L82 PathProgramCache]: Analyzing trace with hash 307755032, now seen corresponding path program 2 times [2020-08-22 22:07:30,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:07:30,893 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [195308895] [2020-08-22 22:07:30,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:07:30,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:30,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:07:30,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:30,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:07:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:30,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:30,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:31,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:31,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:31,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:31,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:31,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:07:31,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:31,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 22:07:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:31,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:31,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:31,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:31,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:07:31,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:31,124 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:31,124 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [195308895] [2020-08-22 22:07:31,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:07:31,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-22 22:07:31,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586809616] [2020-08-22 22:07:31,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-22 22:07:31,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:07:31,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-22 22:07:31,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-08-22 22:07:31,127 INFO L87 Difference]: Start difference. First operand 133 states and 191 transitions. Second operand 12 states. [2020-08-22 22:07:31,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:07:31,560 INFO L93 Difference]: Finished difference Result 265 states and 420 transitions. [2020-08-22 22:07:31,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-08-22 22:07:31,561 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2020-08-22 22:07:31,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:07:31,565 INFO L225 Difference]: With dead ends: 265 [2020-08-22 22:07:31,565 INFO L226 Difference]: Without dead ends: 116 [2020-08-22 22:07:31,568 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:31,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-08-22 22:07:31,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 95. [2020-08-22 22:07:31,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-08-22 22:07:31,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 117 transitions. [2020-08-22 22:07:31,585 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 117 transitions. Word has length 105 [2020-08-22 22:07:31,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:07:31,585 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 117 transitions. [2020-08-22 22:07:31,585 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-22 22:07:31,585 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2020-08-22 22:07:31,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-08-22 22:07:31,587 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:07:31,587 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:31,588 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-22 22:07:31,588 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:07:31,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:07:31,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1534580400, now seen corresponding path program 1 times [2020-08-22 22:07:31,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:07:31,589 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1133106310] [2020-08-22 22:07:31,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:07:31,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:31,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:07:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:31,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:07:31,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:31,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:31,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:31,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:31,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:31,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:31,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:31,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:31,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:31,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:07:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:31,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 22:07:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:31,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 22:07:31,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:31,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:31,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:31,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:31,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:31,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:31,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:07:31,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:31,869 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:31,869 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1133106310] [2020-08-22 22:07:31,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:07:31,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-22 22:07:31,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130740012] [2020-08-22 22:07:31,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 22:07:31,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:07:31,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 22:07:31,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-08-22 22:07:31,872 INFO L87 Difference]: Start difference. First operand 95 states and 117 transitions. Second operand 10 states. [2020-08-22 22:07:32,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:07:32,060 INFO L93 Difference]: Finished difference Result 193 states and 255 transitions. [2020-08-22 22:07:32,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-22 22:07:32,060 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 123 [2020-08-22 22:07:32,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:07:32,063 INFO L225 Difference]: With dead ends: 193 [2020-08-22 22:07:32,063 INFO L226 Difference]: Without dead ends: 105 [2020-08-22 22:07:32,065 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:32,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-08-22 22:07:32,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2020-08-22 22:07:32,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-08-22 22:07:32,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 127 transitions. [2020-08-22 22:07:32,079 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 127 transitions. Word has length 123 [2020-08-22 22:07:32,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:07:32,081 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 127 transitions. [2020-08-22 22:07:32,081 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 22:07:32,081 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 127 transitions. [2020-08-22 22:07:32,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-08-22 22:07:32,082 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:07:32,082 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:32,083 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-22 22:07:32,083 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:07:32,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:07:32,083 INFO L82 PathProgramCache]: Analyzing trace with hash 822116120, now seen corresponding path program 2 times [2020-08-22 22:07:32,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:07:32,084 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1782721967] [2020-08-22 22:07:32,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:07:32,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:32,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:07:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:32,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:07:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:32,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:32,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:32,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:32,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:32,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:32,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:32,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:32,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:32,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:07:32,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:32,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 22:07:32,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:32,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:32,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:32,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:32,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:32,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:32,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:07:32,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:32,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-08-22 22:07:32,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:32,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:32,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:32,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:32,477 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:32,478 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1782721967] [2020-08-22 22:07:32,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:07:32,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-22 22:07:32,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774731021] [2020-08-22 22:07:32,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-22 22:07:32,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:07:32,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-22 22:07:32,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-08-22 22:07:32,482 INFO L87 Difference]: Start difference. First operand 105 states and 127 transitions. Second operand 12 states. [2020-08-22 22:07:32,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:07:32,832 INFO L93 Difference]: Finished difference Result 241 states and 326 transitions. [2020-08-22 22:07:32,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-22 22:07:32,832 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 140 [2020-08-22 22:07:32,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:07:32,834 INFO L225 Difference]: With dead ends: 241 [2020-08-22 22:07:32,834 INFO L226 Difference]: Without dead ends: 141 [2020-08-22 22:07:32,837 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:32,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-08-22 22:07:32,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 123. [2020-08-22 22:07:32,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-08-22 22:07:32,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 149 transitions. [2020-08-22 22:07:32,853 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 149 transitions. Word has length 140 [2020-08-22 22:07:32,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:07:32,854 INFO L479 AbstractCegarLoop]: Abstraction has 123 states and 149 transitions. [2020-08-22 22:07:32,854 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-22 22:07:32,854 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 149 transitions. [2020-08-22 22:07:32,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-08-22 22:07:32,860 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:07:32,860 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:32,860 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-22 22:07:32,860 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:07:32,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:07:32,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1260071360, now seen corresponding path program 2 times [2020-08-22 22:07:32,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:07:32,861 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1372570818] [2020-08-22 22:07:32,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:07:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:32,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:07:32,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:32,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:07:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:33,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:33,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:33,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:33,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:33,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:33,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:33,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:33,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:33,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:07:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:33,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 22:07:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:33,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:33,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:33,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:33,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 22:07:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:33,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:33,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:33,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:33,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:33,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:33,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:33,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:07:33,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:33,559 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2020-08-22 22:07:33,560 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1372570818] [2020-08-22 22:07:33,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:07:33,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-08-22 22:07:33,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723625365] [2020-08-22 22:07:33,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-08-22 22:07:33,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:07:33,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-08-22 22:07:33,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2020-08-22 22:07:33,562 INFO L87 Difference]: Start difference. First operand 123 states and 149 transitions. Second operand 22 states. [2020-08-22 22:07:34,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:07:34,206 INFO L93 Difference]: Finished difference Result 146 states and 180 transitions. [2020-08-22 22:07:34,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-08-22 22:07:34,207 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 140 [2020-08-22 22:07:34,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:07:34,211 INFO L225 Difference]: With dead ends: 146 [2020-08-22 22:07:34,211 INFO L226 Difference]: Without dead ends: 140 [2020-08-22 22:07:34,213 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=105, Invalid=1085, Unknown=0, NotChecked=0, Total=1190 [2020-08-22 22:07:34,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-08-22 22:07:34,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 131. [2020-08-22 22:07:34,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-08-22 22:07:34,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 164 transitions. [2020-08-22 22:07:34,243 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 164 transitions. Word has length 140 [2020-08-22 22:07:34,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:07:34,244 INFO L479 AbstractCegarLoop]: Abstraction has 131 states and 164 transitions. [2020-08-22 22:07:34,244 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-08-22 22:07:34,244 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 164 transitions. [2020-08-22 22:07:34,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-08-22 22:07:34,248 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:07:34,248 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 8, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 22:07:34,249 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-22 22:07:34,249 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:07:34,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:07:34,250 INFO L82 PathProgramCache]: Analyzing trace with hash 235403762, now seen corresponding path program 3 times [2020-08-22 22:07:34,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:07:34,255 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1826945413] [2020-08-22 22:07:34,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:07:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:34,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:07:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:34,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:07:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:34,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:34,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:34,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:34,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:34,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:34,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:34,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:34,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:07:34,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:34,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 22:07:34,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:34,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:34,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:34,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:34,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:34,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 22:07:34,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:34,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:34,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:34,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:34,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:34,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:34,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:34,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:34,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:07:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:34,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 22:07:34,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:34,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:34,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:34,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:34,667 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 107 proven. 178 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2020-08-22 22:07:34,667 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1826945413] [2020-08-22 22:07:34,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:07:34,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-08-22 22:07:34,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621657187] [2020-08-22 22:07:34,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-08-22 22:07:34,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:07:34,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-08-22 22:07:34,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-08-22 22:07:34,670 INFO L87 Difference]: Start difference. First operand 131 states and 164 transitions. Second operand 14 states. [2020-08-22 22:07:35,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:07:35,208 INFO L93 Difference]: Finished difference Result 274 states and 374 transitions. [2020-08-22 22:07:35,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-08-22 22:07:35,209 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 175 [2020-08-22 22:07:35,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:07:35,212 INFO L225 Difference]: With dead ends: 274 [2020-08-22 22:07:35,212 INFO L226 Difference]: Without dead ends: 151 [2020-08-22 22:07:35,215 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2020-08-22 22:07:35,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-08-22 22:07:35,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 135. [2020-08-22 22:07:35,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-08-22 22:07:35,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 170 transitions. [2020-08-22 22:07:35,235 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 170 transitions. Word has length 175 [2020-08-22 22:07:35,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:07:35,236 INFO L479 AbstractCegarLoop]: Abstraction has 135 states and 170 transitions. [2020-08-22 22:07:35,236 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-08-22 22:07:35,236 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 170 transitions. [2020-08-22 22:07:35,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2020-08-22 22:07:35,239 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:07:35,239 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 22:07:35,239 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-08-22 22:07:35,239 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:07:35,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:07:35,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1930099232, now seen corresponding path program 4 times [2020-08-22 22:07:35,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:07:35,240 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1601140454] [2020-08-22 22:07:35,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:07:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:35,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:07:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:35,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:07:35,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:35,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:35,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:35,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:35,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:35,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:35,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:35,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:35,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:35,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:35,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:07:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:35,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 22:07:35,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:35,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:35,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:35,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 22:07:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:35,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:35,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:35,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:35,432 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 93 proven. 27 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2020-08-22 22:07:35,432 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1601140454] [2020-08-22 22:07:35,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:07:35,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-22 22:07:35,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244819509] [2020-08-22 22:07:35,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-22 22:07:35,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:07:35,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-22 22:07:35,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-08-22 22:07:35,435 INFO L87 Difference]: Start difference. First operand 135 states and 170 transitions. Second operand 11 states. [2020-08-22 22:07:35,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:07:35,674 INFO L93 Difference]: Finished difference Result 265 states and 353 transitions. [2020-08-22 22:07:35,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-22 22:07:35,675 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 122 [2020-08-22 22:07:35,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:07:35,677 INFO L225 Difference]: With dead ends: 265 [2020-08-22 22:07:35,677 INFO L226 Difference]: Without dead ends: 142 [2020-08-22 22:07:35,679 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2020-08-22 22:07:35,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-08-22 22:07:35,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2020-08-22 22:07:35,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-08-22 22:07:35,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 178 transitions. [2020-08-22 22:07:35,697 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 178 transitions. Word has length 122 [2020-08-22 22:07:35,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:07:35,697 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 178 transitions. [2020-08-22 22:07:35,698 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-22 22:07:35,698 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 178 transitions. [2020-08-22 22:07:35,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-08-22 22:07:35,700 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:07:35,701 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 22:07:35,701 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-08-22 22:07:35,701 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:07:35,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:07:35,702 INFO L82 PathProgramCache]: Analyzing trace with hash -88380307, now seen corresponding path program 5 times [2020-08-22 22:07:35,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:07:35,702 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1291190905] [2020-08-22 22:07:35,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:07:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:35,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:07:35,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:35,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:07:35,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:35,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:35,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:35,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:35,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:35,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:35,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:35,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:35,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:35,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:35,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:35,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:07:35,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:35,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 22:07:35,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:35,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:35,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:35,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:35,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:35,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 22:07:35,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:35,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:35,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:35,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:35,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:35,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:07:35,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:35,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-08-22 22:07:35,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:36,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:36,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:36,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:36,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:36,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:07:36,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:36,109 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 179 proven. 163 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2020-08-22 22:07:36,109 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1291190905] [2020-08-22 22:07:36,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:07:36,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-08-22 22:07:36,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746352737] [2020-08-22 22:07:36,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-08-22 22:07:36,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:07:36,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-08-22 22:07:36,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-08-22 22:07:36,112 INFO L87 Difference]: Start difference. First operand 142 states and 178 transitions. Second operand 14 states. [2020-08-22 22:07:36,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:07:36,528 INFO L93 Difference]: Finished difference Result 278 states and 369 transitions. [2020-08-22 22:07:36,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-08-22 22:07:36,528 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 193 [2020-08-22 22:07:36,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:07:36,529 INFO L225 Difference]: With dead ends: 278 [2020-08-22 22:07:36,529 INFO L226 Difference]: Without dead ends: 0 [2020-08-22 22:07:36,532 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2020-08-22 22:07:36,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-08-22 22:07:36,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-08-22 22:07:36,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-08-22 22:07:36,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-08-22 22:07:36,533 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 193 [2020-08-22 22:07:36,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:07:36,533 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-08-22 22:07:36,533 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-08-22 22:07:36,533 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-08-22 22:07:36,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-08-22 22:07:36,534 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-08-22 22:07:36,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-08-22 22:07:40,727 WARN L193 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 35 [2020-08-22 22:07:40,932 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 21 [2020-08-22 22:07:41,214 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 21 [2020-08-22 22:07:42,077 WARN L193 SmtUtils]: Spent 812.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 36 [2020-08-22 22:07:42,352 WARN L193 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 28 [2020-08-22 22:07:42,875 WARN L193 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 35 [2020-08-22 22:07:43,142 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 36 [2020-08-22 22:07:43,496 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 36 [2020-08-22 22:07:43,872 WARN L193 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 41 [2020-08-22 22:07:44,397 WARN L193 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 38 [2020-08-22 22:07:44,920 WARN L193 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 38 [2020-08-22 22:07:45,326 WARN L193 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 26 [2020-08-22 22:07:46,124 WARN L193 SmtUtils]: Spent 795.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 36 [2020-08-22 22:07:46,376 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 26 [2020-08-22 22:07:47,034 WARN L193 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 47 [2020-08-22 22:07:47,469 WARN L193 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 33 [2020-08-22 22:07:47,523 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-08-22 22:07:47,524 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-08-22 22:07:47,524 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-08-22 22:07:47,524 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-08-22 22:07:47,524 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-08-22 22:07:47,524 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-08-22 22:07:47,524 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) the Hoare annotation is: false [2020-08-22 22:07:47,525 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 35 42) the Hoare annotation is: true [2020-08-22 22:07:47,525 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 35 42) the Hoare annotation is: (<= 5 main_~x~0) [2020-08-22 22:07:47,525 INFO L264 CegarLoopResult]: At program point mainFINAL(lines 35 42) the Hoare annotation is: (<= 5 main_~x~0) [2020-08-22 22:07:47,525 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: false [2020-08-22 22:07:47,526 INFO L264 CegarLoopResult]: At program point L38(lines 38 40) the Hoare annotation is: (and (<= main_~x~0 5) (<= 5 main_~x~0) (<= 5 main_~result~0) (<= main_~result~0 5)) [2020-08-22 22:07:47,526 INFO L264 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (<= main_~x~0 5) (<= 5 main_~x~0)) [2020-08-22 22:07:47,526 INFO L264 CegarLoopResult]: At program point L37-1(line 37) the Hoare annotation is: (and (<= main_~x~0 5) (<= 5 |main_#t~ret4|) (<= 5 main_~x~0) (<= |main_#t~ret4| 5)) [2020-08-22 22:07:47,526 INFO L264 CegarLoopResult]: At program point L38-2(lines 38 40) the Hoare annotation is: (<= 5 main_~x~0) [2020-08-22 22:07:47,526 INFO L264 CegarLoopResult]: At program point L37-2(line 37) the Hoare annotation is: (and (<= main_~x~0 5) (<= 5 |main_#t~ret4|) (<= 5 main_~x~0) (<= |main_#t~ret4| 5)) [2020-08-22 22:07:47,526 INFO L264 CegarLoopResult]: At program point L37-3(line 37) the Hoare annotation is: (and (<= main_~x~0 5) (<= 5 |main_#t~ret4|) (<= 5 main_~x~0) (<= 5 main_~result~0) (<= |main_#t~ret4| 5) (<= main_~result~0 5)) [2020-08-22 22:07:47,527 INFO L271 CegarLoopResult]: At program point fibo2ENTRY(lines 17 25) the Hoare annotation is: true [2020-08-22 22:07:47,527 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (not (<= |fibo2_#in~n| 1))) [2020-08-22 22:07:47,527 INFO L264 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (or (and (<= |fibo2_#t~ret2| 1) (<= 1 |fibo2_#t~ret2|) (<= |fibo2_#in~n| 2)) (and (<= 4 fibo2_~n) (<= 2 |fibo2_#t~ret2|) (<= |fibo2_#t~ret2| 2)) (<= 5 |fibo2_#in~n|)) (not (<= |fibo2_#in~n| 1))) [2020-08-22 22:07:47,527 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (not (<= 2 |fibo2_#in~n|)) (< 0 fibo2_~n)) [2020-08-22 22:07:47,527 INFO L264 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (or (and (<= |fibo2_#t~ret2| 1) (<= 1 |fibo2_#t~ret2|) (<= |fibo2_#in~n| 2)) (and (<= 4 fibo2_~n) (<= 2 |fibo2_#t~ret2|) (<= |fibo2_#t~ret2| 2)) (<= 5 |fibo2_#in~n|)) (not (<= |fibo2_#in~n| 1))) [2020-08-22 22:07:47,527 INFO L264 CegarLoopResult]: At program point L20(lines 20 24) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (< 0 fibo2_~n)) [2020-08-22 22:07:47,528 INFO L264 CegarLoopResult]: At program point L23-3(line 23) the Hoare annotation is: (let ((.cse1 (<= |fibo2_#t~ret2| 1)) (.cse3 (<= 1 |fibo2_#t~ret2|)) (.cse0 (+ |fibo2_#t~ret3| |fibo2_#t~ret2|)) (.cse2 (= fibo2_~n |fibo2_#in~n|))) (and (or (and (<= 1 .cse0) (<= .cse0 1) .cse1 .cse2 .cse3 (<= 2 |fibo2_#in~n|)) (not (<= |fibo2_#in~n| 2))) (or (and (<= .cse0 3) (<= 2 |fibo2_#t~ret2|) (<= 4 fibo2_~n) (<= |fibo2_#t~ret2| 2) .cse2 (<= 3 .cse0)) (and (<= |fibo2_#in~n| 3) (<= .cse0 2) .cse1 .cse2 .cse3 (<= 2 .cse0)) (not (<= 3 |fibo2_#in~n|)) (and .cse2 (<= 5 |fibo2_#in~n|))))) [2020-08-22 22:07:47,528 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (<= |fibo2_#in~n| 0)) [2020-08-22 22:07:47,528 INFO L264 CegarLoopResult]: At program point L23-4(line 23) the Hoare annotation is: (let ((.cse1 (<= |fibo2_#t~ret2| 1)) (.cse3 (<= 1 |fibo2_#t~ret2|)) (.cse0 (+ |fibo2_#t~ret3| |fibo2_#t~ret2|)) (.cse2 (= fibo2_~n |fibo2_#in~n|))) (and (or (and (<= 1 .cse0) (<= .cse0 1) .cse1 .cse2 .cse3 (<= 2 |fibo2_#in~n|)) (not (<= |fibo2_#in~n| 2))) (or (and (<= .cse0 3) (<= 2 |fibo2_#t~ret2|) (<= 4 fibo2_~n) (<= |fibo2_#t~ret2| 2) .cse2 (<= 3 .cse0)) (and (<= |fibo2_#in~n| 3) (<= .cse0 2) .cse1 .cse2 .cse3 (<= 2 .cse0)) (not (<= 3 |fibo2_#in~n|)) (and .cse2 (<= 5 |fibo2_#in~n|))))) [2020-08-22 22:07:47,528 INFO L264 CegarLoopResult]: At program point L18(lines 18 24) the Hoare annotation is: (= fibo2_~n |fibo2_#in~n|) [2020-08-22 22:07:47,529 INFO L264 CegarLoopResult]: At program point L23-5(line 23) the Hoare annotation is: (and (let ((.cse0 (+ |fibo2_#t~ret3| |fibo2_#t~ret2|)) (.cse1 (<= |fibo2_#t~ret2| 1)) (.cse2 (<= 1 |fibo2_#t~ret2|))) (or (and (<= |fibo2_#in~n| 3) (<= .cse0 2) (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|) (<= 3 fibo2_~n) .cse1 .cse2 (<= 2 .cse0)) (and (<= 4 |fibo2_#in~n|) (<= .cse0 3) (<= 2 |fibo2_#t~ret2|) (<= 3 |fibo2_#res|) (<= |fibo2_#t~ret2| 2) (<= |fibo2_#res| 3) (<= 3 .cse0)) (and (<= 1 .cse0) (<= .cse0 1) (<= 1 |fibo2_#res|) .cse1 (<= |fibo2_#res| 1) .cse2 (<= |fibo2_#in~n| 2)) (<= 5 |fibo2_#in~n|))) (= fibo2_~n |fibo2_#in~n|) (not (<= |fibo2_#in~n| 1))) [2020-08-22 22:07:47,529 INFO L264 CegarLoopResult]: At program point L23-6(line 23) the Hoare annotation is: (and (or (not (<= |fibo2_#in~n| 4)) (and (<= |fibo2_#in~n| 3) (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|) (<= 3 fibo2_~n)) (and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1) (<= |fibo2_#in~n| 2)) (and (<= 4 fibo2_~n) (<= |fibo2_#res| 3) (<= 3 |fibo2_#res|))) (= fibo2_~n |fibo2_#in~n|) (not (<= |fibo2_#in~n| 1))) [2020-08-22 22:07:47,529 INFO L264 CegarLoopResult]: At program point fibo2FINAL(lines 17 25) the Hoare annotation is: (and (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= 4 fibo2_~n) (<= |fibo2_#res| 3) .cse0 (<= 3 |fibo2_#res|)) (and .cse0 (<= |fibo2_#in~n| 0)) (and (<= |fibo2_#in~n| 3) (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|) (<= 3 fibo2_~n) .cse0) (and .cse0 (<= 5 |fibo2_#in~n|)) (and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1) .cse0 (<= |fibo2_#in~n| 2)))) (or (and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|)) (< 0 fibo2_~n))) [2020-08-22 22:07:47,529 INFO L264 CegarLoopResult]: At program point fibo2EXIT(lines 17 25) the Hoare annotation is: (and (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= 4 fibo2_~n) (<= |fibo2_#res| 3) .cse0 (<= 3 |fibo2_#res|)) (and .cse0 (<= |fibo2_#in~n| 0)) (and (<= |fibo2_#in~n| 3) (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|) (<= 3 fibo2_~n) .cse0) (and .cse0 (<= 5 |fibo2_#in~n|)) (and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1) .cse0 (<= |fibo2_#in~n| 2)))) (or (and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|)) (< 0 fibo2_~n))) [2020-08-22 22:07:47,529 INFO L271 CegarLoopResult]: At program point fibo1ENTRY(lines 7 15) the Hoare annotation is: true [2020-08-22 22:07:47,530 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (<= 2 |fibo1_#in~n|) (= fibo1_~n |fibo1_#in~n|)) [2020-08-22 22:07:47,530 INFO L264 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (and (<= 2 |fibo1_#in~n|) (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 3 |fibo1_#t~ret0|) (<= 5 fibo1_~n) .cse0 (<= |fibo1_#t~ret0| 3)) (and .cse0 (<= 6 fibo1_~n)) (and (<= fibo1_~n 4) (<= 4 |fibo1_#in~n|) .cse0) (and (<= |fibo1_#in~n| 3) (<= |fibo1_#t~ret0| 1) (<= 1 |fibo1_#t~ret0|) .cse0)))) [2020-08-22 22:07:47,530 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (<= |fibo1_#in~n| 1) (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n)) [2020-08-22 22:07:47,530 INFO L264 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (and (<= 2 |fibo1_#in~n|) (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 3 |fibo1_#t~ret0|) (<= 5 fibo1_~n) .cse0 (<= |fibo1_#t~ret0| 3)) (and .cse0 (<= 6 fibo1_~n)) (and (<= fibo1_~n 4) (<= 4 |fibo1_#in~n|) .cse0) (and (<= |fibo1_#in~n| 3) (<= |fibo1_#t~ret0| 1) (<= 1 |fibo1_#t~ret0|) .cse0)))) [2020-08-22 22:07:47,530 INFO L264 CegarLoopResult]: At program point fibo1FINAL(lines 7 15) the Hoare annotation is: (and (or (and (<= |fibo1_#in~n| 2) (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|)) (<= |fibo1_#in~n| 0) (and (or (<= fibo1_~n 4) (and (<= 5 |fibo1_#res|) (<= |fibo1_#res| 5))) (<= 4 |fibo1_#in~n|)) (and (<= 2 |fibo1_#res|) (<= |fibo1_#in~n| 3) (<= |fibo1_#res| 2) (<= 3 |fibo1_#in~n|)) (<= 6 fibo1_~n)) (= fibo1_~n |fibo1_#in~n|) (or (and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0)) (< 0 fibo1_~n))) [2020-08-22 22:07:47,530 INFO L264 CegarLoopResult]: At program point L10(lines 10 14) the Hoare annotation is: (and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n)) [2020-08-22 22:07:47,530 INFO L264 CegarLoopResult]: At program point L13-3(line 13) the Hoare annotation is: (let ((.cse2 (<= |fibo1_#t~ret0| 1)) (.cse3 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (.cse4 (<= 1 |fibo1_#t~ret0|)) (.cse0 (= fibo1_~n |fibo1_#in~n|))) (let ((.cse1 (and (<= .cse3 1) .cse2 (<= 1 .cse3) (<= |fibo1_#in~n| 2) .cse4 .cse0))) (and (or (and .cse0 (<= 3 |fibo1_#in~n|)) .cse1) (not (<= |fibo1_#in~n| 1)) (or (and .cse2 (<= .cse3 2) .cse4 (<= 2 .cse3)) (not (<= |fibo1_#in~n| 3)) .cse1) (or (<= fibo1_~n 4) (<= 6 fibo1_~n) (and (<= .cse3 5) (<= 3 |fibo1_#t~ret0|) (<= 5 .cse3) (<= |fibo1_#t~ret0| 3)))))) [2020-08-22 22:07:47,530 INFO L264 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (and (<= |fibo1_#in~n| 0) (= fibo1_~n |fibo1_#in~n|)) [2020-08-22 22:07:47,531 INFO L264 CegarLoopResult]: At program point L13-4(line 13) the Hoare annotation is: (let ((.cse2 (<= |fibo1_#t~ret0| 1)) (.cse3 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (.cse4 (<= 1 |fibo1_#t~ret0|)) (.cse0 (= fibo1_~n |fibo1_#in~n|))) (let ((.cse1 (and (<= .cse3 1) .cse2 (<= 1 .cse3) (<= |fibo1_#in~n| 2) .cse4 .cse0))) (and (or (and .cse0 (<= 3 |fibo1_#in~n|)) .cse1) (not (<= |fibo1_#in~n| 1)) (or (and .cse2 (<= .cse3 2) .cse4 (<= 2 .cse3)) (not (<= |fibo1_#in~n| 3)) .cse1) (or (<= fibo1_~n 4) (<= 6 fibo1_~n) (and (<= .cse3 5) (<= 3 |fibo1_#t~ret0|) (<= 5 .cse3) (<= |fibo1_#t~ret0| 3)))))) [2020-08-22 22:07:47,531 INFO L264 CegarLoopResult]: At program point L8(lines 8 14) the Hoare annotation is: (= fibo1_~n |fibo1_#in~n|) [2020-08-22 22:07:47,531 INFO L264 CegarLoopResult]: At program point L13-5(line 13) the Hoare annotation is: (let ((.cse0 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (.cse3 (<= 3 |fibo1_#in~n|))) (and (let ((.cse1 (<= |fibo1_#t~ret0| 1)) (.cse2 (<= 1 |fibo1_#t~ret0|))) (or (and (<= .cse0 1) .cse1 (<= 1 .cse0) (<= |fibo1_#in~n| 2) .cse2 (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|)) (and (<= 2 |fibo1_#res|) .cse1 (<= .cse0 2) .cse2 (<= |fibo1_#res| 2) (<= 2 .cse0) .cse3) (<= 4 |fibo1_#in~n|))) (let ((.cse4 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse4 (<= 6 fibo1_~n)) (and (<= .cse0 5) (<= 3 |fibo1_#t~ret0|) (<= 5 |fibo1_#res|) (<= |fibo1_#res| 5) .cse4 (<= 5 .cse0) (<= |fibo1_#t~ret0| 3)) (and (<= fibo1_~n 4) .cse4 .cse3) (and (<= |fibo1_#in~n| 3) (< 1 fibo1_~n) .cse4))))) [2020-08-22 22:07:47,531 INFO L264 CegarLoopResult]: At program point L13-6(line 13) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (let ((.cse1 (and (<= |fibo1_#in~n| 2) .cse0 (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|)))) (and (not (<= |fibo1_#in~n| 1)) (or (and .cse0 (<= 6 fibo1_~n)) (and (or (<= fibo1_~n 4) (and (<= 5 |fibo1_#res|) (<= |fibo1_#res| 5))) (<= 4 |fibo1_#in~n|) .cse0) (and (<= 2 |fibo1_#res|) (<= |fibo1_#in~n| 3) (<= |fibo1_#res| 2) .cse0) .cse1) (or .cse1 (<= 3 |fibo1_#in~n|))))) [2020-08-22 22:07:47,532 INFO L264 CegarLoopResult]: At program point fibo1EXIT(lines 7 15) the Hoare annotation is: (and (or (and (<= |fibo1_#in~n| 2) (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|)) (<= |fibo1_#in~n| 0) (and (or (<= fibo1_~n 4) (and (<= 5 |fibo1_#res|) (<= |fibo1_#res| 5))) (<= 4 |fibo1_#in~n|)) (and (<= 2 |fibo1_#res|) (<= |fibo1_#in~n| 3) (<= |fibo1_#res| 2) (<= 3 |fibo1_#in~n|)) (<= 6 fibo1_~n)) (= fibo1_~n |fibo1_#in~n|) (or (and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0)) (< 0 fibo1_~n))) [2020-08-22 22:07:47,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 10:07:47 BoogieIcfgContainer [2020-08-22 22:07:47,552 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-22 22:07:47,554 INFO L168 Benchmark]: Toolchain (without parser) took 20482.27 ms. Allocated memory was 136.3 MB in the beginning and 533.2 MB in the end (delta: 396.9 MB). Free memory was 100.3 MB in the beginning and 350.6 MB in the end (delta: -250.3 MB). Peak memory consumption was 395.7 MB. Max. memory is 7.1 GB. [2020-08-22 22:07:47,555 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 136.3 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-08-22 22:07:47,555 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.36 ms. Allocated memory is still 136.3 MB. Free memory was 100.1 MB in the beginning and 90.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-08-22 22:07:47,556 INFO L168 Benchmark]: Boogie Preprocessor took 128.85 ms. Allocated memory was 136.3 MB in the beginning and 199.2 MB in the end (delta: 62.9 MB). Free memory was 90.0 MB in the beginning and 177.8 MB in the end (delta: -87.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2020-08-22 22:07:47,557 INFO L168 Benchmark]: RCFGBuilder took 264.72 ms. Allocated memory is still 199.2 MB. Free memory was 177.1 MB in the beginning and 163.1 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-08-22 22:07:47,558 INFO L168 Benchmark]: TraceAbstraction took 19827.43 ms. Allocated memory was 199.2 MB in the beginning and 533.2 MB in the end (delta: 334.0 MB). Free memory was 162.4 MB in the beginning and 350.6 MB in the end (delta: -188.3 MB). Peak memory consumption was 394.8 MB. Max. memory is 7.1 GB. [2020-08-22 22:07:47,561 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.19 ms. Allocated memory is still 136.3 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 256.36 ms. Allocated memory is still 136.3 MB. Free memory was 100.1 MB in the beginning and 90.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 128.85 ms. Allocated memory was 136.3 MB in the beginning and 199.2 MB in the end (delta: 62.9 MB). Free memory was 90.0 MB in the beginning and 177.8 MB in the end (delta: -87.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 264.72 ms. Allocated memory is still 199.2 MB. Free memory was 177.1 MB in the beginning and 163.1 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19827.43 ms. Allocated memory was 199.2 MB in the beginning and 533.2 MB in the end (delta: 334.0 MB). Free memory was 162.4 MB in the beginning and 350.6 MB in the end (delta: -188.3 MB). Peak memory consumption was 394.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 35]: Procedure Contract for main Derived contract for procedure main: 5 <= x - ProcedureContractResult [Line: 17]: Procedure Contract for fibo2 Derived contract for procedure fibo2: (((((((4 <= n && \result <= 3) && n == \old(n)) && 3 <= \result) || (n == \old(n) && \old(n) <= 0)) || ((((\old(n) <= 3 && \result <= 2) && 2 <= \result) && 3 <= n) && n == \old(n))) || (n == \old(n) && 5 <= \old(n))) || (((1 <= \result && \result <= 1) && n == \old(n)) && \old(n) <= 2)) && ((\result <= 0 && 0 <= \result) || 0 < n) - ProcedureContractResult [Line: 7]: Procedure Contract for fibo1 Derived contract for procedure fibo1: (((((((\old(n) <= 2 && \result <= 1) && 1 <= \result) || \old(n) <= 0) || ((n <= 4 || (5 <= \result && \result <= 5)) && 4 <= \old(n))) || (((2 <= \result && \old(n) <= 3) && \result <= 2) && 3 <= \old(n))) || 6 <= n) && n == \old(n)) && ((0 <= \result && \result <= 0) || 0 < n) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 8.7s, OverallIterations: 16, TraceHistogramMax: 11, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 10.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 764 SDtfs, 779 SDslu, 4692 SDs, 0 SdLazy, 3095 SolverSat, 279 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 588 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 112 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 2355 PreInvPairs, 4959 NumberOfFragments, 1281 HoareAnnotationTreeSize, 2355 FomulaSimplifications, 140603 FormulaSimplificationTreeSizeReduction, 3.5s HoareSimplificationTime, 45 FomulaSimplificationsInter, 43035 FormulaSimplificationTreeSizeReductionInter, 7.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1390 NumberOfCodeBlocks, 1390 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1374 ConstructedInterpolants, 0 QuantifiedInterpolants, 351354 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 2 PerfectInterpolantSequences, 1678/2437 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 correct! Received shutdown request...