java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label24_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 00:06:08,716 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 00:06:08,718 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 00:06:08,730 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 00:06:08,730 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 00:06:08,731 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 00:06:08,733 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 00:06:08,735 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 00:06:08,736 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 00:06:08,737 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 00:06:08,738 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 00:06:08,738 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 00:06:08,739 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 00:06:08,740 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 00:06:08,742 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 00:06:08,742 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 00:06:08,743 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 00:06:08,745 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 00:06:08,747 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 00:06:08,749 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 00:06:08,750 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 00:06:08,751 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 00:06:08,754 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 00:06:08,754 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 00:06:08,755 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 00:06:08,756 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 00:06:08,757 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 00:06:08,757 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 00:06:08,758 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 00:06:08,759 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 00:06:08,760 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 00:06:08,760 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 00:06:08,760 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 00:06:08,761 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 00:06:08,762 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 00:06:08,762 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 00:06:08,763 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-25 00:06:08,778 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 00:06:08,778 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 00:06:08,779 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 00:06:08,779 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 00:06:08,780 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 00:06:08,780 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 00:06:08,780 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 00:06:08,780 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 00:06:08,780 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 00:06:08,781 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 00:06:08,781 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 00:06:08,781 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 00:06:08,781 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 00:06:08,781 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 00:06:08,782 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 00:06:08,782 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 00:06:08,782 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 00:06:08,783 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 00:06:08,783 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 00:06:08,783 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 00:06:08,783 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 00:06:08,783 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 00:06:08,784 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 00:06:08,784 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 00:06:08,784 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 00:06:08,784 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 00:06:08,784 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:06:08,785 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 00:06:08,785 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 00:06:08,785 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 00:06:08,785 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 00:06:08,785 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 00:06:08,786 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 00:06:08,786 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 00:06:08,786 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 00:06:08,786 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 00:06:08,829 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 00:06:08,845 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 00:06:08,850 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 00:06:08,852 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 00:06:08,852 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 00:06:08,853 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label24_true-unreach-call_false-termination.c [2018-10-25 00:06:08,927 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/92bf7b391/bd6d925399b846c6b013325dd9172c48/FLAG31754393a [2018-10-25 00:06:09,527 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 00:06:09,528 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label24_true-unreach-call_false-termination.c [2018-10-25 00:06:09,552 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/92bf7b391/bd6d925399b846c6b013325dd9172c48/FLAG31754393a [2018-10-25 00:06:09,574 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/92bf7b391/bd6d925399b846c6b013325dd9172c48 [2018-10-25 00:06:09,587 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 00:06:09,588 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 00:06:09,590 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 00:06:09,590 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 00:06:09,594 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 00:06:09,595 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:06:09" (1/1) ... [2018-10-25 00:06:09,598 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67bc9002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:06:09, skipping insertion in model container [2018-10-25 00:06:09,598 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:06:09" (1/1) ... [2018-10-25 00:06:09,609 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 00:06:09,672 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 00:06:10,147 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:06:10,153 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 00:06:10,274 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:06:10,292 INFO L193 MainTranslator]: Completed translation [2018-10-25 00:06:10,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:06:10 WrapperNode [2018-10-25 00:06:10,293 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 00:06:10,294 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 00:06:10,294 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 00:06:10,294 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 00:06:10,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:06:10" (1/1) ... [2018-10-25 00:06:10,340 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:06:10" (1/1) ... [2018-10-25 00:06:10,507 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 00:06:10,508 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 00:06:10,508 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 00:06:10,508 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 00:06:10,518 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:06:10" (1/1) ... [2018-10-25 00:06:10,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:06:10" (1/1) ... [2018-10-25 00:06:10,523 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:06:10" (1/1) ... [2018-10-25 00:06:10,524 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:06:10" (1/1) ... [2018-10-25 00:06:10,542 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:06:10" (1/1) ... [2018-10-25 00:06:10,566 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:06:10" (1/1) ... [2018-10-25 00:06:10,579 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:06:10" (1/1) ... [2018-10-25 00:06:10,588 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 00:06:10,588 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 00:06:10,588 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 00:06:10,589 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 00:06:10,591 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:06:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:06:10,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 00:06:10,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 00:06:10,655 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 00:06:10,655 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 00:06:10,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 00:06:10,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 00:06:10,656 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 00:06:10,656 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 00:06:13,900 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 00:06:13,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:06:13 BoogieIcfgContainer [2018-10-25 00:06:13,901 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 00:06:13,911 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 00:06:13,911 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 00:06:13,915 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 00:06:13,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 12:06:09" (1/3) ... [2018-10-25 00:06:13,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a75a5a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:06:13, skipping insertion in model container [2018-10-25 00:06:13,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:06:10" (2/3) ... [2018-10-25 00:06:13,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a75a5a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:06:13, skipping insertion in model container [2018-10-25 00:06:13,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:06:13" (3/3) ... [2018-10-25 00:06:13,923 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label24_true-unreach-call_false-termination.c [2018-10-25 00:06:13,934 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 00:06:13,951 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 00:06:13,970 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 00:06:14,023 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 00:06:14,024 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 00:06:14,024 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 00:06:14,024 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 00:06:14,024 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 00:06:14,025 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 00:06:14,025 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 00:06:14,025 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 00:06:14,071 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-10-25 00:06:14,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-25 00:06:14,096 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:06:14,098 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:06:14,101 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:06:14,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:14,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1658764377, now seen corresponding path program 1 times [2018-10-25 00:06:14,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:06:14,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:14,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:06:14,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:14,178 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:06:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:06:14,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:06:14,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:06:14,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:06:14,798 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:06:14,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:06:14,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:06:14,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:06:14,825 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-10-25 00:06:16,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:06:16,673 INFO L93 Difference]: Finished difference Result 621 states and 1060 transitions. [2018-10-25 00:06:16,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:06:16,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2018-10-25 00:06:16,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:06:16,696 INFO L225 Difference]: With dead ends: 621 [2018-10-25 00:06:16,696 INFO L226 Difference]: Without dead ends: 382 [2018-10-25 00:06:16,703 INFO L605 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-10-25 00:06:16,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-10-25 00:06:16,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 381. [2018-10-25 00:06:16,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-25 00:06:16,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 637 transitions. [2018-10-25 00:06:16,777 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 637 transitions. Word has length 121 [2018-10-25 00:06:16,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:06:16,778 INFO L481 AbstractCegarLoop]: Abstraction has 381 states and 637 transitions. [2018-10-25 00:06:16,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:06:16,778 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 637 transitions. [2018-10-25 00:06:16,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-25 00:06:16,784 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:06:16,785 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:06:16,785 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:06:16,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:16,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1422747334, now seen corresponding path program 1 times [2018-10-25 00:06:16,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:06:16,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:16,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:06:16,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:16,788 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:06:16,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:06:17,185 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:06:17,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:06:17,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:06:17,186 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:06:17,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:06:17,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:06:17,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:06:17,189 INFO L87 Difference]: Start difference. First operand 381 states and 637 transitions. Second operand 5 states. [2018-10-25 00:06:18,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:06:18,789 INFO L93 Difference]: Finished difference Result 901 states and 1555 transitions. [2018-10-25 00:06:18,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:06:18,790 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2018-10-25 00:06:18,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:06:18,794 INFO L225 Difference]: With dead ends: 901 [2018-10-25 00:06:18,794 INFO L226 Difference]: Without dead ends: 380 [2018-10-25 00:06:18,801 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:06:18,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-10-25 00:06:18,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-10-25 00:06:18,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-10-25 00:06:18,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 632 transitions. [2018-10-25 00:06:18,825 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 632 transitions. Word has length 130 [2018-10-25 00:06:18,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:06:18,826 INFO L481 AbstractCegarLoop]: Abstraction has 380 states and 632 transitions. [2018-10-25 00:06:18,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:06:18,826 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 632 transitions. [2018-10-25 00:06:18,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-25 00:06:18,830 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:06:18,830 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:06:18,830 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:06:18,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:18,831 INFO L82 PathProgramCache]: Analyzing trace with hash -2099227971, now seen corresponding path program 1 times [2018-10-25 00:06:18,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:06:18,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:18,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:06:18,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:18,833 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:06:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:06:19,098 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:06:19,244 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:06:19,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:06:19,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:06:19,245 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:06:19,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:06:19,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:06:19,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:06:19,247 INFO L87 Difference]: Start difference. First operand 380 states and 632 transitions. Second operand 6 states. [2018-10-25 00:06:21,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:06:21,808 INFO L93 Difference]: Finished difference Result 1184 states and 2066 transitions. [2018-10-25 00:06:21,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:06:21,811 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 155 [2018-10-25 00:06:21,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:06:21,821 INFO L225 Difference]: With dead ends: 1184 [2018-10-25 00:06:21,821 INFO L226 Difference]: Without dead ends: 810 [2018-10-25 00:06:21,825 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:06:21,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2018-10-25 00:06:21,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 800. [2018-10-25 00:06:21,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2018-10-25 00:06:21,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1274 transitions. [2018-10-25 00:06:21,906 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1274 transitions. Word has length 155 [2018-10-25 00:06:21,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:06:21,906 INFO L481 AbstractCegarLoop]: Abstraction has 800 states and 1274 transitions. [2018-10-25 00:06:21,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:06:21,907 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1274 transitions. [2018-10-25 00:06:21,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-25 00:06:21,911 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:06:21,915 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:06:21,915 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:06:21,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:21,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1213735243, now seen corresponding path program 1 times [2018-10-25 00:06:21,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:06:21,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:21,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:06:21,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:21,918 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:06:21,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:06:22,149 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:06:22,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:06:22,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:06:22,150 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:06:22,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:06:22,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:06:22,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:06:22,153 INFO L87 Difference]: Start difference. First operand 800 states and 1274 transitions. Second operand 3 states. [2018-10-25 00:06:24,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:06:24,719 INFO L93 Difference]: Finished difference Result 2306 states and 3791 transitions. [2018-10-25 00:06:24,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:06:24,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2018-10-25 00:06:24,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:06:24,734 INFO L225 Difference]: With dead ends: 2306 [2018-10-25 00:06:24,735 INFO L226 Difference]: Without dead ends: 1512 [2018-10-25 00:06:24,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:06:24,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2018-10-25 00:06:24,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1507. [2018-10-25 00:06:24,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2018-10-25 00:06:24,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 2312 transitions. [2018-10-25 00:06:24,811 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 2312 transitions. Word has length 156 [2018-10-25 00:06:24,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:06:24,812 INFO L481 AbstractCegarLoop]: Abstraction has 1507 states and 2312 transitions. [2018-10-25 00:06:24,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:06:24,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 2312 transitions. [2018-10-25 00:06:24,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-25 00:06:24,822 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:06:24,822 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:06:24,822 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:06:24,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:24,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1427113375, now seen corresponding path program 1 times [2018-10-25 00:06:24,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:06:24,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:24,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:06:24,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:24,824 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:06:24,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:06:25,133 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 44 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:06:25,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:06:25,134 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:06:25,134 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 174 with the following transitions: [2018-10-25 00:06:25,137 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [198], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [639], [641], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:06:25,186 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:06:25,187 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:06:26,199 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:06:26,201 INFO L272 AbstractInterpreter]: Visited 124 different actions 242 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-10-25 00:06:26,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:26,237 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:06:27,143 INFO L232 lantSequenceWeakener]: Weakened 170 states. On average, predicates are now at 80.94% of their original sizes. [2018-10-25 00:06:27,144 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:06:27,731 INFO L413 sIntCurrentIteration]: We have 172 unified AI predicates [2018-10-25 00:06:27,731 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:06:27,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:06:27,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-10-25 00:06:27,733 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:06:27,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-25 00:06:27,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-25 00:06:27,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:06:27,734 INFO L87 Difference]: Start difference. First operand 1507 states and 2312 transitions. Second operand 10 states. [2018-10-25 00:06:40,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:06:40,616 INFO L93 Difference]: Finished difference Result 3454 states and 5312 transitions. [2018-10-25 00:06:40,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-25 00:06:40,616 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 173 [2018-10-25 00:06:40,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:06:40,628 INFO L225 Difference]: With dead ends: 3454 [2018-10-25 00:06:40,628 INFO L226 Difference]: Without dead ends: 1953 [2018-10-25 00:06:40,634 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 182 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-10-25 00:06:40,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2018-10-25 00:06:40,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1948. [2018-10-25 00:06:40,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1948 states. [2018-10-25 00:06:40,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1948 states to 1948 states and 2802 transitions. [2018-10-25 00:06:40,689 INFO L78 Accepts]: Start accepts. Automaton has 1948 states and 2802 transitions. Word has length 173 [2018-10-25 00:06:40,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:06:40,690 INFO L481 AbstractCegarLoop]: Abstraction has 1948 states and 2802 transitions. [2018-10-25 00:06:40,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-25 00:06:40,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1948 states and 2802 transitions. [2018-10-25 00:06:40,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-25 00:06:40,699 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:06:40,699 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-25 00:06:40,700 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:06:40,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:40,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1466739305, now seen corresponding path program 1 times [2018-10-25 00:06:40,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:06:40,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:40,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:06:40,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:40,702 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:06:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:06:40,904 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 81 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:06:40,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:06:40,904 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:06:40,904 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 197 with the following transitions: [2018-10-25 00:06:40,905 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [248], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [639], [641], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:06:40,910 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:06:40,911 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:06:41,429 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:06:41,430 INFO L272 AbstractInterpreter]: Visited 125 different actions 244 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-10-25 00:06:41,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:41,458 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:06:42,069 INFO L232 lantSequenceWeakener]: Weakened 174 states. On average, predicates are now at 81.15% of their original sizes. [2018-10-25 00:06:42,069 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:06:44,747 INFO L413 sIntCurrentIteration]: We have 195 unified AI predicates [2018-10-25 00:06:44,748 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:06:44,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:06:44,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-10-25 00:06:44,748 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:06:44,749 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-25 00:06:44,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-25 00:06:44,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2018-10-25 00:06:44,750 INFO L87 Difference]: Start difference. First operand 1948 states and 2802 transitions. Second operand 18 states. [2018-10-25 00:07:01,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:07:01,014 INFO L93 Difference]: Finished difference Result 4944 states and 7086 transitions. [2018-10-25 00:07:01,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-25 00:07:01,015 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 196 [2018-10-25 00:07:01,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:07:01,031 INFO L225 Difference]: With dead ends: 4944 [2018-10-25 00:07:01,031 INFO L226 Difference]: Without dead ends: 3002 [2018-10-25 00:07:01,038 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 211 GetRequests, 51 SyntacticMatches, 128 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1207 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=224, Invalid=898, Unknown=0, NotChecked=0, Total=1122 [2018-10-25 00:07:01,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3002 states. [2018-10-25 00:07:01,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3002 to 2984. [2018-10-25 00:07:01,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2984 states. [2018-10-25 00:07:01,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2984 states to 2984 states and 4005 transitions. [2018-10-25 00:07:01,128 INFO L78 Accepts]: Start accepts. Automaton has 2984 states and 4005 transitions. Word has length 196 [2018-10-25 00:07:01,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:07:01,128 INFO L481 AbstractCegarLoop]: Abstraction has 2984 states and 4005 transitions. [2018-10-25 00:07:01,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-25 00:07:01,129 INFO L276 IsEmpty]: Start isEmpty. Operand 2984 states and 4005 transitions. [2018-10-25 00:07:01,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-25 00:07:01,140 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:07:01,140 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-25 00:07:01,141 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:07:01,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:07:01,141 INFO L82 PathProgramCache]: Analyzing trace with hash -53175711, now seen corresponding path program 1 times [2018-10-25 00:07:01,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:07:01,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:01,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:07:01,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:01,143 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:07:01,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:07:01,312 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-25 00:07:01,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:07:01,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:07:01,313 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:07:01,314 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:07:01,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:07:01,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:07:01,314 INFO L87 Difference]: Start difference. First operand 2984 states and 4005 transitions. Second operand 3 states. [2018-10-25 00:07:02,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:07:02,277 INFO L93 Difference]: Finished difference Result 5660 states and 7689 transitions. [2018-10-25 00:07:02,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:07:02,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2018-10-25 00:07:02,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:07:02,291 INFO L225 Difference]: With dead ends: 5660 [2018-10-25 00:07:02,291 INFO L226 Difference]: Without dead ends: 2984 [2018-10-25 00:07:02,300 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:07:02,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2984 states. [2018-10-25 00:07:02,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2984 to 2984. [2018-10-25 00:07:02,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2984 states. [2018-10-25 00:07:02,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2984 states to 2984 states and 3730 transitions. [2018-10-25 00:07:02,371 INFO L78 Accepts]: Start accepts. Automaton has 2984 states and 3730 transitions. Word has length 205 [2018-10-25 00:07:02,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:07:02,372 INFO L481 AbstractCegarLoop]: Abstraction has 2984 states and 3730 transitions. [2018-10-25 00:07:02,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:07:02,372 INFO L276 IsEmpty]: Start isEmpty. Operand 2984 states and 3730 transitions. [2018-10-25 00:07:02,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-10-25 00:07:02,383 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:07:02,383 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-10-25 00:07:02,383 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:07:02,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:07:02,384 INFO L82 PathProgramCache]: Analyzing trace with hash -923173500, now seen corresponding path program 1 times [2018-10-25 00:07:02,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:07:02,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:02,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:07:02,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:02,385 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:07:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:07:02,650 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:07:03,356 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 108 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:07:03,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:07:03,356 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:07:03,356 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 218 with the following transitions: [2018-10-25 00:07:03,357 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [225], [228], [232], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [639], [641], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:07:03,361 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:07:03,361 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:07:03,812 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:07:03,812 INFO L272 AbstractInterpreter]: Visited 129 different actions 380 times. Merged at 8 different actions 21 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-25 00:07:03,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:07:03,823 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:07:03,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:07:03,823 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:07:03,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:07:03,833 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:07:03,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:07:03,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:07:04,208 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 123 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-25 00:07:04,208 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:07:04,600 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 123 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-25 00:07:04,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:07:04,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 16 [2018-10-25 00:07:04,635 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:07:04,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-25 00:07:04,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-25 00:07:04,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-10-25 00:07:04,637 INFO L87 Difference]: Start difference. First operand 2984 states and 3730 transitions. Second operand 14 states. [2018-10-25 00:07:09,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:07:09,601 INFO L93 Difference]: Finished difference Result 8231 states and 10858 transitions. [2018-10-25 00:07:09,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-25 00:07:09,601 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 217 [2018-10-25 00:07:09,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:07:09,611 INFO L225 Difference]: With dead ends: 8231 [2018-10-25 00:07:09,612 INFO L226 Difference]: Without dead ends: 2273 [2018-10-25 00:07:09,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 448 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=449, Invalid=1273, Unknown=0, NotChecked=0, Total=1722 [2018-10-25 00:07:09,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2273 states. [2018-10-25 00:07:09,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2273 to 2263. [2018-10-25 00:07:09,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2263 states. [2018-10-25 00:07:09,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 2263 states and 2605 transitions. [2018-10-25 00:07:09,709 INFO L78 Accepts]: Start accepts. Automaton has 2263 states and 2605 transitions. Word has length 217 [2018-10-25 00:07:09,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:07:09,710 INFO L481 AbstractCegarLoop]: Abstraction has 2263 states and 2605 transitions. [2018-10-25 00:07:09,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-25 00:07:09,710 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 2605 transitions. [2018-10-25 00:07:09,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-10-25 00:07:09,718 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:07:09,719 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:07:09,719 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:07:09,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:07:09,719 INFO L82 PathProgramCache]: Analyzing trace with hash -517292809, now seen corresponding path program 1 times [2018-10-25 00:07:09,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:07:09,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:09,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:07:09,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:09,721 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:07:09,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:07:11,351 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 152 proven. 71 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-25 00:07:11,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:07:11,351 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:07:11,352 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 255 with the following transitions: [2018-10-25 00:07:11,352 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [67], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [248], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [639], [641], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:07:11,356 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:07:11,356 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:07:11,937 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:07:11,937 INFO L272 AbstractInterpreter]: Visited 127 different actions 392 times. Merged at 9 different actions 33 times. Widened at 1 different actions 2 times. Found 6 fixpoints after 5 different actions. Largest state had 38 variables. [2018-10-25 00:07:11,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:07:11,944 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:07:13,491 INFO L232 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 83.33% of their original sizes. [2018-10-25 00:07:13,492 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:07:19,477 INFO L413 sIntCurrentIteration]: We have 253 unified AI predicates [2018-10-25 00:07:19,478 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:07:19,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:07:19,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 20 [2018-10-25 00:07:19,478 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:07:19,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-25 00:07:19,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-25 00:07:19,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-10-25 00:07:19,480 INFO L87 Difference]: Start difference. First operand 2263 states and 2605 transitions. Second operand 11 states. [2018-10-25 00:07:25,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:07:25,679 INFO L93 Difference]: Finished difference Result 2265 states and 2607 transitions. [2018-10-25 00:07:25,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-25 00:07:25,680 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 254 [2018-10-25 00:07:25,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:07:25,680 INFO L225 Difference]: With dead ends: 2265 [2018-10-25 00:07:25,680 INFO L226 Difference]: Without dead ends: 0 [2018-10-25 00:07:25,684 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 259 GetRequests, 32 SyntacticMatches, 212 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2018-10-25 00:07:25,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-25 00:07:25,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-25 00:07:25,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-25 00:07:25,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-25 00:07:25,685 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 254 [2018-10-25 00:07:25,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:07:25,686 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-25 00:07:25,686 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-25 00:07:25,686 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-25 00:07:25,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-25 00:07:25,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-25 00:07:26,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:26,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:26,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:26,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:26,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:26,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:26,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:26,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:26,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:26,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:26,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:26,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:26,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:26,151 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 140 [2018-10-25 00:07:26,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:26,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:26,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:26,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:26,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:26,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:26,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:26,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:26,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:26,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:26,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:26,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:26,302 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 146 [2018-10-25 00:07:27,405 WARN L179 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2018-10-25 00:07:28,572 WARN L179 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 124 DAG size of output: 77 [2018-10-25 00:07:35,242 WARN L179 SmtUtils]: Spent 6.65 s on a formula simplification. DAG size of input: 253 DAG size of output: 119 [2018-10-25 00:07:35,811 WARN L179 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 96 [2018-10-25 00:07:36,589 WARN L179 SmtUtils]: Spent 775.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 103 [2018-10-25 00:07:36,591 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:07:36,591 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a11~0)| ~a11~0) (= |old(~a28~0)| ~a28~0) (= |old(~a17~0)| ~a17~0)) [2018-10-25 00:07:36,592 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:07:36,592 INFO L425 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,592 INFO L425 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,592 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,592 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,592 INFO L425 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,593 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-10-25 00:07:36,593 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-10-25 00:07:36,593 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-10-25 00:07:36,593 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-10-25 00:07:36,593 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-10-25 00:07:36,593 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-10-25 00:07:36,593 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-10-25 00:07:36,593 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-10-25 00:07:36,594 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-10-25 00:07:36,594 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-10-25 00:07:36,594 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-10-25 00:07:36,594 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-10-25 00:07:36,595 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-10-25 00:07:36,595 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,595 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,595 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,595 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,595 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-10-25 00:07:36,595 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,595 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-10-25 00:07:36,595 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-10-25 00:07:36,595 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-10-25 00:07:36,595 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-10-25 00:07:36,595 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-10-25 00:07:36,595 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-10-25 00:07:36,596 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-10-25 00:07:36,596 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-10-25 00:07:36,596 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-10-25 00:07:36,596 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-10-25 00:07:36,596 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-10-25 00:07:36,596 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-10-25 00:07:36,596 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-10-25 00:07:36,596 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-10-25 00:07:36,596 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-10-25 00:07:36,596 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,596 INFO L425 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,597 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,597 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,597 INFO L425 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,597 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-10-25 00:07:36,597 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-10-25 00:07:36,597 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-10-25 00:07:36,597 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-10-25 00:07:36,597 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-10-25 00:07:36,597 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-10-25 00:07:36,598 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-10-25 00:07:36,598 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-10-25 00:07:36,598 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-10-25 00:07:36,598 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-10-25 00:07:36,598 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-10-25 00:07:36,598 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,598 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,598 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,598 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,599 INFO L425 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,599 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-10-25 00:07:36,599 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-10-25 00:07:36,599 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-10-25 00:07:36,599 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-10-25 00:07:36,599 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-10-25 00:07:36,599 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-10-25 00:07:36,599 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-10-25 00:07:36,600 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-10-25 00:07:36,600 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-10-25 00:07:36,600 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-10-25 00:07:36,600 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-10-25 00:07:36,600 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-10-25 00:07:36,600 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-10-25 00:07:36,600 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,600 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,601 INFO L425 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,601 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,601 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,601 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-10-25 00:07:36,601 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-10-25 00:07:36,601 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-10-25 00:07:36,601 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-10-25 00:07:36,601 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-10-25 00:07:36,601 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-10-25 00:07:36,601 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-10-25 00:07:36,602 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-10-25 00:07:36,602 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-10-25 00:07:36,602 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 514) no Hoare annotation was computed. [2018-10-25 00:07:36,602 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-10-25 00:07:36,602 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-10-25 00:07:36,602 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-10-25 00:07:36,602 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-10-25 00:07:36,602 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-10-25 00:07:36,603 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-10-25 00:07:36,603 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-10-25 00:07:36,603 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,603 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,603 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,603 INFO L425 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,603 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-10-25 00:07:36,603 INFO L425 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,604 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-10-25 00:07:36,604 INFO L425 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,604 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-10-25 00:07:36,604 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-10-25 00:07:36,604 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-10-25 00:07:36,604 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,604 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,604 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-10-25 00:07:36,604 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-10-25 00:07:36,604 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-10-25 00:07:36,604 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-10-25 00:07:36,604 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-10-25 00:07:36,604 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-10-25 00:07:36,605 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-10-25 00:07:36,605 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-10-25 00:07:36,605 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-10-25 00:07:36,605 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-10-25 00:07:36,605 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-10-25 00:07:36,605 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,605 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,605 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,605 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,605 INFO L425 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,605 INFO L425 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,605 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-10-25 00:07:36,605 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-10-25 00:07:36,605 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-10-25 00:07:36,606 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-10-25 00:07:36,606 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-10-25 00:07:36,606 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-10-25 00:07:36,606 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-10-25 00:07:36,606 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-10-25 00:07:36,606 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-10-25 00:07:36,606 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-10-25 00:07:36,606 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-10-25 00:07:36,606 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,606 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,606 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,606 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,607 INFO L425 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,607 INFO L425 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,607 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-10-25 00:07:36,607 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-10-25 00:07:36,607 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-10-25 00:07:36,607 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-10-25 00:07:36,607 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-10-25 00:07:36,607 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-10-25 00:07:36,607 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-10-25 00:07:36,607 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-10-25 00:07:36,607 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-10-25 00:07:36,607 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-10-25 00:07:36,608 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-10-25 00:07:36,608 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-10-25 00:07:36,608 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-10-25 00:07:36,608 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-10-25 00:07:36,608 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,608 INFO L425 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,608 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,609 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse0 (not (= 1 ~a21~0))) (.cse2 (not (= 1 |old(~a19~0)|))) (.cse3 (not (= 8 |old(~a17~0)|))) (.cse17 (= |calculate_output_#in~input| 0))) (let ((.cse5 (not (= 1 |old(~a11~0)|))) (.cse9 (= 9 |old(~a17~0)|)) (.cse1 (not (= 1 |old(~a25~0)|))) (.cse10 (= 1 ~a25~0)) (.cse13 (or .cse0 .cse2 (= 0 |old(~a28~0)|) (not (= 0 |old(~a11~0)|)) .cse3 .cse17)) (.cse16 (= ~a19~0 1)) (.cse11 (= |old(~a11~0)| ~a11~0)) (.cse8 (= |old(~a17~0)| ~a17~0)) (.cse4 (= 9 |old(~a28~0)|)) (.cse12 (not (= 7 |old(~a17~0)|))) (.cse7 (= |old(~a28~0)| ~a28~0)) (.cse14 (= ~a11~0 0)) (.cse15 (= ~a17~0 8)) (.cse6 (or (not (= |old(~a11~0)| 0)) (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= ~a21~0 1)) (not (= ~y~0 25)) (= |old(~a28~0)| 0) (not (= 3 ~c~0)) .cse17 (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= ~x~0 24)) .cse3 (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))))) (and (or .cse0 .cse1 .cse2 .cse3 (= 1 ~a19~0) (not .cse4) .cse5) (or (= ~a25~0 0) .cse6 (or .cse2 (not (= 0 |old(~a25~0)|)))) (or .cse0 (and .cse7 (= 1 ~a11~0) .cse8) .cse5 .cse9) (or .cse0 .cse1 .cse10 .cse5 .cse9) (or .cse1 .cse6 .cse10) (or .cse0 (and .cse11 .cse7 .cse8 .cse10) .cse1 .cse12) (or .cse1 .cse13 (and .cse7 .cse10 (and .cse14 .cse15 .cse16)) (not (= |old(~a28~0)| 7))) (or .cse13 .cse6 .cse16) (or .cse0 (and .cse11 .cse7 .cse8) .cse4 .cse12) (or (and .cse7 (and .cse14 .cse15)) .cse6)))) [2018-10-25 00:07:36,609 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,609 INFO L425 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,609 INFO L425 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,609 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-10-25 00:07:36,609 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-10-25 00:07:36,609 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-10-25 00:07:36,609 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-10-25 00:07:36,609 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-10-25 00:07:36,609 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-10-25 00:07:36,610 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-10-25 00:07:36,610 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-10-25 00:07:36,610 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-10-25 00:07:36,610 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-10-25 00:07:36,610 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-10-25 00:07:36,610 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-10-25 00:07:36,610 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-10-25 00:07:36,610 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,610 INFO L425 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,610 INFO L425 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,610 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,610 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,610 INFO L425 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,610 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-10-25 00:07:36,611 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-10-25 00:07:36,611 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-10-25 00:07:36,611 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-10-25 00:07:36,611 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-10-25 00:07:36,611 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-10-25 00:07:36,611 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-10-25 00:07:36,611 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-10-25 00:07:36,611 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-10-25 00:07:36,611 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-10-25 00:07:36,612 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-10-25 00:07:36,612 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-10-25 00:07:36,612 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-10-25 00:07:36,612 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-10-25 00:07:36,612 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-10-25 00:07:36,612 INFO L425 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-10-25 00:07:36,612 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,612 INFO L425 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,612 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,612 INFO L425 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,612 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:36,612 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-10-25 00:07:36,612 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-10-25 00:07:36,613 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-10-25 00:07:36,613 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-10-25 00:07:36,613 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-10-25 00:07:36,613 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-10-25 00:07:36,613 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-10-25 00:07:36,613 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-10-25 00:07:36,613 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-10-25 00:07:36,613 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-10-25 00:07:36,613 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-10-25 00:07:36,613 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-10-25 00:07:36,614 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-10-25 00:07:36,614 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-10-25 00:07:36,614 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-10-25 00:07:36,614 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-10-25 00:07:36,614 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-10-25 00:07:36,614 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-10-25 00:07:36,614 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-10-25 00:07:36,614 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:07:36,614 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~z~0 26) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a~0 1) (= ~a19~0 1) (= ~a28~0 7)) [2018-10-25 00:07:36,614 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-25 00:07:36,615 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:07:36,615 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= |old(~a11~0)| 0)) (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= ~a21~0 1)) (not (= ~y~0 25)) (not (= 3 ~c~0)) (and (= ~a11~0 0) (= ~a25~0 0) (= ~a19~0 1) (= |old(~a28~0)| ~a28~0) (= ~a17~0 8)) (not (= |old(~a25~0)| 0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= 8 |old(~a17~0)|)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-10-25 00:07:36,615 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-10-25 00:07:36,615 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse1 (= 1 ~a11~0)) (.cse2 (= 7 ~a17~0)) (.cse0 (= ~a11~0 0)) (.cse5 (= ~a19~0 1)) (.cse3 (= 1 ~a25~0)) (.cse4 (= |old(~a17~0)| ~a17~0))) (or (not (= ~a21~0 1)) (not (= ~y~0 25)) (and .cse0 (not (= main_~input~0 0)) (not (= main_~output~0 0)) (not (= ~a28~0 0)) (= ~a17~0 8)) (and .cse1 .cse2 .cse3) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (and .cse1 .cse4) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (and (and (= (+ main_~output~0 1) 0) .cse0 .cse5) .cse4 (= ~a25~0 0) (= ~a28~0 7)) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (and .cse1 .cse2 (not (= ~a28~0 9))) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (and (= |old(~a28~0)| ~a28~0) (and (and .cse0 .cse5) .cse3) .cse4) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0)))) [2018-10-25 00:07:36,615 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-10-25 00:07:36,615 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-10-25 00:07:36,616 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse3 (= 1 ~a11~0)) (.cse4 (= 7 ~a17~0)) (.cse5 (= 1 ~a25~0)) (.cse0 (= ~a11~0 0)) (.cse1 (not (= main_~input~0 0))) (.cse2 (= ~a17~0 8))) (or (not (= ~a21~0 1)) (not (= ~y~0 25)) (and .cse0 .cse1 (not (= main_~output~0 0)) (not (= ~a28~0 0)) .cse2) (and .cse3 .cse4 .cse5) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (and .cse3 (= |old(~a17~0)| ~a17~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (and .cse3 .cse4 (not (= ~a28~0 9))) (and (= |old(~a28~0)| ~a28~0) .cse5 (and .cse0 .cse1 .cse2 (= ~a19~0 1))) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0)))) [2018-10-25 00:07:36,616 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-10-25 00:07:36,616 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-10-25 00:07:36,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 12:07:36 BoogieIcfgContainer [2018-10-25 00:07:36,631 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-25 00:07:36,632 INFO L168 Benchmark]: Toolchain (without parser) took 87044.18 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 3.2 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-10-25 00:07:36,633 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-10-25 00:07:36,633 INFO L168 Benchmark]: CACSL2BoogieTranslator took 703.78 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-25 00:07:36,634 INFO L168 Benchmark]: Boogie Procedure Inliner took 213.29 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -832.1 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2018-10-25 00:07:36,635 INFO L168 Benchmark]: Boogie Preprocessor took 80.39 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-10-25 00:07:36,636 INFO L168 Benchmark]: RCFGBuilder took 3312.94 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: 104.5 MB). Peak memory consumption was 104.5 MB. Max. memory is 7.1 GB. [2018-10-25 00:07:36,637 INFO L168 Benchmark]: TraceAbstraction took 82719.77 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-10-25 00:07:36,642 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 703.78 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 213.29 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -832.1 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 80.39 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 3312.94 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: 104.5 MB). Peak memory consumption was 104.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 82719.77 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.2 GB in the end (delta: -1.1 GB). 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: 514]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(a21 == 1) || !(y == 25)) || ((((a11 == 0 && !(input == 0)) && !(output == 0)) && !(a28 == 0)) && a17 == 8)) || ((1 == a11 && 7 == a17) && 1 == a25)) || !(1 == \old(a19))) || !(x == 24)) || !(e == 5)) || !(d == 4)) || !(21 == u)) || (1 == a11 && \old(a17) == a17)) || !(22 == v)) || !(\old(a11) == 0)) || (((((output + 1 == 0 && a11 == 0) && a19 == 1) && \old(a17) == a17) && a25 == 0) && a28 == 7)) || !(z == 26)) || !(0 == \old(a25))) || ((1 == a11 && 7 == a17) && !(a28 == 9))) || !(3 == c)) || !(23 == w)) || !(\old(a28) == 7)) || ((\old(a28) == a28 && (a11 == 0 && a19 == 1) && 1 == a25) && \old(a17) == a17)) || !(a == 1)) || !(\old(a17) == 8)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 82.6s OverallTime, 9 OverallIterations, 5 TraceHistogramMax, 50.0s AutomataDifference, 0.0s DeadEndRemovalTime, 10.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 1677 SDtfs, 7405 SDslu, 1631 SDs, 0 SdLazy, 11181 SolverSat, 2051 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.1s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 1172 GetRequests, 709 SyntacticMatches, 345 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2477 ImplicationChecksByTransitivity, 12.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2984occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.7s AbstIntTime, 4 AbstIntIterations, 3 AbstIntStrong, 0.9975704899803568 AbsIntWeakeningRatio, 0.1693548387096774 AbsIntAvgWeakeningVarsNumRemoved, 0.20806451612903226 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 49 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 109 PreInvPairs, 194 NumberOfFragments, 920 HoareAnnotationTreeSize, 109 FomulaSimplifications, 13805 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 7 FomulaSimplificationsInter, 13227 FormulaSimplificationTreeSizeReductionInter, 10.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 1824 NumberOfCodeBlocks, 1824 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 2030 ConstructedInterpolants, 0 QuantifiedInterpolants, 1150112 SizeOfPredicates, 1 NumberOfNonLiveVariables, 525 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 833/943 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...