/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/Fibonacci03.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-86f66a4 [2020-07-07 13:03:14,701 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-07 13:03:14,703 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-07 13:03:14,715 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-07 13:03:14,716 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-07 13:03:14,717 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-07 13:03:14,718 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-07 13:03:14,720 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-07 13:03:14,722 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-07 13:03:14,722 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-07 13:03:14,723 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-07 13:03:14,724 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-07 13:03:14,725 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-07 13:03:14,726 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-07 13:03:14,727 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-07 13:03:14,728 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-07 13:03:14,729 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-07 13:03:14,729 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-07 13:03:14,731 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-07 13:03:14,733 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-07 13:03:14,735 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-07 13:03:14,736 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-07 13:03:14,737 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-07 13:03:14,740 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-07 13:03:14,743 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-07 13:03:14,743 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-07 13:03:14,745 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-07 13:03:14,746 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-07 13:03:14,747 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-07 13:03:14,748 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-07 13:03:14,748 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-07 13:03:14,750 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-07 13:03:14,751 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-07 13:03:14,752 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-07 13:03:14,754 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-07 13:03:14,754 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-07 13:03:14,757 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-07 13:03:14,758 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-07 13:03:14,758 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-07 13:03:14,759 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-07 13:03:14,761 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-07 13:03:14,763 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-07 13:03:14,779 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-07 13:03:14,779 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-07 13:03:14,781 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-07 13:03:14,782 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-07 13:03:14,782 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-07 13:03:14,782 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-07 13:03:14,782 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-07 13:03:14,782 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-07 13:03:14,783 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-07 13:03:14,783 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-07 13:03:14,784 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-07 13:03:14,784 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-07 13:03:14,784 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-07 13:03:14,784 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-07 13:03:14,785 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-07 13:03:14,785 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-07 13:03:14,785 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-07 13:03:14,785 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-07 13:03:14,786 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 13:03:14,786 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-07 13:03:14,786 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-07 13:03:14,786 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-07 13:03:14,787 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-07 13:03:15,082 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-07 13:03:15,098 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-07 13:03:15,101 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-07 13:03:15,103 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-07 13:03:15,103 INFO L275 PluginConnector]: CDTParser initialized [2020-07-07 13:03:15,104 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci03.c [2020-07-07 13:03:15,181 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f11415f8/0fdef5955318457f90c62cb3a9fe8de5/FLAG23379cbaa [2020-07-07 13:03:15,636 INFO L306 CDTParser]: Found 1 translation units. [2020-07-07 13:03:15,636 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci03.c [2020-07-07 13:03:15,641 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f11415f8/0fdef5955318457f90c62cb3a9fe8de5/FLAG23379cbaa [2020-07-07 13:03:16,024 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f11415f8/0fdef5955318457f90c62cb3a9fe8de5 [2020-07-07 13:03:16,034 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-07 13:03:16,036 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-07 13:03:16,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-07 13:03:16,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-07 13:03:16,041 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-07 13:03:16,041 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 01:03:16" (1/1) ... [2020-07-07 13:03:16,044 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@713668be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:03:16, skipping insertion in model container [2020-07-07 13:03:16,045 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 01:03:16" (1/1) ... [2020-07-07 13:03:16,052 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-07 13:03:16,071 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-07 13:03:16,231 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 13:03:16,235 INFO L203 MainTranslator]: Completed pre-run [2020-07-07 13:03:16,251 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 13:03:16,266 INFO L208 MainTranslator]: Completed translation [2020-07-07 13:03:16,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:03:16 WrapperNode [2020-07-07 13:03:16,266 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-07 13:03:16,267 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-07 13:03:16,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-07 13:03:16,267 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-07 13:03:16,281 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:03:16" (1/1) ... [2020-07-07 13:03:16,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:03:16" (1/1) ... [2020-07-07 13:03:16,287 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:03:16" (1/1) ... [2020-07-07 13:03:16,287 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:03:16" (1/1) ... [2020-07-07 13:03:16,291 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:03:16" (1/1) ... [2020-07-07 13:03:16,293 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:03:16" (1/1) ... [2020-07-07 13:03:16,294 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:03:16" (1/1) ... [2020-07-07 13:03:16,295 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-07 13:03:16,295 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-07 13:03:16,296 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-07 13:03:16,296 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-07 13:03:16,297 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:03:16" (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-07-07 13:03:16,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-07 13:03:16,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-07 13:03:16,439 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-07-07 13:03:16,439 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-07 13:03:16,439 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-07 13:03:16,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-07 13:03:16,440 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-07-07 13:03:16,440 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-07 13:03:16,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-07 13:03:16,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-07 13:03:16,636 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-07 13:03:16,636 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-07 13:03:16,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 01:03:16 BoogieIcfgContainer [2020-07-07 13:03:16,641 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-07 13:03:16,656 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-07 13:03:16,656 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-07 13:03:16,668 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-07 13:03:16,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.07 01:03:16" (1/3) ... [2020-07-07 13:03:16,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@311db8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 01:03:16, skipping insertion in model container [2020-07-07 13:03:16,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:03:16" (2/3) ... [2020-07-07 13:03:16,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@311db8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 01:03:16, skipping insertion in model container [2020-07-07 13:03:16,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 01:03:16" (3/3) ... [2020-07-07 13:03:16,679 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci03.c [2020-07-07 13:03:16,699 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-07 13:03:16,707 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-07 13:03:16,737 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-07 13:03:16,775 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-07 13:03:16,776 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-07 13:03:16,776 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-07 13:03:16,776 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-07 13:03:16,776 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-07 13:03:16,776 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-07 13:03:16,776 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-07 13:03:16,776 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-07 13:03:16,788 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2020-07-07 13:03:16,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-07 13:03:16,798 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:16,799 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:03:16,800 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:16,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:16,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1379859160, now seen corresponding path program 1 times [2020-07-07 13:03:16,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:16,814 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [82259452] [2020-07-07 13:03:16,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:03:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:16,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:03:17,022 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:17,024 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [82259452] [2020-07-07 13:03:17,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:17,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 13:03:17,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255478930] [2020-07-07 13:03:17,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 13:03:17,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:17,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 13:03:17,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-07 13:03:17,044 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 5 states. [2020-07-07 13:03:17,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:17,182 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2020-07-07 13:03:17,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-07 13:03:17,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-07 13:03:17,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:17,194 INFO L225 Difference]: With dead ends: 50 [2020-07-07 13:03:17,194 INFO L226 Difference]: Without dead ends: 31 [2020-07-07 13:03:17,198 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-07-07 13:03:17,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-07 13:03:17,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-07 13:03:17,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-07 13:03:17,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2020-07-07 13:03:17,246 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 19 [2020-07-07 13:03:17,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:17,247 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-07-07 13:03:17,247 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 13:03:17,248 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-07 13:03:17,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-07 13:03:17,250 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:17,250 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:03:17,251 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-07 13:03:17,251 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:17,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:17,252 INFO L82 PathProgramCache]: Analyzing trace with hash -2056866127, now seen corresponding path program 1 times [2020-07-07 13:03:17,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:17,252 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [195969496] [2020-07-07 13:03:17,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:03:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:03:17,328 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:17,329 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [195969496] [2020-07-07 13:03:17,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:17,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 13:03:17,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978627523] [2020-07-07 13:03:17,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 13:03:17,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:17,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 13:03:17,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-07 13:03:17,332 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 5 states. [2020-07-07 13:03:17,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:17,402 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2020-07-07 13:03:17,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-07 13:03:17,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-07 13:03:17,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:17,405 INFO L225 Difference]: With dead ends: 39 [2020-07-07 13:03:17,405 INFO L226 Difference]: Without dead ends: 33 [2020-07-07 13:03:17,407 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-07-07 13:03:17,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-07 13:03:17,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2020-07-07 13:03:17,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-07 13:03:17,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2020-07-07 13:03:17,419 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 20 [2020-07-07 13:03:17,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:17,420 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-07-07 13:03:17,420 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 13:03:17,420 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-07 13:03:17,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-07 13:03:17,422 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:17,422 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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-07-07 13:03:17,422 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-07 13:03:17,423 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:17,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:17,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1274124978, now seen corresponding path program 1 times [2020-07-07 13:03:17,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:17,424 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1946959123] [2020-07-07 13:03:17,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:03:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,596 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-07 13:03:17,596 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:17,597 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1946959123] [2020-07-07 13:03:17,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:17,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-07 13:03:17,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6851375] [2020-07-07 13:03:17,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-07 13:03:17,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:17,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-07 13:03:17,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-07 13:03:17,599 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2020-07-07 13:03:17,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:17,699 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2020-07-07 13:03:17,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-07 13:03:17,700 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2020-07-07 13:03:17,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:17,702 INFO L225 Difference]: With dead ends: 55 [2020-07-07 13:03:17,702 INFO L226 Difference]: Without dead ends: 33 [2020-07-07 13:03:17,703 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-07 13:03:17,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-07 13:03:17,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-07 13:03:17,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-07 13:03:17,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2020-07-07 13:03:17,716 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 36 [2020-07-07 13:03:17,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:17,716 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2020-07-07 13:03:17,716 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-07 13:03:17,717 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-07 13:03:17,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-07 13:03:17,719 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:17,719 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:03:17,720 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-07 13:03:17,720 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:17,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:17,721 INFO L82 PathProgramCache]: Analyzing trace with hash -2043121517, now seen corresponding path program 1 times [2020-07-07 13:03:17,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:17,721 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [619917322] [2020-07-07 13:03:17,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:03:17,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,910 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-07 13:03:17,911 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:17,911 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [619917322] [2020-07-07 13:03:17,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:17,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-07 13:03:17,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450954594] [2020-07-07 13:03:17,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-07 13:03:17,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:17,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-07 13:03:17,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-07 13:03:17,914 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 7 states. [2020-07-07 13:03:18,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:18,022 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2020-07-07 13:03:18,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-07 13:03:18,023 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2020-07-07 13:03:18,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:18,025 INFO L225 Difference]: With dead ends: 59 [2020-07-07 13:03:18,026 INFO L226 Difference]: Without dead ends: 53 [2020-07-07 13:03:18,027 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-07 13:03:18,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-07 13:03:18,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-07-07 13:03:18,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-07 13:03:18,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2020-07-07 13:03:18,043 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 37 [2020-07-07 13:03:18,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:18,044 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2020-07-07 13:03:18,044 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-07 13:03:18,044 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2020-07-07 13:03:18,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-07 13:03:18,047 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:18,047 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 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] [2020-07-07 13:03:18,047 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-07 13:03:18,048 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:18,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:18,048 INFO L82 PathProgramCache]: Analyzing trace with hash 847598467, now seen corresponding path program 2 times [2020-07-07 13:03:18,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:18,049 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1279468181] [2020-07-07 13:03:18,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:03:18,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:18,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:18,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:18,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:18,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:18,206 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-07-07 13:03:18,206 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:18,207 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1279468181] [2020-07-07 13:03:18,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:18,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-07 13:03:18,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137405739] [2020-07-07 13:03:18,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-07 13:03:18,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:18,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-07 13:03:18,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-07 13:03:18,209 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand 8 states. [2020-07-07 13:03:18,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:18,313 INFO L93 Difference]: Finished difference Result 111 states and 154 transitions. [2020-07-07 13:03:18,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-07 13:03:18,314 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2020-07-07 13:03:18,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:18,316 INFO L225 Difference]: With dead ends: 111 [2020-07-07 13:03:18,316 INFO L226 Difference]: Without dead ends: 67 [2020-07-07 13:03:18,318 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-07-07 13:03:18,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-07-07 13:03:18,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2020-07-07 13:03:18,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-07 13:03:18,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2020-07-07 13:03:18,334 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 54 [2020-07-07 13:03:18,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:18,335 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2020-07-07 13:03:18,335 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-07 13:03:18,335 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2020-07-07 13:03:18,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-07 13:03:18,338 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:18,338 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 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] [2020-07-07 13:03:18,338 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-07 13:03:18,338 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:18,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:18,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1275966376, now seen corresponding path program 3 times [2020-07-07 13:03:18,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:18,339 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1061733914] [2020-07-07 13:03:18,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:03:18,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:18,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:18,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:18,476 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-07 13:03:18,477 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:18,477 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1061733914] [2020-07-07 13:03:18,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:18,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 13:03:18,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092712066] [2020-07-07 13:03:18,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 13:03:18,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:18,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 13:03:18,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-07 13:03:18,480 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand 9 states. [2020-07-07 13:03:18,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:18,598 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2020-07-07 13:03:18,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-07 13:03:18,599 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2020-07-07 13:03:18,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:18,601 INFO L225 Difference]: With dead ends: 89 [2020-07-07 13:03:18,601 INFO L226 Difference]: Without dead ends: 83 [2020-07-07 13:03:18,603 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-07-07 13:03:18,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-07-07 13:03:18,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2020-07-07 13:03:18,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-07-07 13:03:18,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 103 transitions. [2020-07-07 13:03:18,623 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 103 transitions. Word has length 55 [2020-07-07 13:03:18,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:18,624 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 103 transitions. [2020-07-07 13:03:18,624 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 13:03:18,625 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 103 transitions. [2020-07-07 13:03:18,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-07-07 13:03:18,631 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:18,631 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:03:18,632 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-07 13:03:18,632 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:18,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:18,633 INFO L82 PathProgramCache]: Analyzing trace with hash 237402259, now seen corresponding path program 4 times [2020-07-07 13:03:18,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:18,633 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [213591560] [2020-07-07 13:03:18,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.001s / 0.001s total Resizing node table from 113 to 223 [2020-07-07 13:03:18,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:18,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:18,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:18,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:18,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:18,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:18,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:18,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,034 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 27 proven. 70 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2020-07-07 13:03:19,034 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:19,035 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [213591560] [2020-07-07 13:03:19,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:19,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-07 13:03:19,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785654488] [2020-07-07 13:03:19,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-07 13:03:19,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:19,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-07 13:03:19,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2020-07-07 13:03:19,037 INFO L87 Difference]: Start difference. First operand 77 states and 103 transitions. Second operand 14 states. [2020-07-07 13:03:19,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:19,283 INFO L93 Difference]: Finished difference Result 138 states and 199 transitions. [2020-07-07 13:03:19,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-07 13:03:19,284 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 126 [2020-07-07 13:03:19,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:19,290 INFO L225 Difference]: With dead ends: 138 [2020-07-07 13:03:19,291 INFO L226 Difference]: Without dead ends: 69 [2020-07-07 13:03:19,297 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2020-07-07 13:03:19,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-07-07 13:03:19,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2020-07-07 13:03:19,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-07-07 13:03:19,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 73 transitions. [2020-07-07 13:03:19,320 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 73 transitions. Word has length 126 [2020-07-07 13:03:19,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:19,323 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 73 transitions. [2020-07-07 13:03:19,323 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-07 13:03:19,324 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2020-07-07 13:03:19,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-07-07 13:03:19,326 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:19,326 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:03:19,329 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-07 13:03:19,329 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:19,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:19,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1698410615, now seen corresponding path program 5 times [2020-07-07 13:03:19,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:19,331 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [805243907] [2020-07-07 13:03:19,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 [2020-07-07 13:03:19,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,535 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-07-07 13:03:19,535 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:19,535 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [805243907] [2020-07-07 13:03:19,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:19,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-07 13:03:19,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495452035] [2020-07-07 13:03:19,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-07 13:03:19,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:19,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-07 13:03:19,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2020-07-07 13:03:19,538 INFO L87 Difference]: Start difference. First operand 60 states and 73 transitions. Second operand 11 states. [2020-07-07 13:03:19,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:19,667 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2020-07-07 13:03:19,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-07 13:03:19,668 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 90 [2020-07-07 13:03:19,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:19,670 INFO L225 Difference]: With dead ends: 72 [2020-07-07 13:03:19,670 INFO L226 Difference]: Without dead ends: 66 [2020-07-07 13:03:19,671 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-07-07 13:03:19,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-07 13:03:19,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-07-07 13:03:19,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-07 13:03:19,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2020-07-07 13:03:19,684 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 80 transitions. Word has length 90 [2020-07-07 13:03:19,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:19,684 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 80 transitions. [2020-07-07 13:03:19,684 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-07 13:03:19,685 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2020-07-07 13:03:19,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2020-07-07 13:03:19,687 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:19,687 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:03:19,687 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-07 13:03:19,688 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:19,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:19,688 INFO L82 PathProgramCache]: Analyzing trace with hash -376429873, now seen corresponding path program 6 times [2020-07-07 13:03:19,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:19,689 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [752199901] [2020-07-07 13:03:19,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #2: 37 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 37 to 73 Garbage collection #3: 73 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 73 to 139 Garbage collection #4: 139 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 139 to 277 Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 [2020-07-07 13:03:19,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,150 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2020-07-07 13:03:20,150 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:20,151 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [752199901] [2020-07-07 13:03:20,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:20,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-07 13:03:20,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490487940] [2020-07-07 13:03:20,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-07 13:03:20,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:20,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-07 13:03:20,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2020-07-07 13:03:20,153 INFO L87 Difference]: Start difference. First operand 66 states and 80 transitions. Second operand 13 states. [2020-07-07 13:03:20,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:20,379 INFO L93 Difference]: Finished difference Result 168 states and 227 transitions. [2020-07-07 13:03:20,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-07 13:03:20,380 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 196 [2020-07-07 13:03:20,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:20,384 INFO L225 Difference]: With dead ends: 168 [2020-07-07 13:03:20,384 INFO L226 Difference]: Without dead ends: 162 [2020-07-07 13:03:20,385 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-07-07 13:03:20,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-07-07 13:03:20,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 144. [2020-07-07 13:03:20,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-07-07 13:03:20,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 199 transitions. [2020-07-07 13:03:20,411 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 199 transitions. Word has length 196 [2020-07-07 13:03:20,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:20,412 INFO L479 AbstractCegarLoop]: Abstraction has 144 states and 199 transitions. [2020-07-07 13:03:20,412 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-07 13:03:20,412 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 199 transitions. [2020-07-07 13:03:20,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2020-07-07 13:03:20,416 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:20,416 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 8, 8, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:03:20,417 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-07 13:03:20,417 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:20,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:20,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1092378888, now seen corresponding path program 7 times [2020-07-07 13:03:20,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:20,418 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1723385477] [2020-07-07 13:03:20,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #2: 37 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 37 to 73 Garbage collection #3: 73 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 73 to 139 Garbage collection #4: 139 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 139 to 277 Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 [2020-07-07 13:03:20,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,943 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2020-07-07 13:03:20,943 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:20,944 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1723385477] [2020-07-07 13:03:20,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:20,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-07 13:03:20,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696291077] [2020-07-07 13:03:20,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-07 13:03:20,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:20,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-07 13:03:20,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-07-07 13:03:20,946 INFO L87 Difference]: Start difference. First operand 144 states and 199 transitions. Second operand 15 states. [2020-07-07 13:03:21,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:21,237 INFO L93 Difference]: Finished difference Result 340 states and 505 transitions. [2020-07-07 13:03:21,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-07 13:03:21,237 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 231 [2020-07-07 13:03:21,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:21,242 INFO L225 Difference]: With dead ends: 340 [2020-07-07 13:03:21,243 INFO L226 Difference]: Without dead ends: 334 [2020-07-07 13:03:21,244 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-07-07 13:03:21,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2020-07-07 13:03:21,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 310. [2020-07-07 13:03:21,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2020-07-07 13:03:21,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 470 transitions. [2020-07-07 13:03:21,290 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 470 transitions. Word has length 231 [2020-07-07 13:03:21,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:21,291 INFO L479 AbstractCegarLoop]: Abstraction has 310 states and 470 transitions. [2020-07-07 13:03:21,291 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-07 13:03:21,292 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 470 transitions. [2020-07-07 13:03:21,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2020-07-07 13:03:21,299 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:21,300 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 13, 13, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:03:21,300 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-07 13:03:21,300 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:21,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:21,301 INFO L82 PathProgramCache]: Analyzing trace with hash 897250737, now seen corresponding path program 8 times [2020-07-07 13:03:21,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:21,302 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [199294627] [2020-07-07 13:03:21,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 [2020-07-07 13:03:21,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:21,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:21,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:21,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:21,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:21,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:21,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:21,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:21,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:21,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:21,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:21,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:21,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:21,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:22,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:22,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:22,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:22,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:22,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:22,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1060 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 818 trivial. 0 not checked. [2020-07-07 13:03:22,309 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:22,310 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [199294627] [2020-07-07 13:03:22,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:22,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-07-07 13:03:22,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475677642] [2020-07-07 13:03:22,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-07 13:03:22,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:22,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-07 13:03:22,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2020-07-07 13:03:22,312 INFO L87 Difference]: Start difference. First operand 310 states and 470 transitions. Second operand 17 states. [2020-07-07 13:03:22,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:22,659 INFO L93 Difference]: Finished difference Result 688 states and 1106 transitions. [2020-07-07 13:03:22,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-07 13:03:22,660 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 372 [2020-07-07 13:03:22,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:22,677 INFO L225 Difference]: With dead ends: 688 [2020-07-07 13:03:22,677 INFO L226 Difference]: Without dead ends: 682 [2020-07-07 13:03:22,679 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2020-07-07 13:03:22,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2020-07-07 13:03:22,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 652. [2020-07-07 13:03:22,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2020-07-07 13:03:22,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 1064 transitions. [2020-07-07 13:03:22,780 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 1064 transitions. Word has length 372 [2020-07-07 13:03:22,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:22,781 INFO L479 AbstractCegarLoop]: Abstraction has 652 states and 1064 transitions. [2020-07-07 13:03:22,781 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-07 13:03:22,781 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 1064 transitions. [2020-07-07 13:03:22,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2020-07-07 13:03:22,798 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:22,799 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 21, 21, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:03:22,799 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-07 13:03:22,799 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:22,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:22,799 INFO L82 PathProgramCache]: Analyzing trace with hash 2036115571, now seen corresponding path program 9 times [2020-07-07 13:03:22,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:22,800 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [637006324] [2020-07-07 13:03:22,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #2: 37 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 37 to 73 Garbage collection #3: 73 nodes / 0 free / 0.001s / 0.001s total Resizing node table from 73 to 139 Garbage collection #4: 139 nodes / 0 free / 0.0s / 0.001s total Resizing node table from 139 to 277 Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 Garbage collection #1: 23 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 23 to 43 Garbage collection #2: 43 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 43 to 83 Garbage collection #3: 83 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 83 to 163 Garbage collection #4: 163 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 163 to 317 [2020-07-07 13:03:23,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2641 backedges. 0 proven. 399 refuted. 0 times theorem prover too weak. 2242 trivial. 0 not checked. [2020-07-07 13:03:24,819 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:24,819 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [637006324] [2020-07-07 13:03:24,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:24,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-07-07 13:03:24,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435788943] [2020-07-07 13:03:24,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-07 13:03:24,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:24,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-07 13:03:24,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2020-07-07 13:03:24,822 INFO L87 Difference]: Start difference. First operand 652 states and 1064 transitions. Second operand 19 states. [2020-07-07 13:03:25,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:25,302 INFO L93 Difference]: Finished difference Result 1388 states and 2389 transitions. [2020-07-07 13:03:25,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-07 13:03:25,302 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 601 [2020-07-07 13:03:25,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:25,332 INFO L225 Difference]: With dead ends: 1388 [2020-07-07 13:03:25,332 INFO L226 Difference]: Without dead ends: 1382 [2020-07-07 13:03:25,336 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2020-07-07 13:03:25,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2020-07-07 13:03:25,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1346. [2020-07-07 13:03:25,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1346 states. [2020-07-07 13:03:25,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 2340 transitions. [2020-07-07 13:03:25,512 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 2340 transitions. Word has length 601 [2020-07-07 13:03:25,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:25,513 INFO L479 AbstractCegarLoop]: Abstraction has 1346 states and 2340 transitions. [2020-07-07 13:03:25,514 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-07 13:03:25,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 2340 transitions. [2020-07-07 13:03:25,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 972 [2020-07-07 13:03:25,558 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:25,559 INFO L422 BasicCegarLoop]: trace histogram [109, 109, 88, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 34, 34, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:03:25,559 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-07 13:03:25,559 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:25,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:25,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1047272888, now seen corresponding path program 10 times [2020-07-07 13:03:25,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:25,560 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1776260560] [2020-07-07 13:03:25,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 Garbage collection #1: 23 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 23 to 43 Garbage collection #2: 43 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 43 to 83 Garbage collection #3: 83 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 83 to 163 Garbage collection #4: 163 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 163 to 317 [2020-07-07 13:03:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:26,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:27,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:27,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:27,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:31,153 INFO L134 CoverageAnalysis]: Checked inductivity of 6740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6740 trivial. 0 not checked. [2020-07-07 13:03:31,153 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:31,153 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1776260560] [2020-07-07 13:03:31,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:31,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2020-07-07 13:03:31,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992128149] [2020-07-07 13:03:31,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-07-07 13:03:31,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:31,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-07-07 13:03:31,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=618, Unknown=0, NotChecked=0, Total=756 [2020-07-07 13:03:31,156 INFO L87 Difference]: Start difference. First operand 1346 states and 2340 transitions. Second operand 28 states. [2020-07-07 13:03:33,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:33,415 INFO L93 Difference]: Finished difference Result 8060 states and 17420 transitions. [2020-07-07 13:03:33,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2020-07-07 13:03:33,416 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 971 [2020-07-07 13:03:33,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:33,424 INFO L225 Difference]: With dead ends: 8060 [2020-07-07 13:03:33,425 INFO L226 Difference]: Without dead ends: 0 [2020-07-07 13:03:33,554 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 415 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1515, Invalid=4035, Unknown=0, NotChecked=0, Total=5550 [2020-07-07 13:03:33,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-07 13:03:33,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-07 13:03:33,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-07 13:03:33,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-07 13:03:33,556 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 971 [2020-07-07 13:03:33,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:33,557 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-07 13:03:33,557 INFO L480 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-07-07 13:03:33,557 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-07 13:03:33,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-07 13:03:33,557 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-07 13:03:33,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-07 13:04:23,745 WARN L193 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 325 DAG size of output: 44 [2020-07-07 13:04:29,230 WARN L193 SmtUtils]: Spent 5.35 s on a formula simplification. DAG size of input: 832 DAG size of output: 51 [2020-07-07 13:04:30,208 WARN L193 SmtUtils]: Spent 948.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 43 [2020-07-07 13:04:31,299 WARN L193 SmtUtils]: Spent 993.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 44 [2020-07-07 13:04:32,324 WARN L193 SmtUtils]: Spent 990.00 ms on a formula simplification. DAG size of input: 309 DAG size of output: 46 [2020-07-07 13:04:39,161 WARN L193 SmtUtils]: Spent 6.78 s on a formula simplification. DAG size of input: 838 DAG size of output: 64 [2020-07-07 13:04:44,655 WARN L193 SmtUtils]: Spent 5.42 s on a formula simplification. DAG size of input: 832 DAG size of output: 51 [2020-07-07 13:04:46,052 WARN L193 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 325 DAG size of output: 44 [2020-07-07 13:04:46,211 INFO L264 CegarLoopResult]: At program point fibonacciFINAL(lines 14 22) the Hoare annotation is: (and (<= 0 |fibonacci_#res|) (let ((.cse0 (= fibonacci_~n |fibonacci_#in~n|))) (or (and (<= fibonacci_~n 6) (<= 8 |fibonacci_#res|) .cse0) (and (<= 3 |fibonacci_#res|) (<= fibonacci_~n 4) .cse0) (and (<= |fibonacci_#in~n| 0) .cse0) (and (<= fibonacci_~n 5) (<= 5 |fibonacci_#res|) .cse0) (and (<= fibonacci_~n 2) (<= 1 |fibonacci_#res|) .cse0) (and (<= fibonacci_~n 8) (<= 21 |fibonacci_#res|) .cse0) (and (<= 2 |fibonacci_#res|) (<= fibonacci_~n 3) .cse0) (and (<= 34 |fibonacci_#res|) .cse0) (and (<= 13 |fibonacci_#res|) (<= fibonacci_~n 7) .cse0)))) [2020-07-07 13:04:46,211 INFO L271 CegarLoopResult]: At program point fibonacciENTRY(lines 14 22) the Hoare annotation is: true [2020-07-07 13:04:46,211 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (not (<= |fibonacci_#in~n| 1)) (= fibonacci_~n |fibonacci_#in~n|)) [2020-07-07 13:04:46,212 INFO L264 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: (let ((.cse4 (<= 1 |fibonacci_#t~ret0|)) (.cse5 (<= 3 fibonacci_~n)) (.cse3 (= fibonacci_~n |fibonacci_#in~n|))) (let ((.cse0 (and (<= fibonacci_~n 4) (<= 2 |fibonacci_#t~ret0|) .cse5 .cse3)) (.cse1 (and .cse4 .cse5 (<= fibonacci_~n 3) .cse3)) (.cse2 (and (<= fibonacci_~n 2) (< 1 fibonacci_~n) .cse4 .cse3))) (and (or (and (<= 8 |fibonacci_#t~ret0|) (<= fibonacci_~n 7)) .cse0 (and (<= fibonacci_~n 5) (<= 3 |fibonacci_#t~ret0|)) .cse1 (and (<= 5 |fibonacci_#t~ret0|) (<= fibonacci_~n 6)) .cse2 (<= 13 |fibonacci_#t~ret0|)) (or (and .cse3 (<= 21 |fibonacci_#t~ret0|)) (and (<= fibonacci_~n 8) .cse3)) (or (not (<= |fibonacci_#in~n| 4)) .cse0 .cse1 .cse2)))) [2020-07-07 13:04:46,212 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (and (<= |fibonacci_#in~n| 1) (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|)) [2020-07-07 13:04:46,213 INFO L264 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: (let ((.cse4 (<= 1 |fibonacci_#t~ret0|)) (.cse5 (<= 3 fibonacci_~n)) (.cse0 (= fibonacci_~n |fibonacci_#in~n|))) (let ((.cse1 (and (<= fibonacci_~n 4) (<= 2 |fibonacci_#t~ret0|) .cse5 .cse0)) (.cse2 (and .cse4 .cse5 (<= fibonacci_~n 3) .cse0)) (.cse3 (and (<= fibonacci_~n 2) (< 1 fibonacci_~n) .cse4 .cse0))) (and (or (and (<= 8 |fibonacci_#t~ret0|) (<= fibonacci_~n 7) .cse0) (and (<= fibonacci_~n 5) (<= 3 |fibonacci_#t~ret0|) .cse0) (and .cse0 (<= 21 |fibonacci_#t~ret0|)) (and (<= fibonacci_~n 8) .cse0 (<= 13 |fibonacci_#t~ret0|)) .cse1 .cse2 (and (<= 5 |fibonacci_#t~ret0|) (<= fibonacci_~n 6) .cse0) .cse3) (or (not (<= |fibonacci_#in~n| 4)) .cse1 .cse2 .cse3)))) [2020-07-07 13:04:46,213 INFO L264 CegarLoopResult]: At program point fibonacciEXIT(lines 14 22) the Hoare annotation is: (and (<= 0 |fibonacci_#res|) (let ((.cse0 (= fibonacci_~n |fibonacci_#in~n|))) (or (and (<= fibonacci_~n 6) (<= 8 |fibonacci_#res|) .cse0) (and (<= 3 |fibonacci_#res|) (<= fibonacci_~n 4) .cse0) (and (<= |fibonacci_#in~n| 0) .cse0) (and (<= fibonacci_~n 5) (<= 5 |fibonacci_#res|) .cse0) (and (<= fibonacci_~n 2) (<= 1 |fibonacci_#res|) .cse0) (and (<= fibonacci_~n 8) (<= 21 |fibonacci_#res|) .cse0) (and (<= 2 |fibonacci_#res|) (<= fibonacci_~n 3) .cse0) (and (<= 34 |fibonacci_#res|) .cse0) (and (<= 13 |fibonacci_#res|) (<= fibonacci_~n 7) .cse0)))) [2020-07-07 13:04:46,213 INFO L264 CegarLoopResult]: At program point L17(lines 17 21) the Hoare annotation is: (and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|)) [2020-07-07 13:04:46,214 INFO L264 CegarLoopResult]: At program point L20-3(line 20) the Hoare annotation is: (and (not (<= |fibonacci_#in~n| 1)) (let ((.cse2 (<= 1 |fibonacci_#t~ret0|)) (.cse0 (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0|)) (.cse1 (= fibonacci_~n |fibonacci_#in~n|))) (or (and (<= 8 .cse0) (<= 5 |fibonacci_#t~ret0|) (<= fibonacci_~n 6) .cse1) (and .cse2 (<= 2 .cse0) (<= fibonacci_~n 3) .cse1) (and (<= fibonacci_~n 5) (<= 5 .cse0) (<= 3 |fibonacci_#t~ret0|) .cse1) (and (<= 3 .cse0) (<= fibonacci_~n 4) (<= 2 |fibonacci_#t~ret0|) .cse1) (and .cse1 (<= 34 .cse0) (<= 21 |fibonacci_#t~ret0|)) (and (<= 13 .cse0) (<= 8 |fibonacci_#t~ret0|) (<= fibonacci_~n 7) .cse1) (and (<= fibonacci_~n 8) (<= 21 .cse0) .cse1 (<= 13 |fibonacci_#t~ret0|)) (and (<= fibonacci_~n 2) .cse2 (<= 1 .cse0) .cse1)))) [2020-07-07 13:04:46,214 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (<= |fibonacci_#in~n| 0) (= fibonacci_~n |fibonacci_#in~n|)) [2020-07-07 13:04:46,214 INFO L264 CegarLoopResult]: At program point L20-4(line 20) the Hoare annotation is: (and (not (<= |fibonacci_#in~n| 1)) (let ((.cse2 (<= 1 |fibonacci_#t~ret0|)) (.cse0 (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0|)) (.cse1 (= fibonacci_~n |fibonacci_#in~n|))) (or (and (<= 8 .cse0) (<= 5 |fibonacci_#t~ret0|) (<= fibonacci_~n 6) .cse1) (and .cse2 (<= 2 .cse0) (<= fibonacci_~n 3) .cse1) (and (<= fibonacci_~n 5) (<= 5 .cse0) (<= 3 |fibonacci_#t~ret0|) .cse1) (and (<= 3 .cse0) (<= fibonacci_~n 4) (<= 2 |fibonacci_#t~ret0|) .cse1) (and .cse1 (<= 34 .cse0) (<= 21 |fibonacci_#t~ret0|)) (and (<= 13 .cse0) (<= 8 |fibonacci_#t~ret0|) (<= fibonacci_~n 7) .cse1) (and (<= fibonacci_~n 8) (<= 21 .cse0) .cse1 (<= 13 |fibonacci_#t~ret0|)) (and (<= fibonacci_~n 2) .cse2 (<= 1 .cse0) .cse1)))) [2020-07-07 13:04:46,215 INFO L264 CegarLoopResult]: At program point L15(lines 15 21) the Hoare annotation is: (= fibonacci_~n |fibonacci_#in~n|) [2020-07-07 13:04:46,215 INFO L264 CegarLoopResult]: At program point L20-5(line 20) the Hoare annotation is: (let ((.cse3 (<= 1 |fibonacci_#t~ret0|)) (.cse1 (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0|)) (.cse0 (= fibonacci_~n |fibonacci_#in~n|))) (let ((.cse2 (and (<= fibonacci_~n 2) (<= 1 |fibonacci_#res|) (< 1 fibonacci_~n) .cse3 (<= 1 .cse1) .cse0))) (and (or (and (<= fibonacci_~n 8) .cse0) (and (<= 34 |fibonacci_#res|) .cse0 (<= 34 .cse1) (<= 21 |fibonacci_#t~ret0|))) (or .cse2 (not (<= |fibonacci_#in~n| 2))) (or (and (<= 21 |fibonacci_#res|) (<= 21 .cse1) (<= 13 |fibonacci_#t~ret0|)) (and .cse3 (<= 2 |fibonacci_#res|) (<= 2 .cse1) (<= fibonacci_~n 3)) .cse2 (and (<= 8 .cse1) (<= 5 |fibonacci_#t~ret0|) (<= fibonacci_~n 6) (<= 8 |fibonacci_#res|)) (and (<= 3 |fibonacci_#res|) (<= 3 .cse1) (<= fibonacci_~n 4) (<= 2 |fibonacci_#t~ret0|)) (and (<= fibonacci_~n 5) (<= 5 .cse1) (<= 5 |fibonacci_#res|) (<= 3 |fibonacci_#t~ret0|)) (and (<= 13 .cse1) (<= 8 |fibonacci_#t~ret0|) (<= 13 |fibonacci_#res|) (<= fibonacci_~n 7)))))) [2020-07-07 13:04:46,216 INFO L264 CegarLoopResult]: At program point L20-6(line 20) the Hoare annotation is: (let ((.cse5 (<= 3 fibonacci_~n)) (.cse4 (= fibonacci_~n |fibonacci_#in~n|))) (let ((.cse0 (and (<= fibonacci_~n 2) (<= 1 |fibonacci_#res|) (< 1 fibonacci_~n) .cse4)) (.cse1 (and (<= 3 |fibonacci_#res|) (<= fibonacci_~n 4) .cse5 .cse4)) (.cse2 (and (<= fibonacci_~n 5) (<= 5 |fibonacci_#res|) .cse5 .cse4)) (.cse3 (and (<= 2 |fibonacci_#res|) .cse5 (<= fibonacci_~n 3) .cse4))) (and (or .cse0 (not (<= |fibonacci_#in~n| 5)) .cse1 .cse2 .cse3) (or .cse0 .cse1 (<= 21 |fibonacci_#res|) .cse2 (and (<= 13 |fibonacci_#res|) (<= fibonacci_~n 7)) .cse3 (and (<= fibonacci_~n 6) (<= 8 |fibonacci_#res|))) (or (and (<= fibonacci_~n 8) .cse4) (and (<= 34 |fibonacci_#res|) .cse4))))) [2020-07-07 13:04:46,216 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-07 13:04:46,216 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-07 13:04:46,216 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-07 13:04:46,216 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-07 13:04:46,217 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-07 13:04:46,217 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-07 13:04:46,217 INFO L271 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: true [2020-07-07 13:04:46,217 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 34) the Hoare annotation is: false [2020-07-07 13:04:46,219 INFO L264 CegarLoopResult]: At program point L31(lines 31 35) the Hoare annotation is: (or (<= 34 main_~result~0) (<= main_~x~0 8)) [2020-07-07 13:04:46,219 INFO L271 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: true [2020-07-07 13:04:46,220 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 25 36) the Hoare annotation is: true [2020-07-07 13:04:46,220 INFO L264 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: (or (<= main_~x~0 8) (<= 34 |main_#t~ret3|)) [2020-07-07 13:04:46,220 INFO L271 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-07-07 13:04:46,220 INFO L264 CegarLoopResult]: At program point L30-2(line 30) the Hoare annotation is: (or (<= main_~x~0 8) (<= 34 |main_#t~ret3|)) [2020-07-07 13:04:46,220 INFO L271 CegarLoopResult]: At program point L27(lines 27 29) the Hoare annotation is: true [2020-07-07 13:04:46,221 INFO L264 CegarLoopResult]: At program point L30-3(line 30) the Hoare annotation is: (or (<= main_~x~0 8) (and (<= 34 main_~result~0) (<= 34 |main_#t~ret3|))) [2020-07-07 13:04:46,221 INFO L271 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: true [2020-07-07 13:04:46,221 INFO L271 CegarLoopResult]: At program point L26-1(line 26) the Hoare annotation is: true [2020-07-07 13:04:46,221 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 25 36) the Hoare annotation is: true [2020-07-07 13:04:46,221 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 25 36) the Hoare annotation is: true [2020-07-07 13:04:46,221 INFO L264 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: false [2020-07-07 13:04:46,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.07 01:04:46 BoogieIcfgContainer [2020-07-07 13:04:46,260 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-07 13:04:46,262 INFO L168 Benchmark]: Toolchain (without parser) took 90226.44 ms. Allocated memory was 145.8 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 102.6 MB in the beginning and 1.1 GB in the end (delta: -972.7 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2020-07-07 13:04:46,264 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 145.8 MB. Free memory was 121.1 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-07 13:04:46,264 INFO L168 Benchmark]: CACSL2BoogieTranslator took 229.89 ms. Allocated memory is still 145.8 MB. Free memory was 102.4 MB in the beginning and 93.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-07-07 13:04:46,265 INFO L168 Benchmark]: Boogie Preprocessor took 27.91 ms. Allocated memory is still 145.8 MB. Free memory was 93.1 MB in the beginning and 91.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-07 13:04:46,276 INFO L168 Benchmark]: RCFGBuilder took 345.45 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 91.7 MB in the beginning and 169.1 MB in the end (delta: -77.4 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-07 13:04:46,278 INFO L168 Benchmark]: TraceAbstraction took 89604.56 ms. Allocated memory was 202.4 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 169.1 MB in the beginning and 1.1 GB in the end (delta: -906.3 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2020-07-07 13:04:46,286 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.25 ms. Allocated memory is still 145.8 MB. Free memory was 121.1 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 229.89 ms. Allocated memory is still 145.8 MB. Free memory was 102.4 MB in the beginning and 93.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.91 ms. Allocated memory is still 145.8 MB. Free memory was 93.1 MB in the beginning and 91.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 345.45 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 91.7 MB in the beginning and 169.1 MB in the end (delta: -77.4 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 89604.56 ms. Allocated memory was 202.4 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 169.1 MB in the beginning and 1.1 GB in the end (delta: -906.3 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 34]: 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: 14]: Procedure Contract for fibonacci Derived contract for procedure fibonacci: 0 <= \result && ((((((((((n <= 6 && 8 <= \result) && n == \old(n)) || ((3 <= \result && n <= 4) && n == \old(n))) || (\old(n) <= 0 && n == \old(n))) || ((n <= 5 && 5 <= \result) && n == \old(n))) || ((n <= 2 && 1 <= \result) && n == \old(n))) || ((n <= 8 && 21 <= \result) && n == \old(n))) || ((2 <= \result && n <= 3) && n == \old(n))) || (34 <= \result && n == \old(n))) || ((13 <= \result && n <= 7) && n == \old(n))) - ProcedureContractResult [Line: 25]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 16.7s, OverallIterations: 13, TraceHistogramMax: 109, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 72.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 476 SDtfs, 752 SDslu, 2249 SDs, 0 SdLazy, 1989 SolverSat, 624 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1046 GetRequests, 848 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1109 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1346occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 137 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 35 LocationsWithAnnotation, 11291 PreInvPairs, 117262 NumberOfFragments, 1067 HoareAnnotationTreeSize, 11291 FomulaSimplifications, 3414873 FormulaSimplificationTreeSizeReduction, 48.6s HoareSimplificationTime, 35 FomulaSimplificationsInter, 180303 FormulaSimplificationTreeSizeReductionInter, 23.3s 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...