/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_5-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-86f66a4 [2020-07-07 13:07:28,415 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-07 13:07:28,420 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-07 13:07:28,437 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-07 13:07:28,437 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-07 13:07:28,439 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-07 13:07:28,441 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-07 13:07:28,451 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-07 13:07:28,453 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-07 13:07:28,454 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-07 13:07:28,456 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-07 13:07:28,458 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-07 13:07:28,459 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-07 13:07:28,461 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-07 13:07:28,464 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-07 13:07:28,465 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-07 13:07:28,467 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-07 13:07:28,469 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-07 13:07:28,471 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-07 13:07:28,475 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-07 13:07:28,480 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-07 13:07:28,484 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-07 13:07:28,484 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-07 13:07:28,485 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-07 13:07:28,488 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-07 13:07:28,488 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-07 13:07:28,488 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-07 13:07:28,490 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-07 13:07:28,491 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-07 13:07:28,492 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-07 13:07:28,492 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-07 13:07:28,493 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-07 13:07:28,494 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-07 13:07:28,495 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-07 13:07:28,496 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-07 13:07:28,496 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-07 13:07:28,496 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-07 13:07:28,497 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-07 13:07:28,497 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-07 13:07:28,498 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-07 13:07:28,499 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-07 13:07:28,500 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:07:28,527 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-07 13:07:28,527 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-07 13:07:28,529 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-07 13:07:28,529 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-07 13:07:28,529 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-07 13:07:28,529 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-07 13:07:28,530 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-07 13:07:28,530 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-07 13:07:28,530 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-07 13:07:28,534 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-07 13:07:28,535 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-07 13:07:28,535 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-07 13:07:28,535 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-07 13:07:28,535 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-07 13:07:28,535 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-07 13:07:28,536 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-07 13:07:28,536 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-07 13:07:28,536 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-07 13:07:28,536 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 13:07:28,537 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-07 13:07:28,537 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-07 13:07:28,537 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-07 13:07:28,541 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-07 13:07:28,822 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-07 13:07:28,843 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-07 13:07:28,846 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-07 13:07:28,848 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-07 13:07:28,848 INFO L275 PluginConnector]: CDTParser initialized [2020-07-07 13:07:28,849 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_5-1.c [2020-07-07 13:07:28,923 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1c0aa3d0/4445605294fd468baaf2df85a8312945/FLAG621742ef5 [2020-07-07 13:07:29,370 INFO L306 CDTParser]: Found 1 translation units. [2020-07-07 13:07:29,370 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_5-1.c [2020-07-07 13:07:29,378 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1c0aa3d0/4445605294fd468baaf2df85a8312945/FLAG621742ef5 [2020-07-07 13:07:29,759 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1c0aa3d0/4445605294fd468baaf2df85a8312945 [2020-07-07 13:07:29,768 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-07 13:07:29,770 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-07 13:07:29,772 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-07 13:07:29,772 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-07 13:07:29,775 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-07 13:07:29,776 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 01:07:29" (1/1) ... [2020-07-07 13:07:29,780 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@705da547 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:07:29, skipping insertion in model container [2020-07-07 13:07:29,780 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 01:07:29" (1/1) ... [2020-07-07 13:07:29,788 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-07 13:07:29,801 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-07 13:07:29,953 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 13:07:29,958 INFO L203 MainTranslator]: Completed pre-run [2020-07-07 13:07:29,974 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 13:07:29,989 INFO L208 MainTranslator]: Completed translation [2020-07-07 13:07:29,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:07:29 WrapperNode [2020-07-07 13:07:29,990 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-07 13:07:29,990 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-07 13:07:29,991 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-07 13:07:29,991 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-07 13:07:30,004 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:07:29" (1/1) ... [2020-07-07 13:07:30,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:07:29" (1/1) ... [2020-07-07 13:07:30,010 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:07:29" (1/1) ... [2020-07-07 13:07:30,010 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:07:29" (1/1) ... [2020-07-07 13:07:30,014 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:07:29" (1/1) ... [2020-07-07 13:07:30,016 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:07:29" (1/1) ... [2020-07-07 13:07:30,017 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:07:29" (1/1) ... [2020-07-07 13:07:30,019 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-07 13:07:30,019 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-07 13:07:30,019 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-07 13:07:30,019 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-07 13:07:30,020 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:07:29" (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:07:30,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-07 13:07:30,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-07 13:07:30,178 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-07-07 13:07:30,179 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-07 13:07:30,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-07 13:07:30,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-07 13:07:30,179 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-07-07 13:07:30,179 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-07 13:07:30,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-07 13:07:30,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-07 13:07:30,353 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-07 13:07:30,353 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-07 13:07:30,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 01:07:30 BoogieIcfgContainer [2020-07-07 13:07:30,357 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-07 13:07:30,358 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-07 13:07:30,358 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-07 13:07:30,361 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-07 13:07:30,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.07 01:07:29" (1/3) ... [2020-07-07 13:07:30,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39aadc75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 01:07:30, skipping insertion in model container [2020-07-07 13:07:30,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:07:29" (2/3) ... [2020-07-07 13:07:30,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39aadc75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 01:07:30, skipping insertion in model container [2020-07-07 13:07:30,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 01:07:30" (3/3) ... [2020-07-07 13:07:30,365 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_5-1.c [2020-07-07 13:07:30,374 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-07 13:07:30,381 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-07 13:07:30,393 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-07 13:07:30,415 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-07 13:07:30,415 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-07 13:07:30,415 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-07 13:07:30,415 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-07 13:07:30,415 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-07 13:07:30,416 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-07 13:07:30,416 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-07 13:07:30,416 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-07 13:07:30,431 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2020-07-07 13:07:30,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-07 13:07:30,441 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:07:30,443 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:07:30,443 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:07:30,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:07:30,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1756383024, now seen corresponding path program 1 times [2020-07-07 13:07:30,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:07:30,458 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [515615803] [2020-07-07 13:07:30,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:07:30,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:30,752 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:07:30,752 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:07:30,754 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [515615803] [2020-07-07 13:07:30,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:07:30,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 13:07:30,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672614797] [2020-07-07 13:07:30,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 13:07:30,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:07:30,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 13:07:30,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-07 13:07:30,778 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 5 states. [2020-07-07 13:07:30,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:07:30,888 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2020-07-07 13:07:30,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-07 13:07:30,890 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-07 13:07:30,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:07:30,901 INFO L225 Difference]: With dead ends: 44 [2020-07-07 13:07:30,901 INFO L226 Difference]: Without dead ends: 28 [2020-07-07 13:07:30,906 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-07 13:07:30,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-07 13:07:30,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-07 13:07:30,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-07 13:07:30,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-07-07 13:07:30,964 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 16 [2020-07-07 13:07:30,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:07:30,965 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-07-07 13:07:30,965 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 13:07:30,965 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-07-07 13:07:30,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-07 13:07:30,968 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:07:30,968 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:07:30,969 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-07 13:07:30,969 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:07:30,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:07:30,969 INFO L82 PathProgramCache]: Analyzing trace with hash -389703589, now seen corresponding path program 1 times [2020-07-07 13:07:30,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:07:30,970 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1522497964] [2020-07-07 13:07:30,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:07:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:31,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:31,045 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:07:31,046 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:07:31,046 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1522497964] [2020-07-07 13:07:31,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:07:31,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 13:07:31,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120832041] [2020-07-07 13:07:31,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 13:07:31,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:07:31,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 13:07:31,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-07 13:07:31,050 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 5 states. [2020-07-07 13:07:31,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:07:31,129 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2020-07-07 13:07:31,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-07 13:07:31,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-07 13:07:31,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:07:31,132 INFO L225 Difference]: With dead ends: 36 [2020-07-07 13:07:31,132 INFO L226 Difference]: Without dead ends: 30 [2020-07-07 13:07:31,134 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:07:31,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-07 13:07:31,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-07-07 13:07:31,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-07 13:07:31,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-07-07 13:07:31,146 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 17 [2020-07-07 13:07:31,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:07:31,147 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-07-07 13:07:31,147 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 13:07:31,147 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-07-07 13:07:31,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-07 13:07:31,149 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:07:31,149 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-07 13:07:31,149 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-07 13:07:31,150 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:07:31,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:07:31,150 INFO L82 PathProgramCache]: Analyzing trace with hash 50309368, now seen corresponding path program 1 times [2020-07-07 13:07:31,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:07:31,151 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [865084984] [2020-07-07 13:07:31,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:07:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:31,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:31,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:31,291 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:07:31,292 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:07:31,292 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [865084984] [2020-07-07 13:07:31,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:07:31,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-07 13:07:31,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477740466] [2020-07-07 13:07:31,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-07 13:07:31,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:07:31,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-07 13:07:31,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-07 13:07:31,295 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 7 states. [2020-07-07 13:07:31,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:07:31,462 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2020-07-07 13:07:31,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-07 13:07:31,463 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-07-07 13:07:31,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:07:31,464 INFO L225 Difference]: With dead ends: 52 [2020-07-07 13:07:31,465 INFO L226 Difference]: Without dead ends: 30 [2020-07-07 13:07:31,466 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 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-07 13:07:31,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-07 13:07:31,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-07 13:07:31,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-07 13:07:31,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-07-07 13:07:31,497 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 33 [2020-07-07 13:07:31,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:07:31,498 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-07-07 13:07:31,501 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-07 13:07:31,502 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-07 13:07:31,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-07 13:07:31,504 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:07:31,504 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-07 13:07:31,506 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-07 13:07:31,507 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:07:31,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:07:31,508 INFO L82 PathProgramCache]: Analyzing trace with hash -643371531, now seen corresponding path program 1 times [2020-07-07 13:07:31,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:07:31,508 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [546160996] [2020-07-07 13:07:31,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:07:31,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:31,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:31,648 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:07:31,648 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:07:31,649 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [546160996] [2020-07-07 13:07:31,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:07:31,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-07 13:07:31,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064158665] [2020-07-07 13:07:31,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-07 13:07:31,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:07:31,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-07 13:07:31,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-07 13:07:31,668 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 7 states. [2020-07-07 13:07:31,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:07:31,769 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2020-07-07 13:07:31,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-07 13:07:31,770 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2020-07-07 13:07:31,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:07:31,772 INFO L225 Difference]: With dead ends: 56 [2020-07-07 13:07:31,773 INFO L226 Difference]: Without dead ends: 50 [2020-07-07 13:07:31,773 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:07:31,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-07 13:07:31,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-07-07 13:07:31,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-07 13:07:31,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2020-07-07 13:07:31,790 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 34 [2020-07-07 13:07:31,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:07:31,790 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2020-07-07 13:07:31,791 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-07 13:07:31,791 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2020-07-07 13:07:31,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-07 13:07:31,793 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:07:31,793 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-07 13:07:31,794 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-07 13:07:31,794 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:07:31,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:07:31,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1274787059, now seen corresponding path program 2 times [2020-07-07 13:07:31,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:07:31,795 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1517474516] [2020-07-07 13:07:31,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:07:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:31,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:31,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:31,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:31,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:31,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:31,955 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:07:31,956 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:07:31,956 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1517474516] [2020-07-07 13:07:31,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:07:31,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 13:07:31,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229863255] [2020-07-07 13:07:31,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 13:07:31,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:07:31,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 13:07:31,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-07 13:07:31,958 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand 9 states. [2020-07-07 13:07:32,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:07:32,078 INFO L93 Difference]: Finished difference Result 111 states and 156 transitions. [2020-07-07 13:07:32,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-07 13:07:32,079 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2020-07-07 13:07:32,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:07:32,083 INFO L225 Difference]: With dead ends: 111 [2020-07-07 13:07:32,083 INFO L226 Difference]: Without dead ends: 67 [2020-07-07 13:07:32,085 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-07-07 13:07:32,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-07-07 13:07:32,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2020-07-07 13:07:32,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-07 13:07:32,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2020-07-07 13:07:32,101 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 51 [2020-07-07 13:07:32,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:07:32,101 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2020-07-07 13:07:32,101 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 13:07:32,101 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2020-07-07 13:07:32,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-07 13:07:32,106 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:07:32,106 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-07 13:07:32,106 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-07 13:07:32,107 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:07:32,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:07:32,108 INFO L82 PathProgramCache]: Analyzing trace with hash 99184320, now seen corresponding path program 3 times [2020-07-07 13:07:32,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:07:32,109 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [29540311] [2020-07-07 13:07:32,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:07:32,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:32,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:32,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:32,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:32,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:32,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:32,273 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-07 13:07:32,274 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:07:32,274 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [29540311] [2020-07-07 13:07:32,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:07:32,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 13:07:32,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725957494] [2020-07-07 13:07:32,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 13:07:32,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:07:32,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 13:07:32,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-07 13:07:32,277 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand 9 states. [2020-07-07 13:07:32,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:07:32,412 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2020-07-07 13:07:32,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-07 13:07:32,413 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2020-07-07 13:07:32,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:07:32,416 INFO L225 Difference]: With dead ends: 89 [2020-07-07 13:07:32,416 INFO L226 Difference]: Without dead ends: 83 [2020-07-07 13:07:32,417 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-07-07 13:07:32,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-07-07 13:07:32,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2020-07-07 13:07:32,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-07-07 13:07:32,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 103 transitions. [2020-07-07 13:07:32,439 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 103 transitions. Word has length 52 [2020-07-07 13:07:32,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:07:32,440 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 103 transitions. [2020-07-07 13:07:32,440 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 13:07:32,440 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 103 transitions. [2020-07-07 13:07:32,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-07-07 13:07:32,446 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:07:32,446 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-07 13:07:32,446 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-07 13:07:32,447 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:07:32,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:07:32,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1883941443, now seen corresponding path program 4 times [2020-07-07 13:07:32,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:07:32,448 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [960557051] [2020-07-07 13:07:32,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:07:32,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:32,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:32,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:32,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:32,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:32,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:32,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:32,823 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 17 proven. 70 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2020-07-07 13:07:32,824 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:07:32,824 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [960557051] [2020-07-07 13:07:32,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:07:32,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-07 13:07:32,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291976324] [2020-07-07 13:07:32,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-07 13:07:32,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:07:32,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-07 13:07:32,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2020-07-07 13:07:32,827 INFO L87 Difference]: Start difference. First operand 77 states and 103 transitions. Second operand 15 states. [2020-07-07 13:07:33,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:07:33,104 INFO L93 Difference]: Finished difference Result 142 states and 213 transitions. [2020-07-07 13:07:33,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-07 13:07:33,105 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 123 [2020-07-07 13:07:33,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:07:33,108 INFO L225 Difference]: With dead ends: 142 [2020-07-07 13:07:33,109 INFO L226 Difference]: Without dead ends: 73 [2020-07-07 13:07:33,112 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2020-07-07 13:07:33,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-07 13:07:33,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2020-07-07 13:07:33,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-07 13:07:33,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2020-07-07 13:07:33,126 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 123 [2020-07-07 13:07:33,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:07:33,127 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2020-07-07 13:07:33,127 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-07 13:07:33,127 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2020-07-07 13:07:33,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-07-07 13:07:33,137 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:07:33,137 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-07 13:07:33,138 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-07 13:07:33,138 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:07:33,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:07:33,138 INFO L82 PathProgramCache]: Analyzing trace with hash 532445701, now seen corresponding path program 5 times [2020-07-07 13:07:33,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:07:33,139 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [240311940] [2020-07-07 13:07:33,139 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:07:33,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:33,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:33,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:33,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:33,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:33,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:33,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:33,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:33,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:33,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:33,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:33,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:33,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:33,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:33,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:33,863 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 47 proven. 92 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2020-07-07 13:07:33,864 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:07:33,864 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [240311940] [2020-07-07 13:07:33,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:07:33,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-07-07 13:07:33,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451335801] [2020-07-07 13:07:33,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-07 13:07:33,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:07:33,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-07 13:07:33,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2020-07-07 13:07:33,871 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand 18 states. [2020-07-07 13:07:34,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:07:34,344 INFO L93 Difference]: Finished difference Result 149 states and 214 transitions. [2020-07-07 13:07:34,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-07 13:07:34,345 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 193 [2020-07-07 13:07:34,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:07:34,348 INFO L225 Difference]: With dead ends: 149 [2020-07-07 13:07:34,348 INFO L226 Difference]: Without dead ends: 92 [2020-07-07 13:07:34,351 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=622, Unknown=0, NotChecked=0, Total=812 [2020-07-07 13:07:34,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-07-07 13:07:34,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 79. [2020-07-07 13:07:34,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-07-07 13:07:34,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2020-07-07 13:07:34,381 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 193 [2020-07-07 13:07:34,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:07:34,385 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2020-07-07 13:07:34,385 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-07 13:07:34,385 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2020-07-07 13:07:34,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-07-07 13:07:34,396 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:07:34,397 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:07:34,397 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-07 13:07:34,397 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:07:34,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:07:34,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1618484333, now seen corresponding path program 6 times [2020-07-07 13:07:34,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:07:34,398 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1772411245] [2020-07-07 13:07:34,398 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:07:34,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:34,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:34,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:34,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:34,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:34,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:34,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:34,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:34,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:34,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:34,924 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2020-07-07 13:07:34,924 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:07:34,925 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1772411245] [2020-07-07 13:07:34,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:07:34,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-07-07 13:07:34,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970828004] [2020-07-07 13:07:34,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-07 13:07:34,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:07:34,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-07 13:07:34,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2020-07-07 13:07:34,927 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand 16 states. [2020-07-07 13:07:35,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:07:35,383 INFO L93 Difference]: Finished difference Result 102 states and 126 transitions. [2020-07-07 13:07:35,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-07 13:07:35,383 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 140 [2020-07-07 13:07:35,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:07:35,386 INFO L225 Difference]: With dead ends: 102 [2020-07-07 13:07:35,386 INFO L226 Difference]: Without dead ends: 96 [2020-07-07 13:07:35,387 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2020-07-07 13:07:35,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-07-07 13:07:35,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2020-07-07 13:07:35,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-07-07 13:07:35,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 116 transitions. [2020-07-07 13:07:35,405 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 116 transitions. Word has length 140 [2020-07-07 13:07:35,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:07:35,406 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 116 transitions. [2020-07-07 13:07:35,406 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-07 13:07:35,406 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 116 transitions. [2020-07-07 13:07:35,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-07-07 13:07:35,409 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:07:35,409 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:07:35,409 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-07 13:07:35,409 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:07:35,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:07:35,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1853518064, now seen corresponding path program 7 times [2020-07-07 13:07:35,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:07:35,410 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2114604741] [2020-07-07 13:07:35,410 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:07:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:35,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:35,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:35,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:35,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:35,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:35,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:35,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:35,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:35,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:35,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:35,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:35,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:35,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:35,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:35,801 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 26 proven. 44 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2020-07-07 13:07:35,802 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:07:35,802 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2114604741] [2020-07-07 13:07:35,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:07:35,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-07 13:07:35,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232539115] [2020-07-07 13:07:35,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-07 13:07:35,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:07:35,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-07 13:07:35,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-07-07 13:07:35,804 INFO L87 Difference]: Start difference. First operand 93 states and 116 transitions. Second operand 12 states. [2020-07-07 13:07:35,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:07:35,986 INFO L93 Difference]: Finished difference Result 171 states and 216 transitions. [2020-07-07 13:07:35,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-07 13:07:35,986 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 175 [2020-07-07 13:07:35,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:07:35,988 INFO L225 Difference]: With dead ends: 171 [2020-07-07 13:07:35,988 INFO L226 Difference]: Without dead ends: 88 [2020-07-07 13:07:35,990 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2020-07-07 13:07:35,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-07-07 13:07:36,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2020-07-07 13:07:36,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-07 13:07:36,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 101 transitions. [2020-07-07 13:07:36,003 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 101 transitions. Word has length 175 [2020-07-07 13:07:36,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:07:36,004 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 101 transitions. [2020-07-07 13:07:36,004 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-07 13:07:36,004 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 101 transitions. [2020-07-07 13:07:36,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2020-07-07 13:07:36,007 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:07:36,008 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] [2020-07-07 13:07:36,008 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-07 13:07:36,008 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:07:36,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:07:36,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1227428144, now seen corresponding path program 8 times [2020-07-07 13:07:36,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:07:36,009 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [663685804] [2020-07-07 13:07:36,009 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:07:36,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:36,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:36,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:36,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:36,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:36,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:36,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:36,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:36,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:36,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:36,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:36,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:36,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:36,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:36,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:36,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:36,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:36,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:36,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:36,474 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 5 proven. 94 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2020-07-07 13:07:36,475 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:07:36,475 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [663685804] [2020-07-07 13:07:36,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:07:36,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-07 13:07:36,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558302273] [2020-07-07 13:07:36,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-07 13:07:36,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:07:36,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-07 13:07:36,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2020-07-07 13:07:36,478 INFO L87 Difference]: Start difference. First operand 85 states and 101 transitions. Second operand 15 states. [2020-07-07 13:07:36,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:07:36,738 INFO L93 Difference]: Finished difference Result 165 states and 217 transitions. [2020-07-07 13:07:36,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-07 13:07:36,739 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 228 [2020-07-07 13:07:36,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:07:36,740 INFO L225 Difference]: With dead ends: 165 [2020-07-07 13:07:36,740 INFO L226 Difference]: Without dead ends: 0 [2020-07-07 13:07:36,742 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2020-07-07 13:07:36,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-07 13:07:36,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-07 13:07:36,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-07 13:07:36,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-07 13:07:36,743 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 228 [2020-07-07 13:07:36,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:07:36,744 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-07 13:07:36,744 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-07 13:07:36,744 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-07 13:07:36,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-07 13:07:36,744 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-07 13:07:36,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-07 13:07:37,889 WARN L193 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2020-07-07 13:07:38,212 WARN L193 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 36 [2020-07-07 13:07:38,568 WARN L193 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2020-07-07 13:07:38,891 WARN L193 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 40 [2020-07-07 13:07:39,383 WARN L193 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2020-07-07 13:07:39,579 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 40 [2020-07-07 13:07:39,824 WARN L193 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2020-07-07 13:07:40,104 WARN L193 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2020-07-07 13:07:40,136 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-07 13:07:40,136 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-07 13:07:40,136 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-07 13:07:40,137 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-07 13:07:40,137 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-07 13:07:40,137 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-07 13:07:40,137 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 27) the Hoare annotation is: false [2020-07-07 13:07:40,137 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 23 30) the Hoare annotation is: true [2020-07-07 13:07:40,137 INFO L264 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: false [2020-07-07 13:07:40,138 INFO L264 CegarLoopResult]: At program point L26(lines 26 28) the Hoare annotation is: (and (<= main_~x~0 5) (<= 5 main_~x~0) (< 4 main_~result~0) (<= main_~result~0 5)) [2020-07-07 13:07:40,138 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (and (<= main_~x~0 5) (<= 5 main_~x~0)) [2020-07-07 13:07:40,138 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 23 30) the Hoare annotation is: (<= 5 main_~x~0) [2020-07-07 13:07:40,138 INFO L264 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: (and (<= main_~x~0 5) (<= |main_#t~ret2| 5) (<= 5 |main_#t~ret2|) (<= 5 main_~x~0)) [2020-07-07 13:07:40,138 INFO L264 CegarLoopResult]: At program point L26-2(lines 26 28) the Hoare annotation is: (<= 5 main_~x~0) [2020-07-07 13:07:40,139 INFO L264 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: (and (<= main_~x~0 5) (<= |main_#t~ret2| 5) (<= 5 |main_#t~ret2|) (<= 5 main_~x~0)) [2020-07-07 13:07:40,139 INFO L264 CegarLoopResult]: At program point L25-3(line 25) the Hoare annotation is: (and (<= main_~x~0 5) (<= |main_#t~ret2| 5) (<= 5 |main_#t~ret2|) (<= 5 main_~x~0) (< 4 main_~result~0) (<= main_~result~0 5)) [2020-07-07 13:07:40,139 INFO L264 CegarLoopResult]: At program point mainFINAL(lines 23 30) the Hoare annotation is: (<= 5 main_~x~0) [2020-07-07 13:07:40,139 INFO L264 CegarLoopResult]: At program point fiboEXIT(lines 5 13) the Hoare annotation is: (let ((.cse0 (<= |fibo_#res| 1)) (.cse1 (<= 1 |fibo_#res|))) (let ((.cse3 (and .cse0 (<= fibo_~n 2) .cse1)) (.cse4 (not (<= 2 |fibo_#in~n|)))) (and (or (and .cse0 .cse1) (not (<= |fibo_#in~n| 1)) (<= |fibo_#in~n| 0)) (or (and (<= 0 |fibo_#res|) (<= |fibo_#res| 0)) (< 0 fibo_~n)) (let ((.cse2 (= fibo_~n |fibo_#in~n|))) (or (and .cse2 (<= fibo_~n 4)) (and (<= 5 |fibo_#res|) .cse2 (<= |fibo_#res| 5)) (and (<= 6 fibo_~n) .cse2))) (or (and (<= 2 |fibo_#res|) (<= |fibo_#res| 2)) .cse3 .cse4 (<= 4 fibo_~n)) (or (and (<= |fibo_#res| 3) (<= 3 |fibo_#res|)) (<= 5 fibo_~n) (<= fibo_~n 3)) (or .cse3 .cse4 (not (<= |fibo_#in~n| 2)))))) [2020-07-07 13:07:40,139 INFO L264 CegarLoopResult]: At program point fiboFINAL(lines 5 13) the Hoare annotation is: (let ((.cse0 (<= |fibo_#res| 1)) (.cse1 (<= 1 |fibo_#res|))) (let ((.cse3 (and .cse0 (<= fibo_~n 2) .cse1)) (.cse4 (not (<= 2 |fibo_#in~n|)))) (and (or (and .cse0 .cse1) (not (<= |fibo_#in~n| 1)) (<= |fibo_#in~n| 0)) (or (and (<= 0 |fibo_#res|) (<= |fibo_#res| 0)) (< 0 fibo_~n)) (let ((.cse2 (= fibo_~n |fibo_#in~n|))) (or (and .cse2 (<= fibo_~n 4)) (and (<= 5 |fibo_#res|) .cse2 (<= |fibo_#res| 5)) (and (<= 6 fibo_~n) .cse2))) (or (and (<= 2 |fibo_#res|) (<= |fibo_#res| 2)) .cse3 .cse4 (<= 4 fibo_~n)) (or (and (<= |fibo_#res| 3) (<= 3 |fibo_#res|)) (<= 5 fibo_~n) (<= fibo_~n 3)) (or .cse3 .cse4 (not (<= |fibo_#in~n| 2)))))) [2020-07-07 13:07:40,139 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (= fibo_~n |fibo_#in~n|) (not (<= |fibo_#in~n| 1))) [2020-07-07 13:07:40,139 INFO L264 CegarLoopResult]: At program point L11-1(line 11) the Hoare annotation is: (let ((.cse2 (= fibo_~n |fibo_#in~n|))) (let ((.cse0 (<= 1 |fibo_#t~ret0|)) (.cse1 (<= |fibo_#t~ret0| 1)) (.cse3 (and (<= 3 |fibo_#t~ret0|) .cse2 (<= 5 fibo_~n) (<= |fibo_#t~ret0| 3) (<= fibo_~n 5))) (.cse4 (and .cse2 (<= fibo_~n 4) (<= |fibo_#t~ret0| 2) (<= 2 |fibo_#t~ret0|) (<= 4 fibo_~n))) (.cse5 (and (<= 6 fibo_~n) .cse2))) (and (or (and .cse0 .cse1 .cse2 (< 1 fibo_~n)) (not (<= |fibo_#in~n| 2))) (or (not (<= 3 |fibo_#in~n|)) .cse3 (and .cse0 .cse1 (<= fibo_~n 3) (<= 3 fibo_~n)) .cse4 .cse5) (or .cse3 .cse4 .cse5 (not (<= 4 |fibo_#in~n|)))))) [2020-07-07 13:07:40,140 INFO L264 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (and (< 0 fibo_~n) (= fibo_~n |fibo_#in~n|) (<= |fibo_#in~n| 1)) [2020-07-07 13:07:40,140 INFO L264 CegarLoopResult]: At program point L11-2(line 11) the Hoare annotation is: (let ((.cse2 (= fibo_~n |fibo_#in~n|))) (let ((.cse0 (<= 1 |fibo_#t~ret0|)) (.cse1 (<= |fibo_#t~ret0| 1)) (.cse3 (and (<= 3 |fibo_#t~ret0|) .cse2 (<= 5 fibo_~n) (<= |fibo_#t~ret0| 3) (<= fibo_~n 5))) (.cse4 (and .cse2 (<= fibo_~n 4) (<= |fibo_#t~ret0| 2) (<= 2 |fibo_#t~ret0|) (<= 4 fibo_~n))) (.cse5 (and (<= 6 fibo_~n) .cse2))) (and (or (and .cse0 .cse1 .cse2 (< 1 fibo_~n)) (not (<= |fibo_#in~n| 2))) (or (not (<= 3 |fibo_#in~n|)) .cse3 (and .cse0 .cse1 (<= fibo_~n 3) (<= 3 fibo_~n)) .cse4 .cse5) (or .cse3 .cse4 .cse5 (not (<= 4 |fibo_#in~n|)))))) [2020-07-07 13:07:40,140 INFO L264 CegarLoopResult]: At program point L8(lines 8 12) the Hoare annotation is: (and (< 0 fibo_~n) (= fibo_~n |fibo_#in~n|)) [2020-07-07 13:07:40,140 INFO L264 CegarLoopResult]: At program point L11-3(line 11) the Hoare annotation is: (let ((.cse0 (<= 1 |fibo_#t~ret0|)) (.cse3 (+ |fibo_#t~ret0| |fibo_#t~ret1|)) (.cse1 (<= |fibo_#t~ret0| 1)) (.cse2 (= fibo_~n |fibo_#in~n|))) (or (and .cse0 .cse1 .cse2 (<= 2 .cse3) (<= fibo_~n 3) (<= 3 fibo_~n) (<= .cse3 2)) (and .cse2 (<= 3 .cse3) (<= .cse3 3) (<= fibo_~n 4) (<= |fibo_#t~ret0| 2) (<= 2 |fibo_#t~ret0|) (<= 4 fibo_~n)) (and (<= 6 fibo_~n) .cse2) (and (<= 5 .cse3) (<= 3 |fibo_#t~ret0|) .cse2 (<= 5 fibo_~n) (<= |fibo_#t~ret0| 3) (<= .cse3 5)) (and (<= .cse3 1) .cse0 (<= 1 .cse3) .cse1 .cse2 (< 1 fibo_~n) (<= fibo_~n 2)))) [2020-07-07 13:07:40,140 INFO L264 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: (and (= fibo_~n |fibo_#in~n|) (<= |fibo_#in~n| 0)) [2020-07-07 13:07:40,140 INFO L264 CegarLoopResult]: At program point L11-4(line 11) the Hoare annotation is: (let ((.cse0 (<= 1 |fibo_#t~ret0|)) (.cse3 (+ |fibo_#t~ret0| |fibo_#t~ret1|)) (.cse1 (<= |fibo_#t~ret0| 1)) (.cse2 (= fibo_~n |fibo_#in~n|))) (or (and .cse0 .cse1 .cse2 (<= 2 .cse3) (<= fibo_~n 3) (<= 3 fibo_~n) (<= .cse3 2)) (and .cse2 (<= 3 .cse3) (<= .cse3 3) (<= fibo_~n 4) (<= |fibo_#t~ret0| 2) (<= 2 |fibo_#t~ret0|) (<= 4 fibo_~n)) (and (<= 6 fibo_~n) .cse2) (and (<= 5 .cse3) (<= 3 |fibo_#t~ret0|) .cse2 (<= 5 fibo_~n) (<= |fibo_#t~ret0| 3) (<= .cse3 5)) (and (<= .cse3 1) .cse0 (<= 1 .cse3) .cse1 .cse2 (< 1 fibo_~n) (<= fibo_~n 2)))) [2020-07-07 13:07:40,141 INFO L264 CegarLoopResult]: At program point L6(lines 6 12) the Hoare annotation is: (= fibo_~n |fibo_#in~n|) [2020-07-07 13:07:40,141 INFO L264 CegarLoopResult]: At program point L11-5(line 11) the Hoare annotation is: (let ((.cse3 (= fibo_~n |fibo_#in~n|))) (let ((.cse0 (and (<= 6 fibo_~n) .cse3))) (and (or (<= 3 |fibo_#t~ret0|) (<= fibo_~n 4) .cse0) (let ((.cse1 (<= 1 |fibo_#t~ret0|)) (.cse4 (+ |fibo_#t~ret0| |fibo_#t~ret1|)) (.cse2 (<= |fibo_#t~ret0| 1))) (or (and .cse1 (<= 2 |fibo_#res|) .cse2 .cse3 (<= 2 .cse4) (<= fibo_~n 3) (<= 3 fibo_~n) (<= .cse4 2) (<= |fibo_#res| 2)) (and (<= 5 |fibo_#res|) (<= 5 .cse4) .cse3 (<= |fibo_#res| 5) (<= 5 fibo_~n) (<= |fibo_#t~ret0| 3) (<= .cse4 5)) .cse0 (and .cse3 (<= 3 .cse4) (<= .cse4 3) (<= |fibo_#t~ret0| 2) (<= |fibo_#res| 3) (<= 2 |fibo_#t~ret0|) (<= 3 |fibo_#res|) (<= 4 fibo_~n)) (and (<= .cse4 1) .cse1 (<= 1 .cse4) .cse2 .cse3 (< 1 fibo_~n) (<= |fibo_#res| 1) (<= fibo_~n 2) (<= 1 |fibo_#res|))))))) [2020-07-07 13:07:40,141 INFO L271 CegarLoopResult]: At program point fiboENTRY(lines 5 13) the Hoare annotation is: true [2020-07-07 13:07:40,141 INFO L264 CegarLoopResult]: At program point L11-6(line 11) the Hoare annotation is: (let ((.cse2 (= fibo_~n |fibo_#in~n|))) (let ((.cse0 (and (<= 5 |fibo_#res|) .cse2 (<= |fibo_#res| 5) (<= 5 fibo_~n))) (.cse1 (and (<= 6 fibo_~n) .cse2))) (and (or (and (< 1 fibo_~n) (<= |fibo_#res| 1) (<= fibo_~n 2) (<= 1 |fibo_#res|)) .cse0 .cse1 (and .cse2 (<= fibo_~n 4) (<= 4 fibo_~n)) (and (<= 2 |fibo_#res|) (<= 3 fibo_~n) (<= |fibo_#res| 2))) (or (and .cse2 (<= fibo_~n 3)) (and (<= |fibo_#res| 3) (<= 3 |fibo_#res|)) .cse0 .cse1)))) [2020-07-07 13:07:40,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.07 01:07:40 BoogieIcfgContainer [2020-07-07 13:07:40,160 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-07 13:07:40,162 INFO L168 Benchmark]: Toolchain (without parser) took 10391.48 ms. Allocated memory was 145.2 MB in the beginning and 379.1 MB in the end (delta: 233.8 MB). Free memory was 103.4 MB in the beginning and 206.0 MB in the end (delta: -102.6 MB). Peak memory consumption was 240.0 MB. Max. memory is 7.1 GB. [2020-07-07 13:07:40,163 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 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:07:40,163 INFO L168 Benchmark]: CACSL2BoogieTranslator took 218.57 ms. Allocated memory is still 145.2 MB. Free memory was 103.0 MB in the beginning and 93.9 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2020-07-07 13:07:40,164 INFO L168 Benchmark]: Boogie Preprocessor took 28.37 ms. Allocated memory is still 145.2 MB. Free memory was 93.9 MB in the beginning and 92.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-07-07 13:07:40,165 INFO L168 Benchmark]: RCFGBuilder took 338.04 ms. Allocated memory was 145.2 MB in the beginning and 203.9 MB in the end (delta: 58.7 MB). Free memory was 92.5 MB in the beginning and 172.0 MB in the end (delta: -79.5 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-07 13:07:40,166 INFO L168 Benchmark]: TraceAbstraction took 9801.57 ms. Allocated memory was 203.9 MB in the beginning and 379.1 MB in the end (delta: 175.1 MB). Free memory was 171.4 MB in the beginning and 206.0 MB in the end (delta: -34.7 MB). Peak memory consumption was 249.2 MB. Max. memory is 7.1 GB. [2020-07-07 13:07:40,170 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 218.57 ms. Allocated memory is still 145.2 MB. Free memory was 103.0 MB in the beginning and 93.9 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.37 ms. Allocated memory is still 145.2 MB. Free memory was 93.9 MB in the beginning and 92.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 338.04 ms. Allocated memory was 145.2 MB in the beginning and 203.9 MB in the end (delta: 58.7 MB). Free memory was 92.5 MB in the beginning and 172.0 MB in the end (delta: -79.5 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9801.57 ms. Allocated memory was 203.9 MB in the beginning and 379.1 MB in the end (delta: 175.1 MB). Free memory was 171.4 MB in the beginning and 206.0 MB in the end (delta: -34.7 MB). Peak memory consumption was 249.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 27]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 23]: Procedure Contract for main Derived contract for procedure main: 5 <= x - ProcedureContractResult [Line: 5]: Procedure Contract for fibo Derived contract for procedure fibo: (((((((\result <= 1 && 1 <= \result) || !(\old(n) <= 1)) || \old(n) <= 0) && ((0 <= \result && \result <= 0) || 0 < n)) && (((n == \old(n) && n <= 4) || ((5 <= \result && n == \old(n)) && \result <= 5)) || (6 <= n && n == \old(n)))) && ((((2 <= \result && \result <= 2) || ((\result <= 1 && n <= 2) && 1 <= \result)) || !(2 <= \old(n))) || 4 <= n)) && (((\result <= 3 && 3 <= \result) || 5 <= n) || n <= 3)) && ((((\result <= 1 && n <= 2) && 1 <= \result) || !(2 <= \old(n))) || !(\old(n) <= 2)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 6.3s, OverallIterations: 11, TraceHistogramMax: 25, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 365 SDtfs, 577 SDslu, 1580 SDs, 0 SdLazy, 1376 SolverSat, 308 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 423 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred 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, 11 MinimizatonAttempts, 42 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 31 LocationsWithAnnotation, 745 PreInvPairs, 1289 NumberOfFragments, 1029 HoareAnnotationTreeSize, 745 FomulaSimplifications, 7846 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 31 FomulaSimplificationsInter, 5955 FormulaSimplificationTreeSizeReductionInter, 2.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...