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-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label01_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 20:33:11,654 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 20:33:11,656 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 20:33:11,671 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 20:33:11,672 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 20:33:11,673 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 20:33:11,674 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 20:33:11,676 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 20:33:11,678 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 20:33:11,679 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 20:33:11,680 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 20:33:11,680 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 20:33:11,681 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 20:33:11,685 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 20:33:11,687 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 20:33:11,687 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 20:33:11,688 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 20:33:11,690 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 20:33:11,692 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 20:33:11,694 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 20:33:11,695 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 20:33:11,696 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 20:33:11,698 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 20:33:11,699 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 20:33:11,699 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 20:33:11,700 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 20:33:11,701 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 20:33:11,702 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 20:33:11,702 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 20:33:11,706 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 20:33:11,706 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 20:33:11,707 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 20:33:11,707 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 20:33:11,707 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 20:33:11,708 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 20:33:11,709 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 20:33:11,709 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-LIM.epf [2018-11-07 20:33:11,725 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 20:33:11,725 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 20:33:11,726 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 20:33:11,726 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 20:33:11,726 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 20:33:11,726 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 20:33:11,727 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 20:33:11,727 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 20:33:11,727 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 20:33:11,727 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 20:33:11,727 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 20:33:11,727 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 20:33:11,728 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 20:33:11,728 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 20:33:11,728 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 20:33:11,729 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 20:33:11,729 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 20:33:11,729 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 20:33:11,729 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 20:33:11,729 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 20:33:11,730 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 20:33:11,730 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 20:33:11,730 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 20:33:11,730 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 20:33:11,730 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 20:33:11,731 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 20:33:11,731 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 20:33:11,731 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 20:33:11,731 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 20:33:11,731 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 20:33:11,732 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 20:33:11,732 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 20:33:11,732 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 20:33:11,732 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 20:33:11,732 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 20:33:11,777 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 20:33:11,794 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 20:33:11,798 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 20:33:11,800 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 20:33:11,800 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 20:33:11,801 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label01_true-unreach-call_false-termination.c [2018-11-07 20:33:11,866 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd6327c63/a81a1cd518554375aba4a09fd9c9725e/FLAGd284ba66a [2018-11-07 20:33:12,431 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 20:33:12,434 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label01_true-unreach-call_false-termination.c [2018-11-07 20:33:12,459 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd6327c63/a81a1cd518554375aba4a09fd9c9725e/FLAGd284ba66a [2018-11-07 20:33:12,478 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd6327c63/a81a1cd518554375aba4a09fd9c9725e [2018-11-07 20:33:12,489 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 20:33:12,491 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 20:33:12,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 20:33:12,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 20:33:12,498 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 20:33:12,499 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:33:12" (1/1) ... [2018-11-07 20:33:12,502 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35b0efbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:12, skipping insertion in model container [2018-11-07 20:33:12,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:33:12" (1/1) ... [2018-11-07 20:33:12,514 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 20:33:12,593 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 20:33:13,182 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:33:13,186 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 20:33:13,332 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:33:13,352 INFO L193 MainTranslator]: Completed translation [2018-11-07 20:33:13,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:13 WrapperNode [2018-11-07 20:33:13,353 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 20:33:13,354 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 20:33:13,354 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 20:33:13,354 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 20:33:13,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:13" (1/1) ... [2018-11-07 20:33:13,404 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:13" (1/1) ... [2018-11-07 20:33:13,534 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 20:33:13,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 20:33:13,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 20:33:13,538 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 20:33:13,554 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:13" (1/1) ... [2018-11-07 20:33:13,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:13" (1/1) ... [2018-11-07 20:33:13,565 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:13" (1/1) ... [2018-11-07 20:33:13,565 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:13" (1/1) ... [2018-11-07 20:33:13,621 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:13" (1/1) ... [2018-11-07 20:33:13,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:13" (1/1) ... [2018-11-07 20:33:13,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:13" (1/1) ... [2018-11-07 20:33:13,685 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 20:33:13,685 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 20:33:13,685 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 20:33:13,686 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 20:33:13,687 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:13" (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 20:33:13,755 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 20:33:13,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 20:33:13,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 20:33:13,756 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 20:33:13,756 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 20:33:13,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 20:33:13,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 20:33:13,757 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 20:33:13,757 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 20:33:17,632 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 20:33:17,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:33:17 BoogieIcfgContainer [2018-11-07 20:33:17,632 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 20:33:17,633 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 20:33:17,633 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 20:33:17,637 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 20:33:17,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:33:12" (1/3) ... [2018-11-07 20:33:17,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38045993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:33:17, skipping insertion in model container [2018-11-07 20:33:17,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:13" (2/3) ... [2018-11-07 20:33:17,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38045993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:33:17, skipping insertion in model container [2018-11-07 20:33:17,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:33:17" (3/3) ... [2018-11-07 20:33:17,641 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label01_true-unreach-call_false-termination.c [2018-11-07 20:33:17,650 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 20:33:17,659 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 20:33:17,675 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 20:33:17,714 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 20:33:17,715 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 20:33:17,715 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 20:33:17,715 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 20:33:17,715 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 20:33:17,715 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 20:33:17,715 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 20:33:17,716 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 20:33:17,744 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-11-07 20:33:17,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-07 20:33:17,754 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:33:17,756 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] [2018-11-07 20:33:17,758 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:33:17,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:33:17,765 INFO L82 PathProgramCache]: Analyzing trace with hash 105664553, now seen corresponding path program 1 times [2018-11-07 20:33:17,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:33:17,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:33:17,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:33:17,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:33:17,815 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:33:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:33:18,330 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 20:33:18,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:33:18,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 20:33:18,334 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:33:18,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 20:33:18,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 20:33:18,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 20:33:18,361 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 3 states. [2018-11-07 20:33:20,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:33:20,197 INFO L93 Difference]: Finished difference Result 691 states and 1226 transitions. [2018-11-07 20:33:20,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 20:33:20,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2018-11-07 20:33:20,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:33:20,219 INFO L225 Difference]: With dead ends: 691 [2018-11-07 20:33:20,219 INFO L226 Difference]: Without dead ends: 434 [2018-11-07 20:33:20,230 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 20:33:20,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-11-07 20:33:20,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2018-11-07 20:33:20,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-11-07 20:33:20,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 767 transitions. [2018-11-07 20:33:20,360 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 767 transitions. Word has length 61 [2018-11-07 20:33:20,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:33:20,361 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 767 transitions. [2018-11-07 20:33:20,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 20:33:20,361 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 767 transitions. [2018-11-07 20:33:20,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-07 20:33:20,372 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:33:20,372 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 20:33:20,373 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:33:20,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:33:20,373 INFO L82 PathProgramCache]: Analyzing trace with hash -175237717, now seen corresponding path program 1 times [2018-11-07 20:33:20,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:33:20,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:33:20,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:33:20,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:33:20,375 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:33:20,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:33:20,651 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:33:20,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:33:20,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 20:33:20,652 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:33:20,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 20:33:20,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 20:33:20,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 20:33:20,656 INFO L87 Difference]: Start difference. First operand 434 states and 767 transitions. Second operand 5 states. [2018-11-07 20:33:24,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:33:24,538 INFO L93 Difference]: Finished difference Result 1416 states and 2580 transitions. [2018-11-07 20:33:24,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 20:33:24,539 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2018-11-07 20:33:24,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:33:24,550 INFO L225 Difference]: With dead ends: 1416 [2018-11-07 20:33:24,550 INFO L226 Difference]: Without dead ends: 988 [2018-11-07 20:33:24,555 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-07 20:33:24,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2018-11-07 20:33:24,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 973. [2018-11-07 20:33:24,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 973 states. [2018-11-07 20:33:24,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1540 transitions. [2018-11-07 20:33:24,615 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1540 transitions. Word has length 138 [2018-11-07 20:33:24,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:33:24,615 INFO L480 AbstractCegarLoop]: Abstraction has 973 states and 1540 transitions. [2018-11-07 20:33:24,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 20:33:24,616 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1540 transitions. [2018-11-07 20:33:24,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-07 20:33:24,623 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:33:24,623 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:33:24,624 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:33:24,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:33:24,624 INFO L82 PathProgramCache]: Analyzing trace with hash -683828693, now seen corresponding path program 1 times [2018-11-07 20:33:24,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:33:24,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:33:24,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:33:24,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:33:24,626 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:33:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:33:25,032 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:33:25,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:33:25,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 20:33:25,032 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:33:25,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 20:33:25,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 20:33:25,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 20:33:25,034 INFO L87 Difference]: Start difference. First operand 973 states and 1540 transitions. Second operand 6 states. [2018-11-07 20:33:28,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:33:28,484 INFO L93 Difference]: Finished difference Result 2347 states and 3916 transitions. [2018-11-07 20:33:28,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:33:28,485 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 202 [2018-11-07 20:33:28,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:33:28,497 INFO L225 Difference]: With dead ends: 2347 [2018-11-07 20:33:28,497 INFO L226 Difference]: Without dead ends: 1380 [2018-11-07 20:33:28,501 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 20:33:28,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2018-11-07 20:33:28,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1352. [2018-11-07 20:33:28,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-11-07 20:33:28,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 2126 transitions. [2018-11-07 20:33:28,553 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 2126 transitions. Word has length 202 [2018-11-07 20:33:28,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:33:28,554 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 2126 transitions. [2018-11-07 20:33:28,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 20:33:28,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 2126 transitions. [2018-11-07 20:33:28,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-11-07 20:33:28,559 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:33:28,559 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:33:28,559 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:33:28,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:33:28,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1369870952, now seen corresponding path program 1 times [2018-11-07 20:33:28,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:33:28,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:33:28,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:33:28,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:33:28,561 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:33:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:33:28,881 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 180 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:33:28,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:33:28,881 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:33:28,882 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 213 with the following transitions: [2018-11-07 20:33:28,884 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [522], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:33:28,929 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:33:28,930 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:33:29,325 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:33:29,347 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:33:29,348 INFO L272 AbstractInterpreter]: Visited 82 different actions 82 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-11-07 20:33:29,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:33:29,380 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:33:30,000 INFO L227 lantSequenceWeakener]: Weakened 203 states. On average, predicates are now at 78.22% of their original sizes. [2018-11-07 20:33:30,000 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:33:30,264 INFO L415 sIntCurrentIteration]: We unified 211 AI predicates to 211 [2018-11-07 20:33:30,264 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:33:30,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:33:30,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-11-07 20:33:30,266 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:33:30,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 20:33:30,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 20:33:30,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-07 20:33:30,267 INFO L87 Difference]: Start difference. First operand 1352 states and 2126 transitions. Second operand 7 states. [2018-11-07 20:33:46,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:33:46,610 INFO L93 Difference]: Finished difference Result 2883 states and 4473 transitions. [2018-11-07 20:33:46,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:33:46,611 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 212 [2018-11-07 20:33:46,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:33:46,619 INFO L225 Difference]: With dead ends: 2883 [2018-11-07 20:33:46,619 INFO L226 Difference]: Without dead ends: 1537 [2018-11-07 20:33:46,625 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 212 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-07 20:33:46,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2018-11-07 20:33:46,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1535. [2018-11-07 20:33:46,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1535 states. [2018-11-07 20:33:46,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2316 transitions. [2018-11-07 20:33:46,668 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2316 transitions. Word has length 212 [2018-11-07 20:33:46,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:33:46,669 INFO L480 AbstractCegarLoop]: Abstraction has 1535 states and 2316 transitions. [2018-11-07 20:33:46,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 20:33:46,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2316 transitions. [2018-11-07 20:33:46,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-11-07 20:33:46,677 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:33:46,677 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:33:46,677 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:33:46,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:33:46,678 INFO L82 PathProgramCache]: Analyzing trace with hash -50001898, now seen corresponding path program 1 times [2018-11-07 20:33:46,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:33:46,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:33:46,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:33:46,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:33:46,679 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:33:46,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:33:47,422 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 314 proven. 2 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-07 20:33:47,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:33:47,423 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:33:47,423 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 298 with the following transitions: [2018-11-07 20:33:47,424 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [551], [554], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:33:47,437 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:33:47,437 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:33:47,513 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:33:47,634 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:33:47,635 INFO L272 AbstractInterpreter]: Visited 94 different actions 181 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:33:47,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:33:47,674 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:33:48,165 INFO L227 lantSequenceWeakener]: Weakened 106 states. On average, predicates are now at 78.26% of their original sizes. [2018-11-07 20:33:48,165 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:33:49,541 INFO L415 sIntCurrentIteration]: We unified 296 AI predicates to 296 [2018-11-07 20:33:49,542 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:33:49,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:33:49,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [7] total 29 [2018-11-07 20:33:49,542 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:33:49,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 20:33:49,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 20:33:49,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2018-11-07 20:33:49,544 INFO L87 Difference]: Start difference. First operand 1535 states and 2316 transitions. Second operand 24 states. [2018-11-07 20:34:15,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:34:15,132 INFO L93 Difference]: Finished difference Result 4522 states and 6401 transitions. [2018-11-07 20:34:15,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 20:34:15,132 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 297 [2018-11-07 20:34:15,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:34:15,147 INFO L225 Difference]: With dead ends: 4522 [2018-11-07 20:34:15,148 INFO L226 Difference]: Without dead ends: 3176 [2018-11-07 20:34:15,155 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 307 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=231, Invalid=959, Unknown=0, NotChecked=0, Total=1190 [2018-11-07 20:34:15,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3176 states. [2018-11-07 20:34:15,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3176 to 2929. [2018-11-07 20:34:15,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2929 states. [2018-11-07 20:34:15,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2929 states to 2929 states and 3797 transitions. [2018-11-07 20:34:15,231 INFO L78 Accepts]: Start accepts. Automaton has 2929 states and 3797 transitions. Word has length 297 [2018-11-07 20:34:15,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:34:15,232 INFO L480 AbstractCegarLoop]: Abstraction has 2929 states and 3797 transitions. [2018-11-07 20:34:15,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 20:34:15,232 INFO L276 IsEmpty]: Start isEmpty. Operand 2929 states and 3797 transitions. [2018-11-07 20:34:15,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-11-07 20:34:15,240 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:34:15,241 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:34:15,241 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:34:15,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:34:15,242 INFO L82 PathProgramCache]: Analyzing trace with hash -599406654, now seen corresponding path program 1 times [2018-11-07 20:34:15,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:34:15,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:34:15,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:34:15,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:34:15,243 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:34:15,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:34:17,014 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 316 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:34:17,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:34:17,014 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:34:17,015 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 324 with the following transitions: [2018-11-07 20:34:17,015 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:34:17,019 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:34:17,019 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:34:17,053 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:34:17,158 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:34:17,158 INFO L272 AbstractInterpreter]: Visited 120 different actions 234 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:34:17,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:34:17,165 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:34:17,473 INFO L227 lantSequenceWeakener]: Weakened 209 states. On average, predicates are now at 78.5% of their original sizes. [2018-11-07 20:34:17,473 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:34:18,018 INFO L415 sIntCurrentIteration]: We unified 322 AI predicates to 322 [2018-11-07 20:34:18,019 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:34:18,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:34:18,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [14] total 30 [2018-11-07 20:34:18,019 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:34:18,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 20:34:18,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 20:34:18,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-11-07 20:34:18,021 INFO L87 Difference]: Start difference. First operand 2929 states and 3797 transitions. Second operand 18 states. [2018-11-07 20:34:27,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:34:27,976 INFO L93 Difference]: Finished difference Result 4648 states and 6377 transitions. [2018-11-07 20:34:27,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 20:34:27,976 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 323 [2018-11-07 20:34:27,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:34:27,990 INFO L225 Difference]: With dead ends: 4648 [2018-11-07 20:34:27,991 INFO L226 Difference]: Without dead ends: 3302 [2018-11-07 20:34:27,998 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 342 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=269, Invalid=1137, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 20:34:28,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3302 states. [2018-11-07 20:34:28,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3302 to 3297. [2018-11-07 20:34:28,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3297 states. [2018-11-07 20:34:28,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3297 states to 3297 states and 4194 transitions. [2018-11-07 20:34:28,082 INFO L78 Accepts]: Start accepts. Automaton has 3297 states and 4194 transitions. Word has length 323 [2018-11-07 20:34:28,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:34:28,083 INFO L480 AbstractCegarLoop]: Abstraction has 3297 states and 4194 transitions. [2018-11-07 20:34:28,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 20:34:28,083 INFO L276 IsEmpty]: Start isEmpty. Operand 3297 states and 4194 transitions. [2018-11-07 20:34:28,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-11-07 20:34:28,094 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:34:28,095 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:34:28,095 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:34:28,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:34:28,096 INFO L82 PathProgramCache]: Analyzing trace with hash -860052338, now seen corresponding path program 1 times [2018-11-07 20:34:28,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:34:28,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:34:28,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:34:28,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:34:28,097 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:34:28,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:34:28,880 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 239 proven. 143 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 20:34:28,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:34:28,881 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:34:28,881 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 334 with the following transitions: [2018-11-07 20:34:28,881 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [698], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:34:28,886 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:34:28,886 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:34:28,919 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:34:29,057 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:34:29,057 INFO L272 AbstractInterpreter]: Visited 130 different actions 253 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:34:29,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:34:29,066 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:34:29,463 INFO L227 lantSequenceWeakener]: Weakened 44 states. On average, predicates are now at 79.65% of their original sizes. [2018-11-07 20:34:29,464 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:34:30,182 INFO L415 sIntCurrentIteration]: We unified 332 AI predicates to 332 [2018-11-07 20:34:30,183 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:34:30,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:34:30,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [13] total 30 [2018-11-07 20:34:30,183 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:34:30,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 20:34:30,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 20:34:30,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-11-07 20:34:30,185 INFO L87 Difference]: Start difference. First operand 3297 states and 4194 transitions. Second operand 19 states. [2018-11-07 20:34:49,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:34:49,101 INFO L93 Difference]: Finished difference Result 5987 states and 7946 transitions. [2018-11-07 20:34:49,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 20:34:49,101 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 333 [2018-11-07 20:34:49,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:34:49,119 INFO L225 Difference]: With dead ends: 5987 [2018-11-07 20:34:49,119 INFO L226 Difference]: Without dead ends: 4641 [2018-11-07 20:34:49,125 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 341 GetRequests, 309 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2018-11-07 20:34:49,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4641 states. [2018-11-07 20:34:49,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4641 to 3960. [2018-11-07 20:34:49,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3960 states. [2018-11-07 20:34:49,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3960 states to 3960 states and 4898 transitions. [2018-11-07 20:34:49,224 INFO L78 Accepts]: Start accepts. Automaton has 3960 states and 4898 transitions. Word has length 333 [2018-11-07 20:34:49,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:34:49,225 INFO L480 AbstractCegarLoop]: Abstraction has 3960 states and 4898 transitions. [2018-11-07 20:34:49,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 20:34:49,225 INFO L276 IsEmpty]: Start isEmpty. Operand 3960 states and 4898 transitions. [2018-11-07 20:34:49,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-11-07 20:34:49,236 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:34:49,237 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:34:49,237 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:34:49,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:34:49,238 INFO L82 PathProgramCache]: Analyzing trace with hash -526563627, now seen corresponding path program 1 times [2018-11-07 20:34:49,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:34:49,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:34:49,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:34:49,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:34:49,239 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:34:49,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:34:49,691 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 20:34:50,262 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 239 proven. 143 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 20:34:50,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:34:50,263 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:34:50,263 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 359 with the following transitions: [2018-11-07 20:34:50,263 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [798], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:34:50,271 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:34:50,272 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:34:50,306 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:34:50,526 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:34:50,527 INFO L272 AbstractInterpreter]: Visited 155 different actions 303 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:34:50,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:34:50,563 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:34:51,038 INFO L227 lantSequenceWeakener]: Weakened 48 states. On average, predicates are now at 79.45% of their original sizes. [2018-11-07 20:34:51,039 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:34:51,587 INFO L415 sIntCurrentIteration]: We unified 357 AI predicates to 357 [2018-11-07 20:34:51,587 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:34:51,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:34:51,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [13] total 32 [2018-11-07 20:34:51,588 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:34:51,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 20:34:51,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 20:34:51,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-11-07 20:34:51,590 INFO L87 Difference]: Start difference. First operand 3960 states and 4898 transitions. Second operand 21 states. [2018-11-07 20:35:11,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:35:11,703 INFO L93 Difference]: Finished difference Result 6769 states and 8796 transitions. [2018-11-07 20:35:11,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 20:35:11,703 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 358 [2018-11-07 20:35:11,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:35:11,726 INFO L225 Difference]: With dead ends: 6769 [2018-11-07 20:35:11,727 INFO L226 Difference]: Without dead ends: 5423 [2018-11-07 20:35:11,734 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 368 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=197, Invalid=795, Unknown=0, NotChecked=0, Total=992 [2018-11-07 20:35:11,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5423 states. [2018-11-07 20:35:11,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5423 to 4619. [2018-11-07 20:35:11,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4619 states. [2018-11-07 20:35:11,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4619 states to 4619 states and 5596 transitions. [2018-11-07 20:35:11,852 INFO L78 Accepts]: Start accepts. Automaton has 4619 states and 5596 transitions. Word has length 358 [2018-11-07 20:35:11,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:35:11,852 INFO L480 AbstractCegarLoop]: Abstraction has 4619 states and 5596 transitions. [2018-11-07 20:35:11,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 20:35:11,853 INFO L276 IsEmpty]: Start isEmpty. Operand 4619 states and 5596 transitions. [2018-11-07 20:35:11,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-11-07 20:35:11,867 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:35:11,868 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 20:35:11,868 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:35:11,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:35:11,868 INFO L82 PathProgramCache]: Analyzing trace with hash -588792646, now seen corresponding path program 1 times [2018-11-07 20:35:11,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:35:11,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:11,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:35:11,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:11,870 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:35:11,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:35:12,706 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 317 proven. 2 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-11-07 20:35:12,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:35:12,707 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:35:12,707 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 360 with the following transitions: [2018-11-07 20:35:12,708 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:35:12,711 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:35:12,711 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:35:12,942 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:35:13,076 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:35:13,076 INFO L272 AbstractInterpreter]: Visited 120 different actions 359 times. Merged at 8 different actions 21 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-07 20:35:13,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:35:13,114 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:35:13,477 INFO L227 lantSequenceWeakener]: Weakened 356 states. On average, predicates are now at 80.61% of their original sizes. [2018-11-07 20:35:13,478 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:35:13,590 INFO L415 sIntCurrentIteration]: We unified 358 AI predicates to 358 [2018-11-07 20:35:13,590 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:35:13,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:35:13,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 15 [2018-11-07 20:35:13,591 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:35:13,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 20:35:13,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 20:35:13,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 20:35:13,592 INFO L87 Difference]: Start difference. First operand 4619 states and 5596 transitions. Second operand 10 states. [2018-11-07 20:35:18,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:35:18,260 INFO L93 Difference]: Finished difference Result 6557 states and 8650 transitions. [2018-11-07 20:35:18,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 20:35:18,260 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 359 [2018-11-07 20:35:18,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:35:18,279 INFO L225 Difference]: With dead ends: 6557 [2018-11-07 20:35:18,279 INFO L226 Difference]: Without dead ends: 5211 [2018-11-07 20:35:18,286 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 366 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-11-07 20:35:18,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5211 states. [2018-11-07 20:35:18,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5211 to 4988. [2018-11-07 20:35:18,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4988 states. [2018-11-07 20:35:18,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 6059 transitions. [2018-11-07 20:35:18,386 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 6059 transitions. Word has length 359 [2018-11-07 20:35:18,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:35:18,387 INFO L480 AbstractCegarLoop]: Abstraction has 4988 states and 6059 transitions. [2018-11-07 20:35:18,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 20:35:18,387 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 6059 transitions. [2018-11-07 20:35:18,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2018-11-07 20:35:18,404 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:35:18,405 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 20:35:18,405 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:35:18,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:35:18,405 INFO L82 PathProgramCache]: Analyzing trace with hash -400046869, now seen corresponding path program 1 times [2018-11-07 20:35:18,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:35:18,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:18,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:35:18,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:18,407 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:35:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:35:19,363 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 249 proven. 211 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 20:35:19,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:35:19,364 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:35:19,364 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 429 with the following transitions: [2018-11-07 20:35:19,364 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [850], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:35:19,368 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:35:19,368 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:35:19,421 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:35:19,603 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:35:19,603 INFO L272 AbstractInterpreter]: Visited 168 different actions 329 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:35:19,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:35:19,613 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:35:20,190 INFO L227 lantSequenceWeakener]: Weakened 101 states. On average, predicates are now at 78.31% of their original sizes. [2018-11-07 20:35:20,190 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:35:20,991 INFO L415 sIntCurrentIteration]: We unified 427 AI predicates to 427 [2018-11-07 20:35:20,991 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:35:20,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:35:20,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [12] total 30 [2018-11-07 20:35:20,992 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:35:20,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 20:35:20,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 20:35:20,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2018-11-07 20:35:20,994 INFO L87 Difference]: Start difference. First operand 4988 states and 6059 transitions. Second operand 20 states. [2018-11-07 20:35:43,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:35:43,859 INFO L93 Difference]: Finished difference Result 8126 states and 10380 transitions. [2018-11-07 20:35:43,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 20:35:43,860 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 428 [2018-11-07 20:35:43,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:35:43,874 INFO L225 Difference]: With dead ends: 8126 [2018-11-07 20:35:43,874 INFO L226 Difference]: Without dead ends: 6411 [2018-11-07 20:35:43,881 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 438 GetRequests, 403 SyntacticMatches, 6 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=200, Invalid=730, Unknown=0, NotChecked=0, Total=930 [2018-11-07 20:35:43,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6411 states. [2018-11-07 20:35:43,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6411 to 5728. [2018-11-07 20:35:43,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5728 states. [2018-11-07 20:35:43,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5728 states to 5728 states and 6845 transitions. [2018-11-07 20:35:43,986 INFO L78 Accepts]: Start accepts. Automaton has 5728 states and 6845 transitions. Word has length 428 [2018-11-07 20:35:43,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:35:43,987 INFO L480 AbstractCegarLoop]: Abstraction has 5728 states and 6845 transitions. [2018-11-07 20:35:43,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 20:35:43,988 INFO L276 IsEmpty]: Start isEmpty. Operand 5728 states and 6845 transitions. [2018-11-07 20:35:44,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2018-11-07 20:35:44,006 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:35:44,007 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 20:35:44,007 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:35:44,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:35:44,007 INFO L82 PathProgramCache]: Analyzing trace with hash -716636733, now seen corresponding path program 1 times [2018-11-07 20:35:44,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:35:44,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:44,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:35:44,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:44,009 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:35:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:35:44,503 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 20:35:44,706 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-07 20:35:44,921 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 20:35:46,342 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 237 proven. 223 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 20:35:46,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:35:46,342 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:35:46,342 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 441 with the following transitions: [2018-11-07 20:35:46,342 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [879], [883], [887], [891], [895], [898], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:35:46,345 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:35:46,346 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:35:46,396 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:35:46,562 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:35:46,562 INFO L272 AbstractInterpreter]: Visited 180 different actions 353 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:35:46,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:35:46,570 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:35:47,022 INFO L227 lantSequenceWeakener]: Weakened 134 states. On average, predicates are now at 78.05% of their original sizes. [2018-11-07 20:35:47,022 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:35:47,682 INFO L415 sIntCurrentIteration]: We unified 439 AI predicates to 439 [2018-11-07 20:35:47,683 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:35:47,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:35:47,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [14] total 36 [2018-11-07 20:35:47,683 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:35:47,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 20:35:47,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 20:35:47,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2018-11-07 20:35:47,686 INFO L87 Difference]: Start difference. First operand 5728 states and 6845 transitions. Second operand 24 states. [2018-11-07 20:36:10,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:36:10,613 INFO L93 Difference]: Finished difference Result 8906 states and 11214 transitions. [2018-11-07 20:36:10,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 20:36:10,613 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 440 [2018-11-07 20:36:10,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:36:10,630 INFO L225 Difference]: With dead ends: 8906 [2018-11-07 20:36:10,631 INFO L226 Difference]: Without dead ends: 7191 [2018-11-07 20:36:10,638 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 450 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=231, Invalid=959, Unknown=0, NotChecked=0, Total=1190 [2018-11-07 20:36:10,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7191 states. [2018-11-07 20:36:10,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7191 to 6385. [2018-11-07 20:36:10,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6385 states. [2018-11-07 20:36:10,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6385 states to 6385 states and 7541 transitions. [2018-11-07 20:36:10,751 INFO L78 Accepts]: Start accepts. Automaton has 6385 states and 7541 transitions. Word has length 440 [2018-11-07 20:36:10,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:36:10,752 INFO L480 AbstractCegarLoop]: Abstraction has 6385 states and 7541 transitions. [2018-11-07 20:36:10,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 20:36:10,752 INFO L276 IsEmpty]: Start isEmpty. Operand 6385 states and 7541 transitions. [2018-11-07 20:36:10,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2018-11-07 20:36:10,770 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:36:10,770 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:36:10,771 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:36:10,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:36:10,771 INFO L82 PathProgramCache]: Analyzing trace with hash 504901905, now seen corresponding path program 1 times [2018-11-07 20:36:10,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:36:10,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:36:10,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:36:10,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:36:10,772 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:36:10,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:36:11,133 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-11-07 20:36:11,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:36:11,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 20:36:11,133 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:36:11,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 20:36:11,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 20:36:11,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:36:11,135 INFO L87 Difference]: Start difference. First operand 6385 states and 7541 transitions. Second operand 4 states. [2018-11-07 20:36:12,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:36:12,851 INFO L93 Difference]: Finished difference Result 11647 states and 14356 transitions. [2018-11-07 20:36:12,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 20:36:12,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 462 [2018-11-07 20:36:12,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:36:12,880 INFO L225 Difference]: With dead ends: 11647 [2018-11-07 20:36:12,880 INFO L226 Difference]: Without dead ends: 7982 [2018-11-07 20:36:12,895 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:36:12,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7982 states. [2018-11-07 20:36:13,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7982 to 7969. [2018-11-07 20:36:13,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7969 states. [2018-11-07 20:36:13,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7969 states to 7969 states and 9320 transitions. [2018-11-07 20:36:13,027 INFO L78 Accepts]: Start accepts. Automaton has 7969 states and 9320 transitions. Word has length 462 [2018-11-07 20:36:13,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:36:13,028 INFO L480 AbstractCegarLoop]: Abstraction has 7969 states and 9320 transitions. [2018-11-07 20:36:13,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 20:36:13,029 INFO L276 IsEmpty]: Start isEmpty. Operand 7969 states and 9320 transitions. [2018-11-07 20:36:13,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2018-11-07 20:36:13,051 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:36:13,051 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:36:13,051 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:36:13,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:36:13,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1034840062, now seen corresponding path program 1 times [2018-11-07 20:36:13,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:36:13,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:36:13,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:36:13,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:36:13,053 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:36:13,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:36:13,767 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 309 proven. 166 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2018-11-07 20:36:13,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:36:13,768 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:36:13,768 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 471 with the following transitions: [2018-11-07 20:36:13,768 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [614], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [659], [663], [666], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:36:13,771 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:36:13,771 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:36:13,858 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:36:14,191 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 20:36:14,192 INFO L272 AbstractInterpreter]: Visited 124 different actions 368 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-07 20:36:14,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:36:14,232 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 20:36:14,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:36:14,233 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 20:36:14,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:36:14,251 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 20:36:14,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:36:14,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 20:36:15,492 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 570 proven. 2 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-07 20:36:15,493 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 20:36:15,762 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-07 20:36:16,566 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 309 proven. 166 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2018-11-07 20:36:16,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 20:36:16,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-11-07 20:36:16,589 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 20:36:16,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 20:36:16,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 20:36:16,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-07 20:36:16,591 INFO L87 Difference]: Start difference. First operand 7969 states and 9320 transitions. Second operand 9 states. [2018-11-07 20:36:23,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:36:23,355 INFO L93 Difference]: Finished difference Result 18484 states and 23167 transitions. [2018-11-07 20:36:23,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 20:36:23,355 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 470 [2018-11-07 20:36:23,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:36:23,381 INFO L225 Difference]: With dead ends: 18484 [2018-11-07 20:36:23,382 INFO L226 Difference]: Without dead ends: 7922 [2018-11-07 20:36:23,426 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 970 GetRequests, 947 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2018-11-07 20:36:23,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7922 states. [2018-11-07 20:36:23,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7922 to 6706. [2018-11-07 20:36:23,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6706 states. [2018-11-07 20:36:23,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6706 states to 6706 states and 8606 transitions. [2018-11-07 20:36:23,632 INFO L78 Accepts]: Start accepts. Automaton has 6706 states and 8606 transitions. Word has length 470 [2018-11-07 20:36:23,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:36:23,633 INFO L480 AbstractCegarLoop]: Abstraction has 6706 states and 8606 transitions. [2018-11-07 20:36:23,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 20:36:23,633 INFO L276 IsEmpty]: Start isEmpty. Operand 6706 states and 8606 transitions. [2018-11-07 20:36:23,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2018-11-07 20:36:23,652 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:36:23,652 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 20:36:23,653 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:36:23,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:36:23,653 INFO L82 PathProgramCache]: Analyzing trace with hash 790468805, now seen corresponding path program 1 times [2018-11-07 20:36:23,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:36:23,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:36:23,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:36:23,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:36:23,655 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:36:23,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:36:24,663 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 20:36:24,916 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-07 20:36:25,727 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 327 proven. 459 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 20:36:25,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:36:25,728 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:36:25,728 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 474 with the following transitions: [2018-11-07 20:36:25,728 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [566], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [614], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [659], [663], [666], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:36:25,732 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:36:25,732 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:36:25,884 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:36:26,249 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 20:36:26,250 INFO L272 AbstractInterpreter]: Visited 124 different actions 365 times. Merged at 7 different actions 17 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-07 20:36:26,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:36:26,287 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 20:36:26,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:36:26,287 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 20:36:26,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:36:26,306 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 20:36:26,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:36:26,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 20:36:27,358 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 566 trivial. 0 not checked. [2018-11-07 20:36:27,359 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 20:36:28,034 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 566 trivial. 0 not checked. [2018-11-07 20:36:28,067 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:36:28,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [15] total 17 [2018-11-07 20:36:28,067 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:36:28,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 20:36:28,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 20:36:28,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-11-07 20:36:28,070 INFO L87 Difference]: Start difference. First operand 6706 states and 8606 transitions. Second operand 3 states. [2018-11-07 20:36:29,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:36:29,319 INFO L93 Difference]: Finished difference Result 14536 states and 19282 transitions. [2018-11-07 20:36:29,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 20:36:29,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 473 [2018-11-07 20:36:29,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:36:29,327 INFO L225 Difference]: With dead ends: 14536 [2018-11-07 20:36:29,327 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 20:36:29,366 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 961 GetRequests, 945 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-11-07 20:36:29,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 20:36:29,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 20:36:29,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 20:36:29,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 20:36:29,368 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 473 [2018-11-07 20:36:29,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:36:29,368 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 20:36:29,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 20:36:29,368 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 20:36:29,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 20:36:29,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 20:36:29,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:36:29,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:36:29,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:36:29,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:36:29,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:36:29,629 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 132 [2018-11-07 20:36:29,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:36:29,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:36:29,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:36:29,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:36:29,748 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 128 [2018-11-07 20:36:30,046 WARN L179 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2018-11-07 20:36:30,260 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 52 [2018-11-07 20:36:31,732 WARN L179 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 237 DAG size of output: 87 [2018-11-07 20:36:32,180 WARN L179 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 60 [2018-11-07 20:36:32,936 WARN L179 SmtUtils]: Spent 753.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 60 [2018-11-07 20:36:32,939 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 20:36:32,939 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a12~0 |old(~a12~0)|) (= ~a21~0 |old(~a21~0)|) (= |old(~a15~0)| ~a15~0)) [2018-11-07 20:36:32,939 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 20:36:32,940 INFO L425 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2018-11-07 20:36:32,940 INFO L425 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2018-11-07 20:36:32,940 INFO L425 ceAbstractionStarter]: For program point L168(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,940 INFO L425 ceAbstractionStarter]: For program point L102(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,940 INFO L425 ceAbstractionStarter]: For program point L36(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,940 INFO L425 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2018-11-07 20:36:32,940 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-07 20:36:32,940 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-11-07 20:36:32,940 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-07 20:36:32,940 INFO L425 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2018-11-07 20:36:32,940 INFO L425 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2018-11-07 20:36:32,940 INFO L425 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2018-11-07 20:36:32,940 INFO L425 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2018-11-07 20:36:32,941 INFO L425 ceAbstractionStarter]: For program point L171(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,941 INFO L425 ceAbstractionStarter]: For program point L105(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,941 INFO L425 ceAbstractionStarter]: For program point L39(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,941 INFO L425 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2018-11-07 20:36:32,941 INFO L425 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2018-11-07 20:36:32,941 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-07 20:36:32,941 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-07 20:36:32,941 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-07 20:36:32,941 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2018-11-07 20:36:32,941 INFO L425 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2018-11-07 20:36:32,941 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2018-11-07 20:36:32,941 INFO L425 ceAbstractionStarter]: For program point L174(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,941 INFO L425 ceAbstractionStarter]: For program point L108(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,942 INFO L425 ceAbstractionStarter]: For program point L42(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,942 INFO L425 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2018-11-07 20:36:32,942 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-07 20:36:32,942 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-07 20:36:32,942 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-07 20:36:32,942 INFO L425 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2018-11-07 20:36:32,942 INFO L425 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2018-11-07 20:36:32,942 INFO L425 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2018-11-07 20:36:32,942 INFO L425 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2018-11-07 20:36:32,942 INFO L425 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2018-11-07 20:36:32,943 INFO L425 ceAbstractionStarter]: For program point L177(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,943 INFO L425 ceAbstractionStarter]: For program point L111(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,943 INFO L425 ceAbstractionStarter]: For program point L45(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,943 INFO L425 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2018-11-07 20:36:32,943 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-11-07 20:36:32,943 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-07 20:36:32,943 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-07 20:36:32,943 INFO L425 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2018-11-07 20:36:32,944 INFO L425 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2018-11-07 20:36:32,944 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2018-11-07 20:36:32,944 INFO L425 ceAbstractionStarter]: For program point L180(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,944 INFO L425 ceAbstractionStarter]: For program point L114(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,944 INFO L425 ceAbstractionStarter]: For program point L48(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,944 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2018-11-07 20:36:32,944 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-07 20:36:32,944 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-07 20:36:32,944 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-11-07 20:36:32,945 INFO L425 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2018-11-07 20:36:32,945 INFO L425 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2018-11-07 20:36:32,945 INFO L425 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2018-11-07 20:36:32,945 INFO L425 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2018-11-07 20:36:32,945 INFO L425 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2018-11-07 20:36:32,945 INFO L425 ceAbstractionStarter]: For program point L183(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,945 INFO L425 ceAbstractionStarter]: For program point L117(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,945 INFO L425 ceAbstractionStarter]: For program point L51(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,945 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,946 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2018-11-07 20:36:32,950 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-07 20:36:32,950 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-07 20:36:32,950 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-07 20:36:32,950 INFO L425 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2018-11-07 20:36:32,950 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2018-11-07 20:36:32,950 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2018-11-07 20:36:32,950 INFO L425 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2018-11-07 20:36:32,950 INFO L425 ceAbstractionStarter]: For program point L186(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,950 INFO L425 ceAbstractionStarter]: For program point L120(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,951 INFO L425 ceAbstractionStarter]: For program point L54(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,951 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 166) no Hoare annotation was computed. [2018-11-07 20:36:32,951 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-11-07 20:36:32,951 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-07 20:36:32,951 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-07 20:36:32,951 INFO L425 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2018-11-07 20:36:32,951 INFO L425 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2018-11-07 20:36:32,951 INFO L425 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2018-11-07 20:36:32,951 INFO L425 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2018-11-07 20:36:32,951 INFO L425 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2018-11-07 20:36:32,952 INFO L425 ceAbstractionStarter]: For program point L189(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,952 INFO L425 ceAbstractionStarter]: For program point L123(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,952 INFO L425 ceAbstractionStarter]: For program point L57(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,952 INFO L425 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2018-11-07 20:36:32,952 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2018-11-07 20:36:32,952 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-07 20:36:32,952 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-07 20:36:32,952 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-07 20:36:32,952 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2018-11-07 20:36:32,953 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 872) the Hoare annotation is: (let ((.cse4 (< |calculate_output_#in~input| 1)) (.cse2 (< 6 |calculate_output_#in~input|)) (.cse1 (= ~a24~0 1)) (.cse5 (< |old(~a21~0)| 6)) (.cse3 (not (= 1 |old(~a24~0)|))) (.cse8 (not (= 0 (+ |old(~a12~0)| 49)))) (.cse9 (< 8 |old(~a15~0)|)) (.cse7 (< 7 |old(~a21~0)|)) (.cse6 (= 7 |old(~a21~0)|)) (.cse0 (and (= ~a12~0 |old(~a12~0)|) (= ~a21~0 |old(~a21~0)|) (= |old(~a15~0)| ~a15~0))) (.cse10 (= 9 |old(~a15~0)|))) (and (or .cse0 (<= |old(~a12~0)| 11)) (or .cse1 (or .cse2 (< 10 |old(~a21~0)|) .cse3 (not (= 8 |old(~a15~0)|)) (< |old(~a21~0)| 7) .cse4)) (or .cse5 .cse6 (not (= 4 ~inputD~0)) .cse7 .cse4 .cse2 .cse1 (< |old(~a15~0)| 5) (not (= ~inputE~0 5)) (not (= ~inputA~0 1)) (not (= 3 ~inputC~0)) (not (= 2 ~inputB~0)) .cse3 .cse8 .cse9 (not (= ~inputF~0 6))) (or .cse6 (= 8 |old(~a21~0)|) .cse0) (or .cse0 (not .cse10) .cse6) (or .cse1 (or .cse5 .cse3 .cse8 .cse9 .cse7 (< |old(~a15~0)| 6)) .cse6) (or (= 5 |old(~a15~0)|) .cse0 .cse10))) [2018-11-07 20:36:32,953 INFO L425 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2018-11-07 20:36:32,953 INFO L425 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2018-11-07 20:36:32,953 INFO L425 ceAbstractionStarter]: For program point L192(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,953 INFO L425 ceAbstractionStarter]: For program point L126(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,953 INFO L425 ceAbstractionStarter]: For program point L60(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,953 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-11-07 20:36:32,954 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-07 20:36:32,954 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-11-07 20:36:32,954 INFO L425 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2018-11-07 20:36:32,954 INFO L425 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2018-11-07 20:36:32,954 INFO L425 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2018-11-07 20:36:32,954 INFO L425 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2018-11-07 20:36:32,954 INFO L425 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2018-11-07 20:36:32,954 INFO L425 ceAbstractionStarter]: For program point L195(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,954 INFO L425 ceAbstractionStarter]: For program point L129(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,954 INFO L425 ceAbstractionStarter]: For program point L63(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,954 INFO L425 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2018-11-07 20:36:32,954 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2018-11-07 20:36:32,954 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-07 20:36:32,954 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-07 20:36:32,955 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-07 20:36:32,955 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2018-11-07 20:36:32,955 INFO L425 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2018-11-07 20:36:32,955 INFO L425 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2018-11-07 20:36:32,955 INFO L425 ceAbstractionStarter]: For program point L198(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,955 INFO L425 ceAbstractionStarter]: For program point L132(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,955 INFO L425 ceAbstractionStarter]: For program point L66(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,955 INFO L425 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2018-11-07 20:36:32,955 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-07 20:36:32,955 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-07 20:36:32,955 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-07 20:36:32,955 INFO L425 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2018-11-07 20:36:32,955 INFO L425 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2018-11-07 20:36:32,955 INFO L425 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2018-11-07 20:36:32,955 INFO L425 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2018-11-07 20:36:32,956 INFO L425 ceAbstractionStarter]: For program point L201(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,957 INFO L425 ceAbstractionStarter]: For program point L135(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,957 INFO L425 ceAbstractionStarter]: For program point L69(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,957 INFO L425 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2018-11-07 20:36:32,958 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-07 20:36:32,958 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-07 20:36:32,958 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-11-07 20:36:32,958 INFO L425 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2018-11-07 20:36:32,958 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2018-11-07 20:36:32,958 INFO L425 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2018-11-07 20:36:32,958 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2018-11-07 20:36:32,958 INFO L425 ceAbstractionStarter]: For program point L138(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,958 INFO L425 ceAbstractionStarter]: For program point L72(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,958 INFO L425 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2018-11-07 20:36:32,958 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-07 20:36:32,958 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-07 20:36:32,958 INFO L425 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2018-11-07 20:36:32,958 INFO L425 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2018-11-07 20:36:32,958 INFO L425 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2018-11-07 20:36:32,959 INFO L425 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2018-11-07 20:36:32,959 INFO L425 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2018-11-07 20:36:32,959 INFO L425 ceAbstractionStarter]: For program point L141(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,959 INFO L425 ceAbstractionStarter]: For program point L75(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,959 INFO L425 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2018-11-07 20:36:32,959 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-07 20:36:32,959 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-11-07 20:36:32,959 INFO L425 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2018-11-07 20:36:32,959 INFO L425 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2018-11-07 20:36:32,959 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2018-11-07 20:36:32,959 INFO L425 ceAbstractionStarter]: For program point L144(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,959 INFO L425 ceAbstractionStarter]: For program point L78(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,960 INFO L425 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2018-11-07 20:36:32,960 INFO L425 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2018-11-07 20:36:32,960 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-07 20:36:32,960 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-07 20:36:32,960 INFO L425 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2018-11-07 20:36:32,960 INFO L425 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2018-11-07 20:36:32,960 INFO L425 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2018-11-07 20:36:32,960 INFO L425 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2018-11-07 20:36:32,960 INFO L425 ceAbstractionStarter]: For program point L147(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,960 INFO L425 ceAbstractionStarter]: For program point L81(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,961 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2018-11-07 20:36:32,961 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2018-11-07 20:36:32,961 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-07 20:36:32,961 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-07 20:36:32,961 INFO L425 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2018-11-07 20:36:32,961 INFO L425 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2018-11-07 20:36:32,961 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2018-11-07 20:36:32,961 INFO L425 ceAbstractionStarter]: For program point L150(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,961 INFO L425 ceAbstractionStarter]: For program point L84(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,961 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,961 INFO L425 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2018-11-07 20:36:32,962 INFO L425 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2018-11-07 20:36:32,962 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-07 20:36:32,962 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-11-07 20:36:32,962 INFO L425 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2018-11-07 20:36:32,962 INFO L425 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2018-11-07 20:36:32,962 INFO L425 ceAbstractionStarter]: For program point L153(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,962 INFO L425 ceAbstractionStarter]: For program point L87(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,962 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-11-07 20:36:32,962 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,962 INFO L425 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2018-11-07 20:36:32,963 INFO L425 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2018-11-07 20:36:32,963 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2018-11-07 20:36:32,963 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-07 20:36:32,963 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-07 20:36:32,963 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-07 20:36:32,963 INFO L425 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2018-11-07 20:36:32,963 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2018-11-07 20:36:32,963 INFO L425 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2018-11-07 20:36:32,963 INFO L425 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2018-11-07 20:36:32,963 INFO L425 ceAbstractionStarter]: For program point L156(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,963 INFO L425 ceAbstractionStarter]: For program point L90(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,964 INFO L425 ceAbstractionStarter]: For program point L24(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,964 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2018-11-07 20:36:32,964 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-07 20:36:32,964 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-07 20:36:32,964 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-07 20:36:32,964 INFO L425 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2018-11-07 20:36:32,964 INFO L425 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2018-11-07 20:36:32,964 INFO L425 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2018-11-07 20:36:32,964 INFO L425 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2018-11-07 20:36:32,964 INFO L425 ceAbstractionStarter]: For program point L159(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,965 INFO L425 ceAbstractionStarter]: For program point L93(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,965 INFO L425 ceAbstractionStarter]: For program point L27(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,965 INFO L425 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2018-11-07 20:36:32,965 INFO L425 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2018-11-07 20:36:32,965 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-07 20:36:32,965 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-11-07 20:36:32,965 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-07 20:36:32,965 INFO L425 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2018-11-07 20:36:32,965 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2018-11-07 20:36:32,966 INFO L425 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2018-11-07 20:36:32,966 INFO L425 ceAbstractionStarter]: For program point L162(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,966 INFO L425 ceAbstractionStarter]: For program point L96(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,966 INFO L425 ceAbstractionStarter]: For program point L30(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,966 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2018-11-07 20:36:32,966 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-07 20:36:32,966 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-07 20:36:32,966 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-07 20:36:32,966 INFO L425 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2018-11-07 20:36:32,967 INFO L425 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2018-11-07 20:36:32,967 INFO L425 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2018-11-07 20:36:32,967 INFO L425 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2018-11-07 20:36:32,967 INFO L425 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2018-11-07 20:36:32,967 INFO L425 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,967 INFO L425 ceAbstractionStarter]: For program point L99(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,967 INFO L425 ceAbstractionStarter]: For program point L33(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:32,967 INFO L425 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2018-11-07 20:36:32,967 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-07 20:36:32,967 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-07 20:36:32,968 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-07 20:36:32,968 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2018-11-07 20:36:32,968 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 20:36:32,968 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~inputF~0 6) (= ~inputA~0 1) (= ~inputC~0 3) (= ~a15~0 8) (= (+ ~a12~0 49) 0) (= ~inputB~0 2) (= ~a24~0 1) (= ~inputE~0 5) (= ~a21~0 7) (= ~inputD~0 4)) [2018-11-07 20:36:32,968 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 20:36:32,968 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 20:36:32,969 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 874 890) the Hoare annotation is: (or (and (= (+ ~a12~0 49) 0) (= ~a21~0 7) (= |old(~a15~0)| ~a15~0) (= ~a24~0 1)) (not (= |old(~a15~0)| 8)) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (not (= ~inputA~0 1)) (not (= 3 ~inputC~0)) (not (= 2 ~inputB~0)) (not (= 1 |old(~a24~0)|)) (not (= |old(~a21~0)| 7)) (not (= 0 (+ |old(~a12~0)| 49))) (not (= ~inputF~0 6))) [2018-11-07 20:36:32,969 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 874 890) no Hoare annotation was computed. [2018-11-07 20:36:32,969 INFO L421 ceAbstractionStarter]: At program point L888(line 888) the Hoare annotation is: (let ((.cse0 (not (= ~a21~0 7)))) (or (not (= |old(~a15~0)| 8)) (and (not (= ~a15~0 9)) (not (= 5 ~a15~0))) (< 11 ~a12~0) (and (not (= ~a21~0 8)) .cse0) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (not (= ~inputA~0 1)) (not (= 3 ~inputC~0)) (and (= 9 ~a15~0) .cse0) (not (= 2 ~inputB~0)) (not (= 1 |old(~a24~0)|)) (not (= |old(~a21~0)| 7)) (not (= 0 (+ |old(~a12~0)| 49))) (not (= ~inputF~0 6)))) [2018-11-07 20:36:32,970 INFO L425 ceAbstractionStarter]: For program point L888-1(line 888) no Hoare annotation was computed. [2018-11-07 20:36:32,970 INFO L425 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2018-11-07 20:36:32,970 INFO L425 ceAbstractionStarter]: For program point L880-1(lines 880 889) no Hoare annotation was computed. [2018-11-07 20:36:32,970 INFO L421 ceAbstractionStarter]: At program point L880-3(lines 880 889) the Hoare annotation is: (let ((.cse0 (not (= ~a21~0 7)))) (or (not (= |old(~a15~0)| 8)) (and (not (= ~a15~0 9)) (not (= 5 ~a15~0))) (< 11 ~a12~0) (and (not (= ~a21~0 8)) .cse0) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (not (= ~inputA~0 1)) (not (= 3 ~inputC~0)) (and (= 9 ~a15~0) .cse0) (not (= 2 ~inputB~0)) (not (= 1 |old(~a24~0)|)) (not (= |old(~a21~0)| 7)) (not (= 0 (+ |old(~a12~0)| 49))) (not (= ~inputF~0 6)))) [2018-11-07 20:36:32,970 INFO L425 ceAbstractionStarter]: For program point L880-4(lines 874 890) no Hoare annotation was computed. [2018-11-07 20:36:32,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:36:32 BoogieIcfgContainer [2018-11-07 20:36:32,994 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 20:36:32,997 INFO L168 Benchmark]: Toolchain (without parser) took 200507.79 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -248.7 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-11-07 20:36:32,999 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 20:36:32,999 INFO L168 Benchmark]: CACSL2BoogieTranslator took 861.57 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: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-11-07 20:36:33,000 INFO L168 Benchmark]: Boogie Procedure Inliner took 180.57 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 739.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -834.5 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2018-11-07 20:36:33,001 INFO L168 Benchmark]: Boogie Preprocessor took 147.12 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 20:36:33,001 INFO L168 Benchmark]: RCFGBuilder took 3947.29 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: 123.1 MB). Peak memory consumption was 123.1 MB. Max. memory is 7.1 GB. [2018-11-07 20:36:33,003 INFO L168 Benchmark]: TraceAbstraction took 195360.77 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 409.8 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-11-07 20:36:33,013 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 861.57 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: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 180.57 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 739.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -834.5 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 147.12 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 3947.29 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: 123.1 MB). Peak memory consumption was 123.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 195360.77 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 409.8 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 166]: 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: 880]: Loop Invariant Derived loop invariant: ((((((((((((!(\old(a15) == 8) || (!(a15 == 9) && !(5 == a15))) || 11 < a12) || (!(a21 == 8) && !(a21 == 7))) || !(4 == inputD)) || !(inputE == 5)) || !(inputA == 1)) || !(3 == inputC)) || (9 == a15 && !(a21 == 7))) || !(2 == inputB)) || !(1 == \old(a24))) || !(\old(a21) == 7)) || !(0 == \old(a12) + 49)) || !(inputF == 6) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 255 locations, 1 error locations. SAFE Result, 195.2s OverallTime, 14 OverallIterations, 5 TraceHistogramMax, 160.7s AutomataDifference, 0.0s DeadEndRemovalTime, 3.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 2881 SDtfs, 35204 SDslu, 2021 SDs, 0 SdLazy, 30220 SolverSat, 3608 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 52.6s Time, PredicateUnifierStatistics: 16 DeclaredPredicates, 4784 GetRequests, 4505 SyntacticMatches, 18 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1674 ImplicationChecksByTransitivity, 10.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7969occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.2s AbstIntTime, 10 AbstIntIterations, 8 AbstIntStrong, 0.9972119652348144 AbsIntWeakeningRatio, 0.09117432530999271 AbsIntAvgWeakeningVarsNumRemoved, 14.347921225382931 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 4723 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 146 PreInvPairs, 220 NumberOfFragments, 442 HoareAnnotationTreeSize, 146 FomulaSimplifications, 7014 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 7 FomulaSimplificationsInter, 4907 FormulaSimplificationTreeSizeReductionInter, 3.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 12.9s InterpolantComputationTime, 5499 NumberOfCodeBlocks, 5499 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 6424 ConstructedInterpolants, 0 QuantifiedInterpolants, 11900997 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1456 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 6816/8406 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...