java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label05_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 08:58:01,809 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 08:58:01,812 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 08:58:01,827 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 08:58:01,827 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 08:58:01,829 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 08:58:01,830 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 08:58:01,832 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 08:58:01,834 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 08:58:01,835 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 08:58:01,837 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 08:58:01,837 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 08:58:01,838 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 08:58:01,839 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 08:58:01,840 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 08:58:01,841 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 08:58:01,842 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 08:58:01,844 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 08:58:01,846 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 08:58:01,847 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 08:58:01,848 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 08:58:01,850 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 08:58:01,852 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 08:58:01,852 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 08:58:01,853 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 08:58:01,854 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 08:58:01,855 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 08:58:01,855 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 08:58:01,856 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 08:58:01,857 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 08:58:01,858 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 08:58:01,858 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 08:58:01,859 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 08:58:01,859 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 08:58:01,860 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 08:58:01,861 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 08:58:01,861 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 08:58:01,881 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 08:58:01,881 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 08:58:01,882 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 08:58:01,882 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 08:58:01,883 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 08:58:01,883 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 08:58:01,883 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 08:58:01,883 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 08:58:01,883 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 08:58:01,884 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 08:58:01,884 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 08:58:01,884 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 08:58:01,884 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 08:58:01,884 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 08:58:01,885 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 08:58:01,885 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 08:58:01,885 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 08:58:01,886 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 08:58:01,886 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 08:58:01,886 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 08:58:01,886 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 08:58:01,886 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 08:58:01,886 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 08:58:01,887 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 08:58:01,887 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 08:58:01,887 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 08:58:01,887 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 08:58:01,887 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 08:58:01,888 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 08:58:01,888 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 08:58:01,888 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 08:58:01,888 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 08:58:01,888 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 08:58:01,889 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 08:58:01,889 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 08:58:01,889 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 08:58:01,936 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 08:58:01,949 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 08:58:01,954 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 08:58:01,955 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 08:58:01,956 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 08:58:01,957 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label05_true-unreach-call_false-termination.c [2018-11-07 08:58:02,027 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba01f9f7e/3b4b7d81d53f448e8f8b4d967852295a/FLAG692b79151 [2018-11-07 08:58:02,604 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 08:58:02,605 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label05_true-unreach-call_false-termination.c [2018-11-07 08:58:02,628 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba01f9f7e/3b4b7d81d53f448e8f8b4d967852295a/FLAG692b79151 [2018-11-07 08:58:02,649 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba01f9f7e/3b4b7d81d53f448e8f8b4d967852295a [2018-11-07 08:58:02,662 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 08:58:02,664 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 08:58:02,665 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 08:58:02,665 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 08:58:02,670 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 08:58:02,671 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:58:02" (1/1) ... [2018-11-07 08:58:02,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2964f187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:02, skipping insertion in model container [2018-11-07 08:58:02,675 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:58:02" (1/1) ... [2018-11-07 08:58:02,686 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 08:58:02,746 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 08:58:03,228 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 08:58:03,232 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 08:58:03,423 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 08:58:03,442 INFO L193 MainTranslator]: Completed translation [2018-11-07 08:58:03,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:03 WrapperNode [2018-11-07 08:58:03,443 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 08:58:03,444 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 08:58:03,444 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 08:58:03,444 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 08:58:03,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:03" (1/1) ... [2018-11-07 08:58:03,597 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:03" (1/1) ... [2018-11-07 08:58:03,616 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 08:58:03,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 08:58:03,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 08:58:03,617 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 08:58:03,629 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:03" (1/1) ... [2018-11-07 08:58:03,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:03" (1/1) ... [2018-11-07 08:58:03,641 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:03" (1/1) ... [2018-11-07 08:58:03,641 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:03" (1/1) ... [2018-11-07 08:58:03,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:03" (1/1) ... [2018-11-07 08:58:03,721 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:03" (1/1) ... [2018-11-07 08:58:03,730 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:03" (1/1) ... [2018-11-07 08:58:03,741 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 08:58:03,742 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 08:58:03,742 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 08:58:03,742 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 08:58:03,743 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 08:58:03,820 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 08:58:03,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 08:58:03,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 08:58:03,820 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 08:58:03,821 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 08:58:03,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 08:58:03,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 08:58:03,821 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 08:58:03,821 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 08:58:07,530 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 08:58:07,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:58:07 BoogieIcfgContainer [2018-11-07 08:58:07,532 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 08:58:07,533 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 08:58:07,533 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 08:58:07,536 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 08:58:07,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:58:02" (1/3) ... [2018-11-07 08:58:07,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff0ac71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:58:07, skipping insertion in model container [2018-11-07 08:58:07,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:58:03" (2/3) ... [2018-11-07 08:58:07,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff0ac71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:58:07, skipping insertion in model container [2018-11-07 08:58:07,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:58:07" (3/3) ... [2018-11-07 08:58:07,540 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label05_true-unreach-call_false-termination.c [2018-11-07 08:58:07,551 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 08:58:07,561 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 08:58:07,579 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 08:58:07,617 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 08:58:07,618 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 08:58:07,618 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 08:58:07,618 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 08:58:07,618 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 08:58:07,618 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 08:58:07,618 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 08:58:07,618 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 08:58:07,646 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-11-07 08:58:07,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-07 08:58:07,658 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 08:58:07,660 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] [2018-11-07 08:58:07,662 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 08:58:07,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 08:58:07,669 INFO L82 PathProgramCache]: Analyzing trace with hash 638958820, now seen corresponding path program 1 times [2018-11-07 08:58:07,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 08:58:07,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:58:07,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 08:58:07,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:58:07,723 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 08:58:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 08:58:08,153 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 08:58:08,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 08:58:08,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 08:58:08,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 08:58:08,287 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 08:58:08,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 08:58:08,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 08:58:08,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 08:58:08,315 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 3 states. [2018-11-07 08:58:10,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 08:58:10,052 INFO L93 Difference]: Finished difference Result 691 states and 1226 transitions. [2018-11-07 08:58:10,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 08:58:10,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-11-07 08:58:10,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 08:58:10,076 INFO L225 Difference]: With dead ends: 691 [2018-11-07 08:58:10,076 INFO L226 Difference]: Without dead ends: 434 [2018-11-07 08:58:10,085 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 08:58:10,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-11-07 08:58:10,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2018-11-07 08:58:10,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-11-07 08:58:10,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 765 transitions. [2018-11-07 08:58:10,201 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 765 transitions. Word has length 70 [2018-11-07 08:58:10,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 08:58:10,202 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 765 transitions. [2018-11-07 08:58:10,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 08:58:10,203 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 765 transitions. [2018-11-07 08:58:10,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-07 08:58:10,220 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 08:58:10,220 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 08:58:10,221 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 08:58:10,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 08:58:10,222 INFO L82 PathProgramCache]: Analyzing trace with hash 781618536, now seen corresponding path program 1 times [2018-11-07 08:58:10,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 08:58:10,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:58:10,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 08:58:10,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:58:10,225 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 08:58:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 08:58:10,559 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 08:58:10,669 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 08:58:10,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 08:58:10,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 08:58:10,670 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 08:58:10,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 08:58:10,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 08:58:10,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 08:58:10,673 INFO L87 Difference]: Start difference. First operand 434 states and 765 transitions. Second operand 6 states. [2018-11-07 08:58:14,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 08:58:14,164 INFO L93 Difference]: Finished difference Result 1588 states and 2935 transitions. [2018-11-07 08:58:14,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 08:58:14,165 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2018-11-07 08:58:14,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 08:58:14,178 INFO L225 Difference]: With dead ends: 1588 [2018-11-07 08:58:14,178 INFO L226 Difference]: Without dead ends: 1160 [2018-11-07 08:58:14,186 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 08:58:14,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2018-11-07 08:58:14,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1153. [2018-11-07 08:58:14,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2018-11-07 08:58:14,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1887 transitions. [2018-11-07 08:58:14,311 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1887 transitions. Word has length 140 [2018-11-07 08:58:14,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 08:58:14,312 INFO L480 AbstractCegarLoop]: Abstraction has 1153 states and 1887 transitions. [2018-11-07 08:58:14,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 08:58:14,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1887 transitions. [2018-11-07 08:58:14,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-07 08:58:14,316 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 08:58:14,316 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 08:58:14,316 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 08:58:14,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 08:58:14,317 INFO L82 PathProgramCache]: Analyzing trace with hash 386881263, now seen corresponding path program 1 times [2018-11-07 08:58:14,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 08:58:14,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:58:14,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 08:58:14,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:58:14,319 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 08:58:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 08:58:14,567 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 08:58:14,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 08:58:14,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 08:58:14,568 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 08:58:14,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 08:58:14,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 08:58:14,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 08:58:14,569 INFO L87 Difference]: Start difference. First operand 1153 states and 1887 transitions. Second operand 5 states. [2018-11-07 08:58:17,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 08:58:17,011 INFO L93 Difference]: Finished difference Result 2716 states and 4601 transitions. [2018-11-07 08:58:17,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 08:58:17,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2018-11-07 08:58:17,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 08:58:17,032 INFO L225 Difference]: With dead ends: 2716 [2018-11-07 08:58:17,032 INFO L226 Difference]: Without dead ends: 1569 [2018-11-07 08:58:17,039 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-07 08:58:17,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2018-11-07 08:58:17,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1538. [2018-11-07 08:58:17,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1538 states. [2018-11-07 08:58:17,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 2356 transitions. [2018-11-07 08:58:17,108 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 2356 transitions. Word has length 141 [2018-11-07 08:58:17,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 08:58:17,108 INFO L480 AbstractCegarLoop]: Abstraction has 1538 states and 2356 transitions. [2018-11-07 08:58:17,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 08:58:17,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 2356 transitions. [2018-11-07 08:58:17,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-07 08:58:17,113 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 08:58:17,113 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 08:58:17,114 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 08:58:17,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 08:58:17,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1814928629, now seen corresponding path program 1 times [2018-11-07 08:58:17,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 08:58:17,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:58:17,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 08:58:17,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:58:17,116 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 08:58:17,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 08:58:17,249 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 08:58:17,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 08:58:17,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 08:58:17,250 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 08:58:17,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 08:58:17,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 08:58:17,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 08:58:17,253 INFO L87 Difference]: Start difference. First operand 1538 states and 2356 transitions. Second operand 5 states. [2018-11-07 08:58:19,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 08:58:19,879 INFO L93 Difference]: Finished difference Result 4198 states and 6461 transitions. [2018-11-07 08:58:19,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 08:58:19,890 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2018-11-07 08:58:19,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 08:58:19,911 INFO L225 Difference]: With dead ends: 4198 [2018-11-07 08:58:19,911 INFO L226 Difference]: Without dead ends: 2666 [2018-11-07 08:58:19,922 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-07 08:58:19,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2018-11-07 08:58:20,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2560. [2018-11-07 08:58:20,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2560 states. [2018-11-07 08:58:20,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2560 states and 3629 transitions. [2018-11-07 08:58:20,016 INFO L78 Accepts]: Start accepts. Automaton has 2560 states and 3629 transitions. Word has length 143 [2018-11-07 08:58:20,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 08:58:20,017 INFO L480 AbstractCegarLoop]: Abstraction has 2560 states and 3629 transitions. [2018-11-07 08:58:20,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 08:58:20,017 INFO L276 IsEmpty]: Start isEmpty. Operand 2560 states and 3629 transitions. [2018-11-07 08:58:20,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-07 08:58:20,021 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 08:58:20,022 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 08:58:20,022 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 08:58:20,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 08:58:20,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1367995872, now seen corresponding path program 1 times [2018-11-07 08:58:20,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 08:58:20,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:58:20,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 08:58:20,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:58:20,024 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 08:58:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 08:58:20,175 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 08:58:20,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 08:58:20,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 08:58:20,175 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 08:58:20,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 08:58:20,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 08:58:20,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 08:58:20,177 INFO L87 Difference]: Start difference. First operand 2560 states and 3629 transitions. Second operand 4 states. [2018-11-07 08:58:22,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 08:58:22,564 INFO L93 Difference]: Finished difference Result 7180 states and 10578 transitions. [2018-11-07 08:58:22,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 08:58:22,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2018-11-07 08:58:22,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 08:58:22,600 INFO L225 Difference]: With dead ends: 7180 [2018-11-07 08:58:22,601 INFO L226 Difference]: Without dead ends: 4626 [2018-11-07 08:58:22,621 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 08:58:22,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4626 states. [2018-11-07 08:58:22,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4626 to 4626. [2018-11-07 08:58:22,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4626 states. [2018-11-07 08:58:22,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4626 states to 4626 states and 6381 transitions. [2018-11-07 08:58:22,755 INFO L78 Accepts]: Start accepts. Automaton has 4626 states and 6381 transitions. Word has length 144 [2018-11-07 08:58:22,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 08:58:22,756 INFO L480 AbstractCegarLoop]: Abstraction has 4626 states and 6381 transitions. [2018-11-07 08:58:22,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 08:58:22,756 INFO L276 IsEmpty]: Start isEmpty. Operand 4626 states and 6381 transitions. [2018-11-07 08:58:22,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-11-07 08:58:22,791 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 08:58:22,791 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 08:58:22,792 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 08:58:22,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 08:58:22,792 INFO L82 PathProgramCache]: Analyzing trace with hash 2115072535, now seen corresponding path program 1 times [2018-11-07 08:58:22,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 08:58:22,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:58:22,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 08:58:22,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:58:22,794 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 08:58:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 08:58:23,397 WARN L179 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 10 [2018-11-07 08:58:23,593 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 126 proven. 108 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 08:58:23,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 08:58:23,594 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 08:58:23,595 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 338 with the following transitions: [2018-11-07 08:58:23,598 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [461], [463], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [830], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 08:58:23,658 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 08:58:23,658 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 08:58:27,886 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 08:58:27,888 INFO L272 AbstractInterpreter]: Visited 159 different actions 159 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-11-07 08:58:27,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 08:58:27,935 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 08:58:32,298 INFO L227 lantSequenceWeakener]: Weakened 328 states. On average, predicates are now at 78.02% of their original sizes. [2018-11-07 08:58:32,299 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 08:58:32,562 INFO L415 sIntCurrentIteration]: We unified 336 AI predicates to 336 [2018-11-07 08:58:32,562 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 08:58:32,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 08:58:32,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2018-11-07 08:58:32,564 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 08:58:32,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 08:58:32,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 08:58:32,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 08:58:32,566 INFO L87 Difference]: Start difference. First operand 4626 states and 6381 transitions. Second operand 6 states. [2018-11-07 08:58:55,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 08:58:55,571 INFO L93 Difference]: Finished difference Result 9246 states and 12759 transitions. [2018-11-07 08:58:55,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 08:58:55,571 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 337 [2018-11-07 08:58:55,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 08:58:55,593 INFO L225 Difference]: With dead ends: 9246 [2018-11-07 08:58:55,593 INFO L226 Difference]: Without dead ends: 4626 [2018-11-07 08:58:55,614 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 337 GetRequests, 332 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-11-07 08:58:55,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4626 states. [2018-11-07 08:58:55,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4626 to 4624. [2018-11-07 08:58:55,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4624 states. [2018-11-07 08:58:55,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4624 states to 4624 states and 6343 transitions. [2018-11-07 08:58:55,727 INFO L78 Accepts]: Start accepts. Automaton has 4624 states and 6343 transitions. Word has length 337 [2018-11-07 08:58:55,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 08:58:55,728 INFO L480 AbstractCegarLoop]: Abstraction has 4624 states and 6343 transitions. [2018-11-07 08:58:55,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 08:58:55,728 INFO L276 IsEmpty]: Start isEmpty. Operand 4624 states and 6343 transitions. [2018-11-07 08:58:55,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-11-07 08:58:55,761 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 08:58:55,762 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 08:58:55,762 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 08:58:55,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 08:58:55,763 INFO L82 PathProgramCache]: Analyzing trace with hash 65139688, now seen corresponding path program 1 times [2018-11-07 08:58:55,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 08:58:55,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:58:55,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 08:58:55,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:58:55,764 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 08:58:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 08:58:56,790 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 277 proven. 190 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 08:58:56,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 08:58:56,791 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 08:58:56,791 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 423 with the following transitions: [2018-11-07 08:58:56,792 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [461], [463], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [830], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 08:58:56,799 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 08:58:56,799 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 08:59:00,474 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 08:59:00,474 INFO L272 AbstractInterpreter]: Visited 163 different actions 319 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 08:59:00,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 08:59:00,510 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 08:59:02,628 INFO L227 lantSequenceWeakener]: Weakened 419 states. On average, predicates are now at 77.92% of their original sizes. [2018-11-07 08:59:02,628 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 08:59:03,237 INFO L415 sIntCurrentIteration]: We unified 421 AI predicates to 421 [2018-11-07 08:59:03,238 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 08:59:03,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 08:59:03,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 20 [2018-11-07 08:59:03,238 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 08:59:03,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 08:59:03,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 08:59:03,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-07 08:59:03,239 INFO L87 Difference]: Start difference. First operand 4624 states and 6343 transitions. Second operand 10 states. [2018-11-07 09:00:09,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:00:09,153 INFO L93 Difference]: Finished difference Result 9426 states and 12898 transitions. [2018-11-07 09:00:09,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 09:00:09,153 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 422 [2018-11-07 09:00:09,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:00:09,173 INFO L225 Difference]: With dead ends: 9426 [2018-11-07 09:00:09,173 INFO L226 Difference]: Without dead ends: 4810 [2018-11-07 09:00:09,190 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 430 GetRequests, 413 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-11-07 09:00:09,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2018-11-07 09:00:09,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4808. [2018-11-07 09:00:09,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4808 states. [2018-11-07 09:00:09,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4808 states to 4808 states and 6518 transitions. [2018-11-07 09:00:09,310 INFO L78 Accepts]: Start accepts. Automaton has 4808 states and 6518 transitions. Word has length 422 [2018-11-07 09:00:09,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:00:09,311 INFO L480 AbstractCegarLoop]: Abstraction has 4808 states and 6518 transitions. [2018-11-07 09:00:09,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 09:00:09,311 INFO L276 IsEmpty]: Start isEmpty. Operand 4808 states and 6518 transitions. [2018-11-07 09:00:09,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2018-11-07 09:00:09,351 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:00:09,351 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 09:00:09,352 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:00:09,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:00:09,352 INFO L82 PathProgramCache]: Analyzing trace with hash 32605696, now seen corresponding path program 1 times [2018-11-07 09:00:09,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:00:09,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:00:09,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:00:09,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:00:09,354 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:00:09,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:00:10,713 INFO L134 CoverageAnalysis]: Checked inductivity of 809 backedges. 450 proven. 250 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-11-07 09:00:10,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:00:10,714 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 09:00:10,714 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 523 with the following transitions: [2018-11-07 09:00:10,715 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [461], [463], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [830], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 09:00:10,720 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 09:00:10,720 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 09:00:14,510 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 09:00:14,510 INFO L272 AbstractInterpreter]: Visited 164 different actions 322 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 09:00:14,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:00:14,547 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 09:00:16,723 INFO L227 lantSequenceWeakener]: Weakened 519 states. On average, predicates are now at 77.82% of their original sizes. [2018-11-07 09:00:16,723 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 09:00:16,814 INFO L415 sIntCurrentIteration]: We unified 521 AI predicates to 521 [2018-11-07 09:00:16,815 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 09:00:16,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 09:00:16,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 22 [2018-11-07 09:00:16,816 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 09:00:16,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 09:00:16,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 09:00:16,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-07 09:00:16,818 INFO L87 Difference]: Start difference. First operand 4808 states and 6518 transitions. Second operand 10 states. [2018-11-07 09:00:26,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:00:26,398 INFO L93 Difference]: Finished difference Result 9242 states and 12649 transitions. [2018-11-07 09:00:26,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 09:00:26,398 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 522 [2018-11-07 09:00:26,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:00:26,414 INFO L225 Difference]: With dead ends: 9242 [2018-11-07 09:00:26,414 INFO L226 Difference]: Without dead ends: 4623 [2018-11-07 09:00:26,430 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 529 GetRequests, 513 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-11-07 09:00:26,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4623 states. [2018-11-07 09:00:26,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4623 to 4620. [2018-11-07 09:00:26,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4620 states. [2018-11-07 09:00:26,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4620 states to 4620 states and 6300 transitions. [2018-11-07 09:00:26,535 INFO L78 Accepts]: Start accepts. Automaton has 4620 states and 6300 transitions. Word has length 522 [2018-11-07 09:00:26,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:00:26,535 INFO L480 AbstractCegarLoop]: Abstraction has 4620 states and 6300 transitions. [2018-11-07 09:00:26,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 09:00:26,536 INFO L276 IsEmpty]: Start isEmpty. Operand 4620 states and 6300 transitions. [2018-11-07 09:00:26,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 559 [2018-11-07 09:00:26,571 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:00:26,572 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2018-11-07 09:00:26,572 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:00:26,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:00:26,573 INFO L82 PathProgramCache]: Analyzing trace with hash 20863496, now seen corresponding path program 1 times [2018-11-07 09:00:26,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:00:26,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:00:26,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:00:26,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:00:26,574 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:00:26,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:00:27,623 INFO L134 CoverageAnalysis]: Checked inductivity of 917 backedges. 484 proven. 112 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-11-07 09:00:27,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:00:27,624 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 09:00:27,624 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 559 with the following transitions: [2018-11-07 09:00:27,625 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [461], [463], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [830], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 09:00:27,630 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 09:00:27,630 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 09:00:35,823 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 09:00:35,823 INFO L272 AbstractInterpreter]: Visited 164 different actions 491 times. Merged at 7 different actions 21 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-07 09:00:35,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:00:35,832 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 09:00:37,033 INFO L227 lantSequenceWeakener]: Weakened 555 states. On average, predicates are now at 80.5% of their original sizes. [2018-11-07 09:00:37,034 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 09:00:37,240 INFO L415 sIntCurrentIteration]: We unified 557 AI predicates to 557 [2018-11-07 09:00:37,240 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 09:00:37,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 09:00:37,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2018-11-07 09:00:37,241 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 09:00:37,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 09:00:37,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 09:00:37,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-07 09:00:37,242 INFO L87 Difference]: Start difference. First operand 4620 states and 6300 transitions. Second operand 9 states. [2018-11-07 09:00:52,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:00:52,223 INFO L93 Difference]: Finished difference Result 10106 states and 14186 transitions. [2018-11-07 09:00:52,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 09:00:52,224 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 558 [2018-11-07 09:00:52,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:00:52,261 INFO L225 Difference]: With dead ends: 10106 [2018-11-07 09:00:52,262 INFO L226 Difference]: Without dead ends: 5860 [2018-11-07 09:00:52,280 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 564 GetRequests, 550 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-11-07 09:00:52,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5860 states. [2018-11-07 09:00:52,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5860 to 5837. [2018-11-07 09:00:52,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5837 states. [2018-11-07 09:00:52,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5837 states to 5837 states and 7808 transitions. [2018-11-07 09:00:52,416 INFO L78 Accepts]: Start accepts. Automaton has 5837 states and 7808 transitions. Word has length 558 [2018-11-07 09:00:52,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:00:52,417 INFO L480 AbstractCegarLoop]: Abstraction has 5837 states and 7808 transitions. [2018-11-07 09:00:52,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 09:00:52,417 INFO L276 IsEmpty]: Start isEmpty. Operand 5837 states and 7808 transitions. [2018-11-07 09:00:52,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2018-11-07 09:00:52,454 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:00:52,455 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:00:52,455 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:00:52,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:00:52,456 INFO L82 PathProgramCache]: Analyzing trace with hash -936470729, now seen corresponding path program 1 times [2018-11-07 09:00:52,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:00:52,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:00:52,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:00:52,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:00:52,457 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:00:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:00:53,851 WARN L179 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-07 09:00:54,829 INFO L134 CoverageAnalysis]: Checked inductivity of 958 backedges. 486 proven. 363 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-11-07 09:00:54,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:00:54,830 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 09:00:54,830 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 626 with the following transitions: [2018-11-07 09:00:54,830 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [461], [463], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [830], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [879], [883], [887], [891], [895], [899], [903], [907], [911], [915], [919], [923], [927], [931], [934], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 09:00:54,835 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 09:00:54,835 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 09:01:00,395 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 09:01:00,396 INFO L272 AbstractInterpreter]: Visited 191 different actions 763 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 24 variables. [2018-11-07 09:01:00,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:01:00,402 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 09:01:00,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:01:00,402 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 09:01:00,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:01:00,413 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 09:01:00,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:01:00,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 09:01:01,453 WARN L179 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 8 [2018-11-07 09:01:01,825 INFO L134 CoverageAnalysis]: Checked inductivity of 958 backedges. 785 proven. 2 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-11-07 09:01:01,825 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 09:01:02,788 INFO L134 CoverageAnalysis]: Checked inductivity of 958 backedges. 484 proven. 153 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-11-07 09:01:02,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 09:01:02,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6, 6] total 20 [2018-11-07 09:01:02,811 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 09:01:02,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 09:01:02,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 09:01:02,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2018-11-07 09:01:02,813 INFO L87 Difference]: Start difference. First operand 5837 states and 7808 transitions. Second operand 17 states. [2018-11-07 09:01:06,626 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2018-11-07 09:01:06,968 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2018-11-07 09:01:07,453 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 36 [2018-11-07 09:01:08,964 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2018-11-07 09:01:13,131 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2018-11-07 09:01:14,600 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2018-11-07 09:01:16,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:01:16,309 INFO L93 Difference]: Finished difference Result 13048 states and 18386 transitions. [2018-11-07 09:01:16,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-07 09:01:16,309 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 625 [2018-11-07 09:01:16,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:01:16,339 INFO L225 Difference]: With dead ends: 13048 [2018-11-07 09:01:16,339 INFO L226 Difference]: Without dead ends: 7585 [2018-11-07 09:01:16,390 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1347 GetRequests, 1282 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1201 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=916, Invalid=3506, Unknown=0, NotChecked=0, Total=4422 [2018-11-07 09:01:16,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7585 states. [2018-11-07 09:01:16,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7585 to 6943. [2018-11-07 09:01:16,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6943 states. [2018-11-07 09:01:16,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6943 states to 6943 states and 8948 transitions. [2018-11-07 09:01:16,600 INFO L78 Accepts]: Start accepts. Automaton has 6943 states and 8948 transitions. Word has length 625 [2018-11-07 09:01:16,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:01:16,601 INFO L480 AbstractCegarLoop]: Abstraction has 6943 states and 8948 transitions. [2018-11-07 09:01:16,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 09:01:16,602 INFO L276 IsEmpty]: Start isEmpty. Operand 6943 states and 8948 transitions. [2018-11-07 09:01:16,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2018-11-07 09:01:16,637 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:01:16,637 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2018-11-07 09:01:16,637 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:01:16,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:01:16,638 INFO L82 PathProgramCache]: Analyzing trace with hash 398040255, now seen corresponding path program 1 times [2018-11-07 09:01:16,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:01:16,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:01:16,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:01:16,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:01:16,639 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:01:16,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:01:18,106 WARN L179 SmtUtils]: Spent 382.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-07 09:01:19,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1272 backedges. 634 proven. 458 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 09:01:19,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:01:19,024 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 09:01:19,024 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 632 with the following transitions: [2018-11-07 09:01:19,025 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [461], [463], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [830], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 09:01:19,030 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 09:01:19,030 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 09:01:29,697 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 09:01:29,697 INFO L272 AbstractInterpreter]: Visited 166 different actions 658 times. Merged at 8 different actions 30 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 24 variables. [2018-11-07 09:01:29,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:01:29,705 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 09:01:29,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:01:29,705 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 09:01:29,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:01:29,718 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 09:01:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:01:29,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 09:01:30,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1272 backedges. 956 proven. 2 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2018-11-07 09:01:30,563 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 09:01:31,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1272 backedges. 628 proven. 112 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2018-11-07 09:01:31,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 09:01:31,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5, 5] total 19 [2018-11-07 09:01:31,420 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 09:01:31,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 09:01:31,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 09:01:31,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2018-11-07 09:01:31,422 INFO L87 Difference]: Start difference. First operand 6943 states and 8948 transitions. Second operand 17 states. [2018-11-07 09:01:33,208 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 26 [2018-11-07 09:01:38,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:01:38,316 INFO L93 Difference]: Finished difference Result 13666 states and 18762 transitions. [2018-11-07 09:01:38,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-07 09:01:38,317 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 631 [2018-11-07 09:01:38,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:01:38,340 INFO L225 Difference]: With dead ends: 13666 [2018-11-07 09:01:38,340 INFO L226 Difference]: Without dead ends: 5894 [2018-11-07 09:01:38,365 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1318 GetRequests, 1272 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=500, Invalid=1662, Unknown=0, NotChecked=0, Total=2162 [2018-11-07 09:01:38,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5894 states. [2018-11-07 09:01:38,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5894 to 5665. [2018-11-07 09:01:38,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5665 states. [2018-11-07 09:01:38,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5665 states to 5665 states and 6566 transitions. [2018-11-07 09:01:38,515 INFO L78 Accepts]: Start accepts. Automaton has 5665 states and 6566 transitions. Word has length 631 [2018-11-07 09:01:38,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:01:38,516 INFO L480 AbstractCegarLoop]: Abstraction has 5665 states and 6566 transitions. [2018-11-07 09:01:38,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 09:01:38,516 INFO L276 IsEmpty]: Start isEmpty. Operand 5665 states and 6566 transitions. [2018-11-07 09:01:38,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 737 [2018-11-07 09:01:38,531 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:01:38,532 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:01:38,532 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:01:38,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:01:38,533 INFO L82 PathProgramCache]: Analyzing trace with hash 10822516, now seen corresponding path program 2 times [2018-11-07 09:01:38,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:01:38,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:01:38,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:01:38,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:01:38,534 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:01:38,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:01:39,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1464 backedges. 666 proven. 153 refuted. 0 times theorem prover too weak. 645 trivial. 0 not checked. [2018-11-07 09:01:39,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:01:39,516 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 09:01:39,517 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 09:01:39,517 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 09:01:39,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:01:39,517 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 09:01:39,525 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 09:01:39,526 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 09:01:39,606 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-07 09:01:39,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 09:01:39,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 09:01:40,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1464 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 1137 trivial. 0 not checked. [2018-11-07 09:01:40,484 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 09:01:40,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1464 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 1137 trivial. 0 not checked. [2018-11-07 09:01:40,870 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 09:01:40,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 8 [2018-11-07 09:01:40,871 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 09:01:40,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 09:01:40,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 09:01:40,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-07 09:01:40,872 INFO L87 Difference]: Start difference. First operand 5665 states and 6566 transitions. Second operand 3 states. [2018-11-07 09:01:42,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:01:42,265 INFO L93 Difference]: Finished difference Result 13576 states and 16085 transitions. [2018-11-07 09:01:42,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 09:01:42,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 736 [2018-11-07 09:01:42,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:01:42,267 INFO L225 Difference]: With dead ends: 13576 [2018-11-07 09:01:42,267 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 09:01:42,301 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1477 GetRequests, 1471 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-07 09:01:42,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 09:01:42,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 09:01:42,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 09:01:42,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 09:01:42,303 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 736 [2018-11-07 09:01:42,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:01:42,303 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 09:01:42,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 09:01:42,303 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 09:01:42,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 09:01:42,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 09:01:42,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,660 WARN L179 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 135 [2018-11-07 09:01:42,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:01:42,914 WARN L179 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 267 DAG size of output: 176 [2018-11-07 09:01:43,268 WARN L179 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 15 [2018-11-07 09:01:43,973 WARN L179 SmtUtils]: Spent 702.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 29 [2018-11-07 09:01:45,126 WARN L179 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 199 DAG size of output: 54 [2018-11-07 09:01:45,695 WARN L179 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 59 [2018-11-07 09:01:46,217 WARN L179 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 59 [2018-11-07 09:01:46,221 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 09:01:46,221 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a12~0 |old(~a12~0)|) (= ~a24~0 |old(~a24~0)|) (= ~a21~0 |old(~a21~0)|) (= |old(~a15~0)| ~a15~0)) [2018-11-07 09:01:46,222 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 09:01:46,222 INFO L425 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2018-11-07 09:01:46,222 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 193) no Hoare annotation was computed. [2018-11-07 09:01:46,222 INFO L425 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2018-11-07 09:01:46,222 INFO L425 ceAbstractionStarter]: For program point L168(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,222 INFO L425 ceAbstractionStarter]: For program point L102(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,222 INFO L425 ceAbstractionStarter]: For program point L36(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,222 INFO L425 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2018-11-07 09:01:46,222 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-07 09:01:46,222 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-11-07 09:01:46,222 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-07 09:01:46,223 INFO L425 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2018-11-07 09:01:46,223 INFO L425 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2018-11-07 09:01:46,223 INFO L425 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2018-11-07 09:01:46,223 INFO L425 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2018-11-07 09:01:46,223 INFO L425 ceAbstractionStarter]: For program point L171(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,223 INFO L425 ceAbstractionStarter]: For program point L105(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,223 INFO L425 ceAbstractionStarter]: For program point L39(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,223 INFO L425 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2018-11-07 09:01:46,223 INFO L425 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2018-11-07 09:01:46,223 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-07 09:01:46,223 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-07 09:01:46,223 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-07 09:01:46,223 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2018-11-07 09:01:46,224 INFO L425 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2018-11-07 09:01:46,224 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2018-11-07 09:01:46,224 INFO L425 ceAbstractionStarter]: For program point L174(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,224 INFO L425 ceAbstractionStarter]: For program point L108(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,224 INFO L425 ceAbstractionStarter]: For program point L42(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,224 INFO L425 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2018-11-07 09:01:46,224 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-07 09:01:46,224 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-07 09:01:46,224 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-07 09:01:46,224 INFO L425 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2018-11-07 09:01:46,224 INFO L425 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2018-11-07 09:01:46,225 INFO L425 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2018-11-07 09:01:46,225 INFO L425 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2018-11-07 09:01:46,225 INFO L425 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2018-11-07 09:01:46,225 INFO L425 ceAbstractionStarter]: For program point L177(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,225 INFO L425 ceAbstractionStarter]: For program point L111(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,225 INFO L425 ceAbstractionStarter]: For program point L45(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,225 INFO L425 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2018-11-07 09:01:46,225 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-11-07 09:01:46,225 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-07 09:01:46,225 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-07 09:01:46,226 INFO L425 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2018-11-07 09:01:46,226 INFO L425 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2018-11-07 09:01:46,226 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2018-11-07 09:01:46,226 INFO L425 ceAbstractionStarter]: For program point L180(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,226 INFO L425 ceAbstractionStarter]: For program point L114(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,226 INFO L425 ceAbstractionStarter]: For program point L48(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,226 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2018-11-07 09:01:46,226 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-07 09:01:46,226 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-07 09:01:46,227 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-11-07 09:01:46,227 INFO L425 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2018-11-07 09:01:46,227 INFO L425 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2018-11-07 09:01:46,227 INFO L425 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2018-11-07 09:01:46,227 INFO L425 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2018-11-07 09:01:46,227 INFO L425 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2018-11-07 09:01:46,227 INFO L425 ceAbstractionStarter]: For program point L183(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,227 INFO L425 ceAbstractionStarter]: For program point L117(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,228 INFO L425 ceAbstractionStarter]: For program point L51(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,228 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,228 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2018-11-07 09:01:46,228 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-07 09:01:46,228 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-07 09:01:46,228 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-07 09:01:46,228 INFO L425 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2018-11-07 09:01:46,228 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2018-11-07 09:01:46,228 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2018-11-07 09:01:46,229 INFO L425 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2018-11-07 09:01:46,229 INFO L425 ceAbstractionStarter]: For program point L186(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,229 INFO L425 ceAbstractionStarter]: For program point L120(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,229 INFO L425 ceAbstractionStarter]: For program point L54(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,229 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-11-07 09:01:46,229 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-07 09:01:46,229 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-07 09:01:46,229 INFO L425 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2018-11-07 09:01:46,229 INFO L425 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2018-11-07 09:01:46,229 INFO L425 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2018-11-07 09:01:46,230 INFO L425 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2018-11-07 09:01:46,230 INFO L425 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2018-11-07 09:01:46,230 INFO L425 ceAbstractionStarter]: For program point L189(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,230 INFO L425 ceAbstractionStarter]: For program point L123(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,230 INFO L425 ceAbstractionStarter]: For program point L57(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,230 INFO L425 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2018-11-07 09:01:46,230 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2018-11-07 09:01:46,230 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-07 09:01:46,230 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-07 09:01:46,231 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-07 09:01:46,231 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2018-11-07 09:01:46,231 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 872) the Hoare annotation is: (let ((.cse0 (= 7 |old(~a21~0)|)) (.cse3 (= 9 |old(~a15~0)|)) (.cse1 (not (= 1 |old(~a24~0)|))) (.cse2 (and (= ~a12~0 |old(~a12~0)|) (= ~a24~0 |old(~a24~0)|) (= ~a21~0 |old(~a21~0)|) (= |old(~a15~0)| ~a15~0)))) (and (or (= 9 |old(~a21~0)|) .cse0 .cse1 .cse2) (or .cse2 (= 5 |old(~a15~0)|) .cse1 .cse3) (or .cse2 (not (= 6 |old(~a21~0)|)) .cse3) (or .cse2 .cse0 .cse1 .cse3) (or .cse1 .cse2 (forall ((v_~a12~0_488 Int)) (let ((.cse5 (+ (* 9 v_~a12~0_488) 504))) (let ((.cse4 (div .cse5 10))) (or (< |old(~a12~0)| (+ (div .cse4 5) 56)) (< .cse4 0) (< .cse5 0) (<= (+ v_~a12~0_488 43) 0)))))))) [2018-11-07 09:01:46,231 INFO L425 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2018-11-07 09:01:46,231 INFO L425 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2018-11-07 09:01:46,231 INFO L425 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,231 INFO L425 ceAbstractionStarter]: For program point L126(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,231 INFO L425 ceAbstractionStarter]: For program point L60(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,232 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-11-07 09:01:46,232 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-07 09:01:46,232 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-11-07 09:01:46,232 INFO L425 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2018-11-07 09:01:46,232 INFO L425 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2018-11-07 09:01:46,232 INFO L425 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2018-11-07 09:01:46,232 INFO L425 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2018-11-07 09:01:46,232 INFO L425 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2018-11-07 09:01:46,232 INFO L425 ceAbstractionStarter]: For program point L195(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,233 INFO L425 ceAbstractionStarter]: For program point L129(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,233 INFO L425 ceAbstractionStarter]: For program point L63(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,233 INFO L425 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2018-11-07 09:01:46,233 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2018-11-07 09:01:46,233 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-07 09:01:46,233 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-07 09:01:46,233 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-07 09:01:46,233 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2018-11-07 09:01:46,234 INFO L425 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2018-11-07 09:01:46,234 INFO L425 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2018-11-07 09:01:46,234 INFO L425 ceAbstractionStarter]: For program point L198(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,234 INFO L425 ceAbstractionStarter]: For program point L132(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,234 INFO L425 ceAbstractionStarter]: For program point L66(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,234 INFO L425 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2018-11-07 09:01:46,234 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-07 09:01:46,234 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-07 09:01:46,234 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-07 09:01:46,234 INFO L425 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2018-11-07 09:01:46,234 INFO L425 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2018-11-07 09:01:46,234 INFO L425 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2018-11-07 09:01:46,234 INFO L425 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2018-11-07 09:01:46,234 INFO L425 ceAbstractionStarter]: For program point L201(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,235 INFO L425 ceAbstractionStarter]: For program point L135(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,235 INFO L425 ceAbstractionStarter]: For program point L69(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,235 INFO L425 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2018-11-07 09:01:46,235 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-07 09:01:46,235 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-07 09:01:46,235 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-11-07 09:01:46,235 INFO L425 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2018-11-07 09:01:46,235 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2018-11-07 09:01:46,235 INFO L425 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2018-11-07 09:01:46,235 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2018-11-07 09:01:46,235 INFO L425 ceAbstractionStarter]: For program point L138(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,235 INFO L425 ceAbstractionStarter]: For program point L72(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,235 INFO L425 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2018-11-07 09:01:46,235 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-07 09:01:46,236 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-07 09:01:46,236 INFO L425 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2018-11-07 09:01:46,236 INFO L425 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2018-11-07 09:01:46,236 INFO L425 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2018-11-07 09:01:46,236 INFO L425 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2018-11-07 09:01:46,236 INFO L425 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2018-11-07 09:01:46,236 INFO L425 ceAbstractionStarter]: For program point L141(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,236 INFO L425 ceAbstractionStarter]: For program point L75(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,236 INFO L425 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2018-11-07 09:01:46,236 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-07 09:01:46,236 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-11-07 09:01:46,236 INFO L425 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2018-11-07 09:01:46,236 INFO L425 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2018-11-07 09:01:46,237 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2018-11-07 09:01:46,237 INFO L425 ceAbstractionStarter]: For program point L144(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,237 INFO L425 ceAbstractionStarter]: For program point L78(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,237 INFO L425 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2018-11-07 09:01:46,237 INFO L425 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2018-11-07 09:01:46,237 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-07 09:01:46,237 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-07 09:01:46,237 INFO L425 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2018-11-07 09:01:46,237 INFO L425 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2018-11-07 09:01:46,237 INFO L425 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2018-11-07 09:01:46,237 INFO L425 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2018-11-07 09:01:46,237 INFO L425 ceAbstractionStarter]: For program point L147(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,237 INFO L425 ceAbstractionStarter]: For program point L81(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,238 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2018-11-07 09:01:46,238 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2018-11-07 09:01:46,238 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-07 09:01:46,238 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-07 09:01:46,238 INFO L425 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2018-11-07 09:01:46,238 INFO L425 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2018-11-07 09:01:46,238 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2018-11-07 09:01:46,238 INFO L425 ceAbstractionStarter]: For program point L150(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,238 INFO L425 ceAbstractionStarter]: For program point L84(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,238 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,238 INFO L425 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2018-11-07 09:01:46,238 INFO L425 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2018-11-07 09:01:46,238 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-07 09:01:46,238 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-11-07 09:01:46,238 INFO L425 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2018-11-07 09:01:46,238 INFO L425 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2018-11-07 09:01:46,239 INFO L425 ceAbstractionStarter]: For program point L153(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,239 INFO L425 ceAbstractionStarter]: For program point L87(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,239 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-11-07 09:01:46,239 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,239 INFO L425 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2018-11-07 09:01:46,239 INFO L425 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2018-11-07 09:01:46,239 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2018-11-07 09:01:46,239 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-07 09:01:46,239 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-07 09:01:46,239 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-07 09:01:46,239 INFO L425 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2018-11-07 09:01:46,239 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2018-11-07 09:01:46,239 INFO L425 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2018-11-07 09:01:46,239 INFO L425 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2018-11-07 09:01:46,239 INFO L425 ceAbstractionStarter]: For program point L156(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,240 INFO L425 ceAbstractionStarter]: For program point L90(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,240 INFO L425 ceAbstractionStarter]: For program point L24(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,240 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2018-11-07 09:01:46,240 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-07 09:01:46,240 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-07 09:01:46,240 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-07 09:01:46,240 INFO L425 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2018-11-07 09:01:46,240 INFO L425 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2018-11-07 09:01:46,240 INFO L425 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2018-11-07 09:01:46,240 INFO L425 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2018-11-07 09:01:46,240 INFO L425 ceAbstractionStarter]: For program point L159(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,240 INFO L425 ceAbstractionStarter]: For program point L93(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,240 INFO L425 ceAbstractionStarter]: For program point L27(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,240 INFO L425 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2018-11-07 09:01:46,240 INFO L425 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2018-11-07 09:01:46,241 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-07 09:01:46,241 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-11-07 09:01:46,241 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-07 09:01:46,241 INFO L425 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2018-11-07 09:01:46,241 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2018-11-07 09:01:46,241 INFO L425 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2018-11-07 09:01:46,241 INFO L425 ceAbstractionStarter]: For program point L162(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,241 INFO L425 ceAbstractionStarter]: For program point L96(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,241 INFO L425 ceAbstractionStarter]: For program point L30(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,241 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2018-11-07 09:01:46,241 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-07 09:01:46,241 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-07 09:01:46,241 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-07 09:01:46,241 INFO L425 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2018-11-07 09:01:46,241 INFO L425 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2018-11-07 09:01:46,241 INFO L425 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2018-11-07 09:01:46,242 INFO L425 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2018-11-07 09:01:46,242 INFO L425 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2018-11-07 09:01:46,242 INFO L425 ceAbstractionStarter]: For program point L165(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,242 INFO L425 ceAbstractionStarter]: For program point L99(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,242 INFO L425 ceAbstractionStarter]: For program point L33(lines 20 872) no Hoare annotation was computed. [2018-11-07 09:01:46,242 INFO L425 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2018-11-07 09:01:46,242 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-07 09:01:46,242 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-07 09:01:46,242 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-07 09:01:46,242 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2018-11-07 09:01:46,242 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 09:01:46,242 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 8 ~a15~0) (= (+ ~a12~0 49) 0) (= ~a24~0 1) (= ~a21~0 7)) [2018-11-07 09:01:46,242 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 09:01:46,242 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 09:01:46,243 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 874 890) the Hoare annotation is: (or (not (= 7 |old(~a21~0)|)) (and (= 8 ~a15~0) (= (+ ~a12~0 49) 0) (= ~a24~0 1) (= ~a21~0 7)) (not (= 1 |old(~a24~0)|)) (not (= 8 |old(~a15~0)|)) (not (= 0 (+ |old(~a12~0)| 49)))) [2018-11-07 09:01:46,243 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 874 890) no Hoare annotation was computed. [2018-11-07 09:01:46,243 INFO L421 ceAbstractionStarter]: At program point L888(line 888) the Hoare annotation is: (let ((.cse0 (= 1 ~a24~0)) (.cse3 (not (= ~a15~0 9))) (.cse4 (not (= 7 ~a21~0)))) (or (and .cse0 (exists ((v_~a12~0_488 Int)) (let ((.cse2 (+ (* 9 v_~a12~0_488) 504))) (let ((.cse1 (div .cse2 10))) (and (<= (+ (div .cse1 5) 56) ~a12~0) (<= 0 .cse2) (< 0 (+ v_~a12~0_488 43)) (<= 0 .cse1)))))) (not (= 8 |old(~a15~0)|)) (and .cse3 (= 6 ~a21~0)) (and (not (= ~a21~0 9)) .cse4 .cse0) (and .cse3 (not (= ~a15~0 5)) .cse0) (and .cse3 .cse4 (= ~a24~0 |old(~a24~0)|)) (not (= 7 |old(~a21~0)|)) (not (= 1 |old(~a24~0)|)) (not (= 0 (+ |old(~a12~0)| 49))))) [2018-11-07 09:01:46,243 INFO L425 ceAbstractionStarter]: For program point L888-1(line 888) no Hoare annotation was computed. [2018-11-07 09:01:46,243 INFO L425 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2018-11-07 09:01:46,243 INFO L425 ceAbstractionStarter]: For program point L880-1(lines 880 889) no Hoare annotation was computed. [2018-11-07 09:01:46,244 INFO L421 ceAbstractionStarter]: At program point L880-3(lines 880 889) the Hoare annotation is: (let ((.cse0 (= 1 ~a24~0)) (.cse3 (not (= ~a15~0 9))) (.cse4 (not (= 7 ~a21~0)))) (or (and .cse0 (exists ((v_~a12~0_488 Int)) (let ((.cse2 (+ (* 9 v_~a12~0_488) 504))) (let ((.cse1 (div .cse2 10))) (and (<= (+ (div .cse1 5) 56) ~a12~0) (<= 0 .cse2) (< 0 (+ v_~a12~0_488 43)) (<= 0 .cse1)))))) (not (= 8 |old(~a15~0)|)) (and .cse3 (= 6 ~a21~0)) (and (not (= ~a21~0 9)) .cse4 .cse0) (and .cse3 (not (= ~a15~0 5)) .cse0) (and .cse3 .cse4 (= ~a24~0 |old(~a24~0)|)) (not (= 7 |old(~a21~0)|)) (not (= 1 |old(~a24~0)|)) (not (= 0 (+ |old(~a12~0)| 49))))) [2018-11-07 09:01:46,244 INFO L425 ceAbstractionStarter]: For program point L880-4(lines 874 890) no Hoare annotation was computed. [2018-11-07 09:01:46,249 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] [2018-11-07 09:01:46,250 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] [2018-11-07 09:01:46,250 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] [2018-11-07 09:01:46,250 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] [2018-11-07 09:01:46,256 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] [2018-11-07 09:01:46,256 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] [2018-11-07 09:01:46,257 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] [2018-11-07 09:01:46,257 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] [2018-11-07 09:01:46,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 09:01:46 BoogieIcfgContainer [2018-11-07 09:01:46,260 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 09:01:46,261 INFO L168 Benchmark]: Toolchain (without parser) took 223598.33 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -118.1 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-11-07 09:01:46,262 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 09:01:46,263 INFO L168 Benchmark]: CACSL2BoogieTranslator took 778.40 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: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-11-07 09:01:46,263 INFO L168 Benchmark]: Boogie Procedure Inliner took 172.49 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 728.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -824.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 7.1 GB. [2018-11-07 09:01:46,264 INFO L168 Benchmark]: Boogie Preprocessor took 124.14 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-11-07 09:01:46,265 INFO L168 Benchmark]: RCFGBuilder took 3790.10 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: 121.7 MB). Peak memory consumption was 121.7 MB. Max. memory is 7.1 GB. [2018-11-07 09:01:46,265 INFO L168 Benchmark]: TraceAbstraction took 218727.62 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 1.5 GB in the end (delta: 531.4 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-11-07 09:01:46,270 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.23 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 778.40 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: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 172.49 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 728.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -824.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 124.14 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 3790.10 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: 121.7 MB). Peak memory consumption was 121.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 218727.62 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 1.5 GB in the end (delta: 531.4 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 193]: 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: 880]: Loop Invariant [2018-11-07 09:01:46,279 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] [2018-11-07 09:01:46,280 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] [2018-11-07 09:01:46,280 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] [2018-11-07 09:01:46,280 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] [2018-11-07 09:01:46,281 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] [2018-11-07 09:01:46,281 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] [2018-11-07 09:01:46,281 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] [2018-11-07 09:01:46,282 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] Derived loop invariant: ((((((((1 == a24 && (\exists v_~a12~0_488 : int :: (((9 * v_~a12~0_488 + 504) / 10 / 5 + 56 <= a12 && 0 <= 9 * v_~a12~0_488 + 504) && 0 < v_~a12~0_488 + 43) && 0 <= (9 * v_~a12~0_488 + 504) / 10)) || !(8 == \old(a15))) || (!(a15 == 9) && 6 == a21)) || ((!(a21 == 9) && !(7 == a21)) && 1 == a24)) || ((!(a15 == 9) && !(a15 == 5)) && 1 == a24)) || ((!(a15 == 9) && !(7 == a21)) && a24 == \old(a24))) || !(7 == \old(a21))) || !(1 == \old(a24))) || !(0 == \old(a12) + 49) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 255 locations, 1 error locations. SAFE Result, 218.6s OverallTime, 12 OverallIterations, 6 TraceHistogramMax, 148.4s AutomataDifference, 0.0s DeadEndRemovalTime, 3.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 2144 SDtfs, 16779 SDslu, 2370 SDs, 0 SdLazy, 21942 SolverSat, 4134 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 112.4s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 6040 GetRequests, 5845 SyntacticMatches, 5 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1887 ImplicationChecksByTransitivity, 12.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6943occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 36.3s AbstIntTime, 6 AbstIntIterations, 4 AbstIntStrong, 0.9977146582625492 AbsIntWeakeningRatio, 0.07302452316076294 AbsIntAvgWeakeningVarsNumRemoved, 16.280653950953678 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 1045 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 182 PreInvPairs, 264 NumberOfFragments, 421 HoareAnnotationTreeSize, 182 FomulaSimplifications, 16833 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 7 FomulaSimplificationsInter, 9020 FormulaSimplificationTreeSizeReductionInter, 3.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 13.0s InterpolantComputationTime, 6461 NumberOfCodeBlocks, 5949 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 8435 ConstructedInterpolants, 66 QuantifiedInterpolants, 23480294 SizeOfPredicates, 16 NumberOfNonLiveVariables, 2189 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 18 InterpolantComputations, 7 PerfectInterpolantSequences, 11868/13771 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...