/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 -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 18:47:29,720 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 18:47:29,724 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 18:47:29,770 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 18:47:29,770 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 18:47:29,782 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 18:47:29,784 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 18:47:29,787 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 18:47:29,789 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 18:47:29,793 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 18:47:29,793 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 18:47:29,796 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 18:47:29,796 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 18:47:29,801 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 18:47:29,802 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 18:47:29,803 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 18:47:29,803 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 18:47:29,804 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 18:47:29,805 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 18:47:29,807 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 18:47:29,808 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 18:47:29,809 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 18:47:29,810 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 18:47:29,811 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 18:47:29,813 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 18:47:29,813 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 18:47:29,814 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 18:47:29,814 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 18:47:29,815 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 18:47:29,816 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 18:47:29,816 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 18:47:29,816 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 18:47:29,817 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 18:47:29,818 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 18:47:29,819 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 18:47:29,819 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 18:47:29,820 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 18:47:29,820 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 18:47:29,820 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 18:47:29,821 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 18:47:29,822 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 18:47:29,822 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 18:47:29,832 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 18:47:29,833 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 18:47:29,834 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 18:47:29,834 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 18:47:29,834 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 18:47:29,835 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 18:47:29,835 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 18:47:29,835 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 18:47:29,835 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 18:47:29,835 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 18:47:29,836 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 18:47:29,836 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 18:47:29,836 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 18:47:29,836 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 18:47:29,837 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 18:47:29,837 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-08-22 18:47:29,837 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 18:47:29,837 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 18:47:29,837 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 18:47:29,838 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 18:47:29,838 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-08-22 18:47:29,838 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 18:47:29,838 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-08-22 18:47:30,130 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 18:47:30,144 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 18:47:30,148 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 18:47:30,150 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 18:47:30,150 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 18:47:30,151 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 18:47:30,236 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7d73a7ef/87a2f5515f1643b1a9eb730a7a1ab6d3/FLAG0a8fea7fe [2020-08-22 18:47:30,699 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 18:47:30,700 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_5-1.c [2020-08-22 18:47:30,708 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7d73a7ef/87a2f5515f1643b1a9eb730a7a1ab6d3/FLAG0a8fea7fe [2020-08-22 18:47:31,112 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7d73a7ef/87a2f5515f1643b1a9eb730a7a1ab6d3 [2020-08-22 18:47:31,123 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 18:47:31,125 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 18:47:31,127 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 18:47:31,127 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 18:47:31,131 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 18:47:31,132 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 06:47:31" (1/1) ... [2020-08-22 18:47:31,135 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a007d47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:47:31, skipping insertion in model container [2020-08-22 18:47:31,135 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 06:47:31" (1/1) ... [2020-08-22 18:47:31,143 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 18:47:31,165 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 18:47:31,336 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 18:47:31,340 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 18:47:31,360 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 18:47:31,373 INFO L208 MainTranslator]: Completed translation [2020-08-22 18:47:31,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:47:31 WrapperNode [2020-08-22 18:47:31,373 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 18:47:31,374 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 18:47:31,374 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 18:47:31,375 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 18:47:31,386 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:47:31" (1/1) ... [2020-08-22 18:47:31,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:47:31" (1/1) ... [2020-08-22 18:47:31,488 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:47:31" (1/1) ... [2020-08-22 18:47:31,488 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:47:31" (1/1) ... [2020-08-22 18:47:31,492 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:47:31" (1/1) ... [2020-08-22 18:47:31,494 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:47:31" (1/1) ... [2020-08-22 18:47:31,495 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:47:31" (1/1) ... [2020-08-22 18:47:31,497 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 18:47:31,497 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 18:47:31,497 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 18:47:31,498 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 18:47:31,498 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:47:31" (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 18:47:31,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 18:47:31,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 18:47:31,578 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-08-22 18:47:31,578 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-08-22 18:47:31,578 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 18:47:31,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-22 18:47:31,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 18:47:31,579 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-08-22 18:47:31,579 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-08-22 18:47:31,579 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 18:47:31,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 18:47:31,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 18:47:31,806 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 18:47:31,807 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-22 18:47:31,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 06:47:31 BoogieIcfgContainer [2020-08-22 18:47:31,816 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 18:47:31,830 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 18:47:31,830 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 18:47:31,843 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 18:47:31,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 06:47:31" (1/3) ... [2020-08-22 18:47:31,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726b9073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 06:47:31, skipping insertion in model container [2020-08-22 18:47:31,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:47:31" (2/3) ... [2020-08-22 18:47:31,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726b9073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 06:47:31, skipping insertion in model container [2020-08-22 18:47:31,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 06:47:31" (3/3) ... [2020-08-22 18:47:31,854 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_5-1.c [2020-08-22 18:47:31,881 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-22 18:47:31,898 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 18:47:31,913 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 18:47:31,944 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 18:47:31,945 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 18:47:31,945 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-08-22 18:47:31,945 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 18:47:31,946 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 18:47:31,946 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 18:47:31,946 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 18:47:31,946 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 18:47:31,962 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2020-08-22 18:47:31,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-08-22 18:47:31,974 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:47:31,975 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 18:47:31,975 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:47:31,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:47:31,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1089710179, now seen corresponding path program 1 times [2020-08-22 18:47:31,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:47:31,990 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1024798245] [2020-08-22 18:47:31,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:47:32,051 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:47:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:32,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:47:32,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:32,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 18:47:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:32,205 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 18:47:32,207 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1024798245] [2020-08-22 18:47:32,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:47:32,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 18:47:32,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943837591] [2020-08-22 18:47:32,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 18:47:32,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:47:32,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 18:47:32,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 18:47:32,243 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 5 states. [2020-08-22 18:47:32,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:47:32,416 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2020-08-22 18:47:32,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 18:47:32,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-08-22 18:47:32,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:47:32,438 INFO L225 Difference]: With dead ends: 58 [2020-08-22 18:47:32,438 INFO L226 Difference]: Without dead ends: 42 [2020-08-22 18:47:32,442 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 18:47:32,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-08-22 18:47:32,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-08-22 18:47:32,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-08-22 18:47:32,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-08-22 18:47:32,500 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 16 [2020-08-22 18:47:32,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:47:32,501 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-08-22 18:47:32,501 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 18:47:32,501 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-08-22 18:47:32,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-08-22 18:47:32,504 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:47:32,504 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 18:47:32,505 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 18:47:32,505 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:47:32,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:47:32,506 INFO L82 PathProgramCache]: Analyzing trace with hash -653728005, now seen corresponding path program 1 times [2020-08-22 18:47:32,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:47:32,506 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2021244187] [2020-08-22 18:47:32,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:47:32,509 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:47:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:32,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:47:32,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:32,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 18:47:32,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:32,578 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 18:47:32,579 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2021244187] [2020-08-22 18:47:32,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:47:32,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 18:47:32,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936628301] [2020-08-22 18:47:32,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 18:47:32,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:47:32,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 18:47:32,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 18:47:32,582 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 5 states. [2020-08-22 18:47:32,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:47:32,654 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2020-08-22 18:47:32,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 18:47:32,655 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-08-22 18:47:32,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:47:32,658 INFO L225 Difference]: With dead ends: 50 [2020-08-22 18:47:32,658 INFO L226 Difference]: Without dead ends: 44 [2020-08-22 18:47:32,660 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 18:47:32,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-08-22 18:47:32,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-08-22 18:47:32,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-08-22 18:47:32,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-08-22 18:47:32,675 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 17 [2020-08-22 18:47:32,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:47:32,675 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-08-22 18:47:32,675 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 18:47:32,676 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-08-22 18:47:32,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-08-22 18:47:32,678 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:47:32,679 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 18:47:32,679 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 18:47:32,679 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:47:32,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:47:32,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1617834856, now seen corresponding path program 1 times [2020-08-22 18:47:32,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:47:32,680 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [103940315] [2020-08-22 18:47:32,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:47:32,683 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:47:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:32,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:47:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:32,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 18:47:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:32,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:32,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:32,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 18:47:32,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:32,863 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 18:47:32,863 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [103940315] [2020-08-22 18:47:32,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:47:32,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-22 18:47:32,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659007843] [2020-08-22 18:47:32,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 18:47:32,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:47:32,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 18:47:32,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-22 18:47:32,866 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 7 states. [2020-08-22 18:47:32,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:47:32,979 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2020-08-22 18:47:32,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-22 18:47:32,980 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-08-22 18:47:32,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:47:32,982 INFO L225 Difference]: With dead ends: 82 [2020-08-22 18:47:32,983 INFO L226 Difference]: Without dead ends: 46 [2020-08-22 18:47:32,984 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 18:47:32,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-08-22 18:47:32,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2020-08-22 18:47:32,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-08-22 18:47:32,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2020-08-22 18:47:32,999 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 33 [2020-08-22 18:47:33,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:47:33,000 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2020-08-22 18:47:33,000 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 18:47:33,000 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2020-08-22 18:47:33,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-08-22 18:47:33,002 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:47:33,003 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 18:47:33,003 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-22 18:47:33,003 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:47:33,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:47:33,004 INFO L82 PathProgramCache]: Analyzing trace with hash 887160861, now seen corresponding path program 1 times [2020-08-22 18:47:33,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:47:33,005 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1653580880] [2020-08-22 18:47:33,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:47:33,007 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:47:33,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:33,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:47:33,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:33,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 18:47:33,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:33,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:33,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:33,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:47:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:33,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-08-22 18:47:33,131 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1653580880] [2020-08-22 18:47:33,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:47:33,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-22 18:47:33,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139396075] [2020-08-22 18:47:33,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 18:47:33,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:47:33,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 18:47:33,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-08-22 18:47:33,133 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 7 states. [2020-08-22 18:47:33,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:47:33,316 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2020-08-22 18:47:33,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-22 18:47:33,317 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2020-08-22 18:47:33,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:47:33,320 INFO L225 Difference]: With dead ends: 74 [2020-08-22 18:47:33,320 INFO L226 Difference]: Without dead ends: 68 [2020-08-22 18:47:33,321 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 18:47:33,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-08-22 18:47:33,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2020-08-22 18:47:33,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-08-22 18:47:33,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2020-08-22 18:47:33,339 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 34 [2020-08-22 18:47:33,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:47:33,339 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2020-08-22 18:47:33,339 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 18:47:33,340 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2020-08-22 18:47:33,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-08-22 18:47:33,342 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:47:33,343 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 18:47:33,343 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-22 18:47:33,343 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:47:33,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:47:33,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1875452576, now seen corresponding path program 1 times [2020-08-22 18:47:33,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:47:33,344 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [136694675] [2020-08-22 18:47:33,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:47:33,347 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:47:33,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:33,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:47:33,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:33,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 18:47:33,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:33,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:33,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:33,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:33,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 18:47:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:33,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 18:47:33,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:33,490 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-08-22 18:47:33,491 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [136694675] [2020-08-22 18:47:33,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:47:33,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-08-22 18:47:33,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174651445] [2020-08-22 18:47:33,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-22 18:47:33,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:47:33,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-22 18:47:33,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-22 18:47:33,494 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand 6 states. [2020-08-22 18:47:33,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:47:33,610 INFO L93 Difference]: Finished difference Result 130 states and 178 transitions. [2020-08-22 18:47:33,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-22 18:47:33,611 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2020-08-22 18:47:33,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:47:33,615 INFO L225 Difference]: With dead ends: 130 [2020-08-22 18:47:33,616 INFO L226 Difference]: Without dead ends: 70 [2020-08-22 18:47:33,618 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 18:47:33,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-08-22 18:47:33,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-08-22 18:47:33,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-08-22 18:47:33,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2020-08-22 18:47:33,650 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 50 [2020-08-22 18:47:33,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:47:33,651 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2020-08-22 18:47:33,651 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-22 18:47:33,651 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2020-08-22 18:47:33,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-08-22 18:47:33,657 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:47:33,657 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 18:47:33,657 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-22 18:47:33,660 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:47:33,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:47:33,661 INFO L82 PathProgramCache]: Analyzing trace with hash 104828256, now seen corresponding path program 1 times [2020-08-22 18:47:33,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:47:33,662 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1290110612] [2020-08-22 18:47:33,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:47:33,666 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:47:33,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:33,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:47:33,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:33,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 18:47:33,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:33,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:33,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:33,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:33,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:33,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:47:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:33,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:47:33,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:33,819 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-08-22 18:47:33,820 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1290110612] [2020-08-22 18:47:33,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:47:33,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-08-22 18:47:33,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120934934] [2020-08-22 18:47:33,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-22 18:47:33,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:47:33,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-22 18:47:33,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-08-22 18:47:33,822 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand 8 states. [2020-08-22 18:47:33,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:47:33,931 INFO L93 Difference]: Finished difference Result 142 states and 197 transitions. [2020-08-22 18:47:33,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-22 18:47:33,932 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-08-22 18:47:33,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:47:33,934 INFO L225 Difference]: With dead ends: 142 [2020-08-22 18:47:33,934 INFO L226 Difference]: Without dead ends: 78 [2020-08-22 18:47:33,936 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 18:47:33,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-08-22 18:47:33,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2020-08-22 18:47:33,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-08-22 18:47:33,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2020-08-22 18:47:33,953 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 51 [2020-08-22 18:47:33,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:47:33,954 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2020-08-22 18:47:33,954 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-22 18:47:33,954 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2020-08-22 18:47:33,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-08-22 18:47:33,956 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:47:33,956 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 18:47:33,957 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-22 18:47:33,957 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:47:33,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:47:33,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1703786405, now seen corresponding path program 1 times [2020-08-22 18:47:33,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:47:33,958 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1309784373] [2020-08-22 18:47:33,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:47:33,960 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:47:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:33,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:47:33,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:33,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 18:47:33,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:34,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:34,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:34,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:34,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:47:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:34,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:47:34,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:34,092 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-08-22 18:47:34,093 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1309784373] [2020-08-22 18:47:34,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:47:34,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-08-22 18:47:34,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578321662] [2020-08-22 18:47:34,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-22 18:47:34,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:47:34,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-22 18:47:34,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-08-22 18:47:34,096 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand 8 states. [2020-08-22 18:47:34,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:47:34,302 INFO L93 Difference]: Finished difference Result 118 states and 158 transitions. [2020-08-22 18:47:34,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-22 18:47:34,302 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2020-08-22 18:47:34,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:47:34,305 INFO L225 Difference]: With dead ends: 118 [2020-08-22 18:47:34,305 INFO L226 Difference]: Without dead ends: 112 [2020-08-22 18:47:34,306 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 18:47:34,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-08-22 18:47:34,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2020-08-22 18:47:34,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-08-22 18:47:34,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 145 transitions. [2020-08-22 18:47:34,328 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 145 transitions. Word has length 52 [2020-08-22 18:47:34,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:47:34,328 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 145 transitions. [2020-08-22 18:47:34,328 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-22 18:47:34,328 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 145 transitions. [2020-08-22 18:47:34,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-08-22 18:47:34,331 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:47:34,331 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 18:47:34,331 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-22 18:47:34,331 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:47:34,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:47:34,332 INFO L82 PathProgramCache]: Analyzing trace with hash -521446491, now seen corresponding path program 1 times [2020-08-22 18:47:34,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:47:34,333 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [938438059] [2020-08-22 18:47:34,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:47:34,335 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:47:34,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:34,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:47:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:34,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 18:47:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:34,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:34,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:34,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:34,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:34,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:47:34,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:34,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:47:34,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:34,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-08-22 18:47:34,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:34,477 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-08-22 18:47:34,478 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [938438059] [2020-08-22 18:47:34,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:47:34,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-08-22 18:47:34,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062842564] [2020-08-22 18:47:34,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-22 18:47:34,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:47:34,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-22 18:47:34,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-08-22 18:47:34,480 INFO L87 Difference]: Start difference. First operand 106 states and 145 transitions. Second operand 8 states. [2020-08-22 18:47:34,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:47:34,612 INFO L93 Difference]: Finished difference Result 227 states and 348 transitions. [2020-08-22 18:47:34,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-22 18:47:34,613 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2020-08-22 18:47:34,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:47:34,615 INFO L225 Difference]: With dead ends: 227 [2020-08-22 18:47:34,615 INFO L226 Difference]: Without dead ends: 127 [2020-08-22 18:47:34,617 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 18:47:34,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-08-22 18:47:34,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2020-08-22 18:47:34,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-08-22 18:47:34,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 161 transitions. [2020-08-22 18:47:34,639 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 161 transitions. Word has length 69 [2020-08-22 18:47:34,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:47:34,639 INFO L479 AbstractCegarLoop]: Abstraction has 115 states and 161 transitions. [2020-08-22 18:47:34,639 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-22 18:47:34,639 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 161 transitions. [2020-08-22 18:47:34,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-08-22 18:47:34,641 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:47:34,642 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 18:47:34,642 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-22 18:47:34,642 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:47:34,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:47:34,642 INFO L82 PathProgramCache]: Analyzing trace with hash -439633211, now seen corresponding path program 1 times [2020-08-22 18:47:34,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:47:34,643 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1256439336] [2020-08-22 18:47:34,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:47:34,645 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:47:34,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:34,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:47:34,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:34,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 18:47:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:34,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:34,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:34,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:34,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:34,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:47:34,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:34,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:47:34,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:34,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 18:47:34,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:34,842 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-08-22 18:47:34,843 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1256439336] [2020-08-22 18:47:34,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:47:34,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-22 18:47:34,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052539722] [2020-08-22 18:47:34,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 18:47:34,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:47:34,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 18:47:34,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-08-22 18:47:34,845 INFO L87 Difference]: Start difference. First operand 115 states and 161 transitions. Second operand 10 states. [2020-08-22 18:47:35,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:47:35,083 INFO L93 Difference]: Finished difference Result 257 states and 400 transitions. [2020-08-22 18:47:35,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-22 18:47:35,085 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2020-08-22 18:47:35,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:47:35,089 INFO L225 Difference]: With dead ends: 257 [2020-08-22 18:47:35,089 INFO L226 Difference]: Without dead ends: 151 [2020-08-22 18:47:35,091 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 18:47:35,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-08-22 18:47:35,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 133. [2020-08-22 18:47:35,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-08-22 18:47:35,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 191 transitions. [2020-08-22 18:47:35,125 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 191 transitions. Word has length 70 [2020-08-22 18:47:35,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:47:35,126 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 191 transitions. [2020-08-22 18:47:35,126 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 18:47:35,126 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 191 transitions. [2020-08-22 18:47:35,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-08-22 18:47:35,131 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:47:35,131 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 18:47:35,131 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-22 18:47:35,132 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:47:35,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:47:35,132 INFO L82 PathProgramCache]: Analyzing trace with hash 307755032, now seen corresponding path program 2 times [2020-08-22 18:47:35,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:47:35,132 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [584754606] [2020-08-22 18:47:35,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:47:35,136 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:47:35,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:35,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:47:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:35,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 18:47:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:35,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:35,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:35,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:35,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:35,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:35,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:35,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:47:35,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:35,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:47:35,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:35,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 18:47:35,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:35,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:35,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:35,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:35,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:35,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:47:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:35,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:47:35,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:35,466 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-08-22 18:47:35,467 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [584754606] [2020-08-22 18:47:35,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:47:35,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-08-22 18:47:35,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315198275] [2020-08-22 18:47:35,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-22 18:47:35,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:47:35,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-22 18:47:35,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-08-22 18:47:35,469 INFO L87 Difference]: Start difference. First operand 133 states and 191 transitions. Second operand 12 states. [2020-08-22 18:47:35,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:47:35,875 INFO L93 Difference]: Finished difference Result 265 states and 420 transitions. [2020-08-22 18:47:35,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-08-22 18:47:35,876 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2020-08-22 18:47:35,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:47:35,879 INFO L225 Difference]: With dead ends: 265 [2020-08-22 18:47:35,880 INFO L226 Difference]: Without dead ends: 116 [2020-08-22 18:47:35,882 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 18:47:35,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-08-22 18:47:35,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 95. [2020-08-22 18:47:35,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-08-22 18:47:35,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 117 transitions. [2020-08-22 18:47:35,898 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 117 transitions. Word has length 105 [2020-08-22 18:47:35,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:47:35,898 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 117 transitions. [2020-08-22 18:47:35,898 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-22 18:47:35,898 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2020-08-22 18:47:35,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-08-22 18:47:35,900 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:47:35,900 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 18:47:35,900 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-22 18:47:35,901 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:47:35,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:47:35,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1534580400, now seen corresponding path program 1 times [2020-08-22 18:47:35,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:47:35,902 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [164755642] [2020-08-22 18:47:35,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:47:35,904 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:47:35,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:35,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:47:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:35,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 18:47:35,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:35,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:35,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:35,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:35,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:36,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:36,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:36,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:36,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:47:36,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:36,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:47:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:36,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 18:47:36,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:36,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 18:47:36,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:36,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:36,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:36,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:36,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:47:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:36,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:47:36,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:36,107 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-08-22 18:47:36,107 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [164755642] [2020-08-22 18:47:36,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:47:36,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-22 18:47:36,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239771109] [2020-08-22 18:47:36,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 18:47:36,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:47:36,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 18:47:36,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-08-22 18:47:36,110 INFO L87 Difference]: Start difference. First operand 95 states and 117 transitions. Second operand 10 states. [2020-08-22 18:47:36,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:47:36,341 INFO L93 Difference]: Finished difference Result 193 states and 255 transitions. [2020-08-22 18:47:36,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-22 18:47:36,341 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 123 [2020-08-22 18:47:36,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:47:36,343 INFO L225 Difference]: With dead ends: 193 [2020-08-22 18:47:36,343 INFO L226 Difference]: Without dead ends: 105 [2020-08-22 18:47:36,345 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 18:47:36,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-08-22 18:47:36,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2020-08-22 18:47:36,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-08-22 18:47:36,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 127 transitions. [2020-08-22 18:47:36,357 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 127 transitions. Word has length 123 [2020-08-22 18:47:36,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:47:36,358 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 127 transitions. [2020-08-22 18:47:36,358 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 18:47:36,358 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 127 transitions. [2020-08-22 18:47:36,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-08-22 18:47:36,360 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:47:36,360 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 18:47:36,360 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-22 18:47:36,361 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:47:36,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:47:36,361 INFO L82 PathProgramCache]: Analyzing trace with hash 822116120, now seen corresponding path program 2 times [2020-08-22 18:47:36,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:47:36,361 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [123735531] [2020-08-22 18:47:36,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:47:36,364 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:47:36,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:36,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:47:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:36,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 18:47:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:36,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:36,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:36,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:36,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:36,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:36,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:47:36,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:36,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:47:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:36,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 18:47:36,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:36,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:36,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:36,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:47:36,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:36,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:47:36,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:36,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-08-22 18:47:36,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:36,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:36,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:36,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:47:36,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:36,614 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 3 proven. 57 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2020-08-22 18:47:36,615 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [123735531] [2020-08-22 18:47:36,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:47:36,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-08-22 18:47:36,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131819389] [2020-08-22 18:47:36,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-22 18:47:36,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:47:36,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-22 18:47:36,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-08-22 18:47:36,617 INFO L87 Difference]: Start difference. First operand 105 states and 127 transitions. Second operand 12 states. [2020-08-22 18:47:37,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:47:37,064 INFO L93 Difference]: Finished difference Result 241 states and 326 transitions. [2020-08-22 18:47:37,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-22 18:47:37,065 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 140 [2020-08-22 18:47:37,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:47:37,067 INFO L225 Difference]: With dead ends: 241 [2020-08-22 18:47:37,067 INFO L226 Difference]: Without dead ends: 141 [2020-08-22 18:47:37,070 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 18:47:37,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-08-22 18:47:37,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 123. [2020-08-22 18:47:37,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-08-22 18:47:37,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 149 transitions. [2020-08-22 18:47:37,091 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 149 transitions. Word has length 140 [2020-08-22 18:47:37,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:47:37,091 INFO L479 AbstractCegarLoop]: Abstraction has 123 states and 149 transitions. [2020-08-22 18:47:37,092 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-22 18:47:37,092 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 149 transitions. [2020-08-22 18:47:37,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-08-22 18:47:37,095 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:47:37,095 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 18:47:37,095 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-22 18:47:37,096 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:47:37,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:47:37,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1260071360, now seen corresponding path program 2 times [2020-08-22 18:47:37,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:47:37,097 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [503656379] [2020-08-22 18:47:37,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:47:37,100 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:47:37,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:37,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:47:37,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:37,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 18:47:37,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:37,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:37,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:37,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:37,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:37,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:37,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:37,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:37,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:37,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:47:37,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:37,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:47:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:37,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 18:47:37,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:37,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:37,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:37,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:47:37,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:37,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 18:47:37,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:37,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:37,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:37,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:37,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:47:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:37,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:47:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:37,858 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-08-22 18:47:37,859 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [503656379] [2020-08-22 18:47:37,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:47:37,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2020-08-22 18:47:37,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569831663] [2020-08-22 18:47:37,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-08-22 18:47:37,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:47:37,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-08-22 18:47:37,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2020-08-22 18:47:37,863 INFO L87 Difference]: Start difference. First operand 123 states and 149 transitions. Second operand 22 states. [2020-08-22 18:47:38,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:47:38,538 INFO L93 Difference]: Finished difference Result 146 states and 180 transitions. [2020-08-22 18:47:38,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-08-22 18:47:38,539 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 140 [2020-08-22 18:47:38,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:47:38,541 INFO L225 Difference]: With dead ends: 146 [2020-08-22 18:47:38,542 INFO L226 Difference]: Without dead ends: 140 [2020-08-22 18:47:38,544 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 18:47:38,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-08-22 18:47:38,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 131. [2020-08-22 18:47:38,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-08-22 18:47:38,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 164 transitions. [2020-08-22 18:47:38,572 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 164 transitions. Word has length 140 [2020-08-22 18:47:38,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:47:38,573 INFO L479 AbstractCegarLoop]: Abstraction has 131 states and 164 transitions. [2020-08-22 18:47:38,573 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-08-22 18:47:38,573 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 164 transitions. [2020-08-22 18:47:38,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-08-22 18:47:38,576 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:47:38,577 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 18:47:38,577 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-22 18:47:38,577 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:47:38,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:47:38,578 INFO L82 PathProgramCache]: Analyzing trace with hash 235403762, now seen corresponding path program 3 times [2020-08-22 18:47:38,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:47:38,582 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1498998960] [2020-08-22 18:47:38,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:47:38,584 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:47:38,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:38,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:47:38,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:38,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 18:47:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:38,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:38,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:38,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:38,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:38,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:38,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:38,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:38,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:38,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:47:38,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:38,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:47:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:38,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 18:47:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:38,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:38,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:38,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:47:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:38,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 18:47:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:38,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:38,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:38,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:38,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:38,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:47:38,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:38,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:47:38,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:38,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 18:47:38,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:38,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:38,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:38,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:47:38,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:38,946 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2020-08-22 18:47:38,947 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1498998960] [2020-08-22 18:47:38,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:47:38,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-08-22 18:47:38,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401603328] [2020-08-22 18:47:38,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-08-22 18:47:38,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:47:38,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-08-22 18:47:38,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-08-22 18:47:38,949 INFO L87 Difference]: Start difference. First operand 131 states and 164 transitions. Second operand 14 states. [2020-08-22 18:47:39,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:47:39,535 INFO L93 Difference]: Finished difference Result 274 states and 374 transitions. [2020-08-22 18:47:39,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-08-22 18:47:39,536 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 175 [2020-08-22 18:47:39,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:47:39,539 INFO L225 Difference]: With dead ends: 274 [2020-08-22 18:47:39,540 INFO L226 Difference]: Without dead ends: 151 [2020-08-22 18:47:39,542 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2020-08-22 18:47:39,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-08-22 18:47:39,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 135. [2020-08-22 18:47:39,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-08-22 18:47:39,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 170 transitions. [2020-08-22 18:47:39,561 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 170 transitions. Word has length 175 [2020-08-22 18:47:39,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:47:39,561 INFO L479 AbstractCegarLoop]: Abstraction has 135 states and 170 transitions. [2020-08-22 18:47:39,562 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-08-22 18:47:39,562 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 170 transitions. [2020-08-22 18:47:39,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2020-08-22 18:47:39,564 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:47:39,564 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 18:47:39,564 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-08-22 18:47:39,564 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:47:39,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:47:39,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1930099232, now seen corresponding path program 4 times [2020-08-22 18:47:39,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:47:39,565 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1456975626] [2020-08-22 18:47:39,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:47:39,568 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:47:39,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:39,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:47:39,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:39,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 18:47:39,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:39,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:39,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:39,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:39,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:39,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:39,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:39,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:39,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:47:39,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:39,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:47:39,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:39,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 18:47:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:39,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:39,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:47:39,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:39,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 18:47:39,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:39,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:39,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:47:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:39,831 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-08-22 18:47:39,832 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1456975626] [2020-08-22 18:47:39,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:47:39,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-08-22 18:47:39,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528744022] [2020-08-22 18:47:39,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-22 18:47:39,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:47:39,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-22 18:47:39,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-08-22 18:47:39,834 INFO L87 Difference]: Start difference. First operand 135 states and 170 transitions. Second operand 11 states. [2020-08-22 18:47:40,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:47:40,072 INFO L93 Difference]: Finished difference Result 265 states and 353 transitions. [2020-08-22 18:47:40,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-22 18:47:40,073 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 122 [2020-08-22 18:47:40,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:47:40,076 INFO L225 Difference]: With dead ends: 265 [2020-08-22 18:47:40,076 INFO L226 Difference]: Without dead ends: 142 [2020-08-22 18:47:40,077 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 18:47:40,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-08-22 18:47:40,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2020-08-22 18:47:40,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-08-22 18:47:40,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 178 transitions. [2020-08-22 18:47:40,095 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 178 transitions. Word has length 122 [2020-08-22 18:47:40,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:47:40,095 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 178 transitions. [2020-08-22 18:47:40,095 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-22 18:47:40,096 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 178 transitions. [2020-08-22 18:47:40,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-08-22 18:47:40,098 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:47:40,099 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 18:47:40,099 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-08-22 18:47:40,099 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:47:40,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:47:40,099 INFO L82 PathProgramCache]: Analyzing trace with hash -88380307, now seen corresponding path program 5 times [2020-08-22 18:47:40,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:47:40,100 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [557603650] [2020-08-22 18:47:40,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:47:40,102 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:47:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:40,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:47:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:40,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 18:47:40,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:40,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:40,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:40,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:40,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:40,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:40,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:40,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:40,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:40,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:47:40,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:40,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:47:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:40,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 18:47:40,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:40,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:40,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:47:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:40,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 18:47:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:40,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:40,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:40,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:47:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:40,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:47:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:40,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-08-22 18:47:40,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:40,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:40,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:40,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:47:40,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:40,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:47:40,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:40,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:47:40,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:47:40,490 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 21 proven. 35 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2020-08-22 18:47:40,490 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [557603650] [2020-08-22 18:47:40,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:47:40,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-08-22 18:47:40,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566739492] [2020-08-22 18:47:40,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-08-22 18:47:40,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:47:40,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-08-22 18:47:40,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-08-22 18:47:40,492 INFO L87 Difference]: Start difference. First operand 142 states and 178 transitions. Second operand 14 states. [2020-08-22 18:47:40,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:47:40,933 INFO L93 Difference]: Finished difference Result 278 states and 369 transitions. [2020-08-22 18:47:40,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-08-22 18:47:40,933 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 193 [2020-08-22 18:47:40,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:47:40,935 INFO L225 Difference]: With dead ends: 278 [2020-08-22 18:47:40,935 INFO L226 Difference]: Without dead ends: 0 [2020-08-22 18:47:40,937 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 18:47:40,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-08-22 18:47:40,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-08-22 18:47:40,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-08-22 18:47:40,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-08-22 18:47:40,938 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 193 [2020-08-22 18:47:40,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:47:40,939 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-08-22 18:47:40,939 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-08-22 18:47:40,939 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-08-22 18:47:40,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-08-22 18:47:40,939 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-08-22 18:47:40,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-08-22 18:47:45,046 WARN L193 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 35 [2020-08-22 18:47:45,263 WARN L193 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 21 [2020-08-22 18:47:45,567 WARN L193 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 21 [2020-08-22 18:47:46,517 WARN L193 SmtUtils]: Spent 895.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 36 [2020-08-22 18:47:46,807 WARN L193 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 28 [2020-08-22 18:47:47,362 WARN L193 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 35 [2020-08-22 18:47:47,644 WARN L193 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 36 [2020-08-22 18:47:48,023 WARN L193 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 36 [2020-08-22 18:47:48,425 WARN L193 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 41 [2020-08-22 18:47:48,958 WARN L193 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 38 [2020-08-22 18:47:49,483 WARN L193 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 38 [2020-08-22 18:47:49,878 WARN L193 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 26 [2020-08-22 18:47:50,696 WARN L193 SmtUtils]: Spent 814.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 36 [2020-08-22 18:47:50,992 WARN L193 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 26 [2020-08-22 18:47:51,713 WARN L193 SmtUtils]: Spent 625.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 47 [2020-08-22 18:47:52,179 WARN L193 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 33 [2020-08-22 18:47:52,235 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-08-22 18:47:52,235 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-08-22 18:47:52,235 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-08-22 18:47:52,235 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-08-22 18:47:52,235 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-08-22 18:47:52,236 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-08-22 18:47:52,236 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) the Hoare annotation is: false [2020-08-22 18:47:52,236 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 35 42) the Hoare annotation is: true [2020-08-22 18:47:52,236 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 35 42) the Hoare annotation is: (<= 5 main_~x~0) [2020-08-22 18:47:52,236 INFO L264 CegarLoopResult]: At program point mainFINAL(lines 35 42) the Hoare annotation is: (<= 5 main_~x~0) [2020-08-22 18:47:52,236 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: false [2020-08-22 18:47:52,236 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 18:47:52,237 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 18:47:52,237 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 18:47:52,237 INFO L264 CegarLoopResult]: At program point L38-2(lines 38 40) the Hoare annotation is: (<= 5 main_~x~0) [2020-08-22 18:47:52,237 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 18:47:52,238 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 18:47:52,238 INFO L271 CegarLoopResult]: At program point fibo2ENTRY(lines 17 25) the Hoare annotation is: true [2020-08-22 18:47:52,238 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 18:47:52,238 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 18:47:52,238 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 18:47:52,239 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 18:47:52,239 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 18:47:52,239 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 18:47:52,239 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 18:47:52,239 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 18:47:52,240 INFO L264 CegarLoopResult]: At program point L18(lines 18 24) the Hoare annotation is: (= fibo2_~n |fibo2_#in~n|) [2020-08-22 18:47:52,240 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 18:47:52,240 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 18:47:52,240 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 18:47:52,240 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 18:47:52,240 INFO L271 CegarLoopResult]: At program point fibo1ENTRY(lines 7 15) the Hoare annotation is: true [2020-08-22 18:47:52,240 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 18:47:52,241 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 18:47:52,241 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 18:47:52,241 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 18:47:52,241 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 18:47:52,241 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 18:47:52,241 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 18:47:52,241 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 18:47:52,242 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 18:47:52,242 INFO L264 CegarLoopResult]: At program point L8(lines 8 14) the Hoare annotation is: (= fibo1_~n |fibo1_#in~n|) [2020-08-22 18:47:52,242 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 18:47:52,242 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 18:47:52,242 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 18:47:52,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 06:47:52 BoogieIcfgContainer [2020-08-22 18:47:52,273 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-22 18:47:52,278 INFO L168 Benchmark]: Toolchain (without parser) took 21149.63 ms. Allocated memory was 145.2 MB in the beginning and 529.0 MB in the end (delta: 383.8 MB). Free memory was 102.6 MB in the beginning and 344.2 MB in the end (delta: -241.5 MB). Peak memory consumption was 400.9 MB. Max. memory is 7.1 GB. [2020-08-22 18:47:52,284 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 145.2 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-08-22 18:47:52,284 INFO L168 Benchmark]: CACSL2BoogieTranslator took 247.06 ms. Allocated memory is still 145.2 MB. Free memory was 102.4 MB in the beginning and 92.9 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-08-22 18:47:52,285 INFO L168 Benchmark]: Boogie Preprocessor took 122.63 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 92.9 MB in the beginning and 180.6 MB in the end (delta: -87.7 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-08-22 18:47:52,285 INFO L168 Benchmark]: RCFGBuilder took 318.65 ms. Allocated memory is still 202.4 MB. Free memory was 179.9 MB in the beginning and 165.9 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2020-08-22 18:47:52,286 INFO L168 Benchmark]: TraceAbstraction took 20442.88 ms. Allocated memory was 202.4 MB in the beginning and 529.0 MB in the end (delta: 326.6 MB). Free memory was 165.9 MB in the beginning and 344.2 MB in the end (delta: -178.2 MB). Peak memory consumption was 407.0 MB. Max. memory is 7.1 GB. [2020-08-22 18:47:52,290 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.27 ms. Allocated memory is still 145.2 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 247.06 ms. Allocated memory is still 145.2 MB. Free memory was 102.4 MB in the beginning and 92.9 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 122.63 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 92.9 MB in the beginning and 180.6 MB in the end (delta: -87.7 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 318.65 ms. Allocated memory is still 202.4 MB. Free memory was 179.9 MB in the beginning and 165.9 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20442.88 ms. Allocated memory was 202.4 MB in the beginning and 529.0 MB in the end (delta: 326.6 MB). Free memory was 165.9 MB in the beginning and 344.2 MB in the end (delta: -178.2 MB). Peak memory consumption was 407.0 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.9s, OverallIterations: 16, TraceHistogramMax: 11, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 764 SDtfs, 779 SDslu, 4692 SDs, 0 SdLazy, 3097 SolverSat, 282 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s 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.4s HoareSimplificationTime, 45 FomulaSimplificationsInter, 43035 FormulaSimplificationTreeSizeReductionInter, 7.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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...