/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_7-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 17:20:33,502 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 17:20:33,505 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 17:20:33,519 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 17:20:33,520 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 17:20:33,521 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 17:20:33,522 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 17:20:33,524 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 17:20:33,526 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 17:20:33,527 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 17:20:33,528 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 17:20:33,529 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 17:20:33,529 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 17:20:33,530 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 17:20:33,532 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 17:20:33,533 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 17:20:33,534 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 17:20:33,535 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 17:20:33,536 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 17:20:33,539 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 17:20:33,540 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 17:20:33,541 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 17:20:33,542 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 17:20:33,543 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 17:20:33,546 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 17:20:33,546 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 17:20:33,546 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 17:20:33,547 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 17:20:33,548 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 17:20:33,549 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 17:20:33,549 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 17:20:33,550 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 17:20:33,551 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 17:20:33,551 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 17:20:33,553 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 17:20:33,553 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 17:20:33,553 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 17:20:33,554 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 17:20:33,554 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 17:20:33,555 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 17:20:33,556 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 17:20:33,557 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-17 17:20:33,568 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 17:20:33,568 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 17:20:33,571 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 17:20:33,572 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 17:20:33,572 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 17:20:33,572 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 17:20:33,573 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 17:20:33,573 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 17:20:33,573 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 17:20:33,573 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 17:20:33,574 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 17:20:33,574 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 17:20:33,574 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 17:20:33,574 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 17:20:33,574 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 17:20:33,575 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-17 17:20:33,575 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 17:20:33,575 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 17:20:33,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 17:20:33,577 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 17:20:33,577 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-17 17:20:33,577 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 17:20:33,577 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-17 17:20:33,880 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 17:20:33,895 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 17:20:33,899 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 17:20:33,901 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 17:20:33,901 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 17:20:33,902 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_7-2.c [2020-07-17 17:20:33,968 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/553977b1f/02c53a8a961b40e489c6b46a81e9d26c/FLAG9de7cbd8c [2020-07-17 17:20:34,489 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 17:20:34,490 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_7-2.c [2020-07-17 17:20:34,499 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/553977b1f/02c53a8a961b40e489c6b46a81e9d26c/FLAG9de7cbd8c [2020-07-17 17:20:34,971 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/553977b1f/02c53a8a961b40e489c6b46a81e9d26c [2020-07-17 17:20:34,983 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 17:20:34,987 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 17:20:34,988 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 17:20:34,989 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 17:20:34,993 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 17:20:34,994 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 05:20:34" (1/1) ... [2020-07-17 17:20:34,997 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12faa049 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:20:34, skipping insertion in model container [2020-07-17 17:20:34,998 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 05:20:34" (1/1) ... [2020-07-17 17:20:35,006 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 17:20:35,025 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 17:20:35,199 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 17:20:35,204 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 17:20:35,222 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 17:20:35,238 INFO L208 MainTranslator]: Completed translation [2020-07-17 17:20:35,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:20:35 WrapperNode [2020-07-17 17:20:35,238 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 17:20:35,239 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 17:20:35,239 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 17:20:35,239 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 17:20:35,253 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:20:35" (1/1) ... [2020-07-17 17:20:35,253 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:20:35" (1/1) ... [2020-07-17 17:20:35,258 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:20:35" (1/1) ... [2020-07-17 17:20:35,258 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:20:35" (1/1) ... [2020-07-17 17:20:35,262 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:20:35" (1/1) ... [2020-07-17 17:20:35,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:20:35" (1/1) ... [2020-07-17 17:20:35,265 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:20:35" (1/1) ... [2020-07-17 17:20:35,267 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 17:20:35,267 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 17:20:35,268 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 17:20:35,268 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 17:20:35,269 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:20:35" (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-17 17:20:35,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 17:20:35,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 17:20:35,455 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-07-17 17:20:35,456 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 17:20:35,456 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 17:20:35,456 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 17:20:35,456 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-07-17 17:20:35,456 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 17:20:35,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 17:20:35,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 17:20:35,648 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 17:20:35,648 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-17 17:20:35,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 05:20:35 BoogieIcfgContainer [2020-07-17 17:20:35,654 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 17:20:35,662 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 17:20:35,663 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 17:20:35,667 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 17:20:35,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 05:20:34" (1/3) ... [2020-07-17 17:20:35,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27b66644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 05:20:35, skipping insertion in model container [2020-07-17 17:20:35,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:20:35" (2/3) ... [2020-07-17 17:20:35,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27b66644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 05:20:35, skipping insertion in model container [2020-07-17 17:20:35,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 05:20:35" (3/3) ... [2020-07-17 17:20:35,673 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_7-2.c [2020-07-17 17:20:35,688 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-17 17:20:35,700 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 17:20:35,717 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 17:20:35,746 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 17:20:35,747 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 17:20:35,747 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-17 17:20:35,747 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 17:20:35,748 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 17:20:35,748 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 17:20:35,748 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 17:20:35,748 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 17:20:35,771 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2020-07-17 17:20:35,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-17 17:20:35,786 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:20:35,788 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:20:35,789 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:20:35,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:20:35,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1756383024, now seen corresponding path program 1 times [2020-07-17 17:20:35,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:20:35,822 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [701006489] [2020-07-17 17:20:35,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:20:35,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:35,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:36,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:36,050 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-17 17:20:36,051 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [701006489] [2020-07-17 17:20:36,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 17:20:36,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 17:20:36,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095469246] [2020-07-17 17:20:36,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 17:20:36,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:20:36,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 17:20:36,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 17:20:36,082 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 5 states. [2020-07-17 17:20:36,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:20:36,210 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2020-07-17 17:20:36,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 17:20:36,212 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-17 17:20:36,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:20:36,222 INFO L225 Difference]: With dead ends: 44 [2020-07-17 17:20:36,222 INFO L226 Difference]: Without dead ends: 28 [2020-07-17 17:20:36,227 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-17 17:20:36,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-17 17:20:36,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-17 17:20:36,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-17 17:20:36,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-07-17 17:20:36,281 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 16 [2020-07-17 17:20:36,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:20:36,282 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-07-17 17:20:36,282 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 17:20:36,282 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-07-17 17:20:36,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-17 17:20:36,285 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:20:36,285 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:20:36,286 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 17:20:36,286 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:20:36,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:20:36,287 INFO L82 PathProgramCache]: Analyzing trace with hash -389703589, now seen corresponding path program 1 times [2020-07-17 17:20:36,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:20:36,288 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1708809835] [2020-07-17 17:20:36,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:20:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:36,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:36,364 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-17 17:20:36,365 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1708809835] [2020-07-17 17:20:36,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 17:20:36,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 17:20:36,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032074884] [2020-07-17 17:20:36,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 17:20:36,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:20:36,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 17:20:36,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 17:20:36,370 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 5 states. [2020-07-17 17:20:36,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:20:36,464 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2020-07-17 17:20:36,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 17:20:36,466 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-17 17:20:36,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:20:36,468 INFO L225 Difference]: With dead ends: 36 [2020-07-17 17:20:36,468 INFO L226 Difference]: Without dead ends: 30 [2020-07-17 17:20:36,469 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-17 17:20:36,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-17 17:20:36,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-07-17 17:20:36,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-17 17:20:36,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-07-17 17:20:36,485 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 17 [2020-07-17 17:20:36,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:20:36,486 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-07-17 17:20:36,486 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 17:20:36,486 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-07-17 17:20:36,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-17 17:20:36,488 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:20:36,488 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] [2020-07-17 17:20:36,489 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 17:20:36,489 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:20:36,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:20:36,490 INFO L82 PathProgramCache]: Analyzing trace with hash 50309368, now seen corresponding path program 1 times [2020-07-17 17:20:36,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:20:36,490 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [336603583] [2020-07-17 17:20:36,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:20:36,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:36,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:36,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:36,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:36,678 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-17 17:20:36,678 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [336603583] [2020-07-17 17:20:36,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:20:36,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-17 17:20:36,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156900461] [2020-07-17 17:20:36,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 17:20:36,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:20:36,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 17:20:36,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-17 17:20:36,682 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 7 states. [2020-07-17 17:20:36,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:20:36,795 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2020-07-17 17:20:36,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 17:20:36,796 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-07-17 17:20:36,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:20:36,798 INFO L225 Difference]: With dead ends: 52 [2020-07-17 17:20:36,798 INFO L226 Difference]: Without dead ends: 30 [2020-07-17 17:20:36,800 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-07-17 17:20:36,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-17 17:20:36,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-17 17:20:36,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-17 17:20:36,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-07-17 17:20:36,817 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 33 [2020-07-17 17:20:36,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:20:36,818 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-07-17 17:20:36,818 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 17:20:36,818 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-17 17:20:36,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-17 17:20:36,820 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:20:36,823 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] [2020-07-17 17:20:36,824 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 17:20:36,824 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:20:36,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:20:36,825 INFO L82 PathProgramCache]: Analyzing trace with hash -643371531, now seen corresponding path program 1 times [2020-07-17 17:20:36,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:20:36,828 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [724619831] [2020-07-17 17:20:36,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:20:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:36,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:36,953 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-17 17:20:36,954 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [724619831] [2020-07-17 17:20:36,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:20:36,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-17 17:20:36,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172868117] [2020-07-17 17:20:36,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 17:20:36,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:20:36,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 17:20:36,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-17 17:20:36,957 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 6 states. [2020-07-17 17:20:37,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:20:37,103 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2020-07-17 17:20:37,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 17:20:37,104 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2020-07-17 17:20:37,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:20:37,108 INFO L225 Difference]: With dead ends: 56 [2020-07-17 17:20:37,108 INFO L226 Difference]: Without dead ends: 50 [2020-07-17 17:20:37,109 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-17 17:20:37,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-17 17:20:37,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-07-17 17:20:37,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-17 17:20:37,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2020-07-17 17:20:37,130 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 34 [2020-07-17 17:20:37,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:20:37,131 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2020-07-17 17:20:37,131 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 17:20:37,131 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2020-07-17 17:20:37,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-17 17:20:37,134 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:20:37,134 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] [2020-07-17 17:20:37,135 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 17:20:37,135 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:20:37,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:20:37,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1274787059, now seen corresponding path program 2 times [2020-07-17 17:20:37,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:20:37,136 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [866702427] [2020-07-17 17:20:37,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:20:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:37,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:37,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:37,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:37,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:37,439 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-07-17 17:20:37,440 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [866702427] [2020-07-17 17:20:37,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:20:37,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-17 17:20:37,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560539289] [2020-07-17 17:20:37,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 17:20:37,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:20:37,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 17:20:37,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-17 17:20:37,444 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand 8 states. [2020-07-17 17:20:37,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:20:37,625 INFO L93 Difference]: Finished difference Result 111 states and 156 transitions. [2020-07-17 17:20:37,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-17 17:20:37,626 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-07-17 17:20:37,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:20:37,628 INFO L225 Difference]: With dead ends: 111 [2020-07-17 17:20:37,629 INFO L226 Difference]: Without dead ends: 67 [2020-07-17 17:20:37,630 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-07-17 17:20:37,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-07-17 17:20:37,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2020-07-17 17:20:37,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-17 17:20:37,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2020-07-17 17:20:37,646 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 51 [2020-07-17 17:20:37,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:20:37,646 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2020-07-17 17:20:37,647 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 17:20:37,647 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2020-07-17 17:20:37,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-17 17:20:37,649 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:20:37,649 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] [2020-07-17 17:20:37,649 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-17 17:20:37,650 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:20:37,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:20:37,650 INFO L82 PathProgramCache]: Analyzing trace with hash 99184320, now seen corresponding path program 3 times [2020-07-17 17:20:37,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:20:37,651 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1815776542] [2020-07-17 17:20:37,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:20:37,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:37,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:37,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:37,831 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-17 17:20:37,831 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1815776542] [2020-07-17 17:20:37,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:20:37,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-17 17:20:37,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542171290] [2020-07-17 17:20:37,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 17:20:37,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:20:37,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 17:20:37,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-17 17:20:37,835 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand 7 states. [2020-07-17 17:20:37,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:20:37,967 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2020-07-17 17:20:37,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 17:20:37,968 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2020-07-17 17:20:37,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:20:37,970 INFO L225 Difference]: With dead ends: 89 [2020-07-17 17:20:37,970 INFO L226 Difference]: Without dead ends: 83 [2020-07-17 17:20:37,971 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-07-17 17:20:37,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-07-17 17:20:37,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2020-07-17 17:20:37,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-07-17 17:20:37,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 103 transitions. [2020-07-17 17:20:37,990 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 103 transitions. Word has length 52 [2020-07-17 17:20:37,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:20:37,991 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 103 transitions. [2020-07-17 17:20:37,991 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 17:20:37,991 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 103 transitions. [2020-07-17 17:20:37,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-07-17 17:20:37,995 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:20:37,995 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] [2020-07-17 17:20:37,995 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-17 17:20:37,996 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:20:37,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:20:37,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1883941443, now seen corresponding path program 4 times [2020-07-17 17:20:37,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:20:37,997 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [208622943] [2020-07-17 17:20:37,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:20:38,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:38,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:38,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:38,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:38,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:38,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:38,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:38,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:38,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:38,465 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 130 proven. 176 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2020-07-17 17:20:38,466 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [208622943] [2020-07-17 17:20:38,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:20:38,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-17 17:20:38,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670171249] [2020-07-17 17:20:38,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-17 17:20:38,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:20:38,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-17 17:20:38,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-07-17 17:20:38,471 INFO L87 Difference]: Start difference. First operand 77 states and 103 transitions. Second operand 11 states. [2020-07-17 17:20:38,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:20:38,820 INFO L93 Difference]: Finished difference Result 142 states and 213 transitions. [2020-07-17 17:20:38,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-17 17:20:38,821 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 123 [2020-07-17 17:20:38,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:20:38,828 INFO L225 Difference]: With dead ends: 142 [2020-07-17 17:20:38,828 INFO L226 Difference]: Without dead ends: 73 [2020-07-17 17:20:38,836 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2020-07-17 17:20:38,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-17 17:20:38,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2020-07-17 17:20:38,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-17 17:20:38,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2020-07-17 17:20:38,862 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 123 [2020-07-17 17:20:38,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:20:38,864 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2020-07-17 17:20:38,864 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-17 17:20:38,864 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2020-07-17 17:20:38,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-07-17 17:20:38,867 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:20:38,868 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] [2020-07-17 17:20:38,868 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-17 17:20:38,868 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:20:38,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:20:38,869 INFO L82 PathProgramCache]: Analyzing trace with hash 532445701, now seen corresponding path program 5 times [2020-07-17 17:20:38,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:20:38,873 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1730455031] [2020-07-17 17:20:38,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:20:38,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:38,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:39,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:39,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:39,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:39,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:39,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:39,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:39,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:39,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 375 proven. 413 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2020-07-17 17:20:39,415 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1730455031] [2020-07-17 17:20:39,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:20:39,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-17 17:20:39,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682042078] [2020-07-17 17:20:39,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-17 17:20:39,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:20:39,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-17 17:20:39,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-07-17 17:20:39,418 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand 13 states. [2020-07-17 17:20:39,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:20:39,870 INFO L93 Difference]: Finished difference Result 149 states and 204 transitions. [2020-07-17 17:20:39,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-17 17:20:39,871 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 193 [2020-07-17 17:20:39,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:20:39,874 INFO L225 Difference]: With dead ends: 149 [2020-07-17 17:20:39,874 INFO L226 Difference]: Without dead ends: 92 [2020-07-17 17:20:39,876 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2020-07-17 17:20:39,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-07-17 17:20:39,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2020-07-17 17:20:39,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-17 17:20:39,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 101 transitions. [2020-07-17 17:20:39,904 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 101 transitions. Word has length 193 [2020-07-17 17:20:39,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:20:39,906 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 101 transitions. [2020-07-17 17:20:39,907 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-17 17:20:39,907 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 101 transitions. [2020-07-17 17:20:39,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2020-07-17 17:20:39,915 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:20:39,915 INFO L422 BasicCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 10, 10, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:20:39,916 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-17 17:20:39,916 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:20:39,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:20:39,921 INFO L82 PathProgramCache]: Analyzing trace with hash 2080077336, now seen corresponding path program 6 times [2020-07-17 17:20:39,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:20:39,921 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2009363987] [2020-07-17 17:20:39,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:20:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:40,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:40,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:40,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:40,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:40,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:40,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:40,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:40,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:40,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:40,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:40,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:40,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:40,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:40,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:40,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2955 backedges. 552 proven. 920 refuted. 0 times theorem prover too weak. 1483 trivial. 0 not checked. [2020-07-17 17:20:40,750 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2009363987] [2020-07-17 17:20:40,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:20:40,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-07-17 17:20:40,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655233129] [2020-07-17 17:20:40,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-17 17:20:40,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:20:40,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-17 17:20:40,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2020-07-17 17:20:40,753 INFO L87 Difference]: Start difference. First operand 85 states and 101 transitions. Second operand 15 states. [2020-07-17 17:20:41,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:20:41,427 INFO L93 Difference]: Finished difference Result 194 states and 284 transitions. [2020-07-17 17:20:41,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-07-17 17:20:41,428 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 281 [2020-07-17 17:20:41,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:20:41,431 INFO L225 Difference]: With dead ends: 194 [2020-07-17 17:20:41,432 INFO L226 Difference]: Without dead ends: 119 [2020-07-17 17:20:41,434 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=245, Invalid=877, Unknown=0, NotChecked=0, Total=1122 [2020-07-17 17:20:41,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-07-17 17:20:41,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 109. [2020-07-17 17:20:41,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-07-17 17:20:41,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 138 transitions. [2020-07-17 17:20:41,456 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 138 transitions. Word has length 281 [2020-07-17 17:20:41,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:20:41,457 INFO L479 AbstractCegarLoop]: Abstraction has 109 states and 138 transitions. [2020-07-17 17:20:41,457 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-17 17:20:41,457 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 138 transitions. [2020-07-17 17:20:41,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2020-07-17 17:20:41,463 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:20:41,463 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] [2020-07-17 17:20:41,464 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-17 17:20:41,464 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:20:41,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:20:41,464 INFO L82 PathProgramCache]: Analyzing trace with hash 260846875, now seen corresponding path program 7 times [2020-07-17 17:20:41,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:20:41,465 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1393530156] [2020-07-17 17:20:41,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:20:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 17:20:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 17:20:41,681 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-17 17:20:41,682 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 17:20:41,682 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-17 17:20:41,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 05:20:41 BoogieIcfgContainer [2020-07-17 17:20:41,768 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 17:20:41,771 INFO L168 Benchmark]: Toolchain (without parser) took 6784.84 ms. Allocated memory was 135.8 MB in the beginning and 345.0 MB in the end (delta: 209.2 MB). Free memory was 101.1 MB in the beginning and 300.3 MB in the end (delta: -199.2 MB). Peak memory consumption was 223.7 MB. Max. memory is 7.1 GB. [2020-07-17 17:20:41,772 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 135.8 MB. Free memory is still 118.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-17 17:20:41,773 INFO L168 Benchmark]: CACSL2BoogieTranslator took 250.30 ms. Allocated memory is still 135.8 MB. Free memory was 100.7 MB in the beginning and 91.7 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. [2020-07-17 17:20:41,773 INFO L168 Benchmark]: Boogie Preprocessor took 27.60 ms. Allocated memory is still 135.8 MB. Free memory was 91.7 MB in the beginning and 90.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-07-17 17:20:41,774 INFO L168 Benchmark]: RCFGBuilder took 386.32 ms. Allocated memory was 135.8 MB in the beginning and 200.8 MB in the end (delta: 65.0 MB). Free memory was 89.9 MB in the beginning and 167.7 MB in the end (delta: -77.7 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-07-17 17:20:41,775 INFO L168 Benchmark]: TraceAbstraction took 6105.60 ms. Allocated memory was 200.8 MB in the beginning and 345.0 MB in the end (delta: 144.2 MB). Free memory was 166.7 MB in the beginning and 304.8 MB in the end (delta: -138.1 MB). Peak memory consumption was 224.3 MB. Max. memory is 7.1 GB. [2020-07-17 17:20:41,779 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.26 ms. Allocated memory is still 135.8 MB. Free memory is still 118.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 250.30 ms. Allocated memory is still 135.8 MB. Free memory was 100.7 MB in the beginning and 91.7 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.60 ms. Allocated memory is still 135.8 MB. Free memory was 91.7 MB in the beginning and 90.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 386.32 ms. Allocated memory was 135.8 MB in the beginning and 200.8 MB in the end (delta: 65.0 MB). Free memory was 89.9 MB in the beginning and 167.7 MB in the end (delta: -77.7 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6105.60 ms. Allocated memory was 200.8 MB in the beginning and 345.0 MB in the end (delta: 144.2 MB). Free memory was 166.7 MB in the beginning and 304.8 MB in the end (delta: -138.1 MB). Peak memory consumption was 224.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 27]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L24] int x = 7; VAL [x=7] [L25] CALL, EXPR fibo(x) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=5, \result=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=6, \result=8, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=5, \result=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=7, \result=13, fibo(n-1)=8, fibo(n-2)=5, n=7] [L25] RET, EXPR fibo(x) VAL [fibo(x)=13, x=7] [L25] int result = fibo(x); VAL [fibo(x)=13, result=13, x=7] [L26] COND TRUE result == 13 VAL [result=13, x=7] [L27] __VERIFIER_error() VAL [result=13, x=7] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.9s, OverallIterations: 10, TraceHistogramMax: 41, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 273 SDtfs, 553 SDslu, 804 SDs, 0 SdLazy, 864 SolverSat, 279 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 331 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred 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.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 40 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1169 NumberOfCodeBlocks, 1169 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 791 ConstructedInterpolants, 0 QuantifiedInterpolants, 245967 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 2 PerfectInterpolantSequences, 3333/4887 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...