java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label20_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 12:21:18,691 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 12:21:18,693 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 12:21:18,710 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 12:21:18,711 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 12:21:18,712 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 12:21:18,714 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 12:21:18,717 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 12:21:18,719 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 12:21:18,722 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 12:21:18,723 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 12:21:18,723 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 12:21:18,724 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 12:21:18,728 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 12:21:18,729 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 12:21:18,730 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 12:21:18,731 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 12:21:18,739 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 12:21:18,742 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 12:21:18,744 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 12:21:18,745 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 12:21:18,748 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 12:21:18,753 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 12:21:18,754 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 12:21:18,754 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 12:21:18,755 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 12:21:18,756 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 12:21:18,757 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 12:21:18,757 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 12:21:18,761 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 12:21:18,761 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 12:21:18,762 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 12:21:18,762 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 12:21:18,762 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 12:21:18,763 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 12:21:18,764 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 12:21:18,764 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-10-27 12:21:18,782 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 12:21:18,782 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 12:21:18,783 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 12:21:18,783 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 12:21:18,783 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 12:21:18,784 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 12:21:18,784 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 12:21:18,785 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-27 12:21:18,785 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 12:21:18,785 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 12:21:18,785 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 12:21:18,785 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 12:21:18,786 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 12:21:18,786 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 12:21:18,787 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 12:21:18,788 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 12:21:18,788 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 12:21:18,788 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 12:21:18,788 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 12:21:18,788 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 12:21:18,790 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 12:21:18,790 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 12:21:18,790 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 12:21:18,790 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 12:21:18,791 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 12:21:18,791 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 12:21:18,791 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 12:21:18,791 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 12:21:18,791 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 12:21:18,792 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 12:21:18,792 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 12:21:18,792 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 12:21:18,792 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 12:21:18,792 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 12:21:18,847 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 12:21:18,860 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 12:21:18,865 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 12:21:18,867 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 12:21:18,867 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 12:21:18,868 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label20_true-unreach-call_false-termination.c [2018-10-27 12:21:18,921 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/3b5fb4c95/93ccdfa9f83f4458a80da9f52ba4a854/FLAG1a21fbf1f [2018-10-27 12:21:19,485 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 12:21:19,486 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label20_true-unreach-call_false-termination.c [2018-10-27 12:21:19,497 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/3b5fb4c95/93ccdfa9f83f4458a80da9f52ba4a854/FLAG1a21fbf1f [2018-10-27 12:21:19,514 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/3b5fb4c95/93ccdfa9f83f4458a80da9f52ba4a854 [2018-10-27 12:21:19,525 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 12:21:19,527 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 12:21:19,528 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 12:21:19,528 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 12:21:19,532 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 12:21:19,533 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:21:19" (1/1) ... [2018-10-27 12:21:19,536 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@749149db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:21:19, skipping insertion in model container [2018-10-27 12:21:19,537 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:21:19" (1/1) ... [2018-10-27 12:21:19,548 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 12:21:19,615 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 12:21:20,114 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 12:21:20,119 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 12:21:20,240 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 12:21:20,262 INFO L193 MainTranslator]: Completed translation [2018-10-27 12:21:20,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:21:20 WrapperNode [2018-10-27 12:21:20,263 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 12:21:20,264 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 12:21:20,264 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 12:21:20,264 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 12:21:20,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:21:20" (1/1) ... [2018-10-27 12:21:20,292 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:21:20" (1/1) ... [2018-10-27 12:21:20,449 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 12:21:20,450 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 12:21:20,450 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 12:21:20,450 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 12:21:20,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:21:20" (1/1) ... [2018-10-27 12:21:20,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:21:20" (1/1) ... [2018-10-27 12:21:20,470 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:21:20" (1/1) ... [2018-10-27 12:21:20,471 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:21:20" (1/1) ... [2018-10-27 12:21:20,510 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:21:20" (1/1) ... [2018-10-27 12:21:20,538 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:21:20" (1/1) ... [2018-10-27 12:21:20,549 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:21:20" (1/1) ... [2018-10-27 12:21:20,564 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 12:21:20,570 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 12:21:20,570 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 12:21:20,570 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 12:21:20,571 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:21:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 12:21:20,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 12:21:20,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 12:21:20,654 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-27 12:21:20,654 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-27 12:21:20,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 12:21:20,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 12:21:20,655 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 12:21:20,655 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 12:21:24,019 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 12:21:24,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:21:24 BoogieIcfgContainer [2018-10-27 12:21:24,023 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 12:21:24,024 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 12:21:24,025 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 12:21:24,031 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 12:21:24,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 12:21:19" (1/3) ... [2018-10-27 12:21:24,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18cab0d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:21:24, skipping insertion in model container [2018-10-27 12:21:24,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:21:20" (2/3) ... [2018-10-27 12:21:24,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18cab0d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:21:24, skipping insertion in model container [2018-10-27 12:21:24,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:21:24" (3/3) ... [2018-10-27 12:21:24,036 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label20_true-unreach-call_false-termination.c [2018-10-27 12:21:24,047 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 12:21:24,059 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 12:21:24,077 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 12:21:24,117 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 12:21:24,117 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 12:21:24,117 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 12:21:24,117 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 12:21:24,118 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 12:21:24,118 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 12:21:24,118 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 12:21:24,118 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 12:21:24,156 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-10-27 12:21:24,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-27 12:21:24,171 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:21:24,172 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] [2018-10-27 12:21:24,175 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:21:24,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:21:24,181 INFO L82 PathProgramCache]: Analyzing trace with hash 915772480, now seen corresponding path program 1 times [2018-10-27 12:21:24,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:21:24,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:21:24,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:21:24,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:21:24,233 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:21:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:21:24,788 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 12:21:24,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:21:24,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:21:24,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 12:21:24,946 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:21:24,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 12:21:24,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 12:21:24,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 12:21:24,975 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-10-27 12:21:26,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:21:26,394 INFO L93 Difference]: Finished difference Result 618 states and 1056 transitions. [2018-10-27 12:21:26,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 12:21:26,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2018-10-27 12:21:26,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:21:26,418 INFO L225 Difference]: With dead ends: 618 [2018-10-27 12:21:26,419 INFO L226 Difference]: Without dead ends: 379 [2018-10-27 12:21:26,426 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 12:21:26,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-10-27 12:21:26,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2018-10-27 12:21:26,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-10-27 12:21:26,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 621 transitions. [2018-10-27 12:21:26,516 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 621 transitions. Word has length 106 [2018-10-27 12:21:26,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:21:26,517 INFO L481 AbstractCegarLoop]: Abstraction has 379 states and 621 transitions. [2018-10-27 12:21:26,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 12:21:26,518 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 621 transitions. [2018-10-27 12:21:26,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-27 12:21:26,529 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:21:26,530 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:21:26,530 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:21:26,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:21:26,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1354213973, now seen corresponding path program 1 times [2018-10-27 12:21:26,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:21:26,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:21:26,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:21:26,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:21:26,535 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:21:26,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:21:26,836 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-10-27 12:21:26,917 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:21:26,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:21:26,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 12:21:26,918 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:21:26,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 12:21:26,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 12:21:26,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 12:21:26,921 INFO L87 Difference]: Start difference. First operand 379 states and 621 transitions. Second operand 6 states. [2018-10-27 12:21:28,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:21:28,967 INFO L93 Difference]: Finished difference Result 1229 states and 2094 transitions. [2018-10-27 12:21:28,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 12:21:28,976 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 122 [2018-10-27 12:21:28,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:21:28,992 INFO L225 Difference]: With dead ends: 1229 [2018-10-27 12:21:28,993 INFO L226 Difference]: Without dead ends: 856 [2018-10-27 12:21:29,001 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 12:21:29,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-10-27 12:21:29,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 823. [2018-10-27 12:21:29,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-10-27 12:21:29,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1292 transitions. [2018-10-27 12:21:29,073 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1292 transitions. Word has length 122 [2018-10-27 12:21:29,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:21:29,073 INFO L481 AbstractCegarLoop]: Abstraction has 823 states and 1292 transitions. [2018-10-27 12:21:29,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 12:21:29,074 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1292 transitions. [2018-10-27 12:21:29,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-27 12:21:29,085 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:21:29,085 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] [2018-10-27 12:21:29,086 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:21:29,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:21:29,086 INFO L82 PathProgramCache]: Analyzing trace with hash -796384502, now seen corresponding path program 1 times [2018-10-27 12:21:29,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:21:29,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:21:29,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:21:29,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:21:29,092 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:21:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:21:29,322 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 12:21:29,377 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:21:29,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:21:29,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 12:21:29,378 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:21:29,378 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 12:21:29,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 12:21:29,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 12:21:29,379 INFO L87 Difference]: Start difference. First operand 823 states and 1292 transitions. Second operand 6 states. [2018-10-27 12:21:33,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:21:33,194 INFO L93 Difference]: Finished difference Result 2557 states and 4222 transitions. [2018-10-27 12:21:33,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 12:21:33,197 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2018-10-27 12:21:33,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:21:33,220 INFO L225 Difference]: With dead ends: 2557 [2018-10-27 12:21:33,220 INFO L226 Difference]: Without dead ends: 1740 [2018-10-27 12:21:33,226 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 12:21:33,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1740 states. [2018-10-27 12:21:33,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1740 to 1682. [2018-10-27 12:21:33,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1682 states. [2018-10-27 12:21:33,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2540 transitions. [2018-10-27 12:21:33,320 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2540 transitions. Word has length 129 [2018-10-27 12:21:33,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:21:33,320 INFO L481 AbstractCegarLoop]: Abstraction has 1682 states and 2540 transitions. [2018-10-27 12:21:33,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 12:21:33,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2540 transitions. [2018-10-27 12:21:33,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-27 12:21:33,328 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:21:33,328 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:21:33,329 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:21:33,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:21:33,329 INFO L82 PathProgramCache]: Analyzing trace with hash 80807714, now seen corresponding path program 1 times [2018-10-27 12:21:33,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:21:33,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:21:33,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:21:33,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:21:33,330 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:21:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:21:33,574 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 12:21:33,922 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 12:21:33,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:21:33,923 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:21:33,924 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 132 with the following transitions: [2018-10-27 12:21:33,926 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [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], [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], [519], [521], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 12:21:33,990 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:21:33,991 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:21:34,671 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:21:34,673 INFO L272 AbstractInterpreter]: Visited 107 different actions 107 times. Never merged. Never widened. Never found a fixpoint. Largest state had 38 variables. [2018-10-27 12:21:34,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:21:34,716 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:21:35,276 INFO L227 lantSequenceWeakener]: Weakened 109 states. On average, predicates are now at 81.02% of their original sizes. [2018-10-27 12:21:35,277 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:21:36,429 INFO L415 sIntCurrentIteration]: We unified 130 AI predicates to 130 [2018-10-27 12:21:36,429 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:21:36,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:21:36,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 18 [2018-10-27 12:21:36,431 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:21:36,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-27 12:21:36,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-27 12:21:36,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-10-27 12:21:36,432 INFO L87 Difference]: Start difference. First operand 1682 states and 2540 transitions. Second operand 14 states. [2018-10-27 12:21:53,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:21:53,699 INFO L93 Difference]: Finished difference Result 3656 states and 5500 transitions. [2018-10-27 12:21:53,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-27 12:21:53,699 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 131 [2018-10-27 12:21:53,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:21:53,714 INFO L225 Difference]: With dead ends: 3656 [2018-10-27 12:21:53,714 INFO L226 Difference]: Without dead ends: 1980 [2018-10-27 12:21:53,721 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 143 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=193, Invalid=509, Unknown=0, NotChecked=0, Total=702 [2018-10-27 12:21:53,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1980 states. [2018-10-27 12:21:53,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1980 to 1827. [2018-10-27 12:21:53,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1827 states. [2018-10-27 12:21:53,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1827 states and 2692 transitions. [2018-10-27 12:21:53,780 INFO L78 Accepts]: Start accepts. Automaton has 1827 states and 2692 transitions. Word has length 131 [2018-10-27 12:21:53,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:21:53,782 INFO L481 AbstractCegarLoop]: Abstraction has 1827 states and 2692 transitions. [2018-10-27 12:21:53,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-27 12:21:53,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 2692 transitions. [2018-10-27 12:21:53,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-27 12:21:53,787 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:21:53,788 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2018-10-27 12:21:53,788 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:21:53,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:21:53,789 INFO L82 PathProgramCache]: Analyzing trace with hash -2031058527, now seen corresponding path program 1 times [2018-10-27 12:21:53,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:21:53,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:21:53,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:21:53,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:21:53,793 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:21:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:21:54,042 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 32 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 12:21:54,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:21:54,042 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:21:54,043 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 142 with the following transitions: [2018-10-27 12:21:54,043 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [33], [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], [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], [519], [521], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 12:21:54,048 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:21:54,048 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:21:54,703 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:21:54,703 INFO L272 AbstractInterpreter]: Visited 111 different actions 332 times. Merged at 7 different actions 21 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-10-27 12:21:54,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:21:54,737 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:21:55,004 INFO L227 lantSequenceWeakener]: Weakened 138 states. On average, predicates are now at 80.76% of their original sizes. [2018-10-27 12:21:55,004 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:21:55,258 INFO L415 sIntCurrentIteration]: We unified 140 AI predicates to 140 [2018-10-27 12:21:55,259 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:21:55,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:21:55,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2018-10-27 12:21:55,259 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:21:55,260 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 12:21:55,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 12:21:55,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-10-27 12:21:55,261 INFO L87 Difference]: Start difference. First operand 1827 states and 2692 transitions. Second operand 10 states. [2018-10-27 12:22:04,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:22:04,256 INFO L93 Difference]: Finished difference Result 4463 states and 6600 transitions. [2018-10-27 12:22:04,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-27 12:22:04,256 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 141 [2018-10-27 12:22:04,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:22:04,269 INFO L225 Difference]: With dead ends: 4463 [2018-10-27 12:22:04,269 INFO L226 Difference]: Without dead ends: 2642 [2018-10-27 12:22:04,275 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 149 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-10-27 12:22:04,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2642 states. [2018-10-27 12:22:04,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2642 to 2556. [2018-10-27 12:22:04,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2556 states. [2018-10-27 12:22:04,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2556 states to 2556 states and 3571 transitions. [2018-10-27 12:22:04,346 INFO L78 Accepts]: Start accepts. Automaton has 2556 states and 3571 transitions. Word has length 141 [2018-10-27 12:22:04,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:22:04,346 INFO L481 AbstractCegarLoop]: Abstraction has 2556 states and 3571 transitions. [2018-10-27 12:22:04,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 12:22:04,347 INFO L276 IsEmpty]: Start isEmpty. Operand 2556 states and 3571 transitions. [2018-10-27 12:22:04,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-27 12:22:04,353 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:22:04,354 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] [2018-10-27 12:22:04,354 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:22:04,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:22:04,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1483859631, now seen corresponding path program 1 times [2018-10-27 12:22:04,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:22:04,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:22:04,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:22:04,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:22:04,356 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:22:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:22:04,539 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 12:22:04,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:22:04,540 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:22:04,540 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 144 with the following transitions: [2018-10-27 12:22:04,540 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], [519], [521], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 12:22:04,545 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:22:04,545 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:22:05,041 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 12:22:05,042 INFO L272 AbstractInterpreter]: Visited 111 different actions 330 times. Merged at 7 different actions 21 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-10-27 12:22:05,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:22:05,050 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 12:22:05,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:22:05,050 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 12:22:05,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:22:05,062 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 12:22:05,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:22:05,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 12:22:05,392 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 12:22:05,393 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 12:22:05,543 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 12:22:05,574 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:22:05,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2018-10-27 12:22:05,575 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:22:05,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 12:22:05,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 12:22:05,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-27 12:22:05,576 INFO L87 Difference]: Start difference. First operand 2556 states and 3571 transitions. Second operand 3 states. [2018-10-27 12:22:07,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:22:07,471 INFO L93 Difference]: Finished difference Result 7161 states and 10364 transitions. [2018-10-27 12:22:07,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 12:22:07,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2018-10-27 12:22:07,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:22:07,490 INFO L225 Difference]: With dead ends: 7161 [2018-10-27 12:22:07,491 INFO L226 Difference]: Without dead ends: 3930 [2018-10-27 12:22:07,504 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 288 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-27 12:22:07,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3930 states. [2018-10-27 12:22:07,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3930 to 3914. [2018-10-27 12:22:07,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3914 states. [2018-10-27 12:22:07,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3914 states to 3914 states and 5229 transitions. [2018-10-27 12:22:07,600 INFO L78 Accepts]: Start accepts. Automaton has 3914 states and 5229 transitions. Word has length 143 [2018-10-27 12:22:07,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:22:07,601 INFO L481 AbstractCegarLoop]: Abstraction has 3914 states and 5229 transitions. [2018-10-27 12:22:07,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 12:22:07,601 INFO L276 IsEmpty]: Start isEmpty. Operand 3914 states and 5229 transitions. [2018-10-27 12:22:07,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-27 12:22:07,610 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:22:07,610 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:22:07,611 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:22:07,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:22:07,611 INFO L82 PathProgramCache]: Analyzing trace with hash -793512577, now seen corresponding path program 1 times [2018-10-27 12:22:07,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:22:07,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:22:07,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:22:07,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:22:07,612 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:22:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:22:08,059 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:22:08,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:22:08,059 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:22:08,060 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 157 with the following transitions: [2018-10-27 12:22:08,060 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], [127], [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], [519], [521], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 12:22:08,066 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:22:08,066 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:22:09,162 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 12:22:09,162 INFO L272 AbstractInterpreter]: Visited 111 different actions 433 times. Merged at 7 different actions 24 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 38 variables. [2018-10-27 12:22:09,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:22:09,191 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 12:22:09,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:22:09,191 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 12:22:09,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:22:09,217 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 12:22:09,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:22:09,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 12:22:09,414 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:22:09,414 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 12:22:10,049 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:22:10,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 12:22:10,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2018-10-27 12:22:10,082 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 12:22:10,083 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 12:22:10,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 12:22:10,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-27 12:22:10,084 INFO L87 Difference]: Start difference. First operand 3914 states and 5229 transitions. Second operand 6 states. [2018-10-27 12:22:12,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:22:12,471 INFO L93 Difference]: Finished difference Result 9295 states and 12492 transitions. [2018-10-27 12:22:12,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 12:22:12,480 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 156 [2018-10-27 12:22:12,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:22:12,502 INFO L225 Difference]: With dead ends: 9295 [2018-10-27 12:22:12,503 INFO L226 Difference]: Without dead ends: 5387 [2018-10-27 12:22:12,515 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 313 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-27 12:22:12,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5387 states. [2018-10-27 12:22:12,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5387 to 5220. [2018-10-27 12:22:12,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5220 states. [2018-10-27 12:22:12,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5220 states to 5220 states and 6764 transitions. [2018-10-27 12:22:12,662 INFO L78 Accepts]: Start accepts. Automaton has 5220 states and 6764 transitions. Word has length 156 [2018-10-27 12:22:12,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:22:12,662 INFO L481 AbstractCegarLoop]: Abstraction has 5220 states and 6764 transitions. [2018-10-27 12:22:12,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 12:22:12,662 INFO L276 IsEmpty]: Start isEmpty. Operand 5220 states and 6764 transitions. [2018-10-27 12:22:12,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-27 12:22:12,678 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:22:12,678 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-27 12:22:12,679 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:22:12,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:22:12,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1725689910, now seen corresponding path program 1 times [2018-10-27 12:22:12,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:22:12,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:22:12,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:22:12,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:22:12,681 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:22:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:22:13,117 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 98 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-27 12:22:13,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:22:13,118 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:22:13,118 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 201 with the following transitions: [2018-10-27 12:22:13,118 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [45], [50], [52], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [225], [228], [232], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [519], [521], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 12:22:13,129 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:22:13,129 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:22:13,384 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:22:13,384 INFO L272 AbstractInterpreter]: Visited 111 different actions 218 times. Merged at 5 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-10-27 12:22:13,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:22:13,414 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:22:13,848 INFO L227 lantSequenceWeakener]: Weakened 107 states. On average, predicates are now at 80.71% of their original sizes. [2018-10-27 12:22:13,849 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:22:15,002 INFO L415 sIntCurrentIteration]: We unified 199 AI predicates to 199 [2018-10-27 12:22:15,003 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:22:15,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:22:15,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-10-27 12:22:15,003 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:22:15,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-27 12:22:15,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-27 12:22:15,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-10-27 12:22:15,005 INFO L87 Difference]: Start difference. First operand 5220 states and 6764 transitions. Second operand 18 states. [2018-10-27 12:22:24,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:22:24,933 INFO L93 Difference]: Finished difference Result 10163 states and 12950 transitions. [2018-10-27 12:22:24,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-27 12:22:24,933 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 200 [2018-10-27 12:22:24,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:22:24,956 INFO L225 Difference]: With dead ends: 10163 [2018-10-27 12:22:24,957 INFO L226 Difference]: Without dead ends: 5989 [2018-10-27 12:22:24,968 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 214 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2018-10-27 12:22:24,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5989 states. [2018-10-27 12:22:25,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5989 to 5969. [2018-10-27 12:22:25,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5969 states. [2018-10-27 12:22:25,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5969 states to 5969 states and 7570 transitions. [2018-10-27 12:22:25,106 INFO L78 Accepts]: Start accepts. Automaton has 5969 states and 7570 transitions. Word has length 200 [2018-10-27 12:22:25,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:22:25,107 INFO L481 AbstractCegarLoop]: Abstraction has 5969 states and 7570 transitions. [2018-10-27 12:22:25,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-27 12:22:25,107 INFO L276 IsEmpty]: Start isEmpty. Operand 5969 states and 7570 transitions. [2018-10-27 12:22:25,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-27 12:22:25,127 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:22:25,127 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-27 12:22:25,127 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:22:25,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:22:25,128 INFO L82 PathProgramCache]: Analyzing trace with hash 938174553, now seen corresponding path program 1 times [2018-10-27 12:22:25,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:22:25,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:22:25,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:22:25,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:22:25,129 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:22:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:22:25,383 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 12:22:25,970 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 150 proven. 60 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-27 12:22:25,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:22:25,970 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:22:25,971 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 237 with the following transitions: [2018-10-27 12:22:25,971 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [67], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [127], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [225], [228], [232], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [519], [521], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 12:22:25,973 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:22:25,974 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:22:27,227 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 12:22:27,227 INFO L272 AbstractInterpreter]: Visited 115 different actions 920 times. Merged at 9 different actions 85 times. Widened at 1 different actions 5 times. Found 20 fixpoints after 4 different actions. Largest state had 38 variables. [2018-10-27 12:22:27,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:22:27,238 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 12:22:27,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:22:27,238 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 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-10-27 12:22:27,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:22:27,247 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 12:22:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:22:27,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 12:22:27,731 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 168 proven. 2 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-10-27 12:22:27,731 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 12:22:28,229 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 162 proven. 35 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-27 12:22:28,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 12:22:28,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2018-10-27 12:22:28,252 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 12:22:28,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 12:22:28,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 12:22:28,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-10-27 12:22:28,253 INFO L87 Difference]: Start difference. First operand 5969 states and 7570 transitions. Second operand 11 states. [2018-10-27 12:22:30,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:22:30,265 INFO L93 Difference]: Finished difference Result 13079 states and 16689 transitions. [2018-10-27 12:22:30,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-27 12:22:30,270 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 236 [2018-10-27 12:22:30,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:22:30,309 INFO L225 Difference]: With dead ends: 13079 [2018-10-27 12:22:30,309 INFO L226 Difference]: Without dead ends: 6970 [2018-10-27 12:22:30,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 474 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2018-10-27 12:22:30,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6970 states. [2018-10-27 12:22:30,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6970 to 6838. [2018-10-27 12:22:30,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6838 states. [2018-10-27 12:22:30,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6838 states to 6838 states and 8095 transitions. [2018-10-27 12:22:30,488 INFO L78 Accepts]: Start accepts. Automaton has 6838 states and 8095 transitions. Word has length 236 [2018-10-27 12:22:30,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:22:30,488 INFO L481 AbstractCegarLoop]: Abstraction has 6838 states and 8095 transitions. [2018-10-27 12:22:30,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 12:22:30,489 INFO L276 IsEmpty]: Start isEmpty. Operand 6838 states and 8095 transitions. [2018-10-27 12:22:30,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-10-27 12:22:30,507 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:22:30,508 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-27 12:22:30,508 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:22:30,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:22:30,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1488399591, now seen corresponding path program 1 times [2018-10-27 12:22:30,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:22:30,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:22:30,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:22:30,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:22:30,510 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:22:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:22:30,839 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-10-27 12:22:31,189 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-27 12:22:31,428 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-27 12:22:31,693 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 165 proven. 84 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-27 12:22:31,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:22:31,694 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:22:31,694 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 253 with the following transitions: [2018-10-27 12:22:31,694 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], [190], [191], [195], [199], [210], [214], [218], [222], [225], [228], [232], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [519], [521], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 12:22:31,697 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:22:31,697 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:22:32,317 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 12:22:32,318 INFO L272 AbstractInterpreter]: Visited 113 different actions 451 times. Merged at 8 different actions 34 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 4 different actions. Largest state had 38 variables. [2018-10-27 12:22:32,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:22:32,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 12:22:32,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:22:32,325 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 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-10-27 12:22:32,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:22:32,332 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 12:22:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:22:32,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 12:22:32,590 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 202 proven. 2 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-10-27 12:22:32,591 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 12:22:33,031 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 180 proven. 49 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-27 12:22:33,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 12:22:33,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 5] total 16 [2018-10-27 12:22:33,052 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 12:22:33,053 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-27 12:22:33,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-27 12:22:33,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-10-27 12:22:33,053 INFO L87 Difference]: Start difference. First operand 6838 states and 8095 transitions. Second operand 15 states. [2018-10-27 12:22:36,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:22:36,424 INFO L93 Difference]: Finished difference Result 13528 states and 16310 transitions. [2018-10-27 12:22:36,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-27 12:22:36,426 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 252 [2018-10-27 12:22:36,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:22:36,427 INFO L225 Difference]: With dead ends: 13528 [2018-10-27 12:22:36,427 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 12:22:36,463 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 514 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=264, Invalid=666, Unknown=0, NotChecked=0, Total=930 [2018-10-27 12:22:36,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 12:22:36,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 12:22:36,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 12:22:36,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 12:22:36,464 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 252 [2018-10-27 12:22:36,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:22:36,465 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 12:22:36,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-27 12:22:36,472 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 12:22:36,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 12:22:36,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-27 12:22:36,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:22:36,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:22:36,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:22:36,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:22:36,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:22:36,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:22:36,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:22:36,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:22:36,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:22:36,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:22:36,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:22:36,953 WARN L179 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 161 [2018-10-27 12:22:36,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:22:36,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:22:37,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:22:37,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:22:37,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:22:37,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:22:37,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:22:37,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:22:37,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:22:37,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:22:37,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:22:37,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:22:37,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:22:37,265 WARN L179 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 185 [2018-10-27 12:22:38,101 WARN L179 SmtUtils]: Spent 834.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2018-10-27 12:22:38,640 WARN L179 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 77 [2018-10-27 12:22:39,860 WARN L179 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 292 DAG size of output: 69 [2018-10-27 12:22:40,634 WARN L179 SmtUtils]: Spent 754.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 97 [2018-10-27 12:22:41,310 WARN L179 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 94 [2018-10-27 12:22:41,314 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-27 12:22:41,314 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a28~0)| ~a28~0) (= |old(~a19~0)| ~a19~0) (= ~a11~0 |old(~a11~0)|) (= ~a17~0 |old(~a17~0)|) (= ~a25~0 |old(~a25~0)|)) [2018-10-27 12:22:41,314 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-27 12:22:41,315 INFO L425 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,315 INFO L425 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,315 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,315 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,315 INFO L425 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,315 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-10-27 12:22:41,315 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-10-27 12:22:41,315 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-10-27 12:22:41,315 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-10-27 12:22:41,316 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-10-27 12:22:41,316 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-10-27 12:22:41,316 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-10-27 12:22:41,316 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-10-27 12:22:41,316 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-10-27 12:22:41,316 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-10-27 12:22:41,316 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-10-27 12:22:41,316 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-10-27 12:22:41,316 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-10-27 12:22:41,316 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,316 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,316 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,316 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,316 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-10-27 12:22:41,317 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,317 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-10-27 12:22:41,317 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-10-27 12:22:41,317 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-10-27 12:22:41,317 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-10-27 12:22:41,317 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-10-27 12:22:41,317 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-10-27 12:22:41,317 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-10-27 12:22:41,317 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-10-27 12:22:41,317 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-10-27 12:22:41,317 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-10-27 12:22:41,317 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-10-27 12:22:41,318 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-10-27 12:22:41,318 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-10-27 12:22:41,318 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-10-27 12:22:41,318 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-10-27 12:22:41,318 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,318 INFO L425 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,318 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,318 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,318 INFO L425 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,319 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-10-27 12:22:41,319 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-10-27 12:22:41,319 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-10-27 12:22:41,319 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-10-27 12:22:41,319 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-10-27 12:22:41,319 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-10-27 12:22:41,319 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-10-27 12:22:41,319 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-10-27 12:22:41,320 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-10-27 12:22:41,320 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-10-27 12:22:41,320 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-10-27 12:22:41,320 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,320 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,320 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,320 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,320 INFO L425 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,320 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-10-27 12:22:41,321 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-10-27 12:22:41,321 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-10-27 12:22:41,321 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-10-27 12:22:41,321 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-10-27 12:22:41,321 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-10-27 12:22:41,321 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-10-27 12:22:41,321 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-10-27 12:22:41,321 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-10-27 12:22:41,322 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-10-27 12:22:41,322 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-10-27 12:22:41,322 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-10-27 12:22:41,322 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-10-27 12:22:41,322 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,322 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,325 INFO L425 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,325 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,325 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,325 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-10-27 12:22:41,325 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-10-27 12:22:41,325 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-10-27 12:22:41,326 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-10-27 12:22:41,326 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-10-27 12:22:41,326 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-10-27 12:22:41,326 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-10-27 12:22:41,326 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-10-27 12:22:41,326 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-10-27 12:22:41,326 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-10-27 12:22:41,326 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-10-27 12:22:41,326 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-10-27 12:22:41,327 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-10-27 12:22:41,327 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-10-27 12:22:41,327 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-10-27 12:22:41,327 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-10-27 12:22:41,327 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,327 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,327 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,327 INFO L425 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,327 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-10-27 12:22:41,328 INFO L425 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,328 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-10-27 12:22:41,328 INFO L425 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,328 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-10-27 12:22:41,328 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-10-27 12:22:41,328 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-10-27 12:22:41,328 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,328 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,328 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-10-27 12:22:41,329 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-10-27 12:22:41,329 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-10-27 12:22:41,329 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-10-27 12:22:41,329 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-10-27 12:22:41,329 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-10-27 12:22:41,329 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-10-27 12:22:41,329 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-10-27 12:22:41,329 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-10-27 12:22:41,329 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-10-27 12:22:41,329 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-10-27 12:22:41,330 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,330 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,330 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,330 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,330 INFO L425 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,330 INFO L425 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,330 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-10-27 12:22:41,330 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-10-27 12:22:41,330 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-10-27 12:22:41,330 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-10-27 12:22:41,331 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-10-27 12:22:41,331 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-10-27 12:22:41,331 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-10-27 12:22:41,331 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-10-27 12:22:41,331 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-10-27 12:22:41,331 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-10-27 12:22:41,331 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-10-27 12:22:41,331 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,331 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,332 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,332 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,332 INFO L425 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,332 INFO L425 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,332 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-10-27 12:22:41,332 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-10-27 12:22:41,332 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-10-27 12:22:41,332 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-10-27 12:22:41,332 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-10-27 12:22:41,332 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-10-27 12:22:41,333 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-10-27 12:22:41,333 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-10-27 12:22:41,333 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-10-27 12:22:41,333 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-10-27 12:22:41,333 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-10-27 12:22:41,333 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-10-27 12:22:41,333 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-10-27 12:22:41,333 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-10-27 12:22:41,333 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,333 INFO L425 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,334 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,334 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse13 (= 1 |old(~a25~0)|)) (.cse4 (= ~a11~0 |old(~a11~0)|)) (.cse16 (= |old(~a28~0)| ~a28~0)) (.cse9 (= |old(~a19~0)| ~a19~0)) (.cse10 (= ~a17~0 |old(~a17~0)|)) (.cse11 (= ~a25~0 |old(~a25~0)|))) (let ((.cse3 (= |old(~a11~0)| |old(~a19~0)|)) (.cse1 (and .cse4 .cse16 .cse9 .cse10 .cse11)) (.cse5 (<= 10 ~a28~0)) (.cse6 (<= ~a28~0 10)) (.cse8 (< |old(~a28~0)| 10)) (.cse0 (not .cse13)) (.cse12 (= 7 ~a17~0)) (.cse14 (not (= 7 |old(~a17~0)|))) (.cse7 (< 10 |old(~a28~0)|)) (.cse15 (= 10 |old(~a28~0)|)) (.cse2 (not (= |old(~a17~0)| 8)))) (and (or .cse0 .cse1 .cse2 .cse3) (or (< 6 |calculate_output_#in~input|) (not (= 1 ~a21~0)) (and .cse4 .cse5 .cse6 (= |old(~a25~0)| ~a25~0) (= ~a17~0 8) (= ~a19~0 1)) (< |old(~a25~0)| 0) .cse7 (not (= 1 |old(~a19~0)|)) (< 1 |old(~a25~0)|) .cse8 (not (= 8 |old(~a17~0)|)) (< |calculate_output_#in~input| 1)) (or .cse7 .cse0 (and .cse9 .cse4 .cse5 .cse10 .cse6 .cse11) .cse8 .cse2) (or .cse7 .cse2 .cse3 .cse1) (or .cse7 (and .cse9 .cse4 .cse5 .cse12 .cse6 .cse11) .cse8 .cse13 .cse14) (or .cse7 .cse0 .cse15 (and .cse16 .cse9 .cse4 .cse12 .cse11) .cse14) (or .cse7 .cse15 .cse2 (and .cse16 .cse9 .cse4 .cse10 .cse11))))) [2018-10-27 12:22:41,334 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,334 INFO L425 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,334 INFO L425 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,334 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-10-27 12:22:41,335 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-10-27 12:22:41,335 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-10-27 12:22:41,335 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-10-27 12:22:41,335 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-10-27 12:22:41,335 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-10-27 12:22:41,335 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-10-27 12:22:41,335 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-10-27 12:22:41,335 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-10-27 12:22:41,335 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-10-27 12:22:41,336 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 469) no Hoare annotation was computed. [2018-10-27 12:22:41,336 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-10-27 12:22:41,336 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-10-27 12:22:41,336 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-10-27 12:22:41,336 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,336 INFO L425 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,336 INFO L425 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,336 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,336 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,337 INFO L425 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,337 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-10-27 12:22:41,337 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-10-27 12:22:41,337 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-10-27 12:22:41,337 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-10-27 12:22:41,337 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-10-27 12:22:41,337 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-10-27 12:22:41,337 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-10-27 12:22:41,338 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-10-27 12:22:41,338 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-10-27 12:22:41,338 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-10-27 12:22:41,338 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-10-27 12:22:41,338 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-10-27 12:22:41,338 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-10-27 12:22:41,338 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-10-27 12:22:41,338 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-10-27 12:22:41,338 INFO L425 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-10-27 12:22:41,338 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,339 INFO L425 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,339 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,339 INFO L425 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,339 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:22:41,339 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-10-27 12:22:41,339 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-10-27 12:22:41,339 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-10-27 12:22:41,339 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-10-27 12:22:41,339 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-10-27 12:22:41,340 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-10-27 12:22:41,340 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-10-27 12:22:41,340 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-10-27 12:22:41,340 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-10-27 12:22:41,340 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-10-27 12:22:41,340 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-10-27 12:22:41,340 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-10-27 12:22:41,340 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-10-27 12:22:41,340 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-10-27 12:22:41,340 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-10-27 12:22:41,341 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-10-27 12:22:41,341 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-10-27 12:22:41,341 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-10-27 12:22:41,341 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-10-27 12:22:41,341 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-27 12:22:41,341 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~z~0 26) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a~0 1) (= ~a19~0 1) (= ~a28~0 7)) [2018-10-27 12:22:41,341 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-27 12:22:41,341 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-27 12:22:41,342 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (and (= ~a19~0 1) (= ~a25~0 |old(~a25~0)|) (= ~a11~0 |old(~a11~0)|) (= |old(~a28~0)| ~a28~0) (= ~a17~0 8)) (not (= |old(~a11~0)| 0)) (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= ~a21~0 1)) (not (= ~y~0 25)) (not (= 3 ~c~0)) (not (= |old(~a25~0)| 0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= 8 |old(~a17~0)|)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-10-27 12:22:41,342 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-10-27 12:22:41,342 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse2 (not (= ~a19~0 ~a11~0))) (.cse0 (= |old(~a17~0)| ~a17~0)) (.cse4 (= 7 ~a17~0)) (.cse5 (= 1 ~a25~0)) (.cse1 (<= ~a28~0 10)) (.cse3 (not (= ~a28~0 10)))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse3) (and (<= 10 ~a28~0) (not (= ~a25~0 1)) .cse4 .cse1) (not (= ~a21~0 1)) (not (= ~y~0 25)) (and .cse0 .cse5 .cse2) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (and .cse0 .cse5 .cse1) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (and (<= 0 ~a25~0) .cse1 (= ~a17~0 8) (= ~a19~0 1) (<= ~a25~0 1)) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (and .cse4 .cse5 .cse1 .cse3) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0)))) [2018-10-27 12:22:41,342 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-10-27 12:22:41,342 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-10-27 12:22:41,343 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse2 (not (= ~a19~0 ~a11~0))) (.cse0 (= |old(~a17~0)| ~a17~0)) (.cse4 (= 7 ~a17~0)) (.cse5 (= 1 ~a25~0)) (.cse1 (<= ~a28~0 10)) (.cse3 (not (= ~a28~0 10)))) (or (and .cse0 .cse1 .cse2) (and (<= 1 main_~input~0) (<= main_~input~0 6) .cse1 (<= ~a25~0 1) (<= 0 ~a25~0) (= ~a17~0 8) (= ~a19~0 1)) (and .cse0 .cse1 .cse3) (and (<= 10 ~a28~0) (not (= ~a25~0 1)) .cse4 .cse1) (not (= ~a21~0 1)) (not (= ~y~0 25)) (and .cse0 .cse5 .cse2) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (and .cse0 .cse5 .cse1) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (and .cse4 .cse5 .cse1 .cse3) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0)))) [2018-10-27 12:22:41,343 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-10-27 12:22:41,343 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-10-27 12:22:41,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 12:22:41 BoogieIcfgContainer [2018-10-27 12:22:41,358 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 12:22:41,359 INFO L168 Benchmark]: Toolchain (without parser) took 81833.38 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.5 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-10-27 12:22:41,360 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 12:22:41,361 INFO L168 Benchmark]: CACSL2BoogieTranslator took 735.65 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-10-27 12:22:41,362 INFO L168 Benchmark]: Boogie Procedure Inliner took 185.52 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 729.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -802.1 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2018-10-27 12:22:41,362 INFO L168 Benchmark]: Boogie Preprocessor took 114.44 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 12:22:41,363 INFO L168 Benchmark]: RCFGBuilder took 3453.58 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 105.8 MB). Peak memory consumption was 105.8 MB. Max. memory is 7.1 GB. [2018-10-27 12:22:41,364 INFO L168 Benchmark]: TraceAbstraction took 77333.90 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-10-27 12:22:41,368 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.17 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 735.65 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 185.52 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 729.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -802.1 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 114.44 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3453.58 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 105.8 MB). Peak memory consumption was 105.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 77333.90 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 469]: 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: ((((((((((((((((((((((((\old(a17) == a17 && a28 <= 10) && !(a19 == a11)) || ((\old(a17) == a17 && a28 <= 10) && !(a28 == 10))) || (((10 <= a28 && !(a25 == 1)) && 7 == a17) && a28 <= 10)) || !(a21 == 1)) || !(y == 25)) || ((\old(a17) == a17 && 1 == a25) && !(a19 == a11))) || !(1 == \old(a19))) || !(x == 24)) || !(e == 5)) || !(d == 4)) || ((\old(a17) == a17 && 1 == a25) && a28 <= 10)) || !(21 == u)) || !(22 == v)) || !(\old(a11) == 0)) || ((((0 <= a25 && a28 <= 10) && a17 == 8) && a19 == 1) && a25 <= 1)) || !(z == 26)) || !(0 == \old(a25))) || (((7 == a17 && 1 == a25) && a28 <= 10) && !(a28 == 10))) || !(3 == c)) || !(23 == w)) || !(\old(a28) == 7)) || !(a == 1)) || !(\old(a17) == 8)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 77.2s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 53.5s AutomataDifference, 0.0s DeadEndRemovalTime, 4.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 1815 SDtfs, 11727 SDslu, 2689 SDs, 0 SdLazy, 12939 SolverSat, 2265 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.0s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 2189 GetRequests, 2028 SyntacticMatches, 14 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 712 ImplicationChecksByTransitivity, 8.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6838occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 5.3s AbstIntTime, 7 AbstIntIterations, 3 AbstIntStrong, 0.99678000284422 AbsIntWeakeningRatio, 0.24733475479744135 AbsIntAvgWeakeningVarsNumRemoved, 24.916844349680172 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 10 MinimizatonAttempts, 665 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 204 PreInvPairs, 296 NumberOfFragments, 716 HoareAnnotationTreeSize, 204 FomulaSimplifications, 8451 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 7 FomulaSimplificationsInter, 9457 FormulaSimplificationTreeSizeReductionInter, 4.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 2403 NumberOfCodeBlocks, 2403 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 3172 ConstructedInterpolants, 0 QuantifiedInterpolants, 1210267 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2007 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 18 InterpolantComputations, 5 PerfectInterpolantSequences, 1787/2070 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...