java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label06_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 07:07:01,625 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 07:07:01,629 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 07:07:01,647 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 07:07:01,648 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 07:07:01,649 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 07:07:01,650 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 07:07:01,652 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 07:07:01,654 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 07:07:01,655 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 07:07:01,656 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 07:07:01,656 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 07:07:01,657 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 07:07:01,658 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 07:07:01,659 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 07:07:01,660 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 07:07:01,661 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 07:07:01,662 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 07:07:01,664 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 07:07:01,666 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 07:07:01,667 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 07:07:01,668 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 07:07:01,671 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 07:07:01,671 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 07:07:01,671 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 07:07:01,672 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 07:07:01,673 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 07:07:01,674 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 07:07:01,675 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 07:07:01,676 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 07:07:01,676 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 07:07:01,677 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 07:07:01,677 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 07:07:01,677 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 07:07:01,678 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 07:07:01,679 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 07:07:01,679 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 07:07:01,699 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 07:07:01,699 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 07:07:01,700 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 07:07:01,700 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 07:07:01,700 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 07:07:01,701 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 07:07:01,701 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 07:07:01,701 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 07:07:01,701 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 07:07:01,701 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 07:07:01,702 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 07:07:01,702 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 07:07:01,702 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 07:07:01,702 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 07:07:01,704 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 07:07:01,704 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 07:07:01,704 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 07:07:01,704 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 07:07:01,704 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 07:07:01,705 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 07:07:01,705 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 07:07:01,705 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 07:07:01,705 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 07:07:01,705 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 07:07:01,706 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 07:07:01,706 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 07:07:01,706 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 07:07:01,706 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 07:07:01,706 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 07:07:01,707 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 07:07:01,707 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 07:07:01,707 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 07:07:01,707 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 07:07:01,707 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 07:07:01,707 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 07:07:01,708 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 07:07:01,760 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 07:07:01,780 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 07:07:01,784 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 07:07:01,785 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 07:07:01,786 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 07:07:01,787 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label06_true-unreach-call_false-termination.c [2018-11-07 07:07:01,849 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f133d2463/d47aef95727d49d9bd2c420578293df4/FLAG5bb8cf3de [2018-11-07 07:07:02,455 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 07:07:02,456 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label06_true-unreach-call_false-termination.c [2018-11-07 07:07:02,483 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f133d2463/d47aef95727d49d9bd2c420578293df4/FLAG5bb8cf3de [2018-11-07 07:07:02,499 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f133d2463/d47aef95727d49d9bd2c420578293df4 [2018-11-07 07:07:02,510 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 07:07:02,512 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 07:07:02,513 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 07:07:02,513 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 07:07:02,519 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 07:07:02,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:07:02" (1/1) ... [2018-11-07 07:07:02,525 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b1de55c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:02, skipping insertion in model container [2018-11-07 07:07:02,526 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:07:02" (1/1) ... [2018-11-07 07:07:02,537 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 07:07:02,610 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 07:07:03,049 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 07:07:03,059 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 07:07:03,204 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 07:07:03,221 INFO L193 MainTranslator]: Completed translation [2018-11-07 07:07:03,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:03 WrapperNode [2018-11-07 07:07:03,221 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 07:07:03,222 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 07:07:03,223 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 07:07:03,223 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 07:07:03,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:03" (1/1) ... [2018-11-07 07:07:03,252 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:03" (1/1) ... [2018-11-07 07:07:03,341 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 07:07:03,342 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 07:07:03,342 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 07:07:03,342 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 07:07:03,354 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:03" (1/1) ... [2018-11-07 07:07:03,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:03" (1/1) ... [2018-11-07 07:07:03,365 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:03" (1/1) ... [2018-11-07 07:07:03,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:03" (1/1) ... [2018-11-07 07:07:03,406 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:03" (1/1) ... [2018-11-07 07:07:03,426 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:03" (1/1) ... [2018-11-07 07:07:03,432 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:03" (1/1) ... [2018-11-07 07:07:03,438 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 07:07:03,439 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 07:07:03,439 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 07:07:03,439 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 07:07:03,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 07:07:03,525 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 07:07:03,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 07:07:03,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 07:07:03,526 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 07:07:03,526 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 07:07:03,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 07:07:03,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 07:07:03,527 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 07:07:03,527 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 07:07:06,757 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 07:07:06,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:07:06 BoogieIcfgContainer [2018-11-07 07:07:06,758 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 07:07:06,759 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 07:07:06,760 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 07:07:06,764 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 07:07:06,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:07:02" (1/3) ... [2018-11-07 07:07:06,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@612d8a5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:07:06, skipping insertion in model container [2018-11-07 07:07:06,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:03" (2/3) ... [2018-11-07 07:07:06,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@612d8a5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:07:06, skipping insertion in model container [2018-11-07 07:07:06,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:07:06" (3/3) ... [2018-11-07 07:07:06,768 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label06_true-unreach-call_false-termination.c [2018-11-07 07:07:06,779 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 07:07:06,789 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 07:07:06,808 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 07:07:06,849 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 07:07:06,849 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 07:07:06,850 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 07:07:06,850 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 07:07:06,850 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 07:07:06,851 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 07:07:06,851 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 07:07:06,851 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 07:07:06,879 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-07 07:07:06,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-07 07:07:06,896 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:07:06,898 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:07:06,901 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:07:06,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:07:06,908 INFO L82 PathProgramCache]: Analyzing trace with hash -247147345, now seen corresponding path program 1 times [2018-11-07 07:07:06,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:07:06,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:07:06,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:07:06,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:07:06,974 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:07:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:07:07,575 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 07:07:07,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:07:07,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:07:07,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 07:07:07,782 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:07:07,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 07:07:07,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 07:07:07,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 07:07:07,813 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-11-07 07:07:09,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:07:09,644 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-11-07 07:07:09,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 07:07:09,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2018-11-07 07:07:09,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:07:09,668 INFO L225 Difference]: With dead ends: 621 [2018-11-07 07:07:09,668 INFO L226 Difference]: Without dead ends: 382 [2018-11-07 07:07:09,675 INFO L604 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-11-07 07:07:09,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-07 07:07:09,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-11-07 07:07:09,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-11-07 07:07:09,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-11-07 07:07:09,755 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 147 [2018-11-07 07:07:09,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:07:09,756 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-11-07 07:07:09,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 07:07:09,756 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-11-07 07:07:09,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-07 07:07:09,764 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:07:09,764 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:07:09,765 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:07:09,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:07:09,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1882359938, now seen corresponding path program 1 times [2018-11-07 07:07:09,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:07:09,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:07:09,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:07:09,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:07:09,767 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:07:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:07:10,276 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:07:10,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:07:10,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 07:07:10,277 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:07:10,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 07:07:10,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 07:07:10,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 07:07:10,281 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-11-07 07:07:12,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:07:12,027 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-11-07 07:07:12,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 07:07:12,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2018-11-07 07:07:12,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:07:12,032 INFO L225 Difference]: With dead ends: 903 [2018-11-07 07:07:12,032 INFO L226 Difference]: Without dead ends: 381 [2018-11-07 07:07:12,039 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 07:07:12,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-11-07 07:07:12,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-11-07 07:07:12,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-11-07 07:07:12,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-11-07 07:07:12,065 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 156 [2018-11-07 07:07:12,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:07:12,065 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-11-07 07:07:12,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 07:07:12,066 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-11-07 07:07:12,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-07 07:07:12,069 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:07:12,070 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:07:12,070 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:07:12,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:07:12,071 INFO L82 PathProgramCache]: Analyzing trace with hash 337215758, now seen corresponding path program 1 times [2018-11-07 07:07:12,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:07:12,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:07:12,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:07:12,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:07:12,073 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:07:12,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:07:12,495 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:07:12,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:07:12,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 07:07:12,496 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:07:12,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 07:07:12,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 07:07:12,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 07:07:12,498 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-11-07 07:07:13,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:07:13,989 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-11-07 07:07:13,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 07:07:13,991 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 162 [2018-11-07 07:07:13,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:07:13,995 INFO L225 Difference]: With dead ends: 901 [2018-11-07 07:07:13,995 INFO L226 Difference]: Without dead ends: 380 [2018-11-07 07:07:13,997 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 07:07:13,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-11-07 07:07:14,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-11-07 07:07:14,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-11-07 07:07:14,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-11-07 07:07:14,022 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 162 [2018-11-07 07:07:14,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:07:14,022 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-11-07 07:07:14,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 07:07:14,022 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-11-07 07:07:14,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-07 07:07:14,026 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:07:14,026 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:07:14,026 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:07:14,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:07:14,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1461325531, now seen corresponding path program 1 times [2018-11-07 07:07:14,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:07:14,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:07:14,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:07:14,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:07:14,028 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:07:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:07:14,216 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:07:14,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:07:14,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 07:07:14,217 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:07:14,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 07:07:14,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 07:07:14,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 07:07:14,218 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-11-07 07:07:17,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:07:17,289 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-11-07 07:07:17,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 07:07:17,290 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 170 [2018-11-07 07:07:17,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:07:17,295 INFO L225 Difference]: With dead ends: 1193 [2018-11-07 07:07:17,295 INFO L226 Difference]: Without dead ends: 819 [2018-11-07 07:07:17,296 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 07:07:17,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-11-07 07:07:17,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-11-07 07:07:17,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-11-07 07:07:17,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-11-07 07:07:17,336 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 170 [2018-11-07 07:07:17,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:07:17,336 INFO L480 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-11-07 07:07:17,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 07:07:17,336 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-11-07 07:07:17,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-07 07:07:17,340 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:07:17,341 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:07:17,341 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:07:17,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:07:17,341 INFO L82 PathProgramCache]: Analyzing trace with hash -2126959959, now seen corresponding path program 1 times [2018-11-07 07:07:17,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:07:17,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:07:17,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:07:17,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:07:17,343 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:07:17,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:07:17,606 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:07:17,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:07:17,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 07:07:17,606 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:07:17,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 07:07:17,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 07:07:17,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 07:07:17,608 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-11-07 07:07:18,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:07:18,795 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-11-07 07:07:18,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 07:07:18,797 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 172 [2018-11-07 07:07:18,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:07:18,803 INFO L225 Difference]: With dead ends: 1753 [2018-11-07 07:07:18,804 INFO L226 Difference]: Without dead ends: 804 [2018-11-07 07:07:18,807 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 07:07:18,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-11-07 07:07:18,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-11-07 07:07:18,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-11-07 07:07:18,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-11-07 07:07:18,835 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 172 [2018-11-07 07:07:18,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:07:18,835 INFO L480 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-11-07 07:07:18,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 07:07:18,835 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-11-07 07:07:18,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-07 07:07:18,840 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:07:18,840 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:07:18,840 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:07:18,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:07:18,841 INFO L82 PathProgramCache]: Analyzing trace with hash 443683885, now seen corresponding path program 1 times [2018-11-07 07:07:18,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:07:18,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:07:18,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:07:18,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:07:18,842 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:07:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:07:19,172 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:07:19,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:07:19,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 07:07:19,172 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:07:19,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 07:07:19,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 07:07:19,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 07:07:19,174 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-11-07 07:07:20,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:07:20,706 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-11-07 07:07:20,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 07:07:20,710 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 174 [2018-11-07 07:07:20,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:07:20,716 INFO L225 Difference]: With dead ends: 1747 [2018-11-07 07:07:20,717 INFO L226 Difference]: Without dead ends: 801 [2018-11-07 07:07:20,720 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 07:07:20,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-11-07 07:07:20,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-11-07 07:07:20,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-11-07 07:07:20,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-11-07 07:07:20,753 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 174 [2018-11-07 07:07:20,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:07:20,753 INFO L480 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-11-07 07:07:20,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 07:07:20,754 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-11-07 07:07:20,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-07 07:07:20,758 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:07:20,758 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:07:20,759 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:07:20,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:07:20,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1771723, now seen corresponding path program 1 times [2018-11-07 07:07:20,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:07:20,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:07:20,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:07:20,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:07:20,763 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:07:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:07:20,991 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 07:07:21,223 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:07:21,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:07:21,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 07:07:21,224 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:07:21,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 07:07:21,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 07:07:21,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 07:07:21,225 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-11-07 07:07:22,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:07:22,613 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-11-07 07:07:22,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 07:07:22,613 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 178 [2018-11-07 07:07:22,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:07:22,623 INFO L225 Difference]: With dead ends: 2381 [2018-11-07 07:07:22,624 INFO L226 Difference]: Without dead ends: 1586 [2018-11-07 07:07:22,628 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 07:07:22,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-11-07 07:07:22,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-11-07 07:07:22,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-11-07 07:07:22,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-11-07 07:07:22,675 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 178 [2018-11-07 07:07:22,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:07:22,676 INFO L480 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-11-07 07:07:22,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 07:07:22,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-11-07 07:07:22,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-07 07:07:22,682 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:07:22,683 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:07:22,683 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:07:22,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:07:22,683 INFO L82 PathProgramCache]: Analyzing trace with hash 161380030, now seen corresponding path program 1 times [2018-11-07 07:07:22,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:07:22,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:07:22,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:07:22,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:07:22,685 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:07:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:07:22,939 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:07:22,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:07:22,940 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:07:22,941 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 185 with the following transitions: [2018-11-07 07:07:22,943 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], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [827], [835], [843], [847], [849], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 07:07:22,992 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:07:22,993 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:07:24,253 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 07:07:24,255 INFO L272 AbstractInterpreter]: Visited 152 different actions 450 times. Merged at 7 different actions 18 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 07:07:24,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:07:24,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 07:07:24,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:07:24,303 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 07:07:24,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:07:24,318 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 07:07:24,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:07:24,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 07:07:24,552 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 07:07:24,552 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 07:07:24,812 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 07:07:24,833 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:07:24,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 8 [2018-11-07 07:07:24,833 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:07:24,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 07:07:24,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 07:07:24,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-07 07:07:24,834 INFO L87 Difference]: Start difference. First operand 1558 states and 2225 transitions. Second operand 3 states. [2018-11-07 07:07:27,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:07:27,189 INFO L93 Difference]: Finished difference Result 4565 states and 6657 transitions. [2018-11-07 07:07:27,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 07:07:27,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2018-11-07 07:07:27,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:07:27,208 INFO L225 Difference]: With dead ends: 4565 [2018-11-07 07:07:27,208 INFO L226 Difference]: Without dead ends: 3013 [2018-11-07 07:07:27,217 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 370 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-07 07:07:27,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3013 states. [2018-11-07 07:07:27,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3013 to 3008. [2018-11-07 07:07:27,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3008 states. [2018-11-07 07:07:27,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 3992 transitions. [2018-11-07 07:07:27,307 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 3992 transitions. Word has length 184 [2018-11-07 07:07:27,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:07:27,308 INFO L480 AbstractCegarLoop]: Abstraction has 3008 states and 3992 transitions. [2018-11-07 07:07:27,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 07:07:27,308 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 3992 transitions. [2018-11-07 07:07:27,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-07 07:07:27,321 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:07:27,321 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:07:27,322 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:07:27,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:07:27,322 INFO L82 PathProgramCache]: Analyzing trace with hash -2112487449, now seen corresponding path program 1 times [2018-11-07 07:07:27,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:07:27,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:07:27,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:07:27,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:07:27,324 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:07:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:07:27,870 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:07:27,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:07:27,870 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:07:27,871 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 214 with the following transitions: [2018-11-07 07:07:27,871 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [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], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [827], [835], [843], [847], [849], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 07:07:27,885 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:07:27,885 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:07:28,291 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 07:07:28,291 INFO L272 AbstractInterpreter]: Visited 151 different actions 296 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-11-07 07:07:28,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:07:28,329 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 07:07:28,861 INFO L227 lantSequenceWeakener]: Weakened 210 states. On average, predicates are now at 82.93% of their original sizes. [2018-11-07 07:07:28,862 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 07:07:29,640 INFO L415 sIntCurrentIteration]: We unified 212 AI predicates to 212 [2018-11-07 07:07:29,641 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 07:07:29,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:07:29,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-07 07:07:29,642 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:07:29,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 07:07:29,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 07:07:29,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-07 07:07:29,643 INFO L87 Difference]: Start difference. First operand 3008 states and 3992 transitions. Second operand 10 states. [2018-11-07 07:07:40,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:07:40,821 INFO L93 Difference]: Finished difference Result 6825 states and 9103 transitions. [2018-11-07 07:07:40,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 07:07:40,822 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 213 [2018-11-07 07:07:40,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:07:40,840 INFO L225 Difference]: With dead ends: 6825 [2018-11-07 07:07:40,840 INFO L226 Difference]: Without dead ends: 3823 [2018-11-07 07:07:40,849 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 222 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-11-07 07:07:40,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3823 states. [2018-11-07 07:07:40,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3823 to 3752. [2018-11-07 07:07:40,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3752 states. [2018-11-07 07:07:40,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3752 states to 3752 states and 4845 transitions. [2018-11-07 07:07:40,943 INFO L78 Accepts]: Start accepts. Automaton has 3752 states and 4845 transitions. Word has length 213 [2018-11-07 07:07:40,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:07:40,943 INFO L480 AbstractCegarLoop]: Abstraction has 3752 states and 4845 transitions. [2018-11-07 07:07:40,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 07:07:40,945 INFO L276 IsEmpty]: Start isEmpty. Operand 3752 states and 4845 transitions. [2018-11-07 07:07:40,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-11-07 07:07:40,958 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:07:40,958 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:07:40,958 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:07:40,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:07:40,959 INFO L82 PathProgramCache]: Analyzing trace with hash 666818281, now seen corresponding path program 1 times [2018-11-07 07:07:40,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:07:40,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:07:40,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:07:40,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:07:40,961 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:07:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:07:41,472 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-07 07:07:41,545 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 07:07:41,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:07:41,545 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:07:41,545 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 232 with the following transitions: [2018-11-07 07:07:41,546 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [312], [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], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [827], [835], [843], [847], [849], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 07:07:41,551 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:07:41,551 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:07:41,874 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 07:07:41,874 INFO L272 AbstractInterpreter]: Visited 151 different actions 449 times. Merged at 7 different actions 18 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 07:07:41,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:07:41,915 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 07:07:42,199 INFO L227 lantSequenceWeakener]: Weakened 228 states. On average, predicates are now at 84.95% of their original sizes. [2018-11-07 07:07:42,200 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 07:07:42,441 INFO L415 sIntCurrentIteration]: We unified 230 AI predicates to 230 [2018-11-07 07:07:42,441 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 07:07:42,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:07:42,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2018-11-07 07:07:42,442 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:07:42,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 07:07:42,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 07:07:42,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-07 07:07:42,443 INFO L87 Difference]: Start difference. First operand 3752 states and 4845 transitions. Second operand 9 states. [2018-11-07 07:07:48,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:07:48,724 INFO L93 Difference]: Finished difference Result 8964 states and 11861 transitions. [2018-11-07 07:07:48,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 07:07:48,724 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 231 [2018-11-07 07:07:48,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:07:48,749 INFO L225 Difference]: With dead ends: 8964 [2018-11-07 07:07:48,749 INFO L226 Difference]: Without dead ends: 5218 [2018-11-07 07:07:48,763 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 238 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-11-07 07:07:48,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5218 states. [2018-11-07 07:07:48,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5218 to 5166. [2018-11-07 07:07:48,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5166 states. [2018-11-07 07:07:48,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5166 states to 5166 states and 6535 transitions. [2018-11-07 07:07:48,885 INFO L78 Accepts]: Start accepts. Automaton has 5166 states and 6535 transitions. Word has length 231 [2018-11-07 07:07:48,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:07:48,886 INFO L480 AbstractCegarLoop]: Abstraction has 5166 states and 6535 transitions. [2018-11-07 07:07:48,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 07:07:48,886 INFO L276 IsEmpty]: Start isEmpty. Operand 5166 states and 6535 transitions. [2018-11-07 07:07:48,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-11-07 07:07:48,901 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:07:48,901 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:07:48,902 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:07:48,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:07:48,902 INFO L82 PathProgramCache]: Analyzing trace with hash 915295681, now seen corresponding path program 1 times [2018-11-07 07:07:48,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:07:48,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:07:48,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:07:48,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:07:48,904 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:07:48,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:07:49,307 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 101 proven. 54 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 07:07:49,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:07:49,307 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:07:49,307 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 254 with the following transitions: [2018-11-07 07:07:49,308 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [205], [209], [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], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [827], [835], [843], [847], [849], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 07:07:49,314 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:07:49,314 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:07:49,681 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 07:07:49,681 INFO L272 AbstractInterpreter]: Visited 154 different actions 608 times. Merged at 8 different actions 29 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 07:07:49,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:07:49,688 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 07:07:49,941 INFO L227 lantSequenceWeakener]: Weakened 250 states. On average, predicates are now at 86.97% of their original sizes. [2018-11-07 07:07:49,942 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 07:07:50,081 INFO L415 sIntCurrentIteration]: We unified 252 AI predicates to 252 [2018-11-07 07:07:50,081 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 07:07:50,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:07:50,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [10] total 20 [2018-11-07 07:07:50,082 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:07:50,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 07:07:50,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 07:07:50,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-07 07:07:50,083 INFO L87 Difference]: Start difference. First operand 5166 states and 6535 transitions. Second operand 12 states. [2018-11-07 07:07:59,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:07:59,723 INFO L93 Difference]: Finished difference Result 11331 states and 14177 transitions. [2018-11-07 07:07:59,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 07:07:59,723 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 253 [2018-11-07 07:07:59,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:07:59,746 INFO L225 Difference]: With dead ends: 11331 [2018-11-07 07:07:59,746 INFO L226 Difference]: Without dead ends: 5870 [2018-11-07 07:07:59,762 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 271 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=221, Invalid=709, Unknown=0, NotChecked=0, Total=930 [2018-11-07 07:07:59,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5870 states. [2018-11-07 07:07:59,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5870 to 5747. [2018-11-07 07:07:59,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5747 states. [2018-11-07 07:07:59,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5747 states to 5747 states and 6798 transitions. [2018-11-07 07:07:59,892 INFO L78 Accepts]: Start accepts. Automaton has 5747 states and 6798 transitions. Word has length 253 [2018-11-07 07:07:59,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:07:59,893 INFO L480 AbstractCegarLoop]: Abstraction has 5747 states and 6798 transitions. [2018-11-07 07:07:59,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 07:07:59,893 INFO L276 IsEmpty]: Start isEmpty. Operand 5747 states and 6798 transitions. [2018-11-07 07:07:59,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-11-07 07:07:59,907 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:07:59,908 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:07:59,908 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:07:59,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:07:59,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1111459177, now seen corresponding path program 1 times [2018-11-07 07:07:59,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:07:59,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:07:59,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:07:59,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:07:59,910 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:07:59,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:08:00,144 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-11-07 07:08:00,264 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 120 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:08:00,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:08:00,265 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:08:00,265 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 256 with the following transitions: [2018-11-07 07:08:00,265 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], [301], [306], [308], [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], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [827], [835], [843], [847], [849], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 07:08:00,269 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:08:00,269 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:08:00,864 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 07:08:00,864 INFO L272 AbstractInterpreter]: Visited 155 different actions 457 times. Merged at 8 different actions 20 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 07:08:00,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:08:00,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 07:08:00,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:08:00,867 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 07:08:00,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:08:00,882 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 07:08:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:08:00,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 07:08:01,083 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 135 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 07:08:01,083 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 07:08:01,210 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 135 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 07:08:01,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 07:08:01,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 5] total 16 [2018-11-07 07:08:01,231 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 07:08:01,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 07:08:01,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 07:08:01,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-11-07 07:08:01,232 INFO L87 Difference]: Start difference. First operand 5747 states and 6798 transitions. Second operand 15 states. [2018-11-07 07:08:04,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:08:04,332 INFO L93 Difference]: Finished difference Result 10819 states and 13061 transitions. [2018-11-07 07:08:04,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 07:08:04,339 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 255 [2018-11-07 07:08:04,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:08:04,360 INFO L225 Difference]: With dead ends: 10819 [2018-11-07 07:08:04,360 INFO L226 Difference]: Without dead ends: 3681 [2018-11-07 07:08:04,376 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 517 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2018-11-07 07:08:04,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3681 states. [2018-11-07 07:08:04,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3681 to 3648. [2018-11-07 07:08:04,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3648 states. [2018-11-07 07:08:04,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3648 states to 3648 states and 4211 transitions. [2018-11-07 07:08:04,457 INFO L78 Accepts]: Start accepts. Automaton has 3648 states and 4211 transitions. Word has length 255 [2018-11-07 07:08:04,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:08:04,458 INFO L480 AbstractCegarLoop]: Abstraction has 3648 states and 4211 transitions. [2018-11-07 07:08:04,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 07:08:04,458 INFO L276 IsEmpty]: Start isEmpty. Operand 3648 states and 4211 transitions. [2018-11-07 07:08:04,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-11-07 07:08:04,472 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:08:04,472 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:08:04,472 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:08:04,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:08:04,473 INFO L82 PathProgramCache]: Analyzing trace with hash 641913708, now seen corresponding path program 1 times [2018-11-07 07:08:04,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:08:04,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:08:04,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:08:04,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:08:04,474 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:08:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:08:05,160 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 253 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:08:05,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:08:05,160 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:08:05,160 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 314 with the following transitions: [2018-11-07 07:08:05,161 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [236], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [301], [306], [308], [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], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [827], [835], [843], [847], [849], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 07:08:05,163 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:08:05,163 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:08:05,526 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 07:08:05,526 INFO L272 AbstractInterpreter]: Visited 155 different actions 612 times. Merged at 8 different actions 32 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-07 07:08:05,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:08:05,534 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 07:08:05,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:08:05,534 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 07:08:05,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:08:05,543 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 07:08:05,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:08:05,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 07:08:05,880 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 251 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-07 07:08:05,881 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 07:08:05,991 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-11-07 07:08:06,317 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 251 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-07 07:08:06,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 07:08:06,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 15 [2018-11-07 07:08:06,338 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 07:08:06,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 07:08:06,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 07:08:06,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-11-07 07:08:06,340 INFO L87 Difference]: Start difference. First operand 3648 states and 4211 transitions. Second operand 13 states. [2018-11-07 07:08:11,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:08:11,240 INFO L93 Difference]: Finished difference Result 8909 states and 10379 transitions. [2018-11-07 07:08:11,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 07:08:11,242 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 313 [2018-11-07 07:08:11,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:08:11,253 INFO L225 Difference]: With dead ends: 8909 [2018-11-07 07:08:11,254 INFO L226 Difference]: Without dead ends: 4991 [2018-11-07 07:08:11,262 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 682 GetRequests, 644 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=326, Invalid=1156, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 07:08:11,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4991 states. [2018-11-07 07:08:11,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4991 to 4725. [2018-11-07 07:08:11,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4725 states. [2018-11-07 07:08:11,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4725 states to 4725 states and 5225 transitions. [2018-11-07 07:08:11,362 INFO L78 Accepts]: Start accepts. Automaton has 4725 states and 5225 transitions. Word has length 313 [2018-11-07 07:08:11,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:08:11,362 INFO L480 AbstractCegarLoop]: Abstraction has 4725 states and 5225 transitions. [2018-11-07 07:08:11,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 07:08:11,363 INFO L276 IsEmpty]: Start isEmpty. Operand 4725 states and 5225 transitions. [2018-11-07 07:08:11,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-11-07 07:08:11,379 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:08:11,380 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:08:11,380 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:08:11,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:08:11,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1064430452, now seen corresponding path program 1 times [2018-11-07 07:08:11,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:08:11,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:08:11,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:08:11,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:08:11,382 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:08:11,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:08:11,793 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-07 07:08:12,482 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 297 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:08:12,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:08:12,483 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:08:12,483 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 349 with the following transitions: [2018-11-07 07:08:12,484 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [198], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [301], [306], [308], [309], [313], [317], [321], [325], [329], [333], [344], [348], [351], [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], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [827], [835], [843], [847], [849], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 07:08:12,487 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:08:12,487 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:08:12,789 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 07:08:12,789 INFO L272 AbstractInterpreter]: Visited 155 different actions 610 times. Merged at 8 different actions 30 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 07:08:12,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:08:12,798 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 07:08:12,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:08:12,798 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 07:08:12,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:08:12,809 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 07:08:12,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:08:12,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 07:08:13,439 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 312 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-07 07:08:13,439 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 07:08:14,166 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 312 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-07 07:08:14,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 07:08:14,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7, 8] total 23 [2018-11-07 07:08:14,188 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 07:08:14,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 07:08:14,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 07:08:14,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2018-11-07 07:08:14,189 INFO L87 Difference]: Start difference. First operand 4725 states and 5225 transitions. Second operand 19 states. [2018-11-07 07:08:14,791 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2018-11-07 07:08:16,684 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 44 [2018-11-07 07:08:18,595 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 43 [2018-11-07 07:08:19,285 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 36 [2018-11-07 07:08:19,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:08:19,946 INFO L93 Difference]: Finished difference Result 9312 states and 10393 transitions. [2018-11-07 07:08:19,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-07 07:08:19,947 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 348 [2018-11-07 07:08:19,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:08:19,961 INFO L225 Difference]: With dead ends: 9312 [2018-11-07 07:08:19,961 INFO L226 Difference]: Without dead ends: 5002 [2018-11-07 07:08:19,970 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 751 GetRequests, 696 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 793 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=697, Invalid=2495, Unknown=0, NotChecked=0, Total=3192 [2018-11-07 07:08:19,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5002 states. [2018-11-07 07:08:20,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5002 to 4731. [2018-11-07 07:08:20,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4731 states. [2018-11-07 07:08:20,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4731 states to 4731 states and 5189 transitions. [2018-11-07 07:08:20,070 INFO L78 Accepts]: Start accepts. Automaton has 4731 states and 5189 transitions. Word has length 348 [2018-11-07 07:08:20,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:08:20,071 INFO L480 AbstractCegarLoop]: Abstraction has 4731 states and 5189 transitions. [2018-11-07 07:08:20,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 07:08:20,071 INFO L276 IsEmpty]: Start isEmpty. Operand 4731 states and 5189 transitions. [2018-11-07 07:08:20,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-11-07 07:08:20,087 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:08:20,088 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 07:08:20,088 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:08:20,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:08:20,089 INFO L82 PathProgramCache]: Analyzing trace with hash -526388730, now seen corresponding path program 1 times [2018-11-07 07:08:20,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:08:20,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:08:20,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:08:20,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:08:20,090 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:08:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:08:20,554 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 266 proven. 19 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-11-07 07:08:20,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:08:20,554 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:08:20,554 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 357 with the following transitions: [2018-11-07 07:08:20,555 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [45], [50], [52], [53], [56], [61], [63], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [236], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [301], [306], [308], [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], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [827], [835], [843], [847], [849], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 07:08:20,558 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:08:20,558 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:08:20,924 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 07:08:20,924 INFO L272 AbstractInterpreter]: Visited 161 different actions 639 times. Merged at 10 different actions 43 times. Widened at 1 different actions 1 times. Found 10 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 07:08:20,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:08:20,932 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 07:08:20,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:08:20,932 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 07:08:20,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:08:20,941 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 07:08:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:08:21,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 07:08:21,135 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 318 proven. 2 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-07 07:08:21,135 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 07:08:21,263 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 266 proven. 19 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-11-07 07:08:21,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 07:08:21,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2018-11-07 07:08:21,284 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 07:08:21,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 07:08:21,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 07:08:21,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-07 07:08:21,286 INFO L87 Difference]: Start difference. First operand 4731 states and 5189 transitions. Second operand 7 states. [2018-11-07 07:08:21,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:08:21,926 INFO L93 Difference]: Finished difference Result 7345 states and 8113 transitions. [2018-11-07 07:08:21,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 07:08:21,927 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 356 [2018-11-07 07:08:21,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:08:21,937 INFO L225 Difference]: With dead ends: 7345 [2018-11-07 07:08:21,938 INFO L226 Difference]: Without dead ends: 4120 [2018-11-07 07:08:21,942 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 721 GetRequests, 711 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-07 07:08:21,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4120 states. [2018-11-07 07:08:22,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4120 to 4065. [2018-11-07 07:08:22,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4065 states. [2018-11-07 07:08:22,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4065 states to 4065 states and 4431 transitions. [2018-11-07 07:08:22,053 INFO L78 Accepts]: Start accepts. Automaton has 4065 states and 4431 transitions. Word has length 356 [2018-11-07 07:08:22,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:08:22,053 INFO L480 AbstractCegarLoop]: Abstraction has 4065 states and 4431 transitions. [2018-11-07 07:08:22,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 07:08:22,054 INFO L276 IsEmpty]: Start isEmpty. Operand 4065 states and 4431 transitions. [2018-11-07 07:08:22,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-11-07 07:08:22,071 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:08:22,072 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:08:22,072 INFO L423 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:08:22,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:08:22,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1961643071, now seen corresponding path program 1 times [2018-11-07 07:08:22,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:08:22,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:08:22,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:08:22,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:08:22,074 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:08:22,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:08:22,629 WARN L179 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 8 [2018-11-07 07:08:23,271 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2018-11-07 07:08:23,407 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2018-11-07 07:08:24,471 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 92 proven. 330 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-07 07:08:24,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:08:24,471 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:08:24,471 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 371 with the following transitions: [2018-11-07 07:08:24,472 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [56], [61], [63], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [198], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [301], [306], [308], [309], [313], [317], [321], [325], [329], [333], [344], [348], [351], [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], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [827], [835], [843], [847], [849], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 07:08:24,475 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:08:24,475 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:08:24,756 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 07:08:24,756 INFO L272 AbstractInterpreter]: Visited 158 different actions 625 times. Merged at 9 different actions 37 times. Widened at 1 different actions 1 times. Found 8 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 07:08:24,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:08:24,764 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 07:08:24,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:08:24,764 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 07:08:24,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:08:24,773 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 07:08:24,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:08:24,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 07:08:25,024 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 352 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-07 07:08:25,024 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 07:08:25,300 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 352 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-07 07:08:25,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 07:08:25,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 5, 5] total 29 [2018-11-07 07:08:25,321 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 07:08:25,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 07:08:25,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 07:08:25,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2018-11-07 07:08:25,323 INFO L87 Difference]: Start difference. First operand 4065 states and 4431 transitions. Second operand 27 states. [2018-11-07 07:08:27,121 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2018-11-07 07:08:28,476 WARN L179 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2018-11-07 07:08:31,033 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 42 [2018-11-07 07:08:37,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:08:37,307 INFO L93 Difference]: Finished difference Result 7728 states and 8489 transitions. [2018-11-07 07:08:37,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-07 07:08:37,308 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 370 [2018-11-07 07:08:37,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:08:37,309 INFO L225 Difference]: With dead ends: 7728 [2018-11-07 07:08:37,309 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 07:08:37,324 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 850 GetRequests, 765 SyntacticMatches, 6 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1845 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1262, Invalid=5218, Unknown=0, NotChecked=0, Total=6480 [2018-11-07 07:08:37,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 07:08:37,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 07:08:37,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 07:08:37,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 07:08:37,326 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 370 [2018-11-07 07:08:37,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:08:37,326 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 07:08:37,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-07 07:08:37,326 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 07:08:37,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 07:08:37,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 07:08:37,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:37,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:37,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:37,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:37,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:37,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:37,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:37,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:37,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:38,001 WARN L179 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 240 DAG size of output: 188 [2018-11-07 07:08:38,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:38,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:38,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:38,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:38,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:38,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:38,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:38,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:38,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:38,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:38,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:38,556 WARN L179 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 308 DAG size of output: 243 [2018-11-07 07:08:39,082 WARN L179 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 17 [2018-11-07 07:08:40,112 WARN L179 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 68 DAG size of output: 34 [2018-11-07 07:08:42,383 WARN L179 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 211 DAG size of output: 92 [2018-11-07 07:08:43,535 WARN L179 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 188 DAG size of output: 70 [2018-11-07 07:08:45,147 WARN L179 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 242 DAG size of output: 74 [2018-11-07 07:08:45,150 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 07:08:45,151 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a11~0)| ~a11~0) (= ~a17~0 |old(~a17~0)|) (= ~a19~0 |old(~a19~0)|) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) [2018-11-07 07:08:45,151 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 07:08:45,151 INFO L425 ceAbstractionStarter]: For program point L564(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,151 INFO L425 ceAbstractionStarter]: For program point L531(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,151 INFO L425 ceAbstractionStarter]: For program point L498(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,151 INFO L425 ceAbstractionStarter]: For program point L465(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,151 INFO L425 ceAbstractionStarter]: For program point L432(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,152 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-07 07:08:45,152 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-07 07:08:45,152 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-07 07:08:45,152 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-07 07:08:45,152 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-07 07:08:45,152 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-07 07:08:45,152 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-07 07:08:45,152 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-07 07:08:45,152 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-07 07:08:45,152 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-07 07:08:45,153 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-07 07:08:45,153 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-07 07:08:45,153 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-07 07:08:45,153 INFO L425 ceAbstractionStarter]: For program point L567(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,153 INFO L425 ceAbstractionStarter]: For program point L534(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,153 INFO L425 ceAbstractionStarter]: For program point L501(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,153 INFO L425 ceAbstractionStarter]: For program point L468(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,153 INFO L425 ceAbstractionStarter]: For program point L435(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,153 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-07 07:08:45,153 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-07 07:08:45,153 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-07 07:08:45,153 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-07 07:08:45,153 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-07 07:08:45,153 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-07 07:08:45,154 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-07 07:08:45,154 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-07 07:08:45,154 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-07 07:08:45,154 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-07 07:08:45,154 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-07 07:08:45,154 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-07 07:08:45,154 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-07 07:08:45,154 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-07 07:08:45,154 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-07 07:08:45,154 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-07 07:08:45,154 INFO L425 ceAbstractionStarter]: For program point L570(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,154 INFO L425 ceAbstractionStarter]: For program point L537(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,155 INFO L425 ceAbstractionStarter]: For program point L504(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,155 INFO L425 ceAbstractionStarter]: For program point L471(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,155 INFO L425 ceAbstractionStarter]: For program point L438(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,155 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-07 07:08:45,155 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-07 07:08:45,155 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-07 07:08:45,155 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-07 07:08:45,155 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-07 07:08:45,155 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-07 07:08:45,155 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-07 07:08:45,156 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-07 07:08:45,156 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-07 07:08:45,156 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-07 07:08:45,156 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-07 07:08:45,156 INFO L425 ceAbstractionStarter]: For program point L573(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,156 INFO L425 ceAbstractionStarter]: For program point L540(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,156 INFO L425 ceAbstractionStarter]: For program point L507(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,156 INFO L425 ceAbstractionStarter]: For program point L474(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,156 INFO L425 ceAbstractionStarter]: For program point L441(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,156 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-07 07:08:45,157 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-07 07:08:45,157 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-07 07:08:45,157 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-07 07:08:45,157 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-07 07:08:45,157 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-07 07:08:45,157 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-07 07:08:45,157 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-07 07:08:45,157 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-07 07:08:45,157 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-07 07:08:45,157 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-07 07:08:45,157 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-07 07:08:45,158 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-07 07:08:45,158 INFO L425 ceAbstractionStarter]: For program point L576(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,158 INFO L425 ceAbstractionStarter]: For program point L543(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,158 INFO L425 ceAbstractionStarter]: For program point L510(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,158 INFO L425 ceAbstractionStarter]: For program point L477(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,158 INFO L425 ceAbstractionStarter]: For program point L444(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,158 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-07 07:08:45,158 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-07 07:08:45,158 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-07 07:08:45,158 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-07 07:08:45,158 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-07 07:08:45,159 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-07 07:08:45,159 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-07 07:08:45,159 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-07 07:08:45,159 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-07 07:08:45,159 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-07 07:08:45,159 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-07 07:08:45,159 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-07 07:08:45,159 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-07 07:08:45,159 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-07 07:08:45,159 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-07 07:08:45,159 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-07 07:08:45,159 INFO L425 ceAbstractionStarter]: For program point L579(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,159 INFO L425 ceAbstractionStarter]: For program point L546(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,159 INFO L425 ceAbstractionStarter]: For program point L513(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,159 INFO L425 ceAbstractionStarter]: For program point L480(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,160 INFO L425 ceAbstractionStarter]: For program point L447(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,160 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-07 07:08:45,160 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-07 07:08:45,160 INFO L425 ceAbstractionStarter]: For program point L414-1(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,160 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-07 07:08:45,160 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-07 07:08:45,160 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-07 07:08:45,160 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,160 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,160 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-07 07:08:45,160 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-07 07:08:45,160 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-07 07:08:45,160 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-07 07:08:45,160 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-07 07:08:45,160 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-07 07:08:45,161 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-07 07:08:45,161 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-07 07:08:45,161 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-07 07:08:45,161 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-07 07:08:45,161 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-07 07:08:45,161 INFO L425 ceAbstractionStarter]: For program point L582(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,161 INFO L425 ceAbstractionStarter]: For program point L549(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,161 INFO L425 ceAbstractionStarter]: For program point L516(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,161 INFO L425 ceAbstractionStarter]: For program point L483(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,161 INFO L425 ceAbstractionStarter]: For program point L450(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,161 INFO L425 ceAbstractionStarter]: For program point L417(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,162 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-07 07:08:45,162 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-07 07:08:45,162 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-07 07:08:45,162 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-07 07:08:45,162 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-07 07:08:45,162 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-07 07:08:45,162 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-07 07:08:45,162 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-07 07:08:45,162 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-07 07:08:45,162 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-07 07:08:45,162 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-07 07:08:45,162 INFO L425 ceAbstractionStarter]: For program point L585(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,162 INFO L425 ceAbstractionStarter]: For program point L552(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,162 INFO L425 ceAbstractionStarter]: For program point L519(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,163 INFO L425 ceAbstractionStarter]: For program point L486(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,163 INFO L425 ceAbstractionStarter]: For program point L453(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,163 INFO L425 ceAbstractionStarter]: For program point L420(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,163 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-07 07:08:45,163 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-07 07:08:45,163 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-07 07:08:45,163 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-07 07:08:45,163 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-07 07:08:45,163 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-07 07:08:45,163 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-07 07:08:45,164 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-07 07:08:45,164 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-07 07:08:45,164 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-07 07:08:45,164 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-07 07:08:45,164 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-07 07:08:45,164 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-07 07:08:45,164 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-07 07:08:45,164 INFO L425 ceAbstractionStarter]: For program point L588(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,164 INFO L425 ceAbstractionStarter]: For program point L555(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,164 INFO L425 ceAbstractionStarter]: For program point L522(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,165 INFO L425 ceAbstractionStarter]: For program point L489(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,165 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse15 (= 1 |old(~a19~0)|)) (.cse20 (= 1 |old(~a25~0)|))) (let ((.cse9 (= ~a17~0 8)) (.cse1 (= 1 |old(~a11~0)|)) (.cse7 (not .cse20)) (.cse0 (not (= 1 ~a21~0))) (.cse8 (not .cse15)) (.cse11 (= ~a11~0 1))) (let ((.cse10 (= ~a25~0 1)) (.cse2 (not .cse11)) (.cse25 (not (= 10 |old(~a28~0)|))) (.cse3 (= |old(~a17~0)| |old(~a28~0)|)) (.cse22 (= |old(~a28~0)| ~a28~0)) (.cse26 (let ((.cse28 (= 0 |old(~a28~0)|))) (and (or .cse0 .cse7 .cse28) (or .cse0 .cse8 .cse28)))) (.cse18 (= 8 ~a17~0)) (.cse21 (= 9 |old(~a28~0)|)) (.cse14 (not .cse1)) (.cse16 (= 7 ~a28~0)) (.cse17 (= 1 ~a11~0)) (.cse23 (= 7 ~a17~0)) (.cse19 (= 1 ~a19~0)) (.cse24 (= |old(~a25~0)| ~a25~0)) (.cse5 (not (= 7 |old(~a17~0)|))) (.cse6 (not (= 7 |old(~a28~0)|))) (.cse4 (< 0 |old(~a19~0)|)) (.cse13 (= |calculate_output_#in~input| 0)) (.cse12 (not (= 8 |old(~a17~0)|))) (.cse27 (and (= |old(~a11~0)| ~a11~0) .cse9 (= ~a19~0 |old(~a19~0)|) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse6 .cse7 .cse8 (and .cse9 (= ~a19~0 1) (= ~a28~0 7) .cse10 .cse11) .cse12 .cse13 .cse14) (or .cse15 .cse0 .cse6 .cse12 (and .cse16 (not .cse10) .cse17 .cse18 (not .cse19)) .cse14 .cse20) (or .cse0 .cse1 .cse3 .cse21 (and .cse22 .cse23 .cse24 .cse2) .cse20 .cse5) (or (and .cse17 .cse18 .cse19 .cse24 (= 10 ~a28~0)) .cse0 .cse25 .cse7 .cse8 .cse12 .cse14) (or .cse26 .cse13 .cse1 .cse25 .cse12 .cse4 .cse27) (or .cse27 .cse26 .cse3 .cse12 .cse13 .cse20) (or .cse0 .cse1 .cse27 (not (= 8 |old(~a28~0)|)) .cse12 .cse4 .cse13 .cse20) (or .cse0 .cse3 .cse4 (and .cse22 (<= ~a19~0 0) .cse23 .cse24) .cse5) (or .cse7 .cse27 .cse26 .cse13 .cse1 .cse8 .cse12) (or .cse0 .cse7 .cse8 .cse12 (and .cse17 (= 1 ~a25~0) (= 9 ~a28~0) .cse18 .cse19) (not .cse21) .cse14) (or .cse0 .cse6 .cse7 .cse8 .cse14 (and .cse16 .cse17 .cse23 .cse19 .cse24) .cse5) (or (or .cse0 .cse6 .cse1 .cse4 .cse13 .cse20) .cse12 .cse27))))) [2018-11-07 07:08:45,165 INFO L425 ceAbstractionStarter]: For program point L456(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,165 INFO L425 ceAbstractionStarter]: For program point L423(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,165 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-07 07:08:45,166 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-07 07:08:45,166 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-07 07:08:45,166 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 592) no Hoare annotation was computed. [2018-11-07 07:08:45,166 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-07 07:08:45,166 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-07 07:08:45,166 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-07 07:08:45,166 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-07 07:08:45,166 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-07 07:08:45,167 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-07 07:08:45,167 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-07 07:08:45,167 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-07 07:08:45,167 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-07 07:08:45,167 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-07 07:08:45,167 INFO L425 ceAbstractionStarter]: For program point L558(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,167 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,167 INFO L425 ceAbstractionStarter]: For program point L525(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,167 INFO L425 ceAbstractionStarter]: For program point L492(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,167 INFO L425 ceAbstractionStarter]: For program point L459(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,168 INFO L425 ceAbstractionStarter]: For program point L426(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,168 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-07 07:08:45,168 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-07 07:08:45,168 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-07 07:08:45,168 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-07 07:08:45,168 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-07 07:08:45,168 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-07 07:08:45,168 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-07 07:08:45,168 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-07 07:08:45,168 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-07 07:08:45,169 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-07 07:08:45,169 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-07 07:08:45,169 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-07 07:08:45,169 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-07 07:08:45,169 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-07 07:08:45,169 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-07 07:08:45,169 INFO L425 ceAbstractionStarter]: For program point L594(lines 594 596) no Hoare annotation was computed. [2018-11-07 07:08:45,169 INFO L425 ceAbstractionStarter]: For program point L561(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,169 INFO L425 ceAbstractionStarter]: For program point L528(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,169 INFO L425 ceAbstractionStarter]: For program point L495(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,170 INFO L425 ceAbstractionStarter]: For program point L462(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,170 INFO L425 ceAbstractionStarter]: For program point L429(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:45,170 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-07 07:08:45,170 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-07 07:08:45,170 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-07 07:08:45,170 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-07 07:08:45,170 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-07 07:08:45,170 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-07 07:08:45,170 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-07 07:08:45,170 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-07 07:08:45,170 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-07 07:08:45,171 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-07 07:08:45,171 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-07 07:08:45,171 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-07 07:08:45,171 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-07 07:08:45,171 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-07 07:08:45,171 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-07 07:08:45,171 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-07 07:08:45,171 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-07 07:08:45,171 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-07 07:08:45,172 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-07 07:08:45,172 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 07:08:45,172 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a19~0 1) (= ~a28~0 7) (= ~a21~0 1)) [2018-11-07 07:08:45,172 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 07:08:45,172 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 07:08:45,172 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (not (= 0 |old(~a11~0)|)) (and (= ~a11~0 0) (= ~a25~0 |old(~a25~0)|) (= |old(~a28~0)| ~a28~0) (= ~a17~0 8) (= ~a19~0 |old(~a19~0)|)) (not (= 1 |old(~a19~0)|)) (not (= 8 |old(~a17~0)|)) (not (= 0 |old(~a25~0)|))) [2018-11-07 07:08:45,172 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-07 07:08:45,173 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse8 (= 1 ~a25~0)) (.cse4 (= ~a19~0 1)) (.cse1 (not (= ~a28~0 0))) (.cse3 (= ~a17~0 8)) (.cse13 (= ~a25~0 1))) (let ((.cse14 (let ((.cse17 (= ~a21~0 1))) (or (and .cse1 .cse3 .cse4 .cse17) (and .cse1 .cse3 .cse17 .cse13)))) (.cse9 (= 1 ~a19~0)) (.cse16 (= 10 ~a28~0)) (.cse11 (<= ~a19~0 0)) (.cse12 (not .cse8)) (.cse5 (= 7 ~a28~0)) (.cse6 (= 1 ~a11~0)) (.cse10 (= 8 ~a17~0)) (.cse0 (not (= ~a28~0 ~a17~0))) (.cse2 (not .cse13)) (.cse7 (= 7 ~a17~0)) (.cse15 (not (= ~a11~0 1)))) (or (not (= 1 ~a21~0)) (and .cse0 (and .cse1 .cse2 .cse3 .cse4)) (not (= 0 |old(~a11~0)|)) (and .cse5 .cse6 .cse7 .cse8 .cse9) (and (= 9 ~a28~0) .cse10 .cse9) (and .cse11 .cse0 .cse7) (and (and .cse11 .cse5 .cse12) .cse10) (and .cse13 .cse9 (and .cse14 .cse15)) (and (and .cse11 .cse14 .cse15) .cse16) (not (= 1 |old(~a19~0)|)) (and .cse10 .cse9 .cse16) (not (= 7 |old(~a28~0)|)) (and .cse11 .cse15 (= 8 ~a28~0) .cse12 .cse10) (and .cse5 .cse2 .cse6 .cse10) (and .cse0 .cse2 .cse7 .cse15 (not (= ~a28~0 9))) (and .cse3 .cse4 (= ~a28~0 7)) (not (= 0 |old(~a25~0)|)) (not (= |old(~a17~0)| 8))))) [2018-11-07 07:08:45,173 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-11-07 07:08:45,173 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-11-07 07:08:45,173 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse9 (= 1 ~a25~0)) (.cse14 (= ~a25~0 1))) (let ((.cse12 (= 10 ~a28~0)) (.cse7 (= 1 ~a11~0)) (.cse10 (= 8 ~a17~0)) (.cse2 (not (= ~a28~0 ~a17~0))) (.cse1 (not .cse14)) (.cse8 (= 7 ~a17~0)) (.cse3 (not (= ~a28~0 0))) (.cse4 (= 1 ~a19~0)) (.cse13 (not (= ~a11~0 1))) (.cse0 (not (= main_~input~0 0))) (.cse11 (<= ~a19~0 0)) (.cse6 (= 7 ~a28~0)) (.cse15 (not .cse9)) (.cse5 (= ~a17~0 8))) (or (not (= 1 ~a21~0)) (not (= 0 |old(~a11~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse9 .cse4) (and .cse7 .cse9 (= 9 ~a28~0) .cse10 .cse4) (and .cse0 .cse11 .cse9 .cse12 .cse13 .cse5) (and .cse11 .cse2 .cse8) (not (= 1 |old(~a19~0)|)) (and .cse7 .cse9 .cse10 .cse4 .cse12) (not (= 7 |old(~a28~0)|)) (and .cse6 .cse1 .cse7 .cse10 (not .cse4)) (and .cse2 .cse1 .cse8 .cse13 (not (= ~a28~0 9))) (not (= 0 |old(~a25~0)|)) (and .cse0 .cse14 .cse13 .cse3 .cse4 .cse5) (and .cse0 .cse5 (= ~a19~0 1) (= ~a28~0 7)) (and .cse0 .cse11 .cse13 (= 8 ~a28~0) .cse15 .cse5) (not (= |old(~a17~0)| 8)) (and .cse0 .cse11 .cse6 .cse15 .cse5)))) [2018-11-07 07:08:45,173 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-11-07 07:08:45,173 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-07 07:08:45,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:08:45 BoogieIcfgContainer [2018-11-07 07:08:45,190 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 07:08:45,191 INFO L168 Benchmark]: Toolchain (without parser) took 102680.52 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -679.3 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-11-07 07:08:45,192 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-11-07 07:08:45,193 INFO L168 Benchmark]: CACSL2BoogieTranslator took 709.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-07 07:08:45,193 INFO L168 Benchmark]: Boogie Procedure Inliner took 119.26 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 726.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -811.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. [2018-11-07 07:08:45,194 INFO L168 Benchmark]: Boogie Preprocessor took 96.56 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2018-11-07 07:08:45,195 INFO L168 Benchmark]: RCFGBuilder took 3319.53 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 104.8 MB). Peak memory consumption was 104.8 MB. Max. memory is 7.1 GB. [2018-11-07 07:08:45,195 INFO L168 Benchmark]: TraceAbstraction took 98430.85 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: -17.9 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-11-07 07:08:45,200 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 709.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 119.26 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 726.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -811.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 96.56 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3319.53 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 104.8 MB). Peak memory consumption was 104.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 98430.85 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: -17.9 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 592]: 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) || (!(a28 == a17) && ((!(a28 == 0) && !(a25 == 1)) && a17 == 8) && a19 == 1)) || !(0 == \old(a11))) || ((((7 == a28 && 1 == a11) && 7 == a17) && 1 == a25) && 1 == a19)) || ((9 == a28 && 8 == a17) && 1 == a19)) || ((a19 <= 0 && !(a28 == a17)) && 7 == a17)) || (((a19 <= 0 && 7 == a28) && !(1 == a25)) && 8 == a17)) || ((a25 == 1 && 1 == a19) && ((((!(a28 == 0) && a17 == 8) && a19 == 1) && a21 == 1) || (((!(a28 == 0) && a17 == 8) && a21 == 1) && a25 == 1)) && !(a11 == 1))) || (((a19 <= 0 && ((((!(a28 == 0) && a17 == 8) && a19 == 1) && a21 == 1) || (((!(a28 == 0) && a17 == 8) && a21 == 1) && a25 == 1))) && !(a11 == 1)) && 10 == a28)) || !(1 == \old(a19))) || ((8 == a17 && 1 == a19) && 10 == a28)) || !(7 == \old(a28))) || ((((a19 <= 0 && !(a11 == 1)) && 8 == a28) && !(1 == a25)) && 8 == a17)) || (((7 == a28 && !(a25 == 1)) && 1 == a11) && 8 == a17)) || ((((!(a28 == a17) && !(a25 == 1)) && 7 == a17) && !(a11 == 1)) && !(a28 == 9))) || ((a17 == 8 && a19 == 1) && a28 == 7)) || !(0 == \old(a25))) || !(\old(a17) == 8) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 98.3s OverallTime, 16 OverallIterations, 6 TraceHistogramMax, 68.4s AutomataDifference, 0.0s DeadEndRemovalTime, 7.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 2140 SDtfs, 20286 SDslu, 3968 SDs, 0 SdLazy, 28824 SolverSat, 4054 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 33.7s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 4715 GetRequests, 4394 SyntacticMatches, 21 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3445 ImplicationChecksByTransitivity, 15.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5747occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.5s AbstIntTime, 9 AbstIntIterations, 3 AbstIntStrong, 0.9975382092542596 AbsIntWeakeningRatio, 0.15561959654178675 AbsIntAvgWeakeningVarsNumRemoved, 25.363112391930837 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 916 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 279 PreInvPairs, 401 NumberOfFragments, 1126 HoareAnnotationTreeSize, 279 FomulaSimplifications, 26390 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 20086 FormulaSimplificationTreeSizeReductionInter, 6.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 5508 NumberOfCodeBlocks, 5508 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 7306 ConstructedInterpolants, 0 QuantifiedInterpolants, 11555736 SizeOfPredicates, 20 NumberOfNonLiveVariables, 3713 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 28 InterpolantComputations, 9 PerfectInterpolantSequences, 4996/5672 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...