java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label11_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:09:11,678 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:09:11,681 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:09:11,694 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:09:11,695 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:09:11,696 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:09:11,697 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:09:11,698 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:09:11,700 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:09:11,701 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:09:11,702 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:09:11,702 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:09:11,703 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:09:11,704 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:09:11,705 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:09:11,706 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:09:11,707 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:09:11,708 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:09:11,710 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:09:11,712 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:09:11,713 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:09:11,714 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:09:11,717 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:09:11,717 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:09:11,717 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:09:11,718 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:09:11,719 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:09:11,720 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:09:11,721 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:09:11,722 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:09:11,722 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:09:11,723 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:09:11,723 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:09:11,723 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:09:11,724 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:09:11,725 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:09:11,725 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-27 06:09:11,743 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:09:11,743 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:09:11,744 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 06:09:11,744 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 06:09:11,745 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 06:09:11,745 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 06:09:11,745 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-27 06:09:11,745 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 06:09:11,745 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-27 06:09:11,746 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 06:09:11,746 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 06:09:11,748 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 06:09:11,748 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 06:09:11,748 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 06:09:11,749 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:09:11,749 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:09:11,749 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:09:11,750 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 06:09:11,750 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 06:09:11,750 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 06:09:11,750 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:09:11,750 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 06:09:11,751 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:09:11,753 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:09:11,753 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 06:09:11,753 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 06:09:11,753 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 06:09:11,754 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:09:11,754 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 06:09:11,754 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 06:09:11,754 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 06:09:11,754 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 06:09:11,755 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 06:09:11,755 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 06:09:11,755 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 06:09:11,755 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 06:09:11,824 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:09:11,846 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:09:11,850 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:09:11,852 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:09:11,852 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:09:11,853 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label11_true-unreach-call_false-termination.c [2018-10-27 06:09:11,918 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4dd17293e/d8e9229a105b4dd8b42080ecc202b233/FLAG701ae2709 [2018-10-27 06:09:12,485 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:09:12,486 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label11_true-unreach-call_false-termination.c [2018-10-27 06:09:12,510 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4dd17293e/d8e9229a105b4dd8b42080ecc202b233/FLAG701ae2709 [2018-10-27 06:09:12,532 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4dd17293e/d8e9229a105b4dd8b42080ecc202b233 [2018-10-27 06:09:12,545 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:09:12,546 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 06:09:12,548 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:09:12,548 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:09:12,552 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:09:12,553 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:09:12" (1/1) ... [2018-10-27 06:09:12,556 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7173708b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:12, skipping insertion in model container [2018-10-27 06:09:12,557 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:09:12" (1/1) ... [2018-10-27 06:09:12,567 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:09:12,643 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:09:13,147 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:09:13,151 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:09:13,262 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:09:13,281 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:09:13,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:13 WrapperNode [2018-10-27 06:09:13,281 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:09:13,282 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:09:13,283 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:09:13,284 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:09:13,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:13" (1/1) ... [2018-10-27 06:09:13,313 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:13" (1/1) ... [2018-10-27 06:09:13,468 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:09:13,469 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:09:13,469 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:09:13,469 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:09:13,478 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:13" (1/1) ... [2018-10-27 06:09:13,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:13" (1/1) ... [2018-10-27 06:09:13,483 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:13" (1/1) ... [2018-10-27 06:09:13,484 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:13" (1/1) ... [2018-10-27 06:09:13,523 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:13" (1/1) ... [2018-10-27 06:09:13,546 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:13" (1/1) ... [2018-10-27 06:09:13,559 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:13" (1/1) ... [2018-10-27 06:09:13,567 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:09:13,568 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:09:13,568 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:09:13,568 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:09:13,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:13" (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 06:09:13,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 06:09:13,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 06:09:13,644 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-27 06:09:13,644 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-27 06:09:13,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:09:13,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:09:13,645 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 06:09:13,645 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 06:09:17,092 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:09:17,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:09:17 BoogieIcfgContainer [2018-10-27 06:09:17,093 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:09:17,096 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 06:09:17,096 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 06:09:17,100 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 06:09:17,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 06:09:12" (1/3) ... [2018-10-27 06:09:17,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be17c92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 06:09:17, skipping insertion in model container [2018-10-27 06:09:17,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:13" (2/3) ... [2018-10-27 06:09:17,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be17c92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 06:09:17, skipping insertion in model container [2018-10-27 06:09:17,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:09:17" (3/3) ... [2018-10-27 06:09:17,105 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label11_true-unreach-call_false-termination.c [2018-10-27 06:09:17,117 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 06:09:17,131 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 06:09:17,149 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 06:09:17,186 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 06:09:17,187 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 06:09:17,187 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 06:09:17,187 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:09:17,187 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:09:17,188 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 06:09:17,188 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:09:17,188 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 06:09:17,217 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-10-27 06:09:17,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-27 06:09:17,231 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:09:17,232 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:17,235 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:09:17,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:17,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1894719720, now seen corresponding path program 1 times [2018-10-27 06:09:17,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:09:17,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:17,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:17,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:17,296 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:09:17,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:17,880 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 06:09:18,161 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 06:09:18,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:09:18,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:09:18,165 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:09:18,172 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 06:09:18,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:09:18,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:09:18,193 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-10-27 06:09:19,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:19,795 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-10-27 06:09:19,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:09:19,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2018-10-27 06:09:19,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:09:19,827 INFO L225 Difference]: With dead ends: 550 [2018-10-27 06:09:19,827 INFO L226 Difference]: Without dead ends: 340 [2018-10-27 06:09:19,840 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 06:09:19,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-27 06:09:19,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-10-27 06:09:19,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-27 06:09:19,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 562 transitions. [2018-10-27 06:09:19,939 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 562 transitions. Word has length 116 [2018-10-27 06:09:19,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:09:19,940 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 562 transitions. [2018-10-27 06:09:19,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 06:09:19,940 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 562 transitions. [2018-10-27 06:09:19,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-27 06:09:19,953 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:09:19,955 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:19,955 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:09:19,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:19,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1844932745, now seen corresponding path program 1 times [2018-10-27 06:09:19,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:09:19,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:19,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:19,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:19,959 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:09:19,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:20,183 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:20,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:09:20,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 06:09:20,184 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:09:20,186 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 06:09:20,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 06:09:20,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 06:09:20,187 INFO L87 Difference]: Start difference. First operand 340 states and 562 transitions. Second operand 6 states. [2018-10-27 06:09:22,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:22,218 INFO L93 Difference]: Finished difference Result 888 states and 1491 transitions. [2018-10-27 06:09:22,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 06:09:22,219 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-10-27 06:09:22,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:09:22,225 INFO L225 Difference]: With dead ends: 888 [2018-10-27 06:09:22,225 INFO L226 Difference]: Without dead ends: 554 [2018-10-27 06:09:22,229 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 06:09:22,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-10-27 06:09:22,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 539. [2018-10-27 06:09:22,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-10-27 06:09:22,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 827 transitions. [2018-10-27 06:09:22,266 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 827 transitions. Word has length 127 [2018-10-27 06:09:22,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:09:22,266 INFO L481 AbstractCegarLoop]: Abstraction has 539 states and 827 transitions. [2018-10-27 06:09:22,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 06:09:22,267 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 827 transitions. [2018-10-27 06:09:22,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-27 06:09:22,271 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:09:22,272 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:22,272 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:09:22,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:22,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1950525493, now seen corresponding path program 1 times [2018-10-27 06:09:22,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:09:22,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:22,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:22,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:22,274 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:09:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:22,745 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-27 06:09:22,883 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:22,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:09:22,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:09:22,884 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:09:22,885 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 06:09:22,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:09:22,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:09:22,886 INFO L87 Difference]: Start difference. First operand 539 states and 827 transitions. Second operand 5 states. [2018-10-27 06:09:24,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:24,858 INFO L93 Difference]: Finished difference Result 1210 states and 1896 transitions. [2018-10-27 06:09:24,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:09:24,859 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2018-10-27 06:09:24,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:09:24,868 INFO L225 Difference]: With dead ends: 1210 [2018-10-27 06:09:24,868 INFO L226 Difference]: Without dead ends: 536 [2018-10-27 06:09:24,871 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:09:24,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-10-27 06:09:24,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2018-10-27 06:09:24,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-10-27 06:09:24,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 787 transitions. [2018-10-27 06:09:24,915 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 787 transitions. Word has length 128 [2018-10-27 06:09:24,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:09:24,916 INFO L481 AbstractCegarLoop]: Abstraction has 536 states and 787 transitions. [2018-10-27 06:09:24,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 06:09:24,916 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 787 transitions. [2018-10-27 06:09:24,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-27 06:09:24,921 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:09:24,921 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:24,921 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:09:24,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:24,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1220128141, now seen corresponding path program 1 times [2018-10-27 06:09:24,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:09:24,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:24,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:24,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:24,923 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:09:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:25,377 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2018-10-27 06:09:25,531 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:25,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:09:25,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:09:25,532 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:09:25,532 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 06:09:25,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:09:25,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:09:25,533 INFO L87 Difference]: Start difference. First operand 536 states and 787 transitions. Second operand 5 states. [2018-10-27 06:09:27,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:27,402 INFO L93 Difference]: Finished difference Result 1204 states and 1799 transitions. [2018-10-27 06:09:27,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:09:27,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2018-10-27 06:09:27,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:09:27,406 INFO L225 Difference]: With dead ends: 1204 [2018-10-27 06:09:27,407 INFO L226 Difference]: Without dead ends: 535 [2018-10-27 06:09:27,409 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:09:27,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-10-27 06:09:27,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2018-10-27 06:09:27,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-10-27 06:09:27,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 782 transitions. [2018-10-27 06:09:27,426 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 782 transitions. Word has length 129 [2018-10-27 06:09:27,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:09:27,426 INFO L481 AbstractCegarLoop]: Abstraction has 535 states and 782 transitions. [2018-10-27 06:09:27,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 06:09:27,426 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 782 transitions. [2018-10-27 06:09:27,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-27 06:09:27,429 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:09:27,429 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:27,429 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:09:27,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:27,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1858048063, now seen corresponding path program 1 times [2018-10-27 06:09:27,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:09:27,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:27,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:27,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:27,431 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:09:27,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:27,791 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:27,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:09:27,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:09:27,791 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:09:27,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 06:09:27,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:09:27,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:09:27,793 INFO L87 Difference]: Start difference. First operand 535 states and 782 transitions. Second operand 3 states. [2018-10-27 06:09:28,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:28,799 INFO L93 Difference]: Finished difference Result 1521 states and 2300 transitions. [2018-10-27 06:09:28,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:09:28,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2018-10-27 06:09:28,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:09:28,814 INFO L225 Difference]: With dead ends: 1521 [2018-10-27 06:09:28,814 INFO L226 Difference]: Without dead ends: 992 [2018-10-27 06:09:28,817 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:09:28,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-10-27 06:09:28,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 992. [2018-10-27 06:09:28,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2018-10-27 06:09:28,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1411 transitions. [2018-10-27 06:09:28,856 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1411 transitions. Word has length 134 [2018-10-27 06:09:28,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:09:28,858 INFO L481 AbstractCegarLoop]: Abstraction has 992 states and 1411 transitions. [2018-10-27 06:09:28,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 06:09:28,858 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1411 transitions. [2018-10-27 06:09:28,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-27 06:09:28,862 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:09:28,862 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:28,863 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:09:28,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:28,863 INFO L82 PathProgramCache]: Analyzing trace with hash -865633433, now seen corresponding path program 1 times [2018-10-27 06:09:28,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:09:28,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:28,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:28,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:28,865 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:09:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:29,066 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:29,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:09:29,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 06:09:29,067 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:09:29,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 06:09:29,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 06:09:29,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 06:09:29,068 INFO L87 Difference]: Start difference. First operand 992 states and 1411 transitions. Second operand 6 states. [2018-10-27 06:09:30,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:30,237 INFO L93 Difference]: Finished difference Result 2947 states and 4374 transitions. [2018-10-27 06:09:30,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 06:09:30,247 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2018-10-27 06:09:30,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:09:30,261 INFO L225 Difference]: With dead ends: 2947 [2018-10-27 06:09:30,262 INFO L226 Difference]: Without dead ends: 1961 [2018-10-27 06:09:30,270 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 06:09:30,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2018-10-27 06:09:30,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1928. [2018-10-27 06:09:30,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2018-10-27 06:09:30,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2554 transitions. [2018-10-27 06:09:30,352 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2554 transitions. Word has length 135 [2018-10-27 06:09:30,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:09:30,353 INFO L481 AbstractCegarLoop]: Abstraction has 1928 states and 2554 transitions. [2018-10-27 06:09:30,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 06:09:30,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2554 transitions. [2018-10-27 06:09:30,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-27 06:09:30,362 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:09:30,362 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:30,362 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:09:30,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:30,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1578661412, now seen corresponding path program 1 times [2018-10-27 06:09:30,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:09:30,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:30,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:30,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:30,368 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:09:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:30,828 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 43 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:30,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:30,829 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 06:09:30,830 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 152 with the following transitions: [2018-10-27 06:09:30,832 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 06:09:30,888 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 06:09:30,890 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 06:09:31,552 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 06:09:31,554 INFO L272 AbstractInterpreter]: Visited 117 different actions 117 times. Never merged. Never widened. Never found a fixpoint. Largest state had 42 variables. [2018-10-27 06:09:31,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:31,599 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 06:09:32,191 INFO L227 lantSequenceWeakener]: Weakened 142 states. On average, predicates are now at 80.44% of their original sizes. [2018-10-27 06:09:32,192 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 06:09:32,451 INFO L415 sIntCurrentIteration]: We unified 150 AI predicates to 150 [2018-10-27 06:09:32,452 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 06:09:32,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 06:09:32,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-27 06:09:32,453 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:09:32,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 06:09:32,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 06:09:32,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 06:09:32,454 INFO L87 Difference]: Start difference. First operand 1928 states and 2554 transitions. Second operand 6 states. [2018-10-27 06:09:39,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:39,811 INFO L93 Difference]: Finished difference Result 3988 states and 5280 transitions. [2018-10-27 06:09:39,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 06:09:39,811 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 151 [2018-10-27 06:09:39,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:09:39,821 INFO L225 Difference]: With dead ends: 3988 [2018-10-27 06:09:39,821 INFO L226 Difference]: Without dead ends: 2066 [2018-10-27 06:09:39,828 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 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 06:09:39,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states. [2018-10-27 06:09:39,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 2064. [2018-10-27 06:09:39,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2064 states. [2018-10-27 06:09:39,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2064 states to 2064 states and 2696 transitions. [2018-10-27 06:09:39,889 INFO L78 Accepts]: Start accepts. Automaton has 2064 states and 2696 transitions. Word has length 151 [2018-10-27 06:09:39,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:09:39,890 INFO L481 AbstractCegarLoop]: Abstraction has 2064 states and 2696 transitions. [2018-10-27 06:09:39,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 06:09:39,890 INFO L276 IsEmpty]: Start isEmpty. Operand 2064 states and 2696 transitions. [2018-10-27 06:09:39,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-27 06:09:39,898 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:09:39,898 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:09:39,899 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:09:39,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:39,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1993472409, now seen corresponding path program 1 times [2018-10-27 06:09:39,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:09:39,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:39,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:39,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:39,901 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:09:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:40,397 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-27 06:09:40,581 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 47 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 06:09:40,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:40,582 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 06:09:40,582 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 161 with the following transitions: [2018-10-27 06:09:40,583 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 06:09:40,589 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 06:09:40,589 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 06:09:40,840 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 06:09:40,840 INFO L272 AbstractInterpreter]: Visited 121 different actions 236 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-27 06:09:40,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:40,878 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 06:09:41,171 INFO L227 lantSequenceWeakener]: Weakened 157 states. On average, predicates are now at 81.84% of their original sizes. [2018-10-27 06:09:41,172 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 06:09:41,491 INFO L415 sIntCurrentIteration]: We unified 159 AI predicates to 159 [2018-10-27 06:09:41,491 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 06:09:41,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 06:09:41,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-10-27 06:09:41,492 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:09:41,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 06:09:41,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 06:09:41,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:09:41,493 INFO L87 Difference]: Start difference. First operand 2064 states and 2696 transitions. Second operand 10 states. [2018-10-27 06:09:47,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:47,906 INFO L93 Difference]: Finished difference Result 4127 states and 5425 transitions. [2018-10-27 06:09:47,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 06:09:47,906 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 160 [2018-10-27 06:09:47,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:09:47,916 INFO L225 Difference]: With dead ends: 4127 [2018-10-27 06:09:47,917 INFO L226 Difference]: Without dead ends: 2205 [2018-10-27 06:09:47,924 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 167 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-10-27 06:09:47,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2205 states. [2018-10-27 06:09:47,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2205 to 2202. [2018-10-27 06:09:47,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2202 states. [2018-10-27 06:09:47,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 2844 transitions. [2018-10-27 06:09:47,990 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 2844 transitions. Word has length 160 [2018-10-27 06:09:47,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:09:47,990 INFO L481 AbstractCegarLoop]: Abstraction has 2202 states and 2844 transitions. [2018-10-27 06:09:47,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 06:09:47,991 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 2844 transitions. [2018-10-27 06:09:47,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-27 06:09:47,999 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:09:47,999 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:09:48,000 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:09:48,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:48,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1610890117, now seen corresponding path program 1 times [2018-10-27 06:09:48,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:09:48,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:48,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:48,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:48,002 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:09:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:48,227 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 87 proven. 15 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-27 06:09:48,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:48,227 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 06:09:48,228 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 194 with the following transitions: [2018-10-27 06:09:48,228 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 06:09:48,235 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 06:09:48,235 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 06:09:48,412 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 06:09:48,412 INFO L272 AbstractInterpreter]: Visited 121 different actions 236 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-27 06:09:48,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:48,419 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 06:09:48,817 INFO L227 lantSequenceWeakener]: Weakened 190 states. On average, predicates are now at 81.8% of their original sizes. [2018-10-27 06:09:48,817 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 06:09:48,980 INFO L415 sIntCurrentIteration]: We unified 192 AI predicates to 192 [2018-10-27 06:09:48,981 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 06:09:48,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 06:09:48,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-10-27 06:09:48,981 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:09:48,982 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 06:09:48,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 06:09:48,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:09:48,983 INFO L87 Difference]: Start difference. First operand 2202 states and 2844 transitions. Second operand 10 states. [2018-10-27 06:09:53,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:53,404 INFO L93 Difference]: Finished difference Result 4541 states and 5909 transitions. [2018-10-27 06:09:53,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-27 06:09:53,405 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 193 [2018-10-27 06:09:53,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:09:53,416 INFO L225 Difference]: With dead ends: 4541 [2018-10-27 06:09:53,416 INFO L226 Difference]: Without dead ends: 2619 [2018-10-27 06:09:53,423 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 201 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-10-27 06:09:53,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2619 states. [2018-10-27 06:09:53,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2619 to 2616. [2018-10-27 06:09:53,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2616 states. [2018-10-27 06:09:53,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2616 states to 2616 states and 3280 transitions. [2018-10-27 06:09:53,490 INFO L78 Accepts]: Start accepts. Automaton has 2616 states and 3280 transitions. Word has length 193 [2018-10-27 06:09:53,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:09:53,490 INFO L481 AbstractCegarLoop]: Abstraction has 2616 states and 3280 transitions. [2018-10-27 06:09:53,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 06:09:53,491 INFO L276 IsEmpty]: Start isEmpty. Operand 2616 states and 3280 transitions. [2018-10-27 06:09:53,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-27 06:09:53,501 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:09:53,501 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:09:53,501 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:09:53,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:53,502 INFO L82 PathProgramCache]: Analyzing trace with hash 281194242, now seen corresponding path program 1 times [2018-10-27 06:09:53,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:09:53,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:53,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:53,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:53,504 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:09:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:54,013 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 85 proven. 39 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-27 06:09:54,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:54,013 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 06:09:54,014 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 203 with the following transitions: [2018-10-27 06:09:54,014 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 06:09:54,019 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 06:09:54,020 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 06:09:54,573 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 06:09:54,574 INFO L272 AbstractInterpreter]: Visited 123 different actions 490 times. Merged at 9 different actions 34 times. Never widened. Found 8 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-27 06:09:54,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:54,611 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 06:09:54,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:54,611 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 06:09:54,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:54,627 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 06:09:54,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:54,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:55,059 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 103 proven. 2 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-10-27 06:09:55,059 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 06:09:55,333 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-27 06:09:56,056 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 91 proven. 31 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-27 06:09:56,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 06:09:56,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-10-27 06:09:56,080 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 06:09:56,081 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 06:09:56,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 06:09:56,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-10-27 06:09:56,082 INFO L87 Difference]: Start difference. First operand 2616 states and 3280 transitions. Second operand 11 states. [2018-10-27 06:10:00,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:00,560 INFO L93 Difference]: Finished difference Result 8945 states and 12125 transitions. [2018-10-27 06:10:00,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 06:10:00,568 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 202 [2018-10-27 06:10:00,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:10:00,598 INFO L225 Difference]: With dead ends: 8945 [2018-10-27 06:10:00,599 INFO L226 Difference]: Without dead ends: 6885 [2018-10-27 06:10:00,614 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 407 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2018-10-27 06:10:00,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6885 states. [2018-10-27 06:10:00,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6885 to 6812. [2018-10-27 06:10:00,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6812 states. [2018-10-27 06:10:00,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6812 states to 6812 states and 8588 transitions. [2018-10-27 06:10:00,803 INFO L78 Accepts]: Start accepts. Automaton has 6812 states and 8588 transitions. Word has length 202 [2018-10-27 06:10:00,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:10:00,803 INFO L481 AbstractCegarLoop]: Abstraction has 6812 states and 8588 transitions. [2018-10-27 06:10:00,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 06:10:00,803 INFO L276 IsEmpty]: Start isEmpty. Operand 6812 states and 8588 transitions. [2018-10-27 06:10:00,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-27 06:10:00,822 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:10:00,822 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:10:00,822 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:10:00,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:00,823 INFO L82 PathProgramCache]: Analyzing trace with hash 425931920, now seen corresponding path program 1 times [2018-10-27 06:10:00,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:10:00,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:00,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:00,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:00,824 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:10:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:01,375 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-27 06:10:01,551 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 131 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-27 06:10:01,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:10:01,552 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 06:10:01,552 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 212 with the following transitions: [2018-10-27 06:10:01,553 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [173], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 06:10:01,558 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 06:10:01,558 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 06:10:02,022 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 06:10:02,023 INFO L272 AbstractInterpreter]: Visited 122 different actions 358 times. Merged at 7 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 42 variables. [2018-10-27 06:10:02,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:02,058 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 06:10:02,619 INFO L227 lantSequenceWeakener]: Weakened 208 states. On average, predicates are now at 83.43% of their original sizes. [2018-10-27 06:10:02,620 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 06:10:03,414 INFO L415 sIntCurrentIteration]: We unified 210 AI predicates to 210 [2018-10-27 06:10:03,414 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 06:10:03,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 06:10:03,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-10-27 06:10:03,415 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:10:03,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 06:10:03,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 06:10:03,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:10:03,416 INFO L87 Difference]: Start difference. First operand 6812 states and 8588 transitions. Second operand 10 states. [2018-10-27 06:10:10,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:10,340 INFO L93 Difference]: Finished difference Result 13623 states and 17295 transitions. [2018-10-27 06:10:10,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 06:10:10,340 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 211 [2018-10-27 06:10:10,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:10:10,373 INFO L225 Difference]: With dead ends: 13623 [2018-10-27 06:10:10,373 INFO L226 Difference]: Without dead ends: 7505 [2018-10-27 06:10:10,396 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 218 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-10-27 06:10:10,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7505 states. [2018-10-27 06:10:10,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7505 to 7500. [2018-10-27 06:10:10,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7500 states. [2018-10-27 06:10:10,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7500 states to 7500 states and 9359 transitions. [2018-10-27 06:10:10,628 INFO L78 Accepts]: Start accepts. Automaton has 7500 states and 9359 transitions. Word has length 211 [2018-10-27 06:10:10,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:10:10,629 INFO L481 AbstractCegarLoop]: Abstraction has 7500 states and 9359 transitions. [2018-10-27 06:10:10,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 06:10:10,629 INFO L276 IsEmpty]: Start isEmpty. Operand 7500 states and 9359 transitions. [2018-10-27 06:10:10,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-10-27 06:10:10,657 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:10:10,657 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:10:10,657 INFO L424 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:10:10,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:10,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1586568926, now seen corresponding path program 1 times [2018-10-27 06:10:10,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:10:10,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:10,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:10,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:10,659 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:10:10,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:11,261 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-27 06:10:11,483 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 157 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-27 06:10:11,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:10:11,483 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 06:10:11,484 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 228 with the following transitions: [2018-10-27 06:10:11,484 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 06:10:11,487 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 06:10:11,487 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 06:10:12,161 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 06:10:12,162 INFO L272 AbstractInterpreter]: Visited 123 different actions 491 times. Merged at 9 different actions 35 times. Widened at 1 different actions 1 times. Found 7 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-27 06:10:12,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:12,187 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 06:10:12,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:10:12,187 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 06:10:12,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:12,204 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 06:10:12,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:12,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:12,412 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 140 proven. 14 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-27 06:10:12,412 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 06:10:12,817 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 152 proven. 2 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-27 06:10:12,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 06:10:12,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2018-10-27 06:10:12,838 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 06:10:12,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 06:10:12,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 06:10:12,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-10-27 06:10:12,839 INFO L87 Difference]: Start difference. First operand 7500 states and 9359 transitions. Second operand 8 states. [2018-10-27 06:10:15,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:15,392 INFO L93 Difference]: Finished difference Result 14711 states and 18928 transitions. [2018-10-27 06:10:15,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-27 06:10:15,393 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 227 [2018-10-27 06:10:15,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:10:15,431 INFO L225 Difference]: With dead ends: 14711 [2018-10-27 06:10:15,431 INFO L226 Difference]: Without dead ends: 8593 [2018-10-27 06:10:15,456 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 463 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2018-10-27 06:10:15,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8593 states. [2018-10-27 06:10:15,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8593 to 7864. [2018-10-27 06:10:15,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7864 states. [2018-10-27 06:10:15,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7864 states to 7864 states and 9433 transitions. [2018-10-27 06:10:15,638 INFO L78 Accepts]: Start accepts. Automaton has 7864 states and 9433 transitions. Word has length 227 [2018-10-27 06:10:15,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:10:15,639 INFO L481 AbstractCegarLoop]: Abstraction has 7864 states and 9433 transitions. [2018-10-27 06:10:15,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 06:10:15,639 INFO L276 IsEmpty]: Start isEmpty. Operand 7864 states and 9433 transitions. [2018-10-27 06:10:15,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-10-27 06:10:15,660 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:10:15,660 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:15,660 INFO L424 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:10:15,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:15,661 INFO L82 PathProgramCache]: Analyzing trace with hash 395172502, now seen corresponding path program 1 times [2018-10-27 06:10:15,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:10:15,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:15,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:15,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:15,662 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:10:15,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:16,114 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 200 proven. 61 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-27 06:10:16,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:10:16,114 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 06:10:16,115 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 247 with the following transitions: [2018-10-27 06:10:16,115 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [109], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 06:10:16,118 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 06:10:16,118 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 06:10:16,445 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 06:10:16,445 INFO L272 AbstractInterpreter]: Visited 123 different actions 488 times. Merged at 8 different actions 32 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 2 different actions. Largest state had 42 variables. [2018-10-27 06:10:16,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:16,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 06:10:16,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:10:16,455 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 06:10:16,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:16,466 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 06:10:16,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:16,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:16,654 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 179 proven. 2 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-10-27 06:10:16,654 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 06:10:16,910 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 179 proven. 2 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-10-27 06:10:16,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 06:10:16,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-10-27 06:10:16,941 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 06:10:16,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 06:10:16,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 06:10:16,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-10-27 06:10:16,943 INFO L87 Difference]: Start difference. First operand 7864 states and 9433 transitions. Second operand 12 states. [2018-10-27 06:10:23,153 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-27 06:10:23,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:23,830 INFO L93 Difference]: Finished difference Result 14533 states and 18856 transitions. [2018-10-27 06:10:23,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-27 06:10:23,830 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 246 [2018-10-27 06:10:23,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:10:23,831 INFO L225 Difference]: With dead ends: 14533 [2018-10-27 06:10:23,831 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 06:10:23,871 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 513 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 643 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=457, Invalid=1895, Unknown=0, NotChecked=0, Total=2352 [2018-10-27 06:10:23,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 06:10:23,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 06:10:23,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 06:10:23,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 06:10:23,872 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 246 [2018-10-27 06:10:23,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:10:23,873 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:10:23,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 06:10:23,873 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:10:23,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 06:10:23,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-27 06:10:24,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:24,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:24,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:24,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:24,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:24,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:24,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:24,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:24,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:24,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:24,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:24,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:24,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:24,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:24,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:24,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:24,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:24,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:24,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:24,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:24,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:24,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:24,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:24,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:24,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:24,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:24,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:24,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:24,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:24,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:24,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:24,905 WARN L179 SmtUtils]: Spent 651.00 ms on a formula simplification. DAG size of input: 307 DAG size of output: 216 [2018-10-27 06:10:24,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:24,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:24,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:24,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:24,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:24,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:24,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:25,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:25,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:25,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:25,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:25,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:25,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:25,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:25,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:25,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:25,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:25,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:25,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:25,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:25,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:25,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:25,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:25,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:25,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:25,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:25,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:25,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:25,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:25,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:10:25,507 WARN L179 SmtUtils]: Spent 600.00 ms on a formula simplification. DAG size of input: 295 DAG size of output: 207 [2018-10-27 06:10:25,951 WARN L179 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2018-10-27 06:10:26,070 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 40 [2018-10-27 06:10:29,271 WARN L179 SmtUtils]: Spent 3.18 s on a formula simplification. DAG size of input: 220 DAG size of output: 100 [2018-10-27 06:10:30,677 WARN L179 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 220 DAG size of output: 66 [2018-10-27 06:10:32,145 WARN L179 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 211 DAG size of output: 66 [2018-10-27 06:10:32,148 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-27 06:10:32,148 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a17~0 |old(~a17~0)|) (<= ~a21~0 |old(~a21~0)|) (= |old(~a7~0)| ~a7~0) (<= |old(~a8~0)| ~a8~0) (= |old(~a16~0)| ~a16~0) (= ~a20~0 |old(~a20~0)|)) [2018-10-27 06:10:32,148 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-27 06:10:32,148 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-10-27 06:10:32,148 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-10-27 06:10:32,149 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,149 INFO L425 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,149 INFO L425 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,149 INFO L425 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,149 INFO L425 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,149 INFO L425 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,149 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-10-27 06:10:32,149 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-10-27 06:10:32,149 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-10-27 06:10:32,150 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-10-27 06:10:32,150 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-10-27 06:10:32,150 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-10-27 06:10:32,150 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-10-27 06:10:32,150 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-10-27 06:10:32,150 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-10-27 06:10:32,150 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-10-27 06:10:32,150 INFO L425 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,150 INFO L425 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,150 INFO L425 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,150 INFO L425 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,150 INFO L425 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,150 INFO L425 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,151 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-10-27 06:10:32,151 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-10-27 06:10:32,151 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-10-27 06:10:32,151 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-10-27 06:10:32,151 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-10-27 06:10:32,151 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-10-27 06:10:32,151 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-10-27 06:10:32,151 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-10-27 06:10:32,151 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-10-27 06:10:32,152 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-10-27 06:10:32,152 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-10-27 06:10:32,152 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-10-27 06:10:32,152 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-10-27 06:10:32,152 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-10-27 06:10:32,152 INFO L425 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-10-27 06:10:32,152 INFO L425 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,152 INFO L425 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,152 INFO L425 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,153 INFO L425 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,153 INFO L425 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,153 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-10-27 06:10:32,153 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-10-27 06:10:32,153 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-10-27 06:10:32,153 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-10-27 06:10:32,153 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-10-27 06:10:32,153 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-10-27 06:10:32,153 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-10-27 06:10:32,154 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-10-27 06:10:32,154 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-10-27 06:10:32,154 INFO L425 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,154 INFO L425 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,154 INFO L425 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,154 INFO L425 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,154 INFO L425 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,154 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-10-27 06:10:32,154 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-10-27 06:10:32,154 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-10-27 06:10:32,155 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-10-27 06:10:32,155 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-10-27 06:10:32,155 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-10-27 06:10:32,155 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-10-27 06:10:32,155 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-10-27 06:10:32,155 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-10-27 06:10:32,155 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-10-27 06:10:32,155 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-10-27 06:10:32,155 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-10-27 06:10:32,156 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-10-27 06:10:32,156 INFO L425 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,156 INFO L425 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,156 INFO L425 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,156 INFO L425 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,156 INFO L425 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,156 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-10-27 06:10:32,156 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-10-27 06:10:32,157 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-10-27 06:10:32,157 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-10-27 06:10:32,157 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-10-27 06:10:32,157 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-10-27 06:10:32,157 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-10-27 06:10:32,157 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-10-27 06:10:32,157 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-10-27 06:10:32,157 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,157 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,157 INFO L425 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,158 INFO L425 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,158 INFO L425 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,158 INFO L425 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,158 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-10-27 06:10:32,158 INFO L425 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,158 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-10-27 06:10:32,158 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-10-27 06:10:32,158 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-10-27 06:10:32,158 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-10-27 06:10:32,158 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-10-27 06:10:32,158 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-10-27 06:10:32,158 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-10-27 06:10:32,159 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-10-27 06:10:32,159 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-10-27 06:10:32,159 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-10-27 06:10:32,159 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-10-27 06:10:32,159 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-10-27 06:10:32,159 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-10-27 06:10:32,159 INFO L425 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,159 INFO L425 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,159 INFO L425 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,159 INFO L425 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,159 INFO L425 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,159 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-10-27 06:10:32,159 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-10-27 06:10:32,159 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-10-27 06:10:32,160 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-10-27 06:10:32,160 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-10-27 06:10:32,160 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-10-27 06:10:32,160 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-10-27 06:10:32,160 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-10-27 06:10:32,160 INFO L425 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,160 INFO L425 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,160 INFO L425 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,160 INFO L425 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,160 INFO L425 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,160 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-10-27 06:10:32,160 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-10-27 06:10:32,160 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-10-27 06:10:32,160 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-10-27 06:10:32,161 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-10-27 06:10:32,161 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-10-27 06:10:32,161 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-10-27 06:10:32,161 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-10-27 06:10:32,161 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-10-27 06:10:32,161 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-10-27 06:10:32,161 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse6 (= 1 |old(~a17~0)|)) (.cse5 (= 4 |old(~a16~0)|))) (let ((.cse3 (< 0 |old(~a21~0)|)) (.cse1 (and (= ~a17~0 |old(~a17~0)|) (<= ~a21~0 |old(~a21~0)|) (= |old(~a7~0)| ~a7~0) (= ~a16~0 |old(~a16~0)|) (<= |old(~a8~0)| ~a8~0) (= ~a20~0 |old(~a20~0)|))) (.cse9 (< |old(~a8~0)| 14)) (.cse4 (< 0 |old(~a20~0)|)) (.cse12 (and (= ~a8~0 15) (= ~a21~0 1))) (.cse13 (= |calculate_output_#in~input| 0)) (.cse0 (= 6 |old(~a16~0)|)) (.cse14 (not (= 0 |old(~a7~0)|))) (.cse16 (not (= 15 |old(~a8~0)|))) (.cse17 (not (= 0 |old(~a17~0)|))) (.cse15 (not (= 1 |old(~a21~0)|))) (.cse7 (= 1 |old(~a7~0)|)) (.cse10 (not (= 1 |old(~a20~0)|))) (.cse8 (not .cse5)) (.cse2 (not (= 8 ~a12~0))) (.cse19 (= 1 ~a20~0)) (.cse20 (= 13 ~a8~0)) (.cse21 (= |old(~a16~0)| ~a16~0)) (.cse22 (= 1 ~a21~0)) (.cse23 (= 1 ~a17~0)) (.cse24 (not (= 13 |old(~a8~0)|))) (.cse11 (not .cse6))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse1 .cse2 (< |old(~a20~0)| 1) .cse6 .cse3) (or .cse7 .cse8 .cse1 .cse2 .cse6) (or .cse0 .cse5 .cse9 .cse2 .cse6 .cse1) (or .cse0 .cse7 .cse1 .cse9 .cse2) (or .cse1 (or .cse0 .cse10 .cse2 .cse3)) (or .cse7 .cse9 .cse2 .cse1 .cse4) (or .cse7 .cse1 .cse5 .cse10 .cse2 .cse11) (or .cse12 .cse13 (let ((.cse18 (not (= 5 |old(~a16~0)|)))) (and (or .cse14 .cse15 .cse16 .cse17 .cse18 .cse2) (or .cse14 .cse15 .cse16 .cse18 .cse2 .cse11)))) (or .cse15 .cse10 .cse8 (and (= 1 ~a7~0) .cse19 .cse20 .cse21 .cse22 .cse23) .cse2 (not .cse7) .cse24 .cse11) (or .cse7 .cse9 .cse2 .cse6 .cse1) (or .cse0 .cse1 .cse9 .cse2 .cse6 .cse4) (or .cse12 (and (or .cse0 .cse14 .cse15 .cse10 .cse16 (= 0 |old(~a16~0)|) .cse2 .cse6 .cse13) (or .cse13 (or (not .cse0) .cse14 .cse15 .cse10 .cse16 .cse17 .cse2)))) (or .cse15 .cse7 .cse10 .cse8 .cse2 (and (not (= ~a7~0 1)) .cse19 .cse20 .cse21 .cse22 .cse23) .cse24 .cse11)))) [2018-10-27 06:10:32,161 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-10-27 06:10:32,161 INFO L425 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,161 INFO L425 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,161 INFO L425 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,162 INFO L425 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,162 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-10-27 06:10:32,162 INFO L425 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,162 INFO L425 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,162 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-10-27 06:10:32,162 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-10-27 06:10:32,162 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-10-27 06:10:32,162 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-10-27 06:10:32,162 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-10-27 06:10:32,162 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-10-27 06:10:32,162 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-10-27 06:10:32,163 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-10-27 06:10:32,163 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-10-27 06:10:32,163 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-10-27 06:10:32,163 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-10-27 06:10:32,163 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-10-27 06:10:32,163 INFO L425 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,163 INFO L425 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,163 INFO L425 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,163 INFO L425 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,163 INFO L425 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,163 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-10-27 06:10:32,163 INFO L425 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,163 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-10-27 06:10:32,163 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-10-27 06:10:32,164 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 503) no Hoare annotation was computed. [2018-10-27 06:10:32,164 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-10-27 06:10:32,164 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-10-27 06:10:32,164 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-10-27 06:10:32,164 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-10-27 06:10:32,164 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-10-27 06:10:32,164 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-10-27 06:10:32,164 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-10-27 06:10:32,164 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-10-27 06:10:32,164 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-10-27 06:10:32,164 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-10-27 06:10:32,164 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-10-27 06:10:32,164 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-10-27 06:10:32,164 INFO L425 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,165 INFO L425 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,165 INFO L425 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,165 INFO L425 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,165 INFO L425 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,165 INFO L425 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:32,165 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-10-27 06:10:32,165 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-10-27 06:10:32,165 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-10-27 06:10:32,165 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-10-27 06:10:32,165 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-10-27 06:10:32,165 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-10-27 06:10:32,165 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-10-27 06:10:32,165 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-10-27 06:10:32,165 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-10-27 06:10:32,165 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-10-27 06:10:32,166 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-27 06:10:32,166 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a7~0 0) (= ~a8~0 15) (= ~a12~0 8) (= ~a21~0 1) (= ~a20~0 1) (= 1 ~a17~0) (= ~a16~0 5)) [2018-10-27 06:10:32,166 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-27 06:10:32,166 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-27 06:10:32,166 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a21~0)|)) (not (= 8 ~a12~0)) (not (= 1 |old(~a17~0)|)) (not (= 1 |old(~a20~0)|)) (not (= 15 |old(~a8~0)|)) (not (= 5 |old(~a16~0)|)) (and (= ~a8~0 15) (= ~a21~0 1) (= ~a17~0 |old(~a17~0)|) (= |old(~a7~0)| ~a7~0) (= ~a20~0 |old(~a20~0)|) (= ~a16~0 5))) [2018-10-27 06:10:32,166 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-10-27 06:10:32,166 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse1 (= ~a16~0 4))) (let ((.cse5 (<= ~a20~0 0)) (.cse3 (<= 14 ~a8~0)) (.cse2 (not (= ~a17~0 1))) (.cse0 (not (= ~a7~0 1))) (.cse6 (not .cse1)) (.cse7 (= 1 ~a17~0)) (.cse8 (<= ~a21~0 0)) (.cse9 (= |old(~a20~0)| ~a20~0)) (.cse4 (not (= ~a16~0 6)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2 .cse5) (not (= 1 |old(~a20~0)|)) (and .cse3 .cse4 .cse2 .cse6) (not (= 5 |old(~a16~0)|)) (and .cse0 .cse3 .cse5) (and (= 1 ~a20~0) (= 13 ~a8~0) (= 4 ~a16~0) (= 1 ~a21~0) .cse7) (and .cse8 .cse2 (<= 1 ~a20~0) .cse6) (not (= 1 |old(~a21~0)|)) (and .cse0 .cse3 .cse4) (not (= 8 ~a12~0)) (and .cse8 .cse4 .cse5) (and .cse0 .cse3 .cse2) (and .cse0 .cse9 .cse6 .cse7) (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a17~0)|)) (not (= 15 |old(~a8~0)|)) (and .cse8 .cse9 .cse4)))) [2018-10-27 06:10:32,167 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-10-27 06:10:32,167 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-10-27 06:10:32,167 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-10-27 06:10:32,167 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse1 (= ~a16~0 4))) (let ((.cse5 (<= ~a20~0 0)) (.cse3 (<= 14 ~a8~0)) (.cse2 (not (= ~a17~0 1))) (.cse0 (not (= ~a7~0 1))) (.cse6 (not .cse1)) (.cse7 (= 1 ~a17~0)) (.cse8 (<= ~a21~0 0)) (.cse9 (= |old(~a20~0)| ~a20~0)) (.cse4 (not (= ~a16~0 6)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2 .cse5) (not (= 1 |old(~a20~0)|)) (and .cse3 .cse4 .cse2 .cse6) (not (= 5 |old(~a16~0)|)) (and .cse0 .cse3 .cse5) (and (= 1 ~a20~0) (= 13 ~a8~0) (= 4 ~a16~0) (= 1 ~a21~0) .cse7) (and .cse8 .cse2 (<= 1 ~a20~0) .cse6) (not (= 1 |old(~a21~0)|)) (and .cse0 .cse3 .cse4) (not (= 8 ~a12~0)) (and .cse8 .cse4 .cse5) (and .cse0 .cse3 .cse2) (and .cse0 .cse9 .cse6 .cse7) (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a17~0)|)) (not (= 15 |old(~a8~0)|)) (and .cse8 .cse9 .cse4)))) [2018-10-27 06:10:32,167 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-10-27 06:10:32,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 06:10:32 BoogieIcfgContainer [2018-10-27 06:10:32,182 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 06:10:32,183 INFO L168 Benchmark]: Toolchain (without parser) took 79637.47 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 3.2 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-10-27 06:10:32,184 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 06:10:32,184 INFO L168 Benchmark]: CACSL2BoogieTranslator took 734.15 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 06:10:32,185 INFO L168 Benchmark]: Boogie Procedure Inliner took 186.33 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 752.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -836.2 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. [2018-10-27 06:10:32,186 INFO L168 Benchmark]: Boogie Preprocessor took 98.66 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 06:10:32,186 INFO L168 Benchmark]: RCFGBuilder took 3525.13 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: 102.6 MB). Peak memory consumption was 102.6 MB. Max. memory is 7.1 GB. [2018-10-27 06:10:32,187 INFO L168 Benchmark]: TraceAbstraction took 75086.01 ms. Allocated memory was 2.3 GB in the beginning and 3.5 GB in the end (delta: 1.2 GB). Free memory was 2.1 GB in the beginning and 3.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-10-27 06:10:32,192 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 734.15 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 186.33 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 752.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -836.2 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 98.66 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 3525.13 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: 102.6 MB). Peak memory consumption was 102.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 75086.01 ms. Allocated memory was 2.3 GB in the beginning and 3.5 GB in the end (delta: 1.2 GB). Free memory was 2.1 GB in the beginning and 3.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 503]: 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: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(a7 == 1) && a16 == 4) && !(a17 == 1)) || (((14 <= a8 && !(a16 == 6)) && !(a17 == 1)) && a20 <= 0)) || !(1 == \old(a20))) || (((14 <= a8 && !(a16 == 6)) && !(a17 == 1)) && !(a16 == 4))) || !(5 == \old(a16))) || ((!(a7 == 1) && 14 <= a8) && a20 <= 0)) || ((((1 == a20 && 13 == a8) && 4 == a16) && 1 == a21) && 1 == a17)) || (((a21 <= 0 && !(a17 == 1)) && 1 <= a20) && !(a16 == 4))) || !(1 == \old(a21))) || ((!(a7 == 1) && 14 <= a8) && !(a16 == 6))) || !(8 == a12)) || ((a21 <= 0 && !(a16 == 6)) && a20 <= 0)) || ((!(a7 == 1) && 14 <= a8) && !(a17 == 1))) || (((!(a7 == 1) && \old(a20) == a20) && !(a16 == 4)) && 1 == a17)) || !(0 == \old(a7))) || !(1 == \old(a17))) || !(15 == \old(a8))) || ((a21 <= 0 && \old(a20) == a20) && !(a16 == 6)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 74.9s OverallTime, 13 OverallIterations, 5 TraceHistogramMax, 49.0s AutomataDifference, 0.0s DeadEndRemovalTime, 8.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1684 SDtfs, 10919 SDslu, 2162 SDs, 0 SdLazy, 13346 SolverSat, 2231 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.5s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 2258 GetRequests, 2079 SyntacticMatches, 17 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 7.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7864occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.4s AbstIntTime, 7 AbstIntIterations, 4 AbstIntStrong, 0.9969429432615227 AbsIntWeakeningRatio, 0.23066104078762306 AbsIntAvgWeakeningVarsNumRemoved, 28.040787623066105 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 863 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 322 PreInvPairs, 596 NumberOfFragments, 1033 HoareAnnotationTreeSize, 322 FomulaSimplifications, 20872 FormulaSimplificationTreeSizeReduction, 1.6s HoareSimplificationTime, 7 FomulaSimplificationsInter, 18242 FormulaSimplificationTreeSizeReductionInter, 6.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 2834 NumberOfCodeBlocks, 2834 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3490 ConstructedInterpolants, 0 QuantifiedInterpolants, 1920715 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1832 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 19 InterpolantComputations, 6 PerfectInterpolantSequences, 2210/2399 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...