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_label18_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 00:05:30,705 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 00:05:30,707 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 00:05:30,725 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 00:05:30,725 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 00:05:30,727 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 00:05:30,728 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 00:05:30,731 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 00:05:30,739 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 00:05:30,740 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 00:05:30,741 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 00:05:30,741 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 00:05:30,742 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 00:05:30,746 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 00:05:30,747 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 00:05:30,750 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 00:05:30,751 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 00:05:30,755 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 00:05:30,757 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 00:05:30,761 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 00:05:30,762 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 00:05:30,766 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 00:05:30,771 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 00:05:30,771 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 00:05:30,771 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 00:05:30,772 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 00:05:30,774 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 00:05:30,775 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 00:05:30,775 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 00:05:30,778 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 00:05:30,778 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 00:05:30,782 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 00:05:30,782 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 00:05:30,782 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 00:05:30,783 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 00:05:30,784 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 00:05:30,784 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:05:30,811 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 00:05:30,812 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 00:05:30,813 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 00:05:30,813 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 00:05:30,814 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 00:05:30,814 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 00:05:30,814 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 00:05:30,814 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 00:05:30,814 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 00:05:30,815 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 00:05:30,817 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 00:05:30,817 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 00:05:30,818 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 00:05:30,818 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 00:05:30,819 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 00:05:30,819 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 00:05:30,819 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 00:05:30,819 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 00:05:30,820 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 00:05:30,820 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 00:05:30,820 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 00:05:30,820 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 00:05:30,820 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 00:05:30,821 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 00:05:30,822 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 00:05:30,823 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 00:05:30,823 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:05:30,823 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 00:05:30,823 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 00:05:30,824 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 00:05:30,824 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 00:05:30,824 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 00:05:30,824 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 00:05:30,824 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 00:05:30,825 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 00:05:30,825 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 00:05:30,882 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 00:05:30,897 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 00:05:30,902 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 00:05:30,904 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 00:05:30,904 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 00:05:30,905 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label18_true-unreach-call_false-termination.c [2018-10-25 00:05:30,971 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0d54d85f4/1f3b97fbbe9e44cabceb5ad0b6649e57/FLAG599bc6c55 [2018-10-25 00:05:31,554 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 00:05:31,555 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label18_true-unreach-call_false-termination.c [2018-10-25 00:05:31,573 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0d54d85f4/1f3b97fbbe9e44cabceb5ad0b6649e57/FLAG599bc6c55 [2018-10-25 00:05:31,590 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0d54d85f4/1f3b97fbbe9e44cabceb5ad0b6649e57 [2018-10-25 00:05:31,601 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 00:05:31,603 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 00:05:31,604 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 00:05:31,604 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 00:05:31,608 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 00:05:31,609 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:05:31" (1/1) ... [2018-10-25 00:05:31,613 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40f3d0e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:05:31, skipping insertion in model container [2018-10-25 00:05:31,613 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:05:31" (1/1) ... [2018-10-25 00:05:31,624 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 00:05:31,682 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 00:05:32,146 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:05:32,156 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 00:05:32,292 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:05:32,315 INFO L193 MainTranslator]: Completed translation [2018-10-25 00:05:32,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:05:32 WrapperNode [2018-10-25 00:05:32,316 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 00:05:32,317 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 00:05:32,317 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 00:05:32,317 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 00:05:32,328 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:05:32" (1/1) ... [2018-10-25 00:05:32,363 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:05:32" (1/1) ... [2018-10-25 00:05:32,543 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 00:05:32,544 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 00:05:32,544 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 00:05:32,544 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 00:05:32,559 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:05:32" (1/1) ... [2018-10-25 00:05:32,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:05:32" (1/1) ... [2018-10-25 00:05:32,571 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:05:32" (1/1) ... [2018-10-25 00:05:32,571 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:05:32" (1/1) ... [2018-10-25 00:05:32,608 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:05:32" (1/1) ... [2018-10-25 00:05:32,627 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:05:32" (1/1) ... [2018-10-25 00:05:32,636 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:05:32" (1/1) ... [2018-10-25 00:05:32,652 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 00:05:32,653 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 00:05:32,653 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 00:05:32,653 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 00:05:32,655 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:05:32" (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:05:32,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 00:05:32,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 00:05:32,722 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 00:05:32,722 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 00:05:32,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 00:05:32,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 00:05:32,723 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 00:05:32,723 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 00:05:35,831 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 00:05:35,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:05:35 BoogieIcfgContainer [2018-10-25 00:05:35,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 00:05:35,835 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 00:05:35,836 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 00:05:35,843 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 00:05:35,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 12:05:31" (1/3) ... [2018-10-25 00:05:35,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a764658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:05:35, skipping insertion in model container [2018-10-25 00:05:35,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:05:32" (2/3) ... [2018-10-25 00:05:35,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a764658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:05:35, skipping insertion in model container [2018-10-25 00:05:35,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:05:35" (3/3) ... [2018-10-25 00:05:35,851 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label18_true-unreach-call_false-termination.c [2018-10-25 00:05:35,862 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 00:05:35,876 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 00:05:35,894 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 00:05:35,937 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 00:05:35,938 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 00:05:35,938 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 00:05:35,938 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 00:05:35,938 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 00:05:35,938 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 00:05:35,939 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 00:05:35,939 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 00:05:35,966 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-10-25 00:05:35,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-25 00:05:35,982 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:05:35,983 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:05:35,986 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:05:35,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:35,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1505826544, now seen corresponding path program 1 times [2018-10-25 00:05:35,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:05:36,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:36,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:36,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:36,043 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:05:36,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:36,654 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:05:36,788 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:05:36,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:05:36,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:05:36,791 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:05:36,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:05:36,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:05:36,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:05:36,819 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-10-25 00:05:38,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:05:38,154 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-10-25 00:05:38,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:05:38,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2018-10-25 00:05:38,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:05:38,178 INFO L225 Difference]: With dead ends: 621 [2018-10-25 00:05:38,179 INFO L226 Difference]: Without dead ends: 382 [2018-10-25 00:05:38,186 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:05:38,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-10-25 00:05:38,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-10-25 00:05:38,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-10-25 00:05:38,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-10-25 00:05:38,260 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 134 [2018-10-25 00:05:38,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:05:38,261 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-10-25 00:05:38,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:05:38,261 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-10-25 00:05:38,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-25 00:05:38,268 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:05:38,268 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:05:38,269 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:05:38,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:38,269 INFO L82 PathProgramCache]: Analyzing trace with hash -979589059, now seen corresponding path program 1 times [2018-10-25 00:05:38,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:05:38,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:38,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:38,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:38,271 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:05:38,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:38,728 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:05:38,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:05:38,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:05:38,730 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:05:38,732 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:05:38,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:05:38,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:05:38,733 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-10-25 00:05:40,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:05:40,187 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-10-25 00:05:40,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:05:40,188 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2018-10-25 00:05:40,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:05:40,192 INFO L225 Difference]: With dead ends: 903 [2018-10-25 00:05:40,192 INFO L226 Difference]: Without dead ends: 381 [2018-10-25 00:05:40,199 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:05:40,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-10-25 00:05:40,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-10-25 00:05:40,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-25 00:05:40,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-10-25 00:05:40,223 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 143 [2018-10-25 00:05:40,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:05:40,224 INFO L481 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-10-25 00:05:40,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:05:40,224 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-10-25 00:05:40,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-25 00:05:40,227 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:05:40,228 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:40,228 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:05:40,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:40,229 INFO L82 PathProgramCache]: Analyzing trace with hash 730905649, now seen corresponding path program 1 times [2018-10-25 00:05:40,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:05:40,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:40,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:40,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:40,230 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:05:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:41,018 WARN L179 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2018-10-25 00:05:41,172 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:05:41,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:05:41,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:05:41,173 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:05:41,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:05:41,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:05:41,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:05:41,175 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-10-25 00:05:42,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:05:42,911 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-10-25 00:05:42,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:05:42,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 149 [2018-10-25 00:05:42,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:05:42,920 INFO L225 Difference]: With dead ends: 901 [2018-10-25 00:05:42,921 INFO L226 Difference]: Without dead ends: 380 [2018-10-25 00:05:42,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:05:42,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-10-25 00:05:42,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-10-25 00:05:42,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-10-25 00:05:42,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-10-25 00:05:42,958 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 149 [2018-10-25 00:05:42,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:05:42,958 INFO L481 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-10-25 00:05:42,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:05:42,958 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-10-25 00:05:42,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-25 00:05:42,963 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:05:42,963 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:42,963 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:05:42,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:42,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1585246906, now seen corresponding path program 1 times [2018-10-25 00:05:42,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:05:42,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:42,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:42,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:42,965 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:05:42,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:43,199 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:05:43,331 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:05:43,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:05:43,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:05:43,332 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:05:43,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:05:43,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:05:43,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:05:43,333 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-10-25 00:05:46,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:05:46,350 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-10-25 00:05:46,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:05:46,351 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 157 [2018-10-25 00:05:46,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:05:46,356 INFO L225 Difference]: With dead ends: 1193 [2018-10-25 00:05:46,356 INFO L226 Difference]: Without dead ends: 819 [2018-10-25 00:05:46,359 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:05:46,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-10-25 00:05:46,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-10-25 00:05:46,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-10-25 00:05:46,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-10-25 00:05:46,392 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 157 [2018-10-25 00:05:46,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:05:46,393 INFO L481 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-10-25 00:05:46,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:05:46,393 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-10-25 00:05:46,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-25 00:05:46,397 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:05:46,397 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:46,397 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:05:46,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:46,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1163301558, now seen corresponding path program 1 times [2018-10-25 00:05:46,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:05:46,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:46,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:46,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:46,399 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:05:46,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:46,811 WARN L179 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-25 00:05:47,056 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-25 00:05:47,121 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:05:47,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:05:47,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:05:47,122 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:05:47,122 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:05:47,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:05:47,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:05:47,123 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-10-25 00:05:48,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:05:48,243 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-10-25 00:05:48,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:05:48,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2018-10-25 00:05:48,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:05:48,250 INFO L225 Difference]: With dead ends: 1753 [2018-10-25 00:05:48,251 INFO L226 Difference]: Without dead ends: 804 [2018-10-25 00:05:48,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:05:48,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-10-25 00:05:48,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-10-25 00:05:48,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-10-25 00:05:48,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-10-25 00:05:48,279 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 159 [2018-10-25 00:05:48,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:05:48,280 INFO L481 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-10-25 00:05:48,280 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:05:48,280 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-10-25 00:05:48,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-25 00:05:48,284 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:05:48,284 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:48,284 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:05:48,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:48,285 INFO L82 PathProgramCache]: Analyzing trace with hash 2009891506, now seen corresponding path program 1 times [2018-10-25 00:05:48,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:05:48,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:48,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:48,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:48,286 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:05:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:48,640 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-25 00:05:48,892 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-25 00:05:48,973 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:05:48,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:05:48,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:05:48,974 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:05:48,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:05:48,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:05:48,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:05:48,975 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-10-25 00:05:50,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:05:50,580 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-10-25 00:05:50,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:05:50,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2018-10-25 00:05:50,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:05:50,590 INFO L225 Difference]: With dead ends: 1747 [2018-10-25 00:05:50,590 INFO L226 Difference]: Without dead ends: 801 [2018-10-25 00:05:50,595 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:05:50,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-10-25 00:05:50,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-10-25 00:05:50,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-10-25 00:05:50,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-10-25 00:05:50,632 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 161 [2018-10-25 00:05:50,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:05:50,633 INFO L481 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-10-25 00:05:50,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:05:50,633 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-10-25 00:05:50,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-25 00:05:50,644 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:05:50,644 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:50,645 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:05:50,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:50,645 INFO L82 PathProgramCache]: Analyzing trace with hash 222122666, now seen corresponding path program 1 times [2018-10-25 00:05:50,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:05:50,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:50,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:50,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:50,649 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:05:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:50,954 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:05:51,162 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:05:51,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:05:51,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:05:51,162 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:05:51,163 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:05:51,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:05:51,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:05:51,164 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-10-25 00:05:52,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:05:52,233 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-10-25 00:05:52,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:05:52,234 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 165 [2018-10-25 00:05:52,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:05:52,243 INFO L225 Difference]: With dead ends: 2381 [2018-10-25 00:05:52,244 INFO L226 Difference]: Without dead ends: 1586 [2018-10-25 00:05:52,248 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:05:52,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-10-25 00:05:52,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-10-25 00:05:52,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-10-25 00:05:52,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-10-25 00:05:52,295 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 165 [2018-10-25 00:05:52,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:05:52,296 INFO L481 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-10-25 00:05:52,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:05:52,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-10-25 00:05:52,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-10-25 00:05:52,301 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:05:52,302 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:52,302 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:05:52,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:52,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1723746433, now seen corresponding path program 1 times [2018-10-25 00:05:52,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:05:52,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:52,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:52,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:52,304 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:05:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:52,873 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-10-25 00:05:52,946 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:05:52,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:05:52,947 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:05:52,948 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 172 with the following transitions: [2018-10-25 00:05:52,950 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [743], [745], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:05:53,000 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:05:53,000 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:05:54,645 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:05:54,646 INFO L272 AbstractInterpreter]: Visited 139 different actions 412 times. Merged at 7 different actions 19 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-10-25 00:05:54,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:54,692 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:05:54,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:05:54,692 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:05:54,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:54,704 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:05:54,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:54,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:05:55,025 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-25 00:05:55,026 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:05:55,210 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-25 00:05:55,234 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:05:55,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [10] total 11 [2018-10-25 00:05:55,234 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:05:55,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:05:55,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:05:55,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-25 00:05:55,235 INFO L87 Difference]: Start difference. First operand 1558 states and 2225 transitions. Second operand 3 states. [2018-10-25 00:05:56,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:05:56,751 INFO L93 Difference]: Finished difference Result 3595 states and 5164 transitions. [2018-10-25 00:05:56,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:05:56,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2018-10-25 00:05:56,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:05:56,766 INFO L225 Difference]: With dead ends: 3595 [2018-10-25 00:05:56,766 INFO L226 Difference]: Without dead ends: 2043 [2018-10-25 00:05:56,774 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 341 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-25 00:05:56,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2043 states. [2018-10-25 00:05:56,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2043 to 2040. [2018-10-25 00:05:56,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2040 states. [2018-10-25 00:05:56,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2040 states to 2040 states and 2805 transitions. [2018-10-25 00:05:56,838 INFO L78 Accepts]: Start accepts. Automaton has 2040 states and 2805 transitions. Word has length 171 [2018-10-25 00:05:56,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:05:56,839 INFO L481 AbstractCegarLoop]: Abstraction has 2040 states and 2805 transitions. [2018-10-25 00:05:56,839 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:05:56,839 INFO L276 IsEmpty]: Start isEmpty. Operand 2040 states and 2805 transitions. [2018-10-25 00:05:56,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-10-25 00:05:56,852 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:05:56,852 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, 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] [2018-10-25 00:05:56,853 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:05:56,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:56,853 INFO L82 PathProgramCache]: Analyzing trace with hash -302186400, now seen corresponding path program 1 times [2018-10-25 00:05:56,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:05:56,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:56,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:56,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:56,855 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:05:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:57,228 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 127 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:05:57,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:05:57,228 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:05:57,228 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 250 with the following transitions: [2018-10-25 00:05:57,229 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [336], [341], [343], [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], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [743], [745], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:05:57,237 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:05:57,237 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:05:58,085 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:05:58,086 INFO L272 AbstractInterpreter]: Visited 142 different actions 419 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:05:58,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:58,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:05:58,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:05:58,131 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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:05:58,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:58,147 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:05:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:58,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:05:58,399 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 142 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-25 00:05:58,400 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:05:58,715 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 142 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-25 00:05:58,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:05:58,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 16 [2018-10-25 00:05:58,736 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:05:58,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-25 00:05:58,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-25 00:05:58,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-10-25 00:05:58,738 INFO L87 Difference]: Start difference. First operand 2040 states and 2805 transitions. Second operand 14 states. [2018-10-25 00:06:03,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:06:03,236 INFO L93 Difference]: Finished difference Result 6780 states and 9785 transitions. [2018-10-25 00:06:03,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-25 00:06:03,236 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 249 [2018-10-25 00:06:03,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:06:03,237 INFO L225 Difference]: With dead ends: 6780 [2018-10-25 00:06:03,237 INFO L226 Difference]: Without dead ends: 0 [2018-10-25 00:06:03,265 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 510 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2018-10-25 00:06:03,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-25 00:06:03,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-25 00:06:03,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-25 00:06:03,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-25 00:06:03,266 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 249 [2018-10-25 00:06:03,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:06:03,267 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-25 00:06:03,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-25 00:06:03,267 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-25 00:06:03,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-25 00:06:03,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-25 00:06:03,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:03,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:03,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:03,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:03,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:03,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:03,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:03,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:03,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:03,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:03,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:03,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:03,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:03,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:03,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:03,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:03,638 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-25 00:06:03,879 WARN L179 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2018-10-25 00:06:04,799 WARN L179 SmtUtils]: Spent 911.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 69 [2018-10-25 00:06:05,111 WARN L179 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2018-10-25 00:06:05,863 WARN L179 SmtUtils]: Spent 750.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2018-10-25 00:06:05,868 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:06:05,868 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a17~0)| ~a17~0) (= |old(~a25~0)| ~a25~0) (= ~a28~0 |old(~a28~0)|)) [2018-10-25 00:06:05,868 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:06:05,868 INFO L425 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,868 INFO L425 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,869 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,869 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,869 INFO L425 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,869 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-10-25 00:06:05,869 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-10-25 00:06:05,869 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-10-25 00:06:05,869 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-10-25 00:06:05,869 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-10-25 00:06:05,870 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-10-25 00:06:05,870 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-10-25 00:06:05,870 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-10-25 00:06:05,870 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-10-25 00:06:05,870 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-10-25 00:06:05,870 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-10-25 00:06:05,870 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-10-25 00:06:05,870 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-10-25 00:06:05,871 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,871 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,871 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,871 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,871 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-10-25 00:06:05,871 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,871 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-10-25 00:06:05,871 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-10-25 00:06:05,872 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-10-25 00:06:05,872 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-10-25 00:06:05,872 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-10-25 00:06:05,872 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-10-25 00:06:05,872 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-10-25 00:06:05,872 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-10-25 00:06:05,872 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-10-25 00:06:05,872 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-10-25 00:06:05,872 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-10-25 00:06:05,873 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-10-25 00:06:05,873 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-10-25 00:06:05,873 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-10-25 00:06:05,873 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-10-25 00:06:05,873 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,873 INFO L425 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,873 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,873 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,874 INFO L425 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,874 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-10-25 00:06:05,874 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-10-25 00:06:05,874 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-10-25 00:06:05,874 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-10-25 00:06:05,874 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-10-25 00:06:05,874 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-10-25 00:06:05,874 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-10-25 00:06:05,875 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-10-25 00:06:05,875 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-10-25 00:06:05,875 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-10-25 00:06:05,875 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-10-25 00:06:05,875 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,875 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,875 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,875 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,875 INFO L425 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,876 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-10-25 00:06:05,876 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-10-25 00:06:05,876 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-10-25 00:06:05,876 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-10-25 00:06:05,876 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-10-25 00:06:05,876 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-10-25 00:06:05,876 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-10-25 00:06:05,876 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-10-25 00:06:05,877 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-10-25 00:06:05,877 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-10-25 00:06:05,877 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-10-25 00:06:05,877 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-10-25 00:06:05,877 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-10-25 00:06:05,877 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,877 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,877 INFO L425 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,877 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,878 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,878 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-10-25 00:06:05,878 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-10-25 00:06:05,878 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-10-25 00:06:05,878 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-10-25 00:06:05,878 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-10-25 00:06:05,878 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-10-25 00:06:05,878 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-10-25 00:06:05,879 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-10-25 00:06:05,879 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-10-25 00:06:05,879 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-10-25 00:06:05,879 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-10-25 00:06:05,879 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-10-25 00:06:05,879 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-10-25 00:06:05,879 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-10-25 00:06:05,879 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-10-25 00:06:05,879 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-10-25 00:06:05,880 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,880 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,880 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,880 INFO L425 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,880 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-10-25 00:06:05,880 INFO L425 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,880 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-10-25 00:06:05,880 INFO L425 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,880 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-10-25 00:06:05,881 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-10-25 00:06:05,881 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-10-25 00:06:05,881 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,881 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,881 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-10-25 00:06:05,881 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-10-25 00:06:05,881 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-10-25 00:06:05,881 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-10-25 00:06:05,882 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-10-25 00:06:05,882 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-10-25 00:06:05,882 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-10-25 00:06:05,882 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-10-25 00:06:05,882 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-10-25 00:06:05,882 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-10-25 00:06:05,882 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-10-25 00:06:05,882 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,882 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,883 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,883 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,883 INFO L425 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,883 INFO L425 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,883 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-10-25 00:06:05,883 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-10-25 00:06:05,883 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-10-25 00:06:05,883 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-10-25 00:06:05,883 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-10-25 00:06:05,884 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-10-25 00:06:05,884 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-10-25 00:06:05,884 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-10-25 00:06:05,884 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-10-25 00:06:05,884 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-10-25 00:06:05,884 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-10-25 00:06:05,884 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,884 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,884 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,884 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,885 INFO L425 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,885 INFO L425 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,885 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-10-25 00:06:05,885 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-10-25 00:06:05,885 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-10-25 00:06:05,885 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-10-25 00:06:05,885 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-10-25 00:06:05,885 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-10-25 00:06:05,885 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-10-25 00:06:05,885 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-10-25 00:06:05,886 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-10-25 00:06:05,886 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-10-25 00:06:05,886 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-10-25 00:06:05,886 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-10-25 00:06:05,886 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-10-25 00:06:05,886 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-10-25 00:06:05,886 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,886 INFO L425 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,886 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,887 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse16 (= 1 |old(~a11~0)|)) (.cse19 (not (= ~a11~0 1))) (.cse20 (= |old(~a17~0)| ~a17~0)) (.cse21 (= |old(~a25~0)| ~a25~0)) (.cse22 (= ~a28~0 |old(~a28~0)|)) (.cse18 (= 1 |old(~a19~0)|)) (.cse14 (= 1 |old(~a25~0)|)) (.cse12 (= 1 ~a11~0)) (.cse13 (= 1 ~a19~0))) (let ((.cse0 (and .cse12 .cse13)) (.cse2 (not .cse14)) (.cse3 (not .cse18)) (.cse10 (and .cse20 .cse21 .cse22)) (.cse9 (not (= |old(~a17~0)| 8))) (.cse8 (= 9 |old(~a28~0)|)) (.cse17 (and .cse20 .cse21 .cse22 .cse19)) (.cse11 (not (= 7 |old(~a28~0)|))) (.cse4 (not (= 8 |old(~a17~0)|))) (.cse5 (not .cse16)) (.cse6 (< 10 |old(~a28~0)|)) (.cse1 (not (= 1 ~a21~0))) (.cse7 (= 8 |old(~a28~0)|)) (.cse15 (< 7 |old(~a17~0)|))) (and (or .cse0 .cse1 (not (= 10 |old(~a28~0)|)) .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse1 .cse7 .cse8 .cse9 .cse10) (or .cse1 .cse11 .cse2 .cse3 .cse5 .cse0 (not (= 7 |old(~a17~0)|))) (or .cse1 .cse2 .cse3 .cse4 (and .cse12 (= 1 ~a25~0) (= 9 ~a28~0) (= 8 ~a17~0) .cse13) (not .cse8) .cse5) (or .cse6 .cse1 .cse7 .cse9 .cse10 .cse14) (or .cse6 .cse1 .cse10 .cse7 .cse15) (or .cse1 .cse16 .cse9 .cse17) (or .cse6 (= 10 |old(~a17~0)|) .cse1 .cse16 .cse7 .cse8 .cse17 .cse14) (or .cse18 .cse1 .cse11 .cse4 (and .cse12 (not .cse13)) .cse5 .cse14) (or .cse6 .cse1 .cse16 .cse19 .cse7 .cse15)))) [2018-10-25 00:06:05,887 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,887 INFO L425 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,887 INFO L425 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,887 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-10-25 00:06:05,887 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-10-25 00:06:05,888 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-10-25 00:06:05,888 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-10-25 00:06:05,888 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-10-25 00:06:05,888 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-10-25 00:06:05,888 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-10-25 00:06:05,888 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-10-25 00:06:05,888 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-10-25 00:06:05,888 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-10-25 00:06:05,888 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-10-25 00:06:05,889 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-10-25 00:06:05,889 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-10-25 00:06:05,889 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,889 INFO L425 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,889 INFO L425 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,889 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,889 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,889 INFO L425 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,889 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-10-25 00:06:05,890 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-10-25 00:06:05,890 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-10-25 00:06:05,890 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-10-25 00:06:05,890 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-10-25 00:06:05,890 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-10-25 00:06:05,890 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-10-25 00:06:05,890 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-10-25 00:06:05,890 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-10-25 00:06:05,890 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-10-25 00:06:05,890 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-10-25 00:06:05,891 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-10-25 00:06:05,891 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-10-25 00:06:05,891 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-10-25 00:06:05,891 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 553) no Hoare annotation was computed. [2018-10-25 00:06:05,891 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-10-25 00:06:05,891 INFO L425 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-10-25 00:06:05,891 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,891 INFO L425 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,891 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,892 INFO L425 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,892 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:05,892 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-10-25 00:06:05,892 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-10-25 00:06:05,892 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-10-25 00:06:05,892 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-10-25 00:06:05,892 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-10-25 00:06:05,892 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-10-25 00:06:05,892 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-10-25 00:06:05,892 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-10-25 00:06:05,893 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-10-25 00:06:05,893 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-10-25 00:06:05,893 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-10-25 00:06:05,893 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-10-25 00:06:05,893 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-10-25 00:06:05,893 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-10-25 00:06:05,893 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-10-25 00:06:05,893 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-10-25 00:06:05,893 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-10-25 00:06:05,893 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-10-25 00:06:05,894 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-10-25 00:06:05,894 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:06:05,894 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~a17~0 10)) (not (= ~a25~0 1)) (<= ~a28~0 10) (not (= ~a28~0 8)) (= ~a21~0 1) (not (= ~a11~0 1)) (not (= ~a28~0 9))) [2018-10-25 00:06:05,894 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-25 00:06:05,894 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:06:05,894 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (< 10 |old(~a28~0)|) (= 10 |old(~a17~0)|) (not (= 1 ~a21~0)) (= 1 |old(~a11~0)|) (= 8 |old(~a28~0)|) (= 9 |old(~a28~0)|) (and (= |old(~a17~0)| ~a17~0) (= |old(~a25~0)| ~a25~0) (= ~a28~0 |old(~a28~0)|) (not (= ~a11~0 1))) (= 1 |old(~a25~0)|)) [2018-10-25 00:06:05,894 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-10-25 00:06:05,895 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse6 (= 7 ~a28~0)) (.cse3 (not (= ~a25~0 1))) (.cse2 (not (= ~a11~0 1))) (.cse1 (= |old(~a17~0)| ~a17~0)) (.cse0 (= |old(~a17~0)| 8)) (.cse4 (<= ~a28~0 10)) (.cse5 (not (= ~a28~0 8))) (.cse7 (= 1 ~a11~0)) (.cse10 (= 1 ~a25~0)) (.cse8 (= 8 ~a17~0)) (.cse9 (= 1 ~a19~0))) (or (not (= 1 ~a21~0)) (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse1 .cse4 .cse5) (and .cse6 .cse3 .cse7 .cse8 (not .cse9)) (= 1 |old(~a25~0)|) (= 10 |old(~a17~0)|) (= 1 |old(~a11~0)|) (and .cse6 .cse7 (= 7 ~a17~0) .cse10 .cse9) (and .cse7 .cse10 (= 9 ~a28~0) .cse8 .cse9) (and .cse3 .cse1 .cse2 (= ~a28~0 |old(~a28~0)|)) (and .cse0 .cse1 .cse4 .cse5 (not (= ~a28~0 9))) (= 9 |old(~a28~0)|) (and .cse0 (<= ~a17~0 7) .cse4 .cse5) (< 10 |old(~a28~0)|) (= 8 |old(~a28~0)|) (and .cse7 .cse10 .cse8 .cse9 (= 10 ~a28~0)))) [2018-10-25 00:06:05,895 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-10-25 00:06:05,895 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-10-25 00:06:05,895 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse6 (= 7 ~a28~0)) (.cse3 (not (= ~a25~0 1))) (.cse2 (not (= ~a11~0 1))) (.cse1 (= |old(~a17~0)| ~a17~0)) (.cse0 (= |old(~a17~0)| 8)) (.cse4 (<= ~a28~0 10)) (.cse5 (not (= ~a28~0 8))) (.cse7 (= 1 ~a11~0)) (.cse10 (= 1 ~a25~0)) (.cse8 (= 8 ~a17~0)) (.cse9 (= 1 ~a19~0))) (or (not (= 1 ~a21~0)) (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse1 .cse4 .cse5) (and .cse6 .cse3 .cse7 .cse8 (not .cse9)) (= 1 |old(~a25~0)|) (= 10 |old(~a17~0)|) (= 1 |old(~a11~0)|) (and .cse6 .cse7 (= 7 ~a17~0) .cse10 .cse9) (and .cse7 .cse10 (= 9 ~a28~0) .cse8 .cse9) (and .cse3 .cse1 .cse2 (= ~a28~0 |old(~a28~0)|)) (and .cse0 .cse1 .cse4 .cse5 (not (= ~a28~0 9))) (= 9 |old(~a28~0)|) (and .cse0 (<= ~a17~0 7) .cse4 .cse5) (< 10 |old(~a28~0)|) (= 8 |old(~a28~0)|) (and .cse7 .cse10 .cse8 .cse9 (= 10 ~a28~0)))) [2018-10-25 00:06:05,895 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-10-25 00:06:05,896 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-10-25 00:06:05,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 12:06:05 BoogieIcfgContainer [2018-10-25 00:06:05,915 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-25 00:06:05,916 INFO L168 Benchmark]: Toolchain (without parser) took 34314.22 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -809.8 MB). Peak memory consumption was 428.5 MB. Max. memory is 7.1 GB. [2018-10-25 00:06:05,917 INFO L168 Benchmark]: CDTParser took 0.22 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:06:05,918 INFO L168 Benchmark]: CACSL2BoogieTranslator took 712.62 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:06:05,918 INFO L168 Benchmark]: Boogie Procedure Inliner took 226.50 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -815.5 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. [2018-10-25 00:06:05,919 INFO L168 Benchmark]: Boogie Preprocessor took 108.63 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:06:05,920 INFO L168 Benchmark]: RCFGBuilder took 3179.98 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: 106.2 MB). Peak memory consumption was 106.2 MB. Max. memory is 7.1 GB. [2018-10-25 00:06:05,921 INFO L168 Benchmark]: TraceAbstraction took 30079.64 ms. Allocated memory was 2.3 GB in the beginning and 2.8 GB in the end (delta: 497.5 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -142.8 MB). Peak memory consumption was 354.7 MB. Max. memory is 7.1 GB. [2018-10-25 00:06:05,926 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.22 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 712.62 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 226.50 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -815.5 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 108.63 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 3179.98 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: 106.2 MB). Peak memory consumption was 106.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30079.64 ms. Allocated memory was 2.3 GB in the beginning and 2.8 GB in the end (delta: 497.5 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -142.8 MB). Peak memory consumption was 354.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 553]: 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: ((((((((((((((!(1 == a21) || ((\old(a17) == 8 && \old(a17) == a17) && !(a11 == 1))) || ((((\old(a17) == 8 && !(a25 == 1)) && \old(a17) == a17) && a28 <= 10) && !(a28 == 8))) || ((((7 == a28 && !(a25 == 1)) && 1 == a11) && 8 == a17) && !(1 == a19))) || 1 == \old(a25)) || 10 == \old(a17)) || 1 == \old(a11)) || ((((7 == a28 && 1 == a11) && 7 == a17) && 1 == a25) && 1 == a19)) || ((((1 == a11 && 1 == a25) && 9 == a28) && 8 == a17) && 1 == a19)) || (((!(a25 == 1) && \old(a17) == a17) && !(a11 == 1)) && a28 == \old(a28))) || ((((\old(a17) == 8 && \old(a17) == a17) && a28 <= 10) && !(a28 == 8)) && !(a28 == 9))) || 9 == \old(a28)) || (((\old(a17) == 8 && a17 <= 7) && a28 <= 10) && !(a28 == 8))) || 10 < \old(a28)) || 8 == \old(a28)) || ((((1 == a11 && 1 == a25) && 8 == a17) && 1 == a19) && 10 == a28) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 29.9s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 17.5s AutomataDifference, 0.0s DeadEndRemovalTime, 2.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 1089 SDtfs, 6654 SDslu, 1111 SDs, 0 SdLazy, 8780 SolverSat, 1841 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 953 GetRequests, 873 SyntacticMatches, 12 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2040occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.6s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 43 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 93 PreInvPairs, 191 NumberOfFragments, 716 HoareAnnotationTreeSize, 93 FomulaSimplifications, 3338 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 2122 FormulaSimplificationTreeSizeReductionInter, 2.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 1908 NumberOfCodeBlocks, 1908 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2315 ConstructedInterpolants, 0 QuantifiedInterpolants, 2079076 SizeOfPredicates, 3 NumberOfNonLiveVariables, 980 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 655/712 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...