/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/Fibonacci05.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-86f66a4 [2020-07-07 13:03:20,511 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-07 13:03:20,514 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-07 13:03:20,526 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-07 13:03:20,527 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-07 13:03:20,528 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-07 13:03:20,529 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-07 13:03:20,531 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-07 13:03:20,533 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-07 13:03:20,534 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-07 13:03:20,534 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-07 13:03:20,536 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-07 13:03:20,536 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-07 13:03:20,537 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-07 13:03:20,538 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-07 13:03:20,539 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-07 13:03:20,540 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-07 13:03:20,541 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-07 13:03:20,543 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-07 13:03:20,545 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-07 13:03:20,546 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-07 13:03:20,547 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-07 13:03:20,548 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-07 13:03:20,549 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-07 13:03:20,551 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-07 13:03:20,552 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-07 13:03:20,552 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-07 13:03:20,553 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-07 13:03:20,553 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-07 13:03:20,554 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-07 13:03:20,554 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-07 13:03:20,555 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-07 13:03:20,556 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-07 13:03:20,556 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-07 13:03:20,557 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-07 13:03:20,557 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-07 13:03:20,558 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-07 13:03:20,558 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-07 13:03:20,558 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-07 13:03:20,559 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-07 13:03:20,560 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-07 13:03:20,561 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:20,569 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-07 13:03:20,570 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-07 13:03:20,571 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-07 13:03:20,571 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-07 13:03:20,571 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-07 13:03:20,572 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-07 13:03:20,572 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-07 13:03:20,572 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-07 13:03:20,572 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-07 13:03:20,572 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-07 13:03:20,572 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-07 13:03:20,573 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-07 13:03:20,573 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-07 13:03:20,573 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-07 13:03:20,573 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-07 13:03:20,573 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-07 13:03:20,574 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-07 13:03:20,574 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-07 13:03:20,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 13:03:20,574 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-07 13:03:20,574 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-07 13:03:20,575 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-07 13:03:20,575 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-07 13:03:20,927 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-07 13:03:20,942 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-07 13:03:20,946 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-07 13:03:20,948 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-07 13:03:20,949 INFO L275 PluginConnector]: CDTParser initialized [2020-07-07 13:03:20,949 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci05.c [2020-07-07 13:03:21,007 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43b4ae288/ad03f1917509424a918ab644b15c0a2d/FLAG61ff0b8f0 [2020-07-07 13:03:21,427 INFO L306 CDTParser]: Found 1 translation units. [2020-07-07 13:03:21,428 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-07-07 13:03:21,434 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43b4ae288/ad03f1917509424a918ab644b15c0a2d/FLAG61ff0b8f0 [2020-07-07 13:03:21,837 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43b4ae288/ad03f1917509424a918ab644b15c0a2d [2020-07-07 13:03:21,846 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-07 13:03:21,847 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-07 13:03:21,848 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-07 13:03:21,849 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-07 13:03:21,853 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-07 13:03:21,854 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 01:03:21" (1/1) ... [2020-07-07 13:03:21,857 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58bb5dcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:03:21, skipping insertion in model container [2020-07-07 13:03:21,857 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 01:03:21" (1/1) ... [2020-07-07 13:03:21,866 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-07 13:03:21,884 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-07 13:03:22,041 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 13:03:22,045 INFO L203 MainTranslator]: Completed pre-run [2020-07-07 13:03:22,061 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 13:03:22,075 INFO L208 MainTranslator]: Completed translation [2020-07-07 13:03:22,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:03:22 WrapperNode [2020-07-07 13:03:22,076 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-07 13:03:22,077 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-07 13:03:22,077 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-07 13:03:22,077 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-07 13:03:22,090 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:22" (1/1) ... [2020-07-07 13:03:22,090 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:22" (1/1) ... [2020-07-07 13:03:22,096 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:22" (1/1) ... [2020-07-07 13:03:22,096 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:22" (1/1) ... [2020-07-07 13:03:22,100 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:22" (1/1) ... [2020-07-07 13:03:22,102 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:22" (1/1) ... [2020-07-07 13:03:22,102 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:22" (1/1) ... [2020-07-07 13:03:22,104 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-07 13:03:22,104 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-07 13:03:22,104 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-07 13:03:22,105 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-07 13:03:22,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:03:22" (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:22,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-07 13:03:22,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-07 13:03:22,287 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-07-07 13:03:22,287 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-07 13:03:22,288 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-07 13:03:22,288 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-07 13:03:22,288 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-07-07 13:03:22,288 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-07 13:03:22,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-07 13:03:22,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-07 13:03:22,470 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-07 13:03:22,470 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-07 13:03:22,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 01:03:22 BoogieIcfgContainer [2020-07-07 13:03:22,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-07 13:03:22,475 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-07 13:03:22,475 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-07 13:03:22,478 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-07 13:03:22,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.07 01:03:21" (1/3) ... [2020-07-07 13:03:22,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22498d1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 01:03:22, skipping insertion in model container [2020-07-07 13:03:22,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:03:22" (2/3) ... [2020-07-07 13:03:22,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22498d1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 01:03:22, skipping insertion in model container [2020-07-07 13:03:22,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 01:03:22" (3/3) ... [2020-07-07 13:03:22,482 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-07-07 13:03:22,492 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-07 13:03:22,499 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-07 13:03:22,515 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-07 13:03:22,543 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-07 13:03:22,544 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-07 13:03:22,544 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-07 13:03:22,544 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-07 13:03:22,544 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-07 13:03:22,545 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-07 13:03:22,545 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-07 13:03:22,545 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-07 13:03:22,564 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-07-07 13:03:22,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-07 13:03:22,577 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:22,578 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:03:22,578 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:22,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:22,585 INFO L82 PathProgramCache]: Analyzing trace with hash -2064988448, now seen corresponding path program 1 times [2020-07-07 13:03:22,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:22,595 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1887856858] [2020-07-07 13:03:22,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:03:22,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:22,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:22,805 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:22,805 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:22,808 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1887856858] [2020-07-07 13:03:22,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:22,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 13:03:22,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916025466] [2020-07-07 13:03:22,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 13:03:22,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:22,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 13:03:22,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-07 13:03:22,836 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2020-07-07 13:03:22,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:22,981 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2020-07-07 13:03:22,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-07 13:03:22,983 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-07 13:03:22,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:22,994 INFO L225 Difference]: With dead ends: 48 [2020-07-07 13:03:22,995 INFO L226 Difference]: Without dead ends: 30 [2020-07-07 13:03:22,998 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:23,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-07 13:03:23,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-07 13:03:23,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-07 13:03:23,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-07-07 13:03:23,048 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 18 [2020-07-07 13:03:23,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:23,049 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-07-07 13:03:23,049 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 13:03:23,050 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-07 13:03:23,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-07 13:03:23,052 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:23,052 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:23,052 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-07 13:03:23,053 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:23,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:23,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1678486471, now seen corresponding path program 1 times [2020-07-07 13:03:23,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:23,054 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1281800842] [2020-07-07 13:03:23,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:03:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,126 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:23,126 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:23,127 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1281800842] [2020-07-07 13:03:23,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:23,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 13:03:23,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753630642] [2020-07-07 13:03:23,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 13:03:23,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:23,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 13:03:23,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-07 13:03:23,130 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2020-07-07 13:03:23,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:23,203 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2020-07-07 13:03:23,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-07 13:03:23,204 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-07 13:03:23,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:23,205 INFO L225 Difference]: With dead ends: 38 [2020-07-07 13:03:23,205 INFO L226 Difference]: Without dead ends: 32 [2020-07-07 13:03:23,208 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:23,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-07 13:03:23,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-07-07 13:03:23,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-07 13:03:23,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-07-07 13:03:23,220 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 19 [2020-07-07 13:03:23,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:23,226 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-07-07 13:03:23,226 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 13:03:23,227 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-07 13:03:23,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-07 13:03:23,228 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:23,229 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] [2020-07-07 13:03:23,229 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-07 13:03:23,229 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:23,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:23,230 INFO L82 PathProgramCache]: Analyzing trace with hash 961212118, now seen corresponding path program 1 times [2020-07-07 13:03:23,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:23,231 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [602797769] [2020-07-07 13:03:23,232 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.001s / 0.001s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.001s / 0.002s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.002s total Resizing node table from 113 to 223 [2020-07-07 13:03:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,433 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:23,433 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:23,434 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [602797769] [2020-07-07 13:03:23,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:23,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-07 13:03:23,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292952074] [2020-07-07 13:03:23,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-07 13:03:23,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:23,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-07 13:03:23,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-07 13:03:23,436 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 6 states. [2020-07-07 13:03:23,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:23,558 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2020-07-07 13:03:23,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-07 13:03:23,560 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-07-07 13:03:23,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:23,561 INFO L225 Difference]: With dead ends: 54 [2020-07-07 13:03:23,561 INFO L226 Difference]: Without dead ends: 32 [2020-07-07 13:03:23,564 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:23,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-07 13:03:23,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-07 13:03:23,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-07 13:03:23,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2020-07-07 13:03:23,589 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 35 [2020-07-07 13:03:23,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:23,591 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2020-07-07 13:03:23,591 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-07 13:03:23,592 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-07 13:03:23,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-07 13:03:23,594 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:23,595 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] [2020-07-07 13:03:23,595 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-07 13:03:23,596 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:23,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:23,598 INFO L82 PathProgramCache]: Analyzing trace with hash -125795935, now seen corresponding path program 1 times [2020-07-07 13:03:23,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:23,598 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [773966006] [2020-07-07 13:03:23,599 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:23,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,839 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:23,840 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:23,841 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [773966006] [2020-07-07 13:03:23,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:23,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-07 13:03:23,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903959055] [2020-07-07 13:03:23,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-07 13:03:23,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:23,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-07 13:03:23,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-07 13:03:23,844 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 7 states. [2020-07-07 13:03:23,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:23,962 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2020-07-07 13:03:23,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-07 13:03:23,962 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-07-07 13:03:23,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:23,965 INFO L225 Difference]: With dead ends: 58 [2020-07-07 13:03:23,965 INFO L226 Difference]: Without dead ends: 52 [2020-07-07 13:03:23,966 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:23,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-07 13:03:23,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-07-07 13:03:23,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-07 13:03:23,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2020-07-07 13:03:23,981 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 36 [2020-07-07 13:03:23,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:23,982 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2020-07-07 13:03:23,982 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-07 13:03:23,982 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2020-07-07 13:03:23,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-07-07 13:03:23,985 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:23,985 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] [2020-07-07 13:03:23,985 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-07 13:03:23,985 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:23,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:23,986 INFO L82 PathProgramCache]: Analyzing trace with hash 331377205, now seen corresponding path program 2 times [2020-07-07 13:03:23,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:23,986 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1035791335] [2020-07-07 13:03:23,987 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:24,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,158 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,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,207 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:24,208 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:24,209 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1035791335] [2020-07-07 13:03:24,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:24,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-07 13:03:24,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020048385] [2020-07-07 13:03:24,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-07 13:03:24,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:24,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-07 13:03:24,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-07 13:03:24,212 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand 8 states. [2020-07-07 13:03:24,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:24,337 INFO L93 Difference]: Finished difference Result 110 states and 153 transitions. [2020-07-07 13:03:24,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-07 13:03:24,338 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2020-07-07 13:03:24,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:24,340 INFO L225 Difference]: With dead ends: 110 [2020-07-07 13:03:24,340 INFO L226 Difference]: Without dead ends: 66 [2020-07-07 13:03:24,342 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:24,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-07 13:03:24,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2020-07-07 13:03:24,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-07 13:03:24,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2020-07-07 13:03:24,357 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 53 [2020-07-07 13:03:24,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:24,358 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2020-07-07 13:03:24,358 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-07 13:03:24,358 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2020-07-07 13:03:24,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-07 13:03:24,361 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:24,361 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] [2020-07-07 13:03:24,361 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-07 13:03:24,361 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:24,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:24,362 INFO L82 PathProgramCache]: Analyzing trace with hash -2068833840, now seen corresponding path program 3 times [2020-07-07 13:03:24,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:24,362 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1187726564] [2020-07-07 13:03:24,363 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:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,629 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:24,631 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:24,631 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1187726564] [2020-07-07 13:03:24,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:24,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 13:03:24,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242259706] [2020-07-07 13:03:24,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 13:03:24,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:24,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 13:03:24,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-07 13:03:24,639 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand 9 states. [2020-07-07 13:03:24,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:24,792 INFO L93 Difference]: Finished difference Result 88 states and 116 transitions. [2020-07-07 13:03:24,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-07 13:03:24,794 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2020-07-07 13:03:24,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:24,801 INFO L225 Difference]: With dead ends: 88 [2020-07-07 13:03:24,802 INFO L226 Difference]: Without dead ends: 82 [2020-07-07 13:03:24,803 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-07-07 13:03:24,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-07-07 13:03:24,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2020-07-07 13:03:24,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-07 13:03:24,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2020-07-07 13:03:24,839 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 54 [2020-07-07 13:03:24,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:24,841 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2020-07-07 13:03:24,841 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 13:03:24,842 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2020-07-07 13:03:24,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-07-07 13:03:24,856 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:24,856 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] [2020-07-07 13:03:24,856 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-07 13:03:24,856 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:24,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:24,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1575340027, now seen corresponding path program 4 times [2020-07-07 13:03:24,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:24,858 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [948474675] [2020-07-07 13:03:24,858 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:24,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,292 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:25,292 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:25,292 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [948474675] [2020-07-07 13:03:25,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:25,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-07 13:03:25,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186444089] [2020-07-07 13:03:25,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-07 13:03:25,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:25,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-07 13:03:25,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2020-07-07 13:03:25,295 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand 14 states. [2020-07-07 13:03:25,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:25,534 INFO L93 Difference]: Finished difference Result 137 states and 198 transitions. [2020-07-07 13:03:25,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-07 13:03:25,535 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 125 [2020-07-07 13:03:25,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:25,540 INFO L225 Difference]: With dead ends: 137 [2020-07-07 13:03:25,540 INFO L226 Difference]: Without dead ends: 68 [2020-07-07 13:03:25,544 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:25,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-07 13:03:25,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2020-07-07 13:03:25,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-07 13:03:25,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2020-07-07 13:03:25,557 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 125 [2020-07-07 13:03:25,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:25,558 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2020-07-07 13:03:25,558 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-07 13:03:25,558 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2020-07-07 13:03:25,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-07-07 13:03:25,559 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:25,560 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] [2020-07-07 13:03:25,560 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-07 13:03:25,560 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:25,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:25,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1005193447, now seen corresponding path program 5 times [2020-07-07 13:03:25,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:25,561 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1262606972] [2020-07-07 13:03:25,561 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:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,756 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:25,756 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:25,757 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1262606972] [2020-07-07 13:03:25,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:25,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-07 13:03:25,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826129249] [2020-07-07 13:03:25,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-07 13:03:25,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:25,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-07 13:03:25,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2020-07-07 13:03:25,759 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand 11 states. [2020-07-07 13:03:25,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:25,878 INFO L93 Difference]: Finished difference Result 71 states and 85 transitions. [2020-07-07 13:03:25,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-07 13:03:25,878 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 89 [2020-07-07 13:03:25,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:25,880 INFO L225 Difference]: With dead ends: 71 [2020-07-07 13:03:25,880 INFO L226 Difference]: Without dead ends: 65 [2020-07-07 13:03:25,881 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:25,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-07-07 13:03:25,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-07-07 13:03:25,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-07-07 13:03:25,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2020-07-07 13:03:25,894 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 79 transitions. Word has length 89 [2020-07-07 13:03:25,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:25,894 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 79 transitions. [2020-07-07 13:03:25,895 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-07 13:03:25,895 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2020-07-07 13:03:25,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2020-07-07 13:03:25,897 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:25,898 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] [2020-07-07 13:03:25,898 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-07 13:03:25,898 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:25,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:25,899 INFO L82 PathProgramCache]: Analyzing trace with hash -750862549, now seen corresponding path program 6 times [2020-07-07 13:03:25,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:25,899 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [819113455] [2020-07-07 13:03:25,899 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 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:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:26,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:26,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:26,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:26,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:26,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:26,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:26,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:26,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:26,412 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:26,413 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:26,413 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [819113455] [2020-07-07 13:03:26,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:26,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-07 13:03:26,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255208513] [2020-07-07 13:03:26,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-07 13:03:26,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:26,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-07 13:03:26,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2020-07-07 13:03:26,420 INFO L87 Difference]: Start difference. First operand 65 states and 79 transitions. Second operand 13 states. [2020-07-07 13:03:26,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:26,597 INFO L93 Difference]: Finished difference Result 167 states and 226 transitions. [2020-07-07 13:03:26,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-07 13:03:26,598 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 195 [2020-07-07 13:03:26,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:26,601 INFO L225 Difference]: With dead ends: 167 [2020-07-07 13:03:26,602 INFO L226 Difference]: Without dead ends: 161 [2020-07-07 13:03:26,603 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-07-07 13:03:26,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2020-07-07 13:03:26,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 143. [2020-07-07 13:03:26,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-07-07 13:03:26,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 198 transitions. [2020-07-07 13:03:26,630 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 198 transitions. Word has length 195 [2020-07-07 13:03:26,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:26,631 INFO L479 AbstractCegarLoop]: Abstraction has 143 states and 198 transitions. [2020-07-07 13:03:26,631 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-07 13:03:26,632 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 198 transitions. [2020-07-07 13:03:26,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2020-07-07 13:03:26,637 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:26,637 INFO L422 BasicCegarLoop]: trace histogram [29, 29, 23, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 9, 9, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:03:26,637 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-07 13:03:26,638 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:26,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:26,638 INFO L82 PathProgramCache]: Analyzing trace with hash 764562375, now seen corresponding path program 7 times [2020-07-07 13:03:26,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:26,639 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1224170797] [2020-07-07 13:03:26,639 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 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:26,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:26,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:26,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:26,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:27,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:27,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:27,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:27,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:27,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:27,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:27,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:27,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:27,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:27,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:27,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:27,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:27,354 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 53 proven. 158 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2020-07-07 13:03:27,354 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:27,354 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1224170797] [2020-07-07 13:03:27,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:27,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-07-07 13:03:27,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658011141] [2020-07-07 13:03:27,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-07 13:03:27,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:27,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-07 13:03:27,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2020-07-07 13:03:27,357 INFO L87 Difference]: Start difference. First operand 143 states and 198 transitions. Second operand 19 states. [2020-07-07 13:03:27,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:27,748 INFO L93 Difference]: Finished difference Result 245 states and 381 transitions. [2020-07-07 13:03:27,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-07-07 13:03:27,749 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 265 [2020-07-07 13:03:27,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:27,752 INFO L225 Difference]: With dead ends: 245 [2020-07-07 13:03:27,752 INFO L226 Difference]: Without dead ends: 110 [2020-07-07 13:03:27,755 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=236, Invalid=694, Unknown=0, NotChecked=0, Total=930 [2020-07-07 13:03:27,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-07-07 13:03:27,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 90. [2020-07-07 13:03:27,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-07-07 13:03:27,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 113 transitions. [2020-07-07 13:03:27,776 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 113 transitions. Word has length 265 [2020-07-07 13:03:27,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:27,777 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 113 transitions. [2020-07-07 13:03:27,777 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-07 13:03:27,777 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2020-07-07 13:03:27,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2020-07-07 13:03:27,781 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:27,781 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] [2020-07-07 13:03:27,781 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-07 13:03:27,781 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:27,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:27,782 INFO L82 PathProgramCache]: Analyzing trace with hash -753564480, now seen corresponding path program 8 times [2020-07-07 13:03:27,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:27,782 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1207258151] [2020-07-07 13:03:27,782 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 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.001s / 0.001s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.001s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.001s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.001s total Resizing node table from 113 to 223 [2020-07-07 13:03:27,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:27,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:27,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,275 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2020-07-07 13:03:28,276 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:28,276 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1207258151] [2020-07-07 13:03:28,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:28,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-07 13:03:28,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268049574] [2020-07-07 13:03:28,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-07 13:03:28,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:28,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-07 13:03:28,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-07-07 13:03:28,279 INFO L87 Difference]: Start difference. First operand 90 states and 113 transitions. Second operand 15 states. [2020-07-07 13:03:28,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:28,469 INFO L93 Difference]: Finished difference Result 102 states and 126 transitions. [2020-07-07 13:03:28,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-07 13:03:28,469 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 230 [2020-07-07 13:03:28,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:28,471 INFO L225 Difference]: With dead ends: 102 [2020-07-07 13:03:28,471 INFO L226 Difference]: Without dead ends: 96 [2020-07-07 13:03:28,474 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:28,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-07-07 13:03:28,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2020-07-07 13:03:28,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-07-07 13:03:28,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 120 transitions. [2020-07-07 13:03:28,489 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 120 transitions. Word has length 230 [2020-07-07 13:03:28,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:28,490 INFO L479 AbstractCegarLoop]: Abstraction has 96 states and 120 transitions. [2020-07-07 13:03:28,490 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-07 13:03:28,491 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 120 transitions. [2020-07-07 13:03:28,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2020-07-07 13:03:28,498 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:28,499 INFO L422 BasicCegarLoop]: trace histogram [47, 47, 38, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 15, 15, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:03:28,499 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-07 13:03:28,499 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:28,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:28,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1723026983, now seen corresponding path program 9 times [2020-07-07 13:03:28,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:28,500 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1398327692] [2020-07-07 13:03:28,501 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: 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 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: 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:28,619 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,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:29,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1490 backedges. 90 proven. 263 refuted. 0 times theorem prover too weak. 1137 trivial. 0 not checked. [2020-07-07 13:03:29,780 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:29,780 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1398327692] [2020-07-07 13:03:29,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:29,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2020-07-07 13:03:29,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337500382] [2020-07-07 13:03:29,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-07-07 13:03:29,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:29,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-07-07 13:03:29,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2020-07-07 13:03:29,782 INFO L87 Difference]: Start difference. First operand 96 states and 120 transitions. Second operand 23 states. [2020-07-07 13:03:30,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:30,379 INFO L93 Difference]: Finished difference Result 220 states and 339 transitions. [2020-07-07 13:03:30,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-07-07 13:03:30,380 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 424 [2020-07-07 13:03:30,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:30,383 INFO L225 Difference]: With dead ends: 220 [2020-07-07 13:03:30,383 INFO L226 Difference]: Without dead ends: 132 [2020-07-07 13:03:30,385 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=365, Invalid=1275, Unknown=0, NotChecked=0, Total=1640 [2020-07-07 13:03:30,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-07-07 13:03:30,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 115. [2020-07-07 13:03:30,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-07-07 13:03:30,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 148 transitions. [2020-07-07 13:03:30,399 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 148 transitions. Word has length 424 [2020-07-07 13:03:30,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:30,399 INFO L479 AbstractCegarLoop]: Abstraction has 115 states and 148 transitions. [2020-07-07 13:03:30,399 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-07-07 13:03:30,400 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 148 transitions. [2020-07-07 13:03:30,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2020-07-07 13:03:30,405 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:30,406 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] [2020-07-07 13:03:30,406 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-07 13:03:30,406 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:30,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:30,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1790891897, now seen corresponding path program 10 times [2020-07-07 13:03:30,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:30,407 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [272276274] [2020-07-07 13:03:30,407 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: 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 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: 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:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:30,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:30,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:30,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:30,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:30,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:30,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:30,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:30,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:30,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:30,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:30,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:30,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:30,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:31,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:31,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:31,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:31,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:31,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1060 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 914 trivial. 0 not checked. [2020-07-07 13:03:31,445 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:31,445 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [272276274] [2020-07-07 13:03:31,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:31,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-07-07 13:03:31,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136112345] [2020-07-07 13:03:31,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-07 13:03:31,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:31,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-07 13:03:31,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2020-07-07 13:03:31,448 INFO L87 Difference]: Start difference. First operand 115 states and 148 transitions. Second operand 17 states. [2020-07-07 13:03:31,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:31,741 INFO L93 Difference]: Finished difference Result 127 states and 162 transitions. [2020-07-07 13:03:31,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-07 13:03:31,742 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 371 [2020-07-07 13:03:31,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:31,745 INFO L225 Difference]: With dead ends: 127 [2020-07-07 13:03:31,745 INFO L226 Difference]: Without dead ends: 121 [2020-07-07 13:03:31,746 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:31,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-07-07 13:03:31,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2020-07-07 13:03:31,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-07-07 13:03:31,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 156 transitions. [2020-07-07 13:03:31,764 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 156 transitions. Word has length 371 [2020-07-07 13:03:31,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:31,765 INFO L479 AbstractCegarLoop]: Abstraction has 121 states and 156 transitions. [2020-07-07 13:03:31,765 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-07 13:03:31,766 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 156 transitions. [2020-07-07 13:03:31,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2020-07-07 13:03:31,773 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:31,774 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] [2020-07-07 13:03:31,774 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-07 13:03:31,775 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:31,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:31,775 INFO L82 PathProgramCache]: Analyzing trace with hash -170434367, now seen corresponding path program 11 times [2020-07-07 13:03:31,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:31,776 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1585931177] [2020-07-07 13:03:31,776 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: 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 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 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: 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:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-07 13:03:32,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-07 13:03:32,164 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:32,165 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-07 13:03:32,165 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-07 13:03:32,167 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-07 13:03:32,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.07 01:03:32 BoogieIcfgContainer [2020-07-07 13:03:32,238 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-07 13:03:32,241 INFO L168 Benchmark]: Toolchain (without parser) took 10392.95 ms. Allocated memory was 139.5 MB in the beginning and 461.9 MB in the end (delta: 322.4 MB). Free memory was 104.4 MB in the beginning and 104.5 MB in the end (delta: -55.4 kB). Peak memory consumption was 322.4 MB. Max. memory is 7.1 GB. [2020-07-07 13:03:32,242 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 122.9 MB in the beginning and 122.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-07 13:03:32,242 INFO L168 Benchmark]: CACSL2BoogieTranslator took 228.06 ms. Allocated memory is still 139.5 MB. Free memory was 104.2 MB in the beginning and 94.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2020-07-07 13:03:32,243 INFO L168 Benchmark]: Boogie Preprocessor took 27.10 ms. Allocated memory is still 139.5 MB. Free memory was 94.8 MB in the beginning and 93.4 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:03:32,246 INFO L168 Benchmark]: RCFGBuilder took 369.69 ms. Allocated memory was 139.5 MB in the beginning and 201.3 MB in the end (delta: 61.9 MB). Free memory was 93.4 MB in the beginning and 167.9 MB in the end (delta: -74.5 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2020-07-07 13:03:32,250 INFO L168 Benchmark]: TraceAbstraction took 9763.35 ms. Allocated memory was 201.3 MB in the beginning and 461.9 MB in the end (delta: 260.6 MB). Free memory was 167.9 MB in the beginning and 104.5 MB in the end (delta: 63.5 MB). Peak memory consumption was 324.0 MB. Max. memory is 7.1 GB. [2020-07-07 13:03:32,257 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 122.9 MB in the beginning and 122.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 228.06 ms. Allocated memory is still 139.5 MB. Free memory was 104.2 MB in the beginning and 94.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.10 ms. Allocated memory is still 139.5 MB. Free memory was 94.8 MB in the beginning and 93.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 369.69 ms. Allocated memory was 139.5 MB in the beginning and 201.3 MB in the end (delta: 61.9 MB). Free memory was 93.4 MB in the beginning and 167.9 MB in the end (delta: -74.5 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9763.35 ms. Allocated memory was 201.3 MB in the beginning and 461.9 MB in the end (delta: 260.6 MB). Free memory was 167.9 MB in the beginning and 104.5 MB in the end (delta: 63.5 MB). Peak memory consumption was 324.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 31]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = __VERIFIER_nondet_int(); [L27] CALL, EXPR fibonacci(x) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L27] RET, EXPR fibonacci(x) [L27] int result = fibonacci(x); [L28] COND FALSE !(x < 8 || result >= 34) [L31] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.6s, OverallIterations: 14, TraceHistogramMax: 67, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 402 SDtfs, 1089 SDslu, 1375 SDs, 0 SdLazy, 1390 SolverSat, 753 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 631 GetRequests, 456 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 84 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, 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 incorrect! Received shutdown request...