java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label28_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:50:52,561 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:50:52,563 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:50:52,580 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:50:52,580 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:50:52,581 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:50:52,582 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:50:52,584 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:50:52,586 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:50:52,587 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:50:52,588 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:50:52,588 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:50:52,589 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:50:52,590 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:50:52,591 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:50:52,592 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:50:52,593 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:50:52,599 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:50:52,601 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:50:52,603 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:50:52,607 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:50:52,609 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:50:52,614 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:50:52,617 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:50:52,617 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:50:52,618 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:50:52,619 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:50:52,619 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:50:52,622 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:50:52,625 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:50:52,625 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:50:52,627 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:50:52,627 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:50:52,627 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:50:52,629 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:50:52,629 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:50:52,630 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 14:50:52,661 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:50:52,661 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:50:52,663 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:50:52,663 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:50:52,664 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:50:52,664 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:50:52,664 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:50:52,665 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:50:52,665 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:50:52,665 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:50:52,665 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:50:52,665 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:50:52,666 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:50:52,666 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:50:52,666 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:50:52,666 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:50:52,666 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:50:52,667 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:50:52,668 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:50:52,668 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:50:52,668 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:50:52,669 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:50:52,669 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:50:52,669 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:50:52,669 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:50:52,669 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:50:52,670 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:50:52,670 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:50:52,735 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:50:52,751 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:50:52,755 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:50:52,757 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:50:52,757 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:50:52,758 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label28_true-unreach-call_false-termination.c [2018-10-24 14:50:52,818 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/09e66874c/b9173cf507f34c93b2526ec306755fdb/FLAGb8e0263c2 [2018-10-24 14:50:53,387 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:50:53,390 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label28_true-unreach-call_false-termination.c [2018-10-24 14:50:53,408 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/09e66874c/b9173cf507f34c93b2526ec306755fdb/FLAGb8e0263c2 [2018-10-24 14:50:53,431 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/09e66874c/b9173cf507f34c93b2526ec306755fdb [2018-10-24 14:50:53,443 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:50:53,448 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:50:53,450 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:50:53,450 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:50:53,454 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:50:53,455 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:50:53" (1/1) ... [2018-10-24 14:50:53,458 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b65f435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:53, skipping insertion in model container [2018-10-24 14:50:53,459 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:50:53" (1/1) ... [2018-10-24 14:50:53,469 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:50:53,541 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:50:54,051 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:50:54,059 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:50:54,174 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:50:54,198 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:50:54,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:54 WrapperNode [2018-10-24 14:50:54,199 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:50:54,200 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:50:54,200 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:50:54,200 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:50:54,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:54" (1/1) ... [2018-10-24 14:50:54,230 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:54" (1/1) ... [2018-10-24 14:50:54,408 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:50:54,409 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:50:54,409 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:50:54,409 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:50:54,417 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:54" (1/1) ... [2018-10-24 14:50:54,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:54" (1/1) ... [2018-10-24 14:50:54,422 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:54" (1/1) ... [2018-10-24 14:50:54,423 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:54" (1/1) ... [2018-10-24 14:50:54,444 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:54" (1/1) ... [2018-10-24 14:50:54,456 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:54" (1/1) ... [2018-10-24 14:50:54,465 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:54" (1/1) ... [2018-10-24 14:50:54,483 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:50:54,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:50:54,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:50:54,484 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:50:54,488 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-24 14:50:54,561 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:50:54,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:50:54,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:50:57,737 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:50:57,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:50:57 BoogieIcfgContainer [2018-10-24 14:50:57,738 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:50:57,739 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:50:57,739 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:50:57,742 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:50:57,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:50:53" (1/3) ... [2018-10-24 14:50:57,743 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2756c2b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:50:57, skipping insertion in model container [2018-10-24 14:50:57,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:54" (2/3) ... [2018-10-24 14:50:57,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2756c2b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:50:57, skipping insertion in model container [2018-10-24 14:50:57,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:50:57" (3/3) ... [2018-10-24 14:50:57,746 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label28_true-unreach-call_false-termination.c [2018-10-24 14:50:57,756 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:50:57,766 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:50:57,784 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:50:57,821 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:50:57,822 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:50:57,822 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:50:57,822 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:50:57,822 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:50:57,823 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:50:57,823 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:50:57,823 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:50:57,824 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:50:57,848 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2018-10-24 14:50:57,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-24 14:50:57,860 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:57,861 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:50:57,864 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:57,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:57,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1630454777, now seen corresponding path program 1 times [2018-10-24 14:50:57,873 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:57,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:57,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:57,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:57,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:58,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:58,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:50:58,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:58,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:50:58,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:50:58,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:50:58,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:50:58,398 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 3 states. [2018-10-24 14:51:00,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:00,022 INFO L93 Difference]: Finished difference Result 531 states and 918 transitions. [2018-10-24 14:51:00,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:51:00,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2018-10-24 14:51:00,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:00,044 INFO L225 Difference]: With dead ends: 531 [2018-10-24 14:51:00,044 INFO L226 Difference]: Without dead ends: 328 [2018-10-24 14:51:00,049 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:51:00,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-10-24 14:51:00,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2018-10-24 14:51:00,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-10-24 14:51:00,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 533 transitions. [2018-10-24 14:51:00,119 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 533 transitions. Word has length 94 [2018-10-24 14:51:00,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:00,120 INFO L481 AbstractCegarLoop]: Abstraction has 328 states and 533 transitions. [2018-10-24 14:51:00,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:51:00,120 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 533 transitions. [2018-10-24 14:51:00,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-24 14:51:00,125 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:00,125 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:51:00,126 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:00,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:00,126 INFO L82 PathProgramCache]: Analyzing trace with hash -2039531712, now seen corresponding path program 1 times [2018-10-24 14:51:00,127 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:00,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:00,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:00,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:00,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:00,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:00,255 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:51:00,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:00,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:51:00,258 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:51:00,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:51:00,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:51:00,259 INFO L87 Difference]: Start difference. First operand 328 states and 533 transitions. Second operand 4 states. [2018-10-24 14:51:01,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:01,825 INFO L93 Difference]: Finished difference Result 918 states and 1534 transitions. [2018-10-24 14:51:01,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:51:01,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-10-24 14:51:01,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:01,832 INFO L225 Difference]: With dead ends: 918 [2018-10-24 14:51:01,832 INFO L226 Difference]: Without dead ends: 592 [2018-10-24 14:51:01,835 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:51:01,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2018-10-24 14:51:01,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2018-10-24 14:51:01,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-10-24 14:51:01,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 895 transitions. [2018-10-24 14:51:01,868 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 895 transitions. Word has length 100 [2018-10-24 14:51:01,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:01,868 INFO L481 AbstractCegarLoop]: Abstraction has 592 states and 895 transitions. [2018-10-24 14:51:01,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:51:01,869 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 895 transitions. [2018-10-24 14:51:01,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-24 14:51:01,873 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:01,873 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:51:01,874 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:01,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:01,874 INFO L82 PathProgramCache]: Analyzing trace with hash 976219638, now seen corresponding path program 1 times [2018-10-24 14:51:01,874 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:01,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:01,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:01,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:01,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:01,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:02,108 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:51:02,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:02,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:51:02,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:51:02,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:51:02,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:51:02,110 INFO L87 Difference]: Start difference. First operand 592 states and 895 transitions. Second operand 4 states. [2018-10-24 14:51:05,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:05,065 INFO L93 Difference]: Finished difference Result 2238 states and 3452 transitions. [2018-10-24 14:51:05,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:51:05,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2018-10-24 14:51:05,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:05,077 INFO L225 Difference]: With dead ends: 2238 [2018-10-24 14:51:05,077 INFO L226 Difference]: Without dead ends: 1648 [2018-10-24 14:51:05,080 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:51:05,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2018-10-24 14:51:05,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1648. [2018-10-24 14:51:05,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1648 states. [2018-10-24 14:51:05,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2339 transitions. [2018-10-24 14:51:05,134 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2339 transitions. Word has length 104 [2018-10-24 14:51:05,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:05,135 INFO L481 AbstractCegarLoop]: Abstraction has 1648 states and 2339 transitions. [2018-10-24 14:51:05,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:51:05,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2339 transitions. [2018-10-24 14:51:05,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-24 14:51:05,144 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:05,144 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:51:05,144 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:05,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:05,145 INFO L82 PathProgramCache]: Analyzing trace with hash -909606700, now seen corresponding path program 1 times [2018-10-24 14:51:05,145 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:05,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:05,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:05,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:05,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:05,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:05,271 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-24 14:51:05,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:05,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:51:05,272 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:51:05,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:51:05,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:51:05,273 INFO L87 Difference]: Start difference. First operand 1648 states and 2339 transitions. Second operand 3 states. [2018-10-24 14:51:07,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:07,473 INFO L93 Difference]: Finished difference Result 3822 states and 5535 transitions. [2018-10-24 14:51:07,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:51:07,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2018-10-24 14:51:07,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:07,484 INFO L225 Difference]: With dead ends: 3822 [2018-10-24 14:51:07,485 INFO L226 Difference]: Without dead ends: 2176 [2018-10-24 14:51:07,488 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:51:07,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2176 states. [2018-10-24 14:51:07,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2176 to 2176. [2018-10-24 14:51:07,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2176 states. [2018-10-24 14:51:07,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 3102 transitions. [2018-10-24 14:51:07,534 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 3102 transitions. Word has length 108 [2018-10-24 14:51:07,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:07,535 INFO L481 AbstractCegarLoop]: Abstraction has 2176 states and 3102 transitions. [2018-10-24 14:51:07,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:51:07,535 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 3102 transitions. [2018-10-24 14:51:07,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-24 14:51:07,538 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:07,538 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:51:07,540 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:07,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:07,540 INFO L82 PathProgramCache]: Analyzing trace with hash 2057736711, now seen corresponding path program 1 times [2018-10-24 14:51:07,540 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:07,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:07,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:07,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:07,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:07,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:07,727 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:51:07,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:07,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:51:07,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:51:07,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:51:07,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:51:07,729 INFO L87 Difference]: Start difference. First operand 2176 states and 3102 transitions. Second operand 4 states. [2018-10-24 14:51:08,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:08,687 INFO L93 Difference]: Finished difference Result 4669 states and 6590 transitions. [2018-10-24 14:51:08,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:51:08,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2018-10-24 14:51:08,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:08,699 INFO L225 Difference]: With dead ends: 4669 [2018-10-24 14:51:08,700 INFO L226 Difference]: Without dead ends: 2495 [2018-10-24 14:51:08,703 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:51:08,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2018-10-24 14:51:08,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 2435. [2018-10-24 14:51:08,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2435 states. [2018-10-24 14:51:08,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2435 states to 2435 states and 3389 transitions. [2018-10-24 14:51:08,753 INFO L78 Accepts]: Start accepts. Automaton has 2435 states and 3389 transitions. Word has length 110 [2018-10-24 14:51:08,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:08,754 INFO L481 AbstractCegarLoop]: Abstraction has 2435 states and 3389 transitions. [2018-10-24 14:51:08,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:51:08,754 INFO L276 IsEmpty]: Start isEmpty. Operand 2435 states and 3389 transitions. [2018-10-24 14:51:08,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-24 14:51:08,758 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:08,758 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:51:08,758 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:08,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:08,759 INFO L82 PathProgramCache]: Analyzing trace with hash 176836447, now seen corresponding path program 1 times [2018-10-24 14:51:08,759 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:08,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:08,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:08,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:08,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:08,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:08,985 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:51:08,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:08,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:51:08,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:51:08,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:51:08,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:51:08,987 INFO L87 Difference]: Start difference. First operand 2435 states and 3389 transitions. Second operand 4 states. [2018-10-24 14:51:10,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:10,211 INFO L93 Difference]: Finished difference Result 4868 states and 6776 transitions. [2018-10-24 14:51:10,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:51:10,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2018-10-24 14:51:10,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:10,224 INFO L225 Difference]: With dead ends: 4868 [2018-10-24 14:51:10,225 INFO L226 Difference]: Without dead ends: 2435 [2018-10-24 14:51:10,228 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:51:10,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2435 states. [2018-10-24 14:51:10,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2435 to 2435. [2018-10-24 14:51:10,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2435 states. [2018-10-24 14:51:10,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2435 states to 2435 states and 3365 transitions. [2018-10-24 14:51:10,272 INFO L78 Accepts]: Start accepts. Automaton has 2435 states and 3365 transitions. Word has length 115 [2018-10-24 14:51:10,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:10,273 INFO L481 AbstractCegarLoop]: Abstraction has 2435 states and 3365 transitions. [2018-10-24 14:51:10,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:51:10,273 INFO L276 IsEmpty]: Start isEmpty. Operand 2435 states and 3365 transitions. [2018-10-24 14:51:10,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-24 14:51:10,277 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:10,277 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:51:10,277 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:10,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:10,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1844441755, now seen corresponding path program 1 times [2018-10-24 14:51:10,278 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:10,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:10,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:10,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:10,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:10,357 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:51:10,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:10,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:51:10,358 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:51:10,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:51:10,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:51:10,359 INFO L87 Difference]: Start difference. First operand 2435 states and 3365 transitions. Second operand 3 states. [2018-10-24 14:51:11,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:11,335 INFO L93 Difference]: Finished difference Result 6439 states and 8780 transitions. [2018-10-24 14:51:11,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:51:11,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2018-10-24 14:51:11,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:11,348 INFO L225 Difference]: With dead ends: 6439 [2018-10-24 14:51:11,348 INFO L226 Difference]: Without dead ends: 3317 [2018-10-24 14:51:11,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:51:11,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3317 states. [2018-10-24 14:51:11,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3317 to 3266. [2018-10-24 14:51:11,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3266 states. [2018-10-24 14:51:11,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 3266 states and 3890 transitions. [2018-10-24 14:51:11,404 INFO L78 Accepts]: Start accepts. Automaton has 3266 states and 3890 transitions. Word has length 118 [2018-10-24 14:51:11,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:11,405 INFO L481 AbstractCegarLoop]: Abstraction has 3266 states and 3890 transitions. [2018-10-24 14:51:11,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:51:11,405 INFO L276 IsEmpty]: Start isEmpty. Operand 3266 states and 3890 transitions. [2018-10-24 14:51:11,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-24 14:51:11,409 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:11,410 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:51:11,410 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:11,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:11,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1325271489, now seen corresponding path program 1 times [2018-10-24 14:51:11,410 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:11,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:11,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:11,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:11,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:11,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:11,561 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-24 14:51:11,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:11,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:51:11,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:51:11,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:51:11,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:51:11,563 INFO L87 Difference]: Start difference. First operand 3266 states and 3890 transitions. Second operand 3 states. [2018-10-24 14:51:12,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:12,162 INFO L93 Difference]: Finished difference Result 6398 states and 7640 transitions. [2018-10-24 14:51:12,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:51:12,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2018-10-24 14:51:12,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:12,171 INFO L225 Difference]: With dead ends: 6398 [2018-10-24 14:51:12,172 INFO L226 Difference]: Without dead ends: 2676 [2018-10-24 14:51:12,176 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:51:12,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2676 states. [2018-10-24 14:51:12,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2676 to 2676. [2018-10-24 14:51:12,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2676 states. [2018-10-24 14:51:12,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2676 states to 2676 states and 3039 transitions. [2018-10-24 14:51:12,227 INFO L78 Accepts]: Start accepts. Automaton has 2676 states and 3039 transitions. Word has length 127 [2018-10-24 14:51:12,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:12,228 INFO L481 AbstractCegarLoop]: Abstraction has 2676 states and 3039 transitions. [2018-10-24 14:51:12,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:51:12,228 INFO L276 IsEmpty]: Start isEmpty. Operand 2676 states and 3039 transitions. [2018-10-24 14:51:12,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-24 14:51:12,232 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:12,232 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:51:12,232 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:12,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:12,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1421267728, now seen corresponding path program 1 times [2018-10-24 14:51:12,233 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:12,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:12,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:12,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:12,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:12,656 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-24 14:51:12,878 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-24 14:51:13,213 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-10-24 14:51:13,668 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-10-24 14:51:13,803 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:51:13,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:13,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-24 14:51:13,804 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-24 14:51:13,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-24 14:51:13,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2018-10-24 14:51:13,805 INFO L87 Difference]: Start difference. First operand 2676 states and 3039 transitions. Second operand 12 states. [2018-10-24 14:51:14,163 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 30 [2018-10-24 14:51:16,545 WARN L179 SmtUtils]: Spent 697.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2018-10-24 14:51:17,264 WARN L179 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2018-10-24 14:51:18,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:18,214 INFO L93 Difference]: Finished difference Result 6122 states and 6976 transitions. [2018-10-24 14:51:18,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-24 14:51:18,215 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 132 [2018-10-24 14:51:18,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:18,226 INFO L225 Difference]: With dead ends: 6122 [2018-10-24 14:51:18,226 INFO L226 Difference]: Without dead ends: 3413 [2018-10-24 14:51:18,229 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2018-10-24 14:51:18,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3413 states. [2018-10-24 14:51:18,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3413 to 3237. [2018-10-24 14:51:18,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3237 states. [2018-10-24 14:51:18,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3237 states to 3237 states and 3609 transitions. [2018-10-24 14:51:18,279 INFO L78 Accepts]: Start accepts. Automaton has 3237 states and 3609 transitions. Word has length 132 [2018-10-24 14:51:18,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:18,280 INFO L481 AbstractCegarLoop]: Abstraction has 3237 states and 3609 transitions. [2018-10-24 14:51:18,280 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-24 14:51:18,280 INFO L276 IsEmpty]: Start isEmpty. Operand 3237 states and 3609 transitions. [2018-10-24 14:51:18,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-24 14:51:18,286 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:18,287 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:51:18,287 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:18,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:18,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1664526263, now seen corresponding path program 1 times [2018-10-24 14:51:18,288 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:18,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:18,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:18,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:18,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:18,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:18,705 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-10-24 14:51:18,728 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-10-24 14:51:18,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:18,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:51:18,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:51:18,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:51:18,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:51:18,729 INFO L87 Difference]: Start difference. First operand 3237 states and 3609 transitions. Second operand 4 states. [2018-10-24 14:51:20,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:20,046 INFO L93 Difference]: Finished difference Result 6877 states and 7685 transitions. [2018-10-24 14:51:20,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:51:20,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2018-10-24 14:51:20,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:20,060 INFO L225 Difference]: With dead ends: 6877 [2018-10-24 14:51:20,060 INFO L226 Difference]: Without dead ends: 2972 [2018-10-24 14:51:20,064 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:51:20,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2972 states. [2018-10-24 14:51:20,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2972 to 2972. [2018-10-24 14:51:20,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2972 states. [2018-10-24 14:51:20,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2972 states to 2972 states and 3229 transitions. [2018-10-24 14:51:20,106 INFO L78 Accepts]: Start accepts. Automaton has 2972 states and 3229 transitions. Word has length 206 [2018-10-24 14:51:20,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:20,106 INFO L481 AbstractCegarLoop]: Abstraction has 2972 states and 3229 transitions. [2018-10-24 14:51:20,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:51:20,106 INFO L276 IsEmpty]: Start isEmpty. Operand 2972 states and 3229 transitions. [2018-10-24 14:51:20,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-24 14:51:20,113 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:20,114 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:51:20,114 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:20,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:20,114 INFO L82 PathProgramCache]: Analyzing trace with hash 768711416, now seen corresponding path program 1 times [2018-10-24 14:51:20,115 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:20,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:20,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:20,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:20,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:20,374 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-24 14:51:20,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:20,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:51:20,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:51:20,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:51:20,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:51:20,376 INFO L87 Difference]: Start difference. First operand 2972 states and 3229 transitions. Second operand 3 states. [2018-10-24 14:51:21,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:21,733 INFO L93 Difference]: Finished difference Result 5677 states and 6182 transitions. [2018-10-24 14:51:21,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:51:21,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2018-10-24 14:51:21,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:21,742 INFO L225 Difference]: With dead ends: 5677 [2018-10-24 14:51:21,742 INFO L226 Difference]: Without dead ends: 2839 [2018-10-24 14:51:21,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:51:21,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2839 states. [2018-10-24 14:51:21,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2839 to 2839. [2018-10-24 14:51:21,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2839 states. [2018-10-24 14:51:21,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2839 states to 2839 states and 3088 transitions. [2018-10-24 14:51:21,788 INFO L78 Accepts]: Start accepts. Automaton has 2839 states and 3088 transitions. Word has length 212 [2018-10-24 14:51:21,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:21,788 INFO L481 AbstractCegarLoop]: Abstraction has 2839 states and 3088 transitions. [2018-10-24 14:51:21,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:51:21,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2839 states and 3088 transitions. [2018-10-24 14:51:21,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-10-24 14:51:21,798 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:21,798 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:51:21,798 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:21,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:21,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1298101107, now seen corresponding path program 1 times [2018-10-24 14:51:21,799 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:21,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:21,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:21,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:21,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:21,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:22,297 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-24 14:51:22,648 WARN L179 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 13 [2018-10-24 14:51:23,291 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 26 [2018-10-24 14:51:23,467 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 364 proven. 10 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-10-24 14:51:23,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:51:23,468 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:51:23,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:23,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:51:23,866 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2018-10-24 14:51:23,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:51:23,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2018-10-24 14:51:23,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-24 14:51:23,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-24 14:51:23,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-10-24 14:51:23,890 INFO L87 Difference]: Start difference. First operand 2839 states and 3088 transitions. Second operand 14 states. [2018-10-24 14:51:27,590 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 25 [2018-10-24 14:51:27,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:27,897 INFO L93 Difference]: Finished difference Result 5325 states and 5806 transitions. [2018-10-24 14:51:27,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-24 14:51:27,897 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 290 [2018-10-24 14:51:27,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:27,898 INFO L225 Difference]: With dead ends: 5325 [2018-10-24 14:51:27,898 INFO L226 Difference]: Without dead ends: 0 [2018-10-24 14:51:27,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 290 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=146, Invalid=234, Unknown=0, NotChecked=0, Total=380 [2018-10-24 14:51:27,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-24 14:51:27,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-24 14:51:27,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-24 14:51:27,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-24 14:51:27,903 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 290 [2018-10-24 14:51:27,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:27,903 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-24 14:51:27,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-24 14:51:27,904 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-24 14:51:27,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-24 14:51:27,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-24 14:51:30,294 WARN L179 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2018-10-24 14:51:30,691 WARN L179 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2018-10-24 14:51:30,698 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-10-24 14:51:30,698 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-10-24 14:51:30,698 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,699 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,699 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,699 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,699 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,699 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,699 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-10-24 14:51:30,699 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-10-24 14:51:30,699 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-10-24 14:51:30,700 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-10-24 14:51:30,700 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-10-24 14:51:30,700 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-10-24 14:51:30,700 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-10-24 14:51:30,700 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-10-24 14:51:30,700 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-10-24 14:51:30,700 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 455) no Hoare annotation was computed. [2018-10-24 14:51:30,701 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-10-24 14:51:30,701 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,701 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,701 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,701 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,701 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,701 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,701 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-10-24 14:51:30,702 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-10-24 14:51:30,702 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-10-24 14:51:30,702 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-10-24 14:51:30,702 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-10-24 14:51:30,702 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-10-24 14:51:30,702 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-10-24 14:51:30,702 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-10-24 14:51:30,702 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-10-24 14:51:30,703 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-10-24 14:51:30,703 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-10-24 14:51:30,703 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-10-24 14:51:30,703 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-10-24 14:51:30,703 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-10-24 14:51:30,703 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-10-24 14:51:30,703 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,703 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,703 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,704 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,704 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,704 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-10-24 14:51:30,704 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-10-24 14:51:30,704 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-10-24 14:51:30,704 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-10-24 14:51:30,704 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-10-24 14:51:30,704 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-10-24 14:51:30,705 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-10-24 14:51:30,705 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-10-24 14:51:30,705 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-10-24 14:51:30,705 INFO L421 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse11 (= ~a16~0 6)) (.cse10 (= ~a8~0 15)) (.cse2 (= ~a21~0 1)) (.cse9 (= ~a7~0 1))) (let ((.cse0 (= ~a17~0 1)) (.cse4 (<= ~a21~0 0)) (.cse5 (= ~a8~0 13)) (.cse6 (or (and .cse10 .cse2) .cse9)) (.cse1 (= ~a12~0 8)) (.cse7 (<= ~a17~0 0)) (.cse8 (= ~a20~0 1)) (.cse3 (not .cse11))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse2) (and .cse4 (= ~a16~0 4) .cse5 .cse6 .cse1 .cse7 .cse8) (and .cse9 .cse0 .cse2) (and (not .cse9) .cse10 .cse1 .cse2) (and .cse9 .cse4 .cse3 .cse5 .cse0 .cse1) (and .cse4 .cse5 .cse6 .cse1 .cse7 .cse8 .cse11 (or (= ULTIMATE.start_calculate_output_~input 2) (= ULTIMATE.start_calculate_output_~input 4) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input) (= ULTIMATE.start_calculate_output_~input 6))) (and .cse9 .cse3 .cse2)))) [2018-10-24 14:51:30,706 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,706 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,706 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,706 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,706 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,706 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-10-24 14:51:30,706 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-10-24 14:51:30,706 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-10-24 14:51:30,707 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-10-24 14:51:30,707 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-10-24 14:51:30,707 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-10-24 14:51:30,707 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-10-24 14:51:30,707 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-10-24 14:51:30,707 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-10-24 14:51:30,707 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-10-24 14:51:30,707 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-10-24 14:51:30,707 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-10-24 14:51:30,708 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-10-24 14:51:30,708 INFO L428 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-10-24 14:51:30,708 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,708 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,708 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,708 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,708 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,708 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-10-24 14:51:30,709 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-10-24 14:51:30,709 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-10-24 14:51:30,709 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-10-24 14:51:30,709 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-10-24 14:51:30,709 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-10-24 14:51:30,709 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-10-24 14:51:30,709 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-10-24 14:51:30,709 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-10-24 14:51:30,710 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,710 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,710 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,710 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,710 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,710 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-10-24 14:51:30,710 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-10-24 14:51:30,710 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-10-24 14:51:30,710 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-10-24 14:51:30,711 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-10-24 14:51:30,711 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-10-24 14:51:30,711 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-10-24 14:51:30,711 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-10-24 14:51:30,711 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-10-24 14:51:30,711 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-10-24 14:51:30,711 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-10-24 14:51:30,711 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-10-24 14:51:30,712 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-10-24 14:51:30,712 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-10-24 14:51:30,712 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-10-24 14:51:30,712 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-10-24 14:51:30,712 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,712 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,712 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,713 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse11 (= ~a16~0 6)) (.cse10 (= ~a8~0 15)) (.cse2 (= ~a21~0 1)) (.cse9 (= ~a7~0 1))) (let ((.cse0 (= ~a17~0 1)) (.cse4 (<= ~a21~0 0)) (.cse5 (= ~a8~0 13)) (.cse6 (or (and .cse10 .cse2) .cse9)) (.cse1 (= ~a12~0 8)) (.cse7 (<= ~a17~0 0)) (.cse8 (= ~a20~0 1)) (.cse3 (not .cse11))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse2) (and .cse4 (= ~a16~0 4) .cse5 .cse6 .cse1 .cse7 .cse8) (and .cse9 .cse0 .cse2) (and (not .cse9) .cse10 .cse1 .cse2) (and .cse9 .cse4 .cse3 .cse5 .cse0 .cse1) (and .cse4 .cse5 .cse6 .cse1 .cse7 .cse8 .cse11 (or (= ULTIMATE.start_calculate_output_~input 2) (= ULTIMATE.start_calculate_output_~input 4) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input) (= ULTIMATE.start_calculate_output_~input 6))) (and .cse9 .cse3 .cse2)))) [2018-10-24 14:51:30,713 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,713 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,713 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-10-24 14:51:30,713 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-10-24 14:51:30,713 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-10-24 14:51:30,713 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-10-24 14:51:30,713 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-10-24 14:51:30,714 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-10-24 14:51:30,714 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-10-24 14:51:30,714 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-10-24 14:51:30,714 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,714 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,714 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,714 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,714 INFO L425 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,715 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-10-24 14:51:30,715 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-24 14:51:30,715 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-10-24 14:51:30,715 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-10-24 14:51:30,715 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-10-24 14:51:30,715 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-10-24 14:51:30,715 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-10-24 14:51:30,715 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-10-24 14:51:30,715 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-10-24 14:51:30,716 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-10-24 14:51:30,716 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-10-24 14:51:30,716 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-10-24 14:51:30,716 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-10-24 14:51:30,716 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,716 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,716 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,716 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,716 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,717 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-10-24 14:51:30,717 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,717 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-10-24 14:51:30,717 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-10-24 14:51:30,717 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-24 14:51:30,717 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-10-24 14:51:30,717 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-10-24 14:51:30,717 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-10-24 14:51:30,718 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-10-24 14:51:30,718 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-10-24 14:51:30,718 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-10-24 14:51:30,718 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-10-24 14:51:30,718 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-10-24 14:51:30,718 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-10-24 14:51:30,718 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-10-24 14:51:30,718 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,718 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,719 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,719 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,719 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,719 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,719 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-10-24 14:51:30,719 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-10-24 14:51:30,719 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-10-24 14:51:30,719 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-10-24 14:51:30,719 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-10-24 14:51:30,720 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-10-24 14:51:30,720 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-10-24 14:51:30,720 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-10-24 14:51:30,720 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-10-24 14:51:30,720 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-10-24 14:51:30,720 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-10-24 14:51:30,720 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-10-24 14:51:30,720 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-10-24 14:51:30,720 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-10-24 14:51:30,721 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-10-24 14:51:30,721 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-10-24 14:51:30,721 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,721 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,721 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,721 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,721 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,721 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:30,721 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-10-24 14:51:30,722 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-10-24 14:51:30,722 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-10-24 14:51:30,722 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-10-24 14:51:30,722 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-10-24 14:51:30,722 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-10-24 14:51:30,722 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-10-24 14:51:30,722 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-10-24 14:51:30,722 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-10-24 14:51:30,723 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-10-24 14:51:30,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:51:30 BoogieIcfgContainer [2018-10-24 14:51:30,756 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 14:51:30,757 INFO L168 Benchmark]: Toolchain (without parser) took 37313.15 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -360.4 MB). Peak memory consumption was 725.4 MB. Max. memory is 7.1 GB. [2018-10-24 14:51:30,762 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 14:51:30,763 INFO L168 Benchmark]: CACSL2BoogieTranslator took 749.88 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-24 14:51:30,764 INFO L168 Benchmark]: Boogie Procedure Inliner took 208.20 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 719.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -798.1 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2018-10-24 14:51:30,765 INFO L168 Benchmark]: Boogie Preprocessor took 74.74 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 14:51:30,765 INFO L168 Benchmark]: RCFGBuilder took 3254.32 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 119.1 MB). Peak memory consumption was 119.1 MB. Max. memory is 7.1 GB. [2018-10-24 14:51:30,766 INFO L168 Benchmark]: TraceAbstraction took 33017.10 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 366.5 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 286.9 MB). Peak memory consumption was 653.4 MB. Max. memory is 7.1 GB. [2018-10-24 14:51:30,777 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.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 749.88 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 208.20 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 719.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -798.1 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 74.74 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3254.32 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 119.1 MB). Peak memory consumption was 119.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 33017.10 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 366.5 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 286.9 MB). Peak memory consumption was 653.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 455]: 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 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((a17 == 1 && a12 == 8) && a21 == 1) || ((!(a16 == 6) && a12 == 8) && a21 == 1)) || ((((((a21 <= 0 && a16 == 4) && a8 == 13) && ((a8 == 15 && a21 == 1) || a7 == 1)) && a12 == 8) && a17 <= 0) && a20 == 1)) || ((a7 == 1 && a17 == 1) && a21 == 1)) || (((!(a7 == 1) && a8 == 15) && a12 == 8) && a21 == 1)) || (((((a7 == 1 && a21 <= 0) && !(a16 == 6)) && a8 == 13) && a17 == 1) && a12 == 8)) || (((((((a21 <= 0 && a8 == 13) && ((a8 == 15 && a21 == 1) || a7 == 1)) && a12 == 8) && a17 <= 0) && a20 == 1) && a16 == 6) && ((((input == 2 || input == 4) || 1 == input) || 5 == input) || input == 6))) || ((a7 == 1 && !(a16 == 6)) && a21 == 1) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((a17 == 1 && a12 == 8) && a21 == 1) || ((!(a16 == 6) && a12 == 8) && a21 == 1)) || ((((((a21 <= 0 && a16 == 4) && a8 == 13) && ((a8 == 15 && a21 == 1) || a7 == 1)) && a12 == 8) && a17 <= 0) && a20 == 1)) || ((a7 == 1 && a17 == 1) && a21 == 1)) || (((!(a7 == 1) && a8 == 15) && a12 == 8) && a21 == 1)) || (((((a7 == 1 && a21 <= 0) && !(a16 == 6)) && a8 == 13) && a17 == 1) && a12 == 8)) || (((((((a21 <= 0 && a8 == 13) && ((a8 == 15 && a21 == 1) || a7 == 1)) && a12 == 8) && a17 <= 0) && a20 == 1) && a16 == 6) && ((((input == 2 || input == 4) || 1 == input) || 5 == input) || input == 6))) || ((a7 == 1 && !(a16 == 6)) && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 199 locations, 1 error locations. SAFE Result, 32.9s OverallTime, 12 OverallIterations, 7 TraceHistogramMax, 23.3s AutomataDifference, 0.0s DeadEndRemovalTime, 2.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 1624 SDtfs, 3383 SDslu, 812 SDs, 0 SdLazy, 8356 SolverSat, 1176 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 360 GetRequests, 304 SyntacticMatches, 7 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3266occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 287 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 79 NumberOfFragments, 307 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2230 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 234 FormulaSimplificationTreeSizeReductionInter, 2.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 2006 NumberOfCodeBlocks, 2006 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1993 ConstructedInterpolants, 0 QuantifiedInterpolants, 1774086 SizeOfPredicates, 1 NumberOfNonLiveVariables, 521 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 1591/1601 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...