java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label21_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 12:53:53,629 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 12:53:53,631 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 12:53:53,643 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 12:53:53,643 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 12:53:53,644 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 12:53:53,646 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 12:53:53,648 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 12:53:53,649 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 12:53:53,650 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 12:53:53,651 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 12:53:53,651 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 12:53:53,652 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 12:53:53,653 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 12:53:53,654 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 12:53:53,655 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 12:53:53,656 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 12:53:53,658 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 12:53:53,660 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 12:53:53,662 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 12:53:53,663 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 12:53:53,665 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 12:53:53,667 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 12:53:53,668 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 12:53:53,668 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 12:53:53,669 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 12:53:53,670 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 12:53:53,671 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 12:53:53,672 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 12:53:53,673 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 12:53:53,673 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 12:53:53,674 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 12:53:53,674 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 12:53:53,675 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 12:53:53,676 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 12:53:53,676 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 12:53:53,677 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-11-07 12:53:53,692 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 12:53:53,692 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 12:53:53,693 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 12:53:53,693 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 12:53:53,694 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 12:53:53,694 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 12:53:53,694 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 12:53:53,694 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 12:53:53,695 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 12:53:53,695 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 12:53:53,695 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 12:53:53,695 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 12:53:53,696 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 12:53:53,696 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 12:53:53,696 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 12:53:53,696 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 12:53:53,697 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 12:53:53,697 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 12:53:53,697 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 12:53:53,697 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 12:53:53,698 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 12:53:53,698 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 12:53:53,698 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 12:53:53,698 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 12:53:53,698 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 12:53:53,699 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 12:53:53,699 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 12:53:53,699 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 12:53:53,699 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 12:53:53,699 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 12:53:53,699 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 12:53:53,700 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 12:53:53,700 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 12:53:53,700 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 12:53:53,746 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 12:53:53,759 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 12:53:53,763 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 12:53:53,764 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 12:53:53,765 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 12:53:53,765 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label21_true-unreach-call_false-termination.c [2018-11-07 12:53:53,825 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6892d0bb2/19eff84e50834e37bc6f4da89dc34a22/FLAGb831d1b04 [2018-11-07 12:53:54,437 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 12:53:54,437 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label21_true-unreach-call_false-termination.c [2018-11-07 12:53:54,452 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6892d0bb2/19eff84e50834e37bc6f4da89dc34a22/FLAGb831d1b04 [2018-11-07 12:53:54,471 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6892d0bb2/19eff84e50834e37bc6f4da89dc34a22 [2018-11-07 12:53:54,482 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 12:53:54,484 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 12:53:54,485 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 12:53:54,485 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 12:53:54,489 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 12:53:54,490 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:53:54" (1/1) ... [2018-11-07 12:53:54,493 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@502be44a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:54, skipping insertion in model container [2018-11-07 12:53:54,493 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:53:54" (1/1) ... [2018-11-07 12:53:54,504 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 12:53:54,560 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 12:53:54,999 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 12:53:55,005 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 12:53:55,157 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 12:53:55,184 INFO L193 MainTranslator]: Completed translation [2018-11-07 12:53:55,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:55 WrapperNode [2018-11-07 12:53:55,185 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 12:53:55,186 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 12:53:55,186 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 12:53:55,186 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 12:53:55,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:55" (1/1) ... [2018-11-07 12:53:55,215 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:55" (1/1) ... [2018-11-07 12:53:55,313 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 12:53:55,313 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 12:53:55,313 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 12:53:55,314 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 12:53:55,322 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:55" (1/1) ... [2018-11-07 12:53:55,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:55" (1/1) ... [2018-11-07 12:53:55,327 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:55" (1/1) ... [2018-11-07 12:53:55,327 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:55" (1/1) ... [2018-11-07 12:53:55,366 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:55" (1/1) ... [2018-11-07 12:53:55,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:55" (1/1) ... [2018-11-07 12:53:55,390 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:55" (1/1) ... [2018-11-07 12:53:55,398 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 12:53:55,399 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 12:53:55,399 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 12:53:55,399 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 12:53:55,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 12:53:55,476 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 12:53:55,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 12:53:55,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 12:53:55,476 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 12:53:55,477 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 12:53:55,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 12:53:55,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 12:53:55,477 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 12:53:55,477 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 12:53:58,698 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 12:53:58,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:53:58 BoogieIcfgContainer [2018-11-07 12:53:58,702 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 12:53:58,703 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 12:53:58,703 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 12:53:58,706 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 12:53:58,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:53:54" (1/3) ... [2018-11-07 12:53:58,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a01d19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:53:58, skipping insertion in model container [2018-11-07 12:53:58,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:55" (2/3) ... [2018-11-07 12:53:58,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a01d19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:53:58, skipping insertion in model container [2018-11-07 12:53:58,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:53:58" (3/3) ... [2018-11-07 12:53:58,709 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label21_true-unreach-call_false-termination.c [2018-11-07 12:53:58,717 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 12:53:58,725 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 12:53:58,739 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 12:53:58,777 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 12:53:58,777 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 12:53:58,778 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 12:53:58,778 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 12:53:58,778 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 12:53:58,779 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 12:53:58,779 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 12:53:58,779 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 12:53:58,806 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-07 12:53:58,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-07 12:53:58,819 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:53:58,820 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:53:58,823 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:53:58,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:53:58,829 INFO L82 PathProgramCache]: Analyzing trace with hash 64907071, now seen corresponding path program 1 times [2018-11-07 12:53:58,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:53:58,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:58,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:53:58,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:58,886 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:53:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:53:59,478 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:53:59,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:53:59,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:53:59,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 12:53:59,636 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:53:59,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:53:59,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:53:59,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:53:59,666 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-11-07 12:54:01,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:54:01,210 INFO L93 Difference]: Finished difference Result 618 states and 1056 transitions. [2018-11-07 12:54:01,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:54:01,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2018-11-07 12:54:01,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:54:01,232 INFO L225 Difference]: With dead ends: 618 [2018-11-07 12:54:01,232 INFO L226 Difference]: Without dead ends: 379 [2018-11-07 12:54:01,240 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:54:01,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-11-07 12:54:01,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2018-11-07 12:54:01,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-11-07 12:54:01,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 621 transitions. [2018-11-07 12:54:01,329 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 621 transitions. Word has length 103 [2018-11-07 12:54:01,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:54:01,330 INFO L480 AbstractCegarLoop]: Abstraction has 379 states and 621 transitions. [2018-11-07 12:54:01,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:54:01,330 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 621 transitions. [2018-11-07 12:54:01,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-07 12:54:01,339 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:54:01,341 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:54:01,341 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:54:01,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:01,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1456017738, now seen corresponding path program 1 times [2018-11-07 12:54:01,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:54:01,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:01,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:54:01,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:01,345 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:54:01,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:54:01,644 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:54:01,728 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:54:01,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:54:01,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 12:54:01,729 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:54:01,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 12:54:01,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 12:54:01,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 12:54:01,733 INFO L87 Difference]: Start difference. First operand 379 states and 621 transitions. Second operand 6 states. [2018-11-07 12:54:02,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:54:02,896 INFO L93 Difference]: Finished difference Result 750 states and 1238 transitions. [2018-11-07 12:54:02,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 12:54:02,896 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2018-11-07 12:54:02,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:54:02,901 INFO L225 Difference]: With dead ends: 750 [2018-11-07 12:54:02,901 INFO L226 Difference]: Without dead ends: 377 [2018-11-07 12:54:02,904 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-07 12:54:02,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-11-07 12:54:02,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 372. [2018-11-07 12:54:02,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-11-07 12:54:02,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 580 transitions. [2018-11-07 12:54:02,951 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 580 transitions. Word has length 119 [2018-11-07 12:54:02,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:54:02,951 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 580 transitions. [2018-11-07 12:54:02,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 12:54:02,952 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 580 transitions. [2018-11-07 12:54:02,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-07 12:54:02,955 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:54:02,956 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 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-11-07 12:54:02,956 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:54:02,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:02,956 INFO L82 PathProgramCache]: Analyzing trace with hash 641817781, now seen corresponding path program 1 times [2018-11-07 12:54:02,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:54:02,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:02,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:54:02,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:02,958 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:54:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:54:03,227 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:54:03,613 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:54:03,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:54:03,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 12:54:03,614 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:54:03,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 12:54:03,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 12:54:03,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 12:54:03,615 INFO L87 Difference]: Start difference. First operand 372 states and 580 transitions. Second operand 6 states. [2018-11-07 12:54:05,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:54:05,471 INFO L93 Difference]: Finished difference Result 952 states and 1493 transitions. [2018-11-07 12:54:05,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 12:54:05,473 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 126 [2018-11-07 12:54:05,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:54:05,478 INFO L225 Difference]: With dead ends: 952 [2018-11-07 12:54:05,479 INFO L226 Difference]: Without dead ends: 586 [2018-11-07 12:54:05,481 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 12:54:05,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2018-11-07 12:54:05,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 563. [2018-11-07 12:54:05,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2018-11-07 12:54:05,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 823 transitions. [2018-11-07 12:54:05,513 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 823 transitions. Word has length 126 [2018-11-07 12:54:05,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:54:05,513 INFO L480 AbstractCegarLoop]: Abstraction has 563 states and 823 transitions. [2018-11-07 12:54:05,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 12:54:05,514 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 823 transitions. [2018-11-07 12:54:05,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-07 12:54:05,518 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:54:05,518 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 12:54:05,519 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:54:05,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:05,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1176628157, now seen corresponding path program 1 times [2018-11-07 12:54:05,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:54:05,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:05,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:54:05,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:05,521 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:54:05,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:54:05,929 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:54:05,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:54:05,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 12:54:05,930 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:54:05,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 12:54:05,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 12:54:05,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 12:54:05,932 INFO L87 Difference]: Start difference. First operand 563 states and 823 transitions. Second operand 5 states. [2018-11-07 12:54:08,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:54:08,244 INFO L93 Difference]: Finished difference Result 1269 states and 1897 transitions. [2018-11-07 12:54:08,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 12:54:08,245 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2018-11-07 12:54:08,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:54:08,250 INFO L225 Difference]: With dead ends: 1269 [2018-11-07 12:54:08,250 INFO L226 Difference]: Without dead ends: 562 [2018-11-07 12:54:08,253 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 12:54:08,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2018-11-07 12:54:08,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2018-11-07 12:54:08,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2018-11-07 12:54:08,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 811 transitions. [2018-11-07 12:54:08,271 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 811 transitions. Word has length 130 [2018-11-07 12:54:08,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:54:08,271 INFO L480 AbstractCegarLoop]: Abstraction has 562 states and 811 transitions. [2018-11-07 12:54:08,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 12:54:08,272 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 811 transitions. [2018-11-07 12:54:08,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-07 12:54:08,274 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:54:08,275 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 12:54:08,275 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:54:08,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:08,275 INFO L82 PathProgramCache]: Analyzing trace with hash 956906181, now seen corresponding path program 1 times [2018-11-07 12:54:08,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:54:08,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:08,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:54:08,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:08,277 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:54:08,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:54:08,520 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:54:08,812 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:54:08,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:54:08,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 12:54:08,812 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:54:08,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 12:54:08,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 12:54:08,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 12:54:08,814 INFO L87 Difference]: Start difference. First operand 562 states and 811 transitions. Second operand 6 states. [2018-11-07 12:54:10,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:54:10,118 INFO L93 Difference]: Finished difference Result 1544 states and 2298 transitions. [2018-11-07 12:54:10,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 12:54:10,124 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2018-11-07 12:54:10,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:54:10,133 INFO L225 Difference]: With dead ends: 1544 [2018-11-07 12:54:10,133 INFO L226 Difference]: Without dead ends: 988 [2018-11-07 12:54:10,136 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 12:54:10,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2018-11-07 12:54:10,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 962. [2018-11-07 12:54:10,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 962 states. [2018-11-07 12:54:10,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1349 transitions. [2018-11-07 12:54:10,175 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1349 transitions. Word has length 134 [2018-11-07 12:54:10,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:54:10,176 INFO L480 AbstractCegarLoop]: Abstraction has 962 states and 1349 transitions. [2018-11-07 12:54:10,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 12:54:10,176 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1349 transitions. [2018-11-07 12:54:10,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-07 12:54:10,180 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:54:10,181 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 12:54:10,181 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:54:10,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:10,182 INFO L82 PathProgramCache]: Analyzing trace with hash -973773874, now seen corresponding path program 1 times [2018-11-07 12:54:10,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:54:10,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:10,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:54:10,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:10,183 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:54:10,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:54:10,865 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:54:10,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:54:10,865 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:54:10,866 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 141 with the following transitions: [2018-11-07 12:54:10,869 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [495], [497], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:54:10,919 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:54:10,919 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:54:12,630 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:54:12,632 INFO L272 AbstractInterpreter]: Visited 108 different actions 320 times. Merged at 7 different actions 20 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 12:54:12,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:12,671 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:54:12,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:54:12,672 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 12:54:12,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:54:12,687 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:54:12,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:54:12,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:54:13,049 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 12:54:13,049 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:54:13,483 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 12:54:13,514 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:54:13,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 10 [2018-11-07 12:54:13,514 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:54:13,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:54:13,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:54:13,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-07 12:54:13,516 INFO L87 Difference]: Start difference. First operand 962 states and 1349 transitions. Second operand 3 states. [2018-11-07 12:54:15,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:54:15,295 INFO L93 Difference]: Finished difference Result 2213 states and 3145 transitions. [2018-11-07 12:54:15,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:54:15,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2018-11-07 12:54:15,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:54:15,311 INFO L225 Difference]: With dead ends: 2213 [2018-11-07 12:54:15,313 INFO L226 Difference]: Without dead ends: 1257 [2018-11-07 12:54:15,317 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 282 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-07 12:54:15,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2018-11-07 12:54:15,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1255. [2018-11-07 12:54:15,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1255 states. [2018-11-07 12:54:15,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1670 transitions. [2018-11-07 12:54:15,374 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1670 transitions. Word has length 140 [2018-11-07 12:54:15,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:54:15,375 INFO L480 AbstractCegarLoop]: Abstraction has 1255 states and 1670 transitions. [2018-11-07 12:54:15,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:54:15,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1670 transitions. [2018-11-07 12:54:15,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-07 12:54:15,381 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:54:15,381 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:54:15,381 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:54:15,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:15,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1528509422, now seen corresponding path program 1 times [2018-11-07 12:54:15,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:54:15,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:15,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:54:15,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:15,384 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:54:15,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:54:15,682 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 41 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:54:15,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:54:15,683 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:54:15,683 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 144 with the following transitions: [2018-11-07 12:54:15,683 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [495], [497], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:54:15,691 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:54:15,691 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:54:15,982 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:54:15,982 INFO L272 AbstractInterpreter]: Visited 104 different actions 104 times. Never merged. Never widened. Never found a fixpoint. Largest state had 38 variables. [2018-11-07 12:54:16,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:16,020 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:54:16,447 INFO L227 lantSequenceWeakener]: Weakened 121 states. On average, predicates are now at 80.91% of their original sizes. [2018-11-07 12:54:16,447 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:54:17,743 INFO L415 sIntCurrentIteration]: We unified 142 AI predicates to 142 [2018-11-07 12:54:17,744 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:54:17,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:54:17,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 17 [2018-11-07 12:54:17,745 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:54:17,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 12:54:17,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 12:54:17,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-11-07 12:54:17,747 INFO L87 Difference]: Start difference. First operand 1255 states and 1670 transitions. Second operand 13 states. [2018-11-07 12:54:28,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:54:28,823 INFO L93 Difference]: Finished difference Result 2654 states and 3555 transitions. [2018-11-07 12:54:28,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 12:54:28,823 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 143 [2018-11-07 12:54:28,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:54:28,832 INFO L225 Difference]: With dead ends: 2654 [2018-11-07 12:54:28,832 INFO L226 Difference]: Without dead ends: 1405 [2018-11-07 12:54:28,837 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 149 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2018-11-07 12:54:28,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2018-11-07 12:54:28,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1400. [2018-11-07 12:54:28,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1400 states. [2018-11-07 12:54:28,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 1824 transitions. [2018-11-07 12:54:28,880 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 1824 transitions. Word has length 143 [2018-11-07 12:54:28,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:54:28,881 INFO L480 AbstractCegarLoop]: Abstraction has 1400 states and 1824 transitions. [2018-11-07 12:54:28,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 12:54:28,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 1824 transitions. [2018-11-07 12:54:28,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-07 12:54:28,886 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:54:28,886 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 12:54:28,886 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:54:28,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:28,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1955101065, now seen corresponding path program 1 times [2018-11-07 12:54:28,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:54:28,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:28,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:54:28,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:28,888 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:54:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:54:29,336 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:54:29,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:54:29,337 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:54:29,337 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 170 with the following transitions: [2018-11-07 12:54:29,339 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [495], [497], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:54:29,344 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:54:29,344 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:54:29,944 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:54:29,945 INFO L272 AbstractInterpreter]: Visited 107 different actions 208 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-11-07 12:54:29,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:29,983 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:54:30,503 INFO L227 lantSequenceWeakener]: Weakened 34 states. On average, predicates are now at 81.62% of their original sizes. [2018-11-07 12:54:30,503 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:54:31,711 INFO L415 sIntCurrentIteration]: We unified 168 AI predicates to 168 [2018-11-07 12:54:31,711 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:54:31,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:54:31,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 19 [2018-11-07 12:54:31,712 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:54:31,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 12:54:31,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 12:54:31,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-11-07 12:54:31,714 INFO L87 Difference]: Start difference. First operand 1400 states and 1824 transitions. Second operand 15 states. [2018-11-07 12:54:45,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:54:45,778 INFO L93 Difference]: Finished difference Result 3249 states and 4315 transitions. [2018-11-07 12:54:45,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 12:54:45,778 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 169 [2018-11-07 12:54:45,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:54:45,788 INFO L225 Difference]: With dead ends: 3249 [2018-11-07 12:54:45,788 INFO L226 Difference]: Without dead ends: 2000 [2018-11-07 12:54:45,792 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 178 GetRequests, 138 SyntacticMatches, 17 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2018-11-07 12:54:45,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2000 states. [2018-11-07 12:54:45,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 1993. [2018-11-07 12:54:45,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1993 states. [2018-11-07 12:54:45,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 2498 transitions. [2018-11-07 12:54:45,853 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 2498 transitions. Word has length 169 [2018-11-07 12:54:45,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:54:45,853 INFO L480 AbstractCegarLoop]: Abstraction has 1993 states and 2498 transitions. [2018-11-07 12:54:45,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 12:54:45,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 2498 transitions. [2018-11-07 12:54:45,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-07 12:54:45,860 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:54:45,860 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 12:54:45,861 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:54:45,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:45,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1171623708, now seen corresponding path program 1 times [2018-11-07 12:54:45,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:54:45,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:45,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:54:45,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:45,862 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:54:45,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:54:46,010 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 75 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 12:54:46,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:54:46,011 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:54:46,011 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 175 with the following transitions: [2018-11-07 12:54:46,012 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [34], [38], [42], [45], [50], [52], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [495], [497], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:54:46,016 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:54:46,017 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:54:46,514 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:54:46,514 INFO L272 AbstractInterpreter]: Visited 109 different actions 326 times. Merged at 7 different actions 21 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-07 12:54:46,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:46,519 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:54:46,804 INFO L227 lantSequenceWeakener]: Weakened 169 states. On average, predicates are now at 80.7% of their original sizes. [2018-11-07 12:54:46,805 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:54:47,134 INFO L415 sIntCurrentIteration]: We unified 173 AI predicates to 173 [2018-11-07 12:54:47,135 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:54:47,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:54:47,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-07 12:54:47,135 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:54:47,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 12:54:47,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 12:54:47,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 12:54:47,136 INFO L87 Difference]: Start difference. First operand 1993 states and 2498 transitions. Second operand 10 states. [2018-11-07 12:54:53,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:54:53,980 INFO L93 Difference]: Finished difference Result 3948 states and 5087 transitions. [2018-11-07 12:54:53,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 12:54:53,980 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 174 [2018-11-07 12:54:53,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:54:53,991 INFO L225 Difference]: With dead ends: 3948 [2018-11-07 12:54:53,992 INFO L226 Difference]: Without dead ends: 2478 [2018-11-07 12:54:53,998 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 181 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-11-07 12:54:54,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2478 states. [2018-11-07 12:54:54,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2478 to 2435. [2018-11-07 12:54:54,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2435 states. [2018-11-07 12:54:54,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2435 states to 2435 states and 2970 transitions. [2018-11-07 12:54:54,069 INFO L78 Accepts]: Start accepts. Automaton has 2435 states and 2970 transitions. Word has length 174 [2018-11-07 12:54:54,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:54:54,069 INFO L480 AbstractCegarLoop]: Abstraction has 2435 states and 2970 transitions. [2018-11-07 12:54:54,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 12:54:54,070 INFO L276 IsEmpty]: Start isEmpty. Operand 2435 states and 2970 transitions. [2018-11-07 12:54:54,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-07 12:54:54,078 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:54:54,078 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 12:54:54,078 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:54:54,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:54,079 INFO L82 PathProgramCache]: Analyzing trace with hash 129353209, now seen corresponding path program 1 times [2018-11-07 12:54:54,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:54:54,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:54,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:54:54,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:54,080 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:54:54,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:54:54,276 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:54:54,407 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 109 proven. 34 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-07 12:54:54,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:54:54,408 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:54:54,408 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 205 with the following transitions: [2018-11-07 12:54:54,408 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [45], [50], [52], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [495], [497], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:54:54,411 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:54:54,411 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:54:54,756 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:54:54,756 INFO L272 AbstractInterpreter]: Visited 109 different actions 223 times. Merged at 7 different actions 16 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 12:54:54,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:54,793 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:54:55,120 INFO L227 lantSequenceWeakener]: Weakened 113 states. On average, predicates are now at 80.66% of their original sizes. [2018-11-07 12:54:55,121 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:54:55,427 INFO L415 sIntCurrentIteration]: We unified 203 AI predicates to 203 [2018-11-07 12:54:55,427 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:54:55,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:54:55,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-07 12:54:55,428 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:54:55,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 12:54:55,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 12:54:55,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2018-11-07 12:54:55,429 INFO L87 Difference]: Start difference. First operand 2435 states and 2970 transitions. Second operand 18 states. [2018-11-07 12:55:04,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:55:04,052 INFO L93 Difference]: Finished difference Result 4875 states and 6140 transitions. [2018-11-07 12:55:04,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 12:55:04,052 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 204 [2018-11-07 12:55:04,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:55:04,064 INFO L225 Difference]: With dead ends: 4875 [2018-11-07 12:55:04,065 INFO L226 Difference]: Without dead ends: 3037 [2018-11-07 12:55:04,072 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 214 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=645, Unknown=0, NotChecked=0, Total=812 [2018-11-07 12:55:04,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3037 states. [2018-11-07 12:55:04,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3037 to 3028. [2018-11-07 12:55:04,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3028 states. [2018-11-07 12:55:04,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3028 states to 3028 states and 3632 transitions. [2018-11-07 12:55:04,147 INFO L78 Accepts]: Start accepts. Automaton has 3028 states and 3632 transitions. Word has length 204 [2018-11-07 12:55:04,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:55:04,147 INFO L480 AbstractCegarLoop]: Abstraction has 3028 states and 3632 transitions. [2018-11-07 12:55:04,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 12:55:04,148 INFO L276 IsEmpty]: Start isEmpty. Operand 3028 states and 3632 transitions. [2018-11-07 12:55:04,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-11-07 12:55:04,157 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:55:04,158 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 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, 3, 3, 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] [2018-11-07 12:55:04,158 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:55:04,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:55:04,158 INFO L82 PathProgramCache]: Analyzing trace with hash 156264466, now seen corresponding path program 1 times [2018-11-07 12:55:04,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:55:04,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:55:04,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:55:04,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:55:04,160 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:55:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:55:04,299 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 119 proven. 54 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-07 12:55:04,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:55:04,299 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:55:04,299 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 213 with the following transitions: [2018-11-07 12:55:04,300 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [99], [100], [104], [107], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [495], [497], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:55:04,302 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:55:04,302 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:55:07,807 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:55:07,808 INFO L272 AbstractInterpreter]: Visited 110 different actions 2370 times. Merged at 9 different actions 284 times. Widened at 1 different actions 19 times. Found 61 fixpoints after 4 different actions. Largest state had 38 variables. [2018-11-07 12:55:07,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:55:07,818 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:55:07,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:55:07,818 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 12:55:07,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:55:07,828 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:55:07,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:55:07,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:55:08,067 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 186 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 12:55:08,067 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:55:08,251 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 151 proven. 30 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-07 12:55:08,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 12:55:08,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-11-07 12:55:08,273 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 12:55:08,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 12:55:08,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 12:55:08,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-07 12:55:08,274 INFO L87 Difference]: Start difference. First operand 3028 states and 3632 transitions. Second operand 9 states. [2018-11-07 12:55:12,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:55:12,959 INFO L93 Difference]: Finished difference Result 11162 states and 14517 transitions. [2018-11-07 12:55:12,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 12:55:12,960 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 212 [2018-11-07 12:55:12,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:55:12,996 INFO L225 Difference]: With dead ends: 11162 [2018-11-07 12:55:12,996 INFO L226 Difference]: Without dead ends: 8429 [2018-11-07 12:55:13,017 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 439 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=241, Invalid=881, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 12:55:13,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8429 states. [2018-11-07 12:55:13,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8429 to 7970. [2018-11-07 12:55:13,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7970 states. [2018-11-07 12:55:13,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7970 states to 7970 states and 9611 transitions. [2018-11-07 12:55:13,252 INFO L78 Accepts]: Start accepts. Automaton has 7970 states and 9611 transitions. Word has length 212 [2018-11-07 12:55:13,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:55:13,252 INFO L480 AbstractCegarLoop]: Abstraction has 7970 states and 9611 transitions. [2018-11-07 12:55:13,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 12:55:13,253 INFO L276 IsEmpty]: Start isEmpty. Operand 7970 states and 9611 transitions. [2018-11-07 12:55:13,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-11-07 12:55:13,275 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:55:13,275 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 12:55:13,275 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:55:13,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:55:13,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1632915875, now seen corresponding path program 1 times [2018-11-07 12:55:13,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:55:13,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:55:13,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:55:13,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:55:13,277 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:55:13,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:55:13,742 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 165 proven. 30 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-07 12:55:13,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:55:13,742 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:55:13,743 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 233 with the following transitions: [2018-11-07 12:55:13,743 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [248], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [495], [497], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:55:13,745 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:55:13,746 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:55:14,475 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:55:14,476 INFO L272 AbstractInterpreter]: Visited 110 different actions 444 times. Merged at 9 different actions 39 times. Widened at 1 different actions 1 times. Found 8 fixpoints after 4 different actions. Largest state had 38 variables. [2018-11-07 12:55:14,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:55:14,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:55:14,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:55:14,483 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 12:55:14,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:55:14,500 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:55:14,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:55:14,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:55:15,019 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 194 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 12:55:15,019 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:55:15,123 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 165 proven. 30 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-07 12:55:15,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 12:55:15,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-11-07 12:55:15,144 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 12:55:15,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 12:55:15,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 12:55:15,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-07 12:55:15,145 INFO L87 Difference]: Start difference. First operand 7970 states and 9611 transitions. Second operand 9 states. [2018-11-07 12:55:17,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:55:17,365 INFO L93 Difference]: Finished difference Result 13970 states and 16957 transitions. [2018-11-07 12:55:17,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 12:55:17,366 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 232 [2018-11-07 12:55:17,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:55:17,367 INFO L225 Difference]: With dead ends: 13970 [2018-11-07 12:55:17,367 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 12:55:17,401 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 465 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-11-07 12:55:17,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 12:55:17,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 12:55:17,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 12:55:17,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 12:55:17,402 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 232 [2018-11-07 12:55:17,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:55:17,403 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 12:55:17,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 12:55:17,403 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 12:55:17,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 12:55:17,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 12:55:17,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:17,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:17,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:17,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:17,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:17,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:17,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:17,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:17,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:17,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:17,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:17,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:17,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:17,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:17,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:17,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:17,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:17,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:17,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:17,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:17,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:17,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:17,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:17,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:17,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:17,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:17,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:17,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:17,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:17,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:17,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:17,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:17,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:17,909 WARN L179 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 176 [2018-11-07 12:55:17,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:17,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:17,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:17,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:17,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:18,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:18,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:18,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:18,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:18,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:18,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:18,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:18,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:18,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:18,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:18,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:18,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:18,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:18,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:18,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:18,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:18,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:18,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:18,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:18,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:18,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:18,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:18,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:18,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:18,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:18,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:18,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:18,158 WARN L179 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 244 DAG size of output: 169 [2018-11-07 12:55:18,936 WARN L179 SmtUtils]: Spent 776.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2018-11-07 12:55:19,585 WARN L179 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 77 [2018-11-07 12:55:23,622 WARN L179 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 320 DAG size of output: 90 [2018-11-07 12:55:24,414 WARN L179 SmtUtils]: Spent 727.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 98 [2018-11-07 12:55:25,023 WARN L179 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 95 [2018-11-07 12:55:25,026 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 12:55:25,026 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a28~0)| ~a28~0) (= ~a11~0 |old(~a11~0)|) (= |old(~a17~0)| ~a17~0) (<= ~a19~0 |old(~a19~0)|) (= ~a25~0 |old(~a25~0)|)) [2018-11-07 12:55:25,026 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 12:55:25,026 INFO L425 ceAbstractionStarter]: For program point L564(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,026 INFO L425 ceAbstractionStarter]: For program point L531(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,026 INFO L425 ceAbstractionStarter]: For program point L498(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,026 INFO L425 ceAbstractionStarter]: For program point L465(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,027 INFO L425 ceAbstractionStarter]: For program point L432(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,027 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-07 12:55:25,027 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-07 12:55:25,027 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-07 12:55:25,027 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-07 12:55:25,027 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-07 12:55:25,028 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-07 12:55:25,028 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-07 12:55:25,028 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-07 12:55:25,028 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-07 12:55:25,028 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-07 12:55:25,028 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-07 12:55:25,028 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-07 12:55:25,029 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-07 12:55:25,029 INFO L425 ceAbstractionStarter]: For program point L567(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,029 INFO L425 ceAbstractionStarter]: For program point L534(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,029 INFO L425 ceAbstractionStarter]: For program point L501(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,029 INFO L425 ceAbstractionStarter]: For program point L468(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,029 INFO L425 ceAbstractionStarter]: For program point L435(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,029 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-07 12:55:25,029 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-07 12:55:25,029 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-07 12:55:25,030 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-07 12:55:25,030 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-07 12:55:25,030 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-07 12:55:25,030 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-07 12:55:25,030 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-07 12:55:25,030 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-07 12:55:25,030 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-07 12:55:25,031 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-07 12:55:25,031 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-07 12:55:25,031 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-07 12:55:25,031 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-07 12:55:25,031 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-07 12:55:25,031 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-07 12:55:25,031 INFO L425 ceAbstractionStarter]: For program point L570(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,031 INFO L425 ceAbstractionStarter]: For program point L537(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,032 INFO L425 ceAbstractionStarter]: For program point L504(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,032 INFO L425 ceAbstractionStarter]: For program point L471(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,032 INFO L425 ceAbstractionStarter]: For program point L438(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,032 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-07 12:55:25,032 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-07 12:55:25,032 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-07 12:55:25,032 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-07 12:55:25,032 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-07 12:55:25,032 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-07 12:55:25,033 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-07 12:55:25,033 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-07 12:55:25,033 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-07 12:55:25,033 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-07 12:55:25,033 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-07 12:55:25,033 INFO L425 ceAbstractionStarter]: For program point L573(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,033 INFO L425 ceAbstractionStarter]: For program point L540(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,033 INFO L425 ceAbstractionStarter]: For program point L507(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,034 INFO L425 ceAbstractionStarter]: For program point L474(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,034 INFO L425 ceAbstractionStarter]: For program point L441(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,034 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-07 12:55:25,034 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-07 12:55:25,034 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-07 12:55:25,034 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-07 12:55:25,034 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-07 12:55:25,034 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-07 12:55:25,034 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-07 12:55:25,035 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-07 12:55:25,035 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-07 12:55:25,035 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-07 12:55:25,035 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-07 12:55:25,035 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-07 12:55:25,035 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-07 12:55:25,035 INFO L425 ceAbstractionStarter]: For program point L576(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,035 INFO L425 ceAbstractionStarter]: For program point L543(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,035 INFO L425 ceAbstractionStarter]: For program point L510(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,036 INFO L425 ceAbstractionStarter]: For program point L477(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,036 INFO L425 ceAbstractionStarter]: For program point L444(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,036 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-07 12:55:25,036 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-07 12:55:25,036 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-07 12:55:25,036 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-07 12:55:25,036 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-07 12:55:25,036 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-07 12:55:25,037 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-07 12:55:25,037 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-07 12:55:25,037 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-07 12:55:25,037 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-07 12:55:25,037 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-07 12:55:25,037 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-07 12:55:25,037 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-07 12:55:25,037 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-07 12:55:25,037 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-07 12:55:25,038 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-07 12:55:25,038 INFO L425 ceAbstractionStarter]: For program point L579(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,038 INFO L425 ceAbstractionStarter]: For program point L546(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,038 INFO L425 ceAbstractionStarter]: For program point L513(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,038 INFO L425 ceAbstractionStarter]: For program point L480(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,038 INFO L425 ceAbstractionStarter]: For program point L447(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,038 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-07 12:55:25,038 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-07 12:55:25,038 INFO L425 ceAbstractionStarter]: For program point L414-1(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,038 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-07 12:55:25,039 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-07 12:55:25,039 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-07 12:55:25,039 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,039 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,039 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-07 12:55:25,039 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-07 12:55:25,039 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-07 12:55:25,039 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-07 12:55:25,039 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-07 12:55:25,040 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-07 12:55:25,040 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-07 12:55:25,040 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-07 12:55:25,040 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-07 12:55:25,040 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-07 12:55:25,040 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-07 12:55:25,040 INFO L425 ceAbstractionStarter]: For program point L582(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,040 INFO L425 ceAbstractionStarter]: For program point L549(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,040 INFO L425 ceAbstractionStarter]: For program point L516(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,040 INFO L425 ceAbstractionStarter]: For program point L483(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,041 INFO L425 ceAbstractionStarter]: For program point L450(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,041 INFO L425 ceAbstractionStarter]: For program point L417(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,041 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-07 12:55:25,041 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-07 12:55:25,041 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-07 12:55:25,041 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-07 12:55:25,041 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-07 12:55:25,041 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-07 12:55:25,041 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-07 12:55:25,042 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-07 12:55:25,042 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-07 12:55:25,042 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-07 12:55:25,042 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-07 12:55:25,042 INFO L425 ceAbstractionStarter]: For program point L585(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,042 INFO L425 ceAbstractionStarter]: For program point L552(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,042 INFO L425 ceAbstractionStarter]: For program point L519(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,042 INFO L425 ceAbstractionStarter]: For program point L486(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,042 INFO L425 ceAbstractionStarter]: For program point L453(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,043 INFO L425 ceAbstractionStarter]: For program point L420(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,043 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-07 12:55:25,043 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-07 12:55:25,043 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-07 12:55:25,043 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-07 12:55:25,043 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-07 12:55:25,043 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-07 12:55:25,043 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-07 12:55:25,043 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-07 12:55:25,043 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-07 12:55:25,044 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-07 12:55:25,044 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-07 12:55:25,044 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-07 12:55:25,044 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-07 12:55:25,044 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-07 12:55:25,044 INFO L425 ceAbstractionStarter]: For program point L588(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,044 INFO L425 ceAbstractionStarter]: For program point L555(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,044 INFO L425 ceAbstractionStarter]: For program point L522(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,044 INFO L425 ceAbstractionStarter]: For program point L489(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,045 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse21 (< |old(~a28~0)| 7)) (.cse0 (not (= 1 ~a21~0))) (.cse22 (< 1 |old(~a25~0)|)) (.cse1 (= 1 |old(~a11~0)|)) (.cse5 (= |old(~a17~0)| ~a17~0)) (.cse3 (= |old(~a28~0)| ~a28~0)) (.cse24 (= 1 ~a11~0)) (.cse6 (<= ~a19~0 |old(~a19~0)|)) (.cse7 (= ~a25~0 |old(~a25~0)|))) (let ((.cse18 (and .cse5 .cse3 .cse24 .cse6 .cse7)) (.cse14 (< |old(~a25~0)| 0)) (.cse15 (< 10 |old(~a28~0)|)) (.cse9 (= 11 |old(~a28~0)|)) (.cse20 (< 7 |old(~a17~0)|)) (.cse19 (not .cse1)) (.cse2 (< |old(~a17~0)| 8)) (.cse4 (= ~a11~0 |old(~a11~0)|)) (.cse8 (= 9 |old(~a17~0)|)) (.cse12 (< 6 |calculate_output_#in~input|)) (.cse23 (not (= 1 |old(~a25~0)|))) (.cse13 (let ((.cse25 (not (= 0 |old(~a11~0)|))) (.cse26 (< 11 |old(~a28~0)|))) (and (or .cse0 .cse25 .cse26 .cse21 (not (= 0 |old(~a25~0)|))) (or .cse0 (< |old(~a28~0)| 8) .cse22 .cse25 .cse26)))) (.cse16 (not (= 1 |old(~a19~0)|))) (.cse10 (= ~a19~0 1)) (.cse17 (not (= 8 |old(~a17~0)|))) (.cse11 (< |calculate_output_#in~input| 1))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9) (or .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse18 (< |old(~a28~0)| 10) .cse19 .cse9 .cse20) (or .cse0 .cse2 (= 9 |old(~a28~0)|) .cse18 .cse19 .cse8 .cse9) (or .cse12 .cse0 (and .cse10 .cse7 .cse4 .cse3 (= ~a17~0 8)) .cse14 .cse19 .cse21 .cse15 .cse16 .cse22 .cse17 .cse11) (or .cse0 .cse23 (and .cse3 .cse24 .cse5 .cse6 .cse7) .cse19 .cse9 .cse20) (or .cse0 (not (= 7 |old(~a28~0)|)) .cse23 .cse16 .cse19 (= 1 ~a19~0) (not (= 7 |old(~a17~0)|))) (or .cse0 .cse1 .cse2 .cse23 (and .cse4 .cse5 .cse3 .cse6 .cse7) .cse8) (or .cse12 .cse23 .cse13 .cse16 .cse10 .cse17 .cse11)))) [2018-11-07 12:55:25,045 INFO L425 ceAbstractionStarter]: For program point L456(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,045 INFO L425 ceAbstractionStarter]: For program point L423(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,045 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-07 12:55:25,045 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-07 12:55:25,045 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-07 12:55:25,046 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-07 12:55:25,046 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-07 12:55:25,046 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-07 12:55:25,046 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-07 12:55:25,046 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-07 12:55:25,046 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-07 12:55:25,046 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-07 12:55:25,046 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-07 12:55:25,046 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-07 12:55:25,046 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-07 12:55:25,047 INFO L425 ceAbstractionStarter]: For program point L591(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,047 INFO L425 ceAbstractionStarter]: For program point L558(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,047 INFO L425 ceAbstractionStarter]: For program point L525(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,047 INFO L425 ceAbstractionStarter]: For program point L492(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,047 INFO L425 ceAbstractionStarter]: For program point L426(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,047 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,047 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-07 12:55:25,047 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-07 12:55:25,047 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-07 12:55:25,047 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-07 12:55:25,048 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-07 12:55:25,048 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-07 12:55:25,048 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-07 12:55:25,048 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-07 12:55:25,048 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-07 12:55:25,048 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-07 12:55:25,048 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-07 12:55:25,048 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-07 12:55:25,048 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-07 12:55:25,048 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-07 12:55:25,049 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 460) no Hoare annotation was computed. [2018-11-07 12:55:25,049 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-07 12:55:25,049 INFO L425 ceAbstractionStarter]: For program point L594(lines 594 596) no Hoare annotation was computed. [2018-11-07 12:55:25,049 INFO L425 ceAbstractionStarter]: For program point L561(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,049 INFO L425 ceAbstractionStarter]: For program point L528(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,049 INFO L425 ceAbstractionStarter]: For program point L495(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,049 INFO L425 ceAbstractionStarter]: For program point L462(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,049 INFO L425 ceAbstractionStarter]: For program point L429(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:25,049 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-07 12:55:25,049 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-07 12:55:25,049 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-07 12:55:25,050 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-07 12:55:25,050 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-07 12:55:25,050 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-07 12:55:25,050 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-07 12:55:25,050 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-07 12:55:25,050 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-07 12:55:25,050 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-07 12:55:25,050 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-07 12:55:25,050 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-07 12:55:25,050 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-07 12:55:25,050 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-07 12:55:25,051 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-07 12:55:25,051 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-07 12:55:25,051 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-07 12:55:25,051 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-07 12:55:25,051 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-07 12:55:25,051 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 12:55:25,051 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~z~0 26) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a~0 1) (= ~a19~0 1) (= ~a28~0 7)) [2018-11-07 12:55:25,051 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 12:55:25,051 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 12:55:25,052 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= |old(~a11~0)| 0)) (and (= ~a19~0 1) (= ~a25~0 |old(~a25~0)|) (= ~a11~0 |old(~a11~0)|) (= |old(~a28~0)| ~a28~0) (= ~a17~0 8)) (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= ~a21~0 1)) (not (= ~y~0 25)) (not (= 3 ~c~0)) (not (= |old(~a25~0)| 0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= 8 |old(~a17~0)|)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-11-07 12:55:25,052 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-07 12:55:25,052 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse0 (<= ~a17~0 |old(~a17~0)|)) (.cse1 (= ~a11~0 |old(~a11~0)|)) (.cse2 (<= 8 ~a17~0)) (.cse3 (= 1 ~a25~0)) (.cse6 (<= ~a17~0 7)) (.cse4 (= 1 ~a11~0)) (.cse5 (not (= ~a28~0 11)))) (or (and .cse0 .cse1 .cse2 .cse3) (not (= ~a21~0 1)) (not (= ~y~0 25)) (and (<= ~a25~0 1) (<= 0 ~a25~0) .cse4 (= ~a17~0 8) (= ~a19~0 1) .cse5) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (and .cse0 .cse2 .cse4 (not (= ~a28~0 9)) .cse5) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (and .cse0 .cse1 .cse2 .cse5) (and .cse6 .cse4 .cse3 .cse5) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (and .cse6 (<= 10 ~a28~0) .cse4 .cse5) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0)))) [2018-11-07 12:55:25,052 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-11-07 12:55:25,052 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-11-07 12:55:25,052 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse0 (<= ~a17~0 |old(~a17~0)|)) (.cse1 (= ~a11~0 |old(~a11~0)|)) (.cse2 (<= 8 ~a17~0)) (.cse3 (= 1 ~a25~0)) (.cse6 (<= ~a17~0 7)) (.cse4 (= 1 ~a11~0)) (.cse5 (not (= ~a28~0 11)))) (or (and .cse0 .cse1 .cse2 .cse3) (not (= ~a21~0 1)) (not (= ~y~0 25)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (and .cse0 .cse2 .cse4 (not (= ~a28~0 9)) .cse5) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (and .cse0 .cse1 .cse2 .cse5) (and .cse6 .cse4 .cse3 .cse5) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (and (<= 1 main_~input~0) (<= main_~input~0 6) (<= ~a25~0 1) (<= 0 ~a25~0) .cse4 (= ~a17~0 8) (= ~a19~0 1) .cse5) (not (= ~a~0 1)) (and .cse6 (<= 10 ~a28~0) .cse4 .cse5) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0)))) [2018-11-07 12:55:25,052 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-11-07 12:55:25,052 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-07 12:55:25,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:55:25 BoogieIcfgContainer [2018-11-07 12:55:25,076 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 12:55:25,077 INFO L168 Benchmark]: Toolchain (without parser) took 90594.69 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.7 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-11-07 12:55:25,078 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 12:55:25,079 INFO L168 Benchmark]: CACSL2BoogieTranslator took 700.43 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-11-07 12:55:25,080 INFO L168 Benchmark]: Boogie Procedure Inliner took 127.11 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -804.4 MB). Peak memory consumption was 18.5 MB. Max. memory is 7.1 GB. [2018-11-07 12:55:25,084 INFO L168 Benchmark]: Boogie Preprocessor took 85.33 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 12:55:25,084 INFO L168 Benchmark]: RCFGBuilder took 3303.04 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 105.5 MB). Peak memory consumption was 105.5 MB. Max. memory is 7.1 GB. [2018-11-07 12:55:25,085 INFO L168 Benchmark]: TraceAbstraction took 86373.79 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-11-07 12:55:25,097 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 700.43 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 127.11 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -804.4 MB). Peak memory consumption was 18.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 85.33 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3303.04 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 105.5 MB). Peak memory consumption was 105.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 86373.79 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 460]: 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: 606]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((a17 <= \old(a17) && a11 == \old(a11)) && 8 <= a17) && 1 == a25) || !(a21 == 1)) || !(y == 25)) || (((((a25 <= 1 && 0 <= a25) && 1 == a11) && a17 == 8) && a19 == 1) && !(a28 == 11))) || !(1 == \old(a19))) || !(x == 24)) || !(e == 5)) || !(d == 4)) || ((((a17 <= \old(a17) && 8 <= a17) && 1 == a11) && !(a28 == 9)) && !(a28 == 11))) || !(21 == u)) || !(22 == v)) || !(\old(a11) == 0)) || (((a17 <= \old(a17) && a11 == \old(a11)) && 8 <= a17) && !(a28 == 11))) || (((a17 <= 7 && 1 == a11) && 1 == a25) && !(a28 == 11))) || !(z == 26)) || !(0 == \old(a25))) || !(3 == c)) || !(23 == w)) || !(\old(a28) == 7)) || !(a == 1)) || (((a17 <= 7 && 10 <= a28) && 1 == a11) && !(a28 == 11))) || !(\old(a17) == 8)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 86.2s OverallTime, 12 OverallIterations, 5 TraceHistogramMax, 57.7s AutomataDifference, 0.0s DeadEndRemovalTime, 7.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 1800 SDtfs, 11286 SDslu, 2266 SDs, 0 SdLazy, 14791 SolverSat, 2094 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.6s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 2007 GetRequests, 1820 SyntacticMatches, 25 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 852 ImplicationChecksByTransitivity, 8.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7970occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 7.9s AbstIntTime, 7 AbstIntIterations, 4 AbstIntStrong, 0.9966549627756968 AbsIntWeakeningRatio, 0.2303206997084548 AbsIntAvgWeakeningVarsNumRemoved, 24.784256559766764 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 579 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 153 PreInvPairs, 240 NumberOfFragments, 887 HoareAnnotationTreeSize, 153 FomulaSimplifications, 17725 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 7 FomulaSimplificationsInter, 9404 FormulaSimplificationTreeSizeReductionInter, 6.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 2470 NumberOfCodeBlocks, 2470 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3036 ConstructedInterpolants, 0 QuantifiedInterpolants, 1284260 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1538 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 18 InterpolantComputations, 7 PerfectInterpolantSequences, 1833/2067 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...