java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label08_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:08:47,820 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:08:47,825 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:08:47,843 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:08:47,843 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:08:47,845 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:08:47,846 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:08:47,848 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:08:47,850 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:08:47,851 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:08:47,851 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:08:47,852 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:08:47,853 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:08:47,854 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:08:47,855 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:08:47,856 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:08:47,856 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:08:47,858 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:08:47,860 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:08:47,865 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:08:47,866 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:08:47,870 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:08:47,872 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:08:47,872 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:08:47,872 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:08:47,873 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:08:47,874 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:08:47,875 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:08:47,875 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:08:47,877 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:08:47,877 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:08:47,877 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:08:47,878 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:08:47,878 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:08:47,879 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:08:47,879 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:08:47,880 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-27 06:08:47,895 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:08:47,895 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:08:47,896 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 06:08:47,896 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 06:08:47,896 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 06:08:47,897 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 06:08:47,897 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-27 06:08:47,897 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 06:08:47,897 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-27 06:08:47,897 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 06:08:47,898 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 06:08:47,898 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 06:08:47,898 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 06:08:47,898 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 06:08:47,899 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:08:47,899 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:08:47,899 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:08:47,899 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 06:08:47,899 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 06:08:47,900 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 06:08:47,900 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:08:47,900 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 06:08:47,900 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:08:47,901 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:08:47,901 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 06:08:47,901 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 06:08:47,901 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 06:08:47,901 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:08:47,901 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 06:08:47,902 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 06:08:47,902 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 06:08:47,902 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 06:08:47,902 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 06:08:47,902 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 06:08:47,903 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 06:08:47,903 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 06:08:47,958 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:08:47,976 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:08:47,981 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:08:47,982 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:08:47,983 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:08:47,984 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label08_true-unreach-call_false-termination.c [2018-10-27 06:08:48,051 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f365f3a20/e502941a0e964f75af343fa0833f15a1/FLAGc288ce988 [2018-10-27 06:08:48,702 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:08:48,702 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label08_true-unreach-call_false-termination.c [2018-10-27 06:08:48,720 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f365f3a20/e502941a0e964f75af343fa0833f15a1/FLAGc288ce988 [2018-10-27 06:08:48,743 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f365f3a20/e502941a0e964f75af343fa0833f15a1 [2018-10-27 06:08:48,755 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:08:48,758 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 06:08:48,760 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:08:48,760 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:08:48,766 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:08:48,767 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:08:48" (1/1) ... [2018-10-27 06:08:48,771 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71e73589 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:48, skipping insertion in model container [2018-10-27 06:08:48,771 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:08:48" (1/1) ... [2018-10-27 06:08:48,782 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:08:48,843 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:08:49,268 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:08:49,281 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:08:49,380 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:08:49,399 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:08:49,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:49 WrapperNode [2018-10-27 06:08:49,400 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:08:49,401 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:08:49,401 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:08:49,402 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:08:49,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:49" (1/1) ... [2018-10-27 06:08:49,434 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:49" (1/1) ... [2018-10-27 06:08:49,612 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:08:49,612 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:08:49,612 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:08:49,612 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:08:49,624 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:49" (1/1) ... [2018-10-27 06:08:49,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:49" (1/1) ... [2018-10-27 06:08:49,632 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:49" (1/1) ... [2018-10-27 06:08:49,632 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:49" (1/1) ... [2018-10-27 06:08:49,671 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:49" (1/1) ... [2018-10-27 06:08:49,694 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:49" (1/1) ... [2018-10-27 06:08:49,704 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:49" (1/1) ... [2018-10-27 06:08:49,717 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:08:49,718 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:08:49,718 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:08:49,718 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:08:49,719 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 06:08:49,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 06:08:49,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 06:08:49,795 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-27 06:08:49,795 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-27 06:08:49,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:08:49,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:08:49,796 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 06:08:49,796 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 06:08:53,487 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:08:53,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:08:53 BoogieIcfgContainer [2018-10-27 06:08:53,491 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:08:53,492 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 06:08:53,493 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 06:08:53,496 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 06:08:53,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 06:08:48" (1/3) ... [2018-10-27 06:08:53,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@192018a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 06:08:53, skipping insertion in model container [2018-10-27 06:08:53,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:49" (2/3) ... [2018-10-27 06:08:53,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@192018a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 06:08:53, skipping insertion in model container [2018-10-27 06:08:53,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:08:53" (3/3) ... [2018-10-27 06:08:53,500 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label08_true-unreach-call_false-termination.c [2018-10-27 06:08:53,510 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 06:08:53,520 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 06:08:53,538 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 06:08:53,581 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 06:08:53,581 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 06:08:53,582 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 06:08:53,582 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:08:53,582 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:08:53,582 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 06:08:53,583 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:08:53,583 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 06:08:53,611 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-10-27 06:08:53,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-27 06:08:53,626 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:08:53,627 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:53,630 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:08:53,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:53,638 INFO L82 PathProgramCache]: Analyzing trace with hash -682702232, now seen corresponding path program 1 times [2018-10-27 06:08:53,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:08:53,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:53,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:53,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:53,687 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:08:53,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:54,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:54,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:08:54,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:08:54,284 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:08:54,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 06:08:54,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:08:54,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:08:54,312 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-10-27 06:08:56,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:56,009 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-10-27 06:08:56,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:08:56,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2018-10-27 06:08:56,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:08:56,033 INFO L225 Difference]: With dead ends: 550 [2018-10-27 06:08:56,034 INFO L226 Difference]: Without dead ends: 340 [2018-10-27 06:08:56,041 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:08:56,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-27 06:08:56,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-10-27 06:08:56,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-27 06:08:56,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 553 transitions. [2018-10-27 06:08:56,134 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 553 transitions. Word has length 120 [2018-10-27 06:08:56,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:08:56,136 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 553 transitions. [2018-10-27 06:08:56,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 06:08:56,136 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 553 transitions. [2018-10-27 06:08:56,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-27 06:08:56,145 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:08:56,145 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:56,146 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:08:56,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:56,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1009333063, now seen corresponding path program 1 times [2018-10-27 06:08:56,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:08:56,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:56,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:56,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:56,149 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:08:56,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:56,381 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:56,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:08:56,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 06:08:56,384 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:08:56,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 06:08:56,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 06:08:56,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 06:08:56,389 INFO L87 Difference]: Start difference. First operand 340 states and 553 transitions. Second operand 6 states. [2018-10-27 06:08:58,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:58,309 INFO L93 Difference]: Finished difference Result 1075 states and 1835 transitions. [2018-10-27 06:08:58,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 06:08:58,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2018-10-27 06:08:58,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:08:58,325 INFO L225 Difference]: With dead ends: 1075 [2018-10-27 06:08:58,325 INFO L226 Difference]: Without dead ends: 741 [2018-10-27 06:08:58,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 06:08:58,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-10-27 06:08:58,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 724. [2018-10-27 06:08:58,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-10-27 06:08:58,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1145 transitions. [2018-10-27 06:08:58,395 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1145 transitions. Word has length 131 [2018-10-27 06:08:58,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:08:58,396 INFO L481 AbstractCegarLoop]: Abstraction has 724 states and 1145 transitions. [2018-10-27 06:08:58,396 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 06:08:58,396 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1145 transitions. [2018-10-27 06:08:58,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-27 06:08:58,401 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:08:58,401 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:58,402 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:08:58,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:58,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1121563035, now seen corresponding path program 1 times [2018-10-27 06:08:58,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:08:58,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:58,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:58,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:58,404 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:08:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:58,844 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:58,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:08:58,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:08:58,845 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:08:58,845 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 06:08:58,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:08:58,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:08:58,846 INFO L87 Difference]: Start difference. First operand 724 states and 1145 transitions. Second operand 5 states. [2018-10-27 06:09:01,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:01,181 INFO L93 Difference]: Finished difference Result 1578 states and 2533 transitions. [2018-10-27 06:09:01,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:09:01,181 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2018-10-27 06:09:01,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:09:01,187 INFO L225 Difference]: With dead ends: 1578 [2018-10-27 06:09:01,188 INFO L226 Difference]: Without dead ends: 721 [2018-10-27 06:09:01,194 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:09:01,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2018-10-27 06:09:01,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 721. [2018-10-27 06:09:01,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2018-10-27 06:09:01,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1069 transitions. [2018-10-27 06:09:01,236 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1069 transitions. Word has length 132 [2018-10-27 06:09:01,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:09:01,237 INFO L481 AbstractCegarLoop]: Abstraction has 721 states and 1069 transitions. [2018-10-27 06:09:01,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 06:09:01,237 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1069 transitions. [2018-10-27 06:09:01,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-27 06:09:01,241 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:09:01,241 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:01,241 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:09:01,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:01,242 INFO L82 PathProgramCache]: Analyzing trace with hash 915740739, now seen corresponding path program 1 times [2018-10-27 06:09:01,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:09:01,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:01,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:01,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:01,244 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:09:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:01,896 WARN L179 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2018-10-27 06:09:02,180 WARN L179 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-10-27 06:09:02,266 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:02,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:09:02,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:09:02,267 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:09:02,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 06:09:02,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:09:02,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:09:02,269 INFO L87 Difference]: Start difference. First operand 721 states and 1069 transitions. Second operand 5 states. [2018-10-27 06:09:03,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:03,454 INFO L93 Difference]: Finished difference Result 1572 states and 2365 transitions. [2018-10-27 06:09:03,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:09:03,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2018-10-27 06:09:03,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:09:03,465 INFO L225 Difference]: With dead ends: 1572 [2018-10-27 06:09:03,466 INFO L226 Difference]: Without dead ends: 720 [2018-10-27 06:09:03,469 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:09:03,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2018-10-27 06:09:03,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 720. [2018-10-27 06:09:03,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2018-10-27 06:09:03,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1062 transitions. [2018-10-27 06:09:03,503 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1062 transitions. Word has length 133 [2018-10-27 06:09:03,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:09:03,504 INFO L481 AbstractCegarLoop]: Abstraction has 720 states and 1062 transitions. [2018-10-27 06:09:03,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 06:09:03,504 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1062 transitions. [2018-10-27 06:09:03,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-27 06:09:03,507 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:09:03,507 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:03,508 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:09:03,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:03,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1024180077, now seen corresponding path program 1 times [2018-10-27 06:09:03,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:09:03,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:03,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:03,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:03,511 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:09:03,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:03,646 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:03,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:09:03,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:09:03,646 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:09:03,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 06:09:03,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:09:03,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:09:03,648 INFO L87 Difference]: Start difference. First operand 720 states and 1062 transitions. Second operand 3 states. [2018-10-27 06:09:04,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:04,391 INFO L93 Difference]: Finished difference Result 1882 states and 2820 transitions. [2018-10-27 06:09:04,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:09:04,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2018-10-27 06:09:04,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:09:04,405 INFO L225 Difference]: With dead ends: 1882 [2018-10-27 06:09:04,405 INFO L226 Difference]: Without dead ends: 1168 [2018-10-27 06:09:04,409 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:09:04,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2018-10-27 06:09:04,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1164. [2018-10-27 06:09:04,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1164 states. [2018-10-27 06:09:04,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1592 transitions. [2018-10-27 06:09:04,449 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1592 transitions. Word has length 136 [2018-10-27 06:09:04,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:09:04,449 INFO L481 AbstractCegarLoop]: Abstraction has 1164 states and 1592 transitions. [2018-10-27 06:09:04,450 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 06:09:04,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1592 transitions. [2018-10-27 06:09:04,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-27 06:09:04,456 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:09:04,456 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:04,456 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:09:04,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:04,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1336149662, now seen corresponding path program 1 times [2018-10-27 06:09:04,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:09:04,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:04,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:04,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:04,458 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:09:04,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:04,685 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:04,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:04,685 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 06:09:04,687 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 169 with the following transitions: [2018-10-27 06:09:04,689 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [597], [599], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 06:09:04,743 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 06:09:04,744 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 06:09:05,322 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 06:09:05,324 INFO L272 AbstractInterpreter]: Visited 121 different actions 121 times. Never merged. Never widened. Never found a fixpoint. Largest state had 42 variables. [2018-10-27 06:09:05,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:05,372 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 06:09:05,934 INFO L227 lantSequenceWeakener]: Weakened 159 states. On average, predicates are now at 80.46% of their original sizes. [2018-10-27 06:09:05,934 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 06:09:06,024 INFO L415 sIntCurrentIteration]: We unified 167 AI predicates to 167 [2018-10-27 06:09:06,025 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 06:09:06,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 06:09:06,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-27 06:09:06,026 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:09:06,027 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 06:09:06,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 06:09:06,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 06:09:06,028 INFO L87 Difference]: Start difference. First operand 1164 states and 1592 transitions. Second operand 6 states. [2018-10-27 06:09:11,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:11,489 INFO L93 Difference]: Finished difference Result 2460 states and 3350 transitions. [2018-10-27 06:09:11,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 06:09:11,490 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 168 [2018-10-27 06:09:11,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:09:11,496 INFO L225 Difference]: With dead ends: 2460 [2018-10-27 06:09:11,497 INFO L226 Difference]: Without dead ends: 1302 [2018-10-27 06:09:11,501 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 168 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-27 06:09:11,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2018-10-27 06:09:11,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1300. [2018-10-27 06:09:11,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2018-10-27 06:09:11,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 1734 transitions. [2018-10-27 06:09:11,535 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 1734 transitions. Word has length 168 [2018-10-27 06:09:11,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:09:11,535 INFO L481 AbstractCegarLoop]: Abstraction has 1300 states and 1734 transitions. [2018-10-27 06:09:11,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 06:09:11,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1734 transitions. [2018-10-27 06:09:11,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-27 06:09:11,542 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:09:11,542 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:11,543 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:09:11,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:11,543 INFO L82 PathProgramCache]: Analyzing trace with hash 213477505, now seen corresponding path program 1 times [2018-10-27 06:09:11,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:09:11,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:11,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:11,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:11,545 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:09:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:11,769 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 06:09:11,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:11,770 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 06:09:11,770 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 178 with the following transitions: [2018-10-27 06:09:11,771 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [597], [599], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 06:09:11,778 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 06:09:11,778 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 06:09:12,063 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 06:09:12,064 INFO L272 AbstractInterpreter]: Visited 125 different actions 244 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-27 06:09:12,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:12,072 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 06:09:12,377 INFO L227 lantSequenceWeakener]: Weakened 174 states. On average, predicates are now at 81.88% of their original sizes. [2018-10-27 06:09:12,377 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 06:09:12,569 INFO L415 sIntCurrentIteration]: We unified 176 AI predicates to 176 [2018-10-27 06:09:12,569 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 06:09:12,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 06:09:12,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-10-27 06:09:12,570 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:09:12,571 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 06:09:12,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 06:09:12,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:09:12,571 INFO L87 Difference]: Start difference. First operand 1300 states and 1734 transitions. Second operand 10 states. [2018-10-27 06:09:19,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:19,866 INFO L93 Difference]: Finished difference Result 2599 states and 3521 transitions. [2018-10-27 06:09:19,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 06:09:19,866 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2018-10-27 06:09:19,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:09:19,873 INFO L225 Difference]: With dead ends: 2599 [2018-10-27 06:09:19,874 INFO L226 Difference]: Without dead ends: 1441 [2018-10-27 06:09:19,878 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 184 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-10-27 06:09:19,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2018-10-27 06:09:19,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 1438. [2018-10-27 06:09:19,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1438 states. [2018-10-27 06:09:19,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1438 states and 1882 transitions. [2018-10-27 06:09:19,914 INFO L78 Accepts]: Start accepts. Automaton has 1438 states and 1882 transitions. Word has length 177 [2018-10-27 06:09:19,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:09:19,915 INFO L481 AbstractCegarLoop]: Abstraction has 1438 states and 1882 transitions. [2018-10-27 06:09:19,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 06:09:19,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 1882 transitions. [2018-10-27 06:09:19,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-27 06:09:19,922 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:09:19,922 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:19,922 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:09:19,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:19,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1364345835, now seen corresponding path program 1 times [2018-10-27 06:09:19,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:09:19,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:19,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:19,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:19,924 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:09:19,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:20,117 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 100 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-27 06:09:20,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:20,118 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 06:09:20,118 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 211 with the following transitions: [2018-10-27 06:09:20,119 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [597], [599], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 06:09:20,123 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 06:09:20,124 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 06:09:20,483 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 06:09:20,484 INFO L272 AbstractInterpreter]: Visited 125 different actions 244 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-27 06:09:20,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:20,521 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 06:09:20,830 INFO L227 lantSequenceWeakener]: Weakened 207 states. On average, predicates are now at 81.83% of their original sizes. [2018-10-27 06:09:20,831 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 06:09:20,948 INFO L415 sIntCurrentIteration]: We unified 209 AI predicates to 209 [2018-10-27 06:09:20,948 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 06:09:20,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 06:09:20,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-10-27 06:09:20,949 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:09:20,950 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 06:09:20,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 06:09:20,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:09:20,951 INFO L87 Difference]: Start difference. First operand 1438 states and 1882 transitions. Second operand 10 states. [2018-10-27 06:09:25,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:25,786 INFO L93 Difference]: Finished difference Result 2876 states and 3820 transitions. [2018-10-27 06:09:25,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-27 06:09:25,786 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 210 [2018-10-27 06:09:25,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:09:25,795 INFO L225 Difference]: With dead ends: 2876 [2018-10-27 06:09:25,796 INFO L226 Difference]: Without dead ends: 1718 [2018-10-27 06:09:25,801 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 218 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-10-27 06:09:25,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2018-10-27 06:09:25,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1715. [2018-10-27 06:09:25,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1715 states. [2018-10-27 06:09:25,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2181 transitions. [2018-10-27 06:09:25,852 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2181 transitions. Word has length 210 [2018-10-27 06:09:25,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:09:25,853 INFO L481 AbstractCegarLoop]: Abstraction has 1715 states and 2181 transitions. [2018-10-27 06:09:25,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 06:09:25,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2181 transitions. [2018-10-27 06:09:25,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-27 06:09:25,862 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:09:25,862 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:25,862 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:09:25,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:25,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1434391096, now seen corresponding path program 1 times [2018-10-27 06:09:25,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:09:25,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:25,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:25,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:25,864 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:09:26,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:26,359 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 98 proven. 52 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-27 06:09:26,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:26,359 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 06:09:26,359 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 220 with the following transitions: [2018-10-27 06:09:26,360 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [597], [599], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 06:09:26,364 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 06:09:26,365 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 06:09:26,824 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 06:09:26,825 INFO L272 AbstractInterpreter]: Visited 127 different actions 510 times. Merged at 9 different actions 38 times. Widened at 1 different actions 1 times. Found 8 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-27 06:09:26,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:26,831 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 06:09:26,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:26,831 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:09:26,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:26,842 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 06:09:26,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:26,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:27,464 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 116 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-27 06:09:27,465 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 06:09:27,847 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 104 proven. 44 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-27 06:09:27,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 06:09:27,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-10-27 06:09:27,883 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 06:09:27,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 06:09:27,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 06:09:27,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-10-27 06:09:27,886 INFO L87 Difference]: Start difference. First operand 1715 states and 2181 transitions. Second operand 11 states. [2018-10-27 06:09:30,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:30,824 INFO L93 Difference]: Finished difference Result 3589 states and 4709 transitions. [2018-10-27 06:09:30,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 06:09:30,831 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 219 [2018-10-27 06:09:30,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:09:30,842 INFO L225 Difference]: With dead ends: 3589 [2018-10-27 06:09:30,842 INFO L226 Difference]: Without dead ends: 2293 [2018-10-27 06:09:30,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 439 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-10-27 06:09:30,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2293 states. [2018-10-27 06:09:30,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2293 to 2285. [2018-10-27 06:09:30,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2285 states. [2018-10-27 06:09:30,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2285 states to 2285 states and 2863 transitions. [2018-10-27 06:09:30,916 INFO L78 Accepts]: Start accepts. Automaton has 2285 states and 2863 transitions. Word has length 219 [2018-10-27 06:09:30,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:09:30,917 INFO L481 AbstractCegarLoop]: Abstraction has 2285 states and 2863 transitions. [2018-10-27 06:09:30,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 06:09:30,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2285 states and 2863 transitions. [2018-10-27 06:09:30,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-27 06:09:30,928 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:09:30,928 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:30,928 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:09:30,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:30,929 INFO L82 PathProgramCache]: Analyzing trace with hash 49211626, now seen corresponding path program 2 times [2018-10-27 06:09:30,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:09:30,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:30,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:30,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:30,930 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:09:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:31,475 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 98 proven. 54 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-27 06:09:31,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:31,476 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 06:09:31,476 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 06:09:31,476 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 06:09:31,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:31,477 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:09:31,484 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 06:09:31,484 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 06:09:31,578 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-27 06:09:31,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:09:31,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:31,668 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-10-27 06:09:31,669 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 06:09:31,782 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-10-27 06:09:31,804 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 06:09:31,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-10-27 06:09:31,805 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:09:31,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 06:09:31,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:09:31,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:09:31,806 INFO L87 Difference]: Start difference. First operand 2285 states and 2863 transitions. Second operand 3 states. [2018-10-27 06:09:33,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:33,060 INFO L93 Difference]: Finished difference Result 4563 states and 5972 transitions. [2018-10-27 06:09:33,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:09:33,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2018-10-27 06:09:33,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:09:33,073 INFO L225 Difference]: With dead ends: 4563 [2018-10-27 06:09:33,073 INFO L226 Difference]: Without dead ends: 2835 [2018-10-27 06:09:33,080 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 439 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:09:33,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2835 states. [2018-10-27 06:09:33,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2835 to 2699. [2018-10-27 06:09:33,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2699 states. [2018-10-27 06:09:33,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2699 states to 2699 states and 3326 transitions. [2018-10-27 06:09:33,155 INFO L78 Accepts]: Start accepts. Automaton has 2699 states and 3326 transitions. Word has length 219 [2018-10-27 06:09:33,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:09:33,157 INFO L481 AbstractCegarLoop]: Abstraction has 2699 states and 3326 transitions. [2018-10-27 06:09:33,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 06:09:33,157 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 3326 transitions. [2018-10-27 06:09:33,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-27 06:09:33,168 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:09:33,168 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:33,169 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:09:33,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:33,169 INFO L82 PathProgramCache]: Analyzing trace with hash 725737755, now seen corresponding path program 1 times [2018-10-27 06:09:33,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:09:33,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:33,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:33,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:33,171 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:09:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:33,692 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 107 proven. 49 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 06:09:33,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:33,692 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 06:09:33,693 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 231 with the following transitions: [2018-10-27 06:09:33,693 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [205], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [597], [599], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 06:09:33,698 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 06:09:33,698 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 06:09:34,345 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 06:09:34,345 INFO L272 AbstractInterpreter]: Visited 125 different actions 495 times. Merged at 8 different actions 28 times. Never widened. Found 7 fixpoints after 2 different actions. Largest state had 42 variables. [2018-10-27 06:09:34,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:34,383 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 06:09:34,781 INFO L227 lantSequenceWeakener]: Weakened 227 states. On average, predicates are now at 83.78% of their original sizes. [2018-10-27 06:09:34,782 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 06:09:35,443 INFO L415 sIntCurrentIteration]: We unified 229 AI predicates to 229 [2018-10-27 06:09:35,444 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 06:09:35,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 06:09:35,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 16 [2018-10-27 06:09:35,445 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:09:35,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 06:09:35,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 06:09:35,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-27 06:09:35,446 INFO L87 Difference]: Start difference. First operand 2699 states and 3326 transitions. Second operand 9 states. [2018-10-27 06:09:42,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:42,554 INFO L93 Difference]: Finished difference Result 5938 states and 7510 transitions. [2018-10-27 06:09:42,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-27 06:09:42,554 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 230 [2018-10-27 06:09:42,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:09:42,571 INFO L225 Difference]: With dead ends: 5938 [2018-10-27 06:09:42,572 INFO L226 Difference]: Without dead ends: 3796 [2018-10-27 06:09:42,580 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 238 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-10-27 06:09:42,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3796 states. [2018-10-27 06:09:42,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3796 to 3750. [2018-10-27 06:09:42,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3750 states. [2018-10-27 06:09:42,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3750 states to 3750 states and 4496 transitions. [2018-10-27 06:09:42,683 INFO L78 Accepts]: Start accepts. Automaton has 3750 states and 4496 transitions. Word has length 230 [2018-10-27 06:09:42,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:09:42,684 INFO L481 AbstractCegarLoop]: Abstraction has 3750 states and 4496 transitions. [2018-10-27 06:09:42,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 06:09:42,685 INFO L276 IsEmpty]: Start isEmpty. Operand 3750 states and 4496 transitions. [2018-10-27 06:09:42,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-10-27 06:09:42,702 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:09:42,702 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:42,703 INFO L424 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:09:42,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:42,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1447497907, now seen corresponding path program 1 times [2018-10-27 06:09:42,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:09:42,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:42,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:42,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:42,705 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:09:42,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:43,591 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 148 proven. 84 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-27 06:09:43,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:43,591 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 06:09:43,591 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 268 with the following transitions: [2018-10-27 06:09:43,592 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [53], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [205], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [597], [599], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 06:09:43,595 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 06:09:43,595 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 06:09:43,945 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 06:09:43,946 INFO L272 AbstractInterpreter]: Visited 128 different actions 518 times. Merged at 10 different actions 42 times. Widened at 1 different actions 1 times. Found 10 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-27 06:09:43,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:43,948 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 06:09:43,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:43,948 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:09:43,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:43,956 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 06:09:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:44,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:44,187 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 155 proven. 2 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2018-10-27 06:09:44,187 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 06:09:44,384 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 154 proven. 20 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-10-27 06:09:44,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 06:09:44,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-10-27 06:09:44,406 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 06:09:44,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 06:09:44,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 06:09:44,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-10-27 06:09:44,409 INFO L87 Difference]: Start difference. First operand 3750 states and 4496 transitions. Second operand 12 states. [2018-10-27 06:09:49,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:49,975 INFO L93 Difference]: Finished difference Result 13539 states and 17624 transitions. [2018-10-27 06:09:49,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-27 06:09:49,976 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 267 [2018-10-27 06:09:49,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:09:50,026 INFO L225 Difference]: With dead ends: 13539 [2018-10-27 06:09:50,027 INFO L226 Difference]: Without dead ends: 10069 [2018-10-27 06:09:50,048 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 613 GetRequests, 565 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=479, Invalid=1873, Unknown=0, NotChecked=0, Total=2352 [2018-10-27 06:09:50,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10069 states. [2018-10-27 06:09:50,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10069 to 9634. [2018-10-27 06:09:50,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9634 states. [2018-10-27 06:09:50,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9634 states to 9634 states and 11859 transitions. [2018-10-27 06:09:50,347 INFO L78 Accepts]: Start accepts. Automaton has 9634 states and 11859 transitions. Word has length 267 [2018-10-27 06:09:50,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:09:50,347 INFO L481 AbstractCegarLoop]: Abstraction has 9634 states and 11859 transitions. [2018-10-27 06:09:50,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 06:09:50,347 INFO L276 IsEmpty]: Start isEmpty. Operand 9634 states and 11859 transitions. [2018-10-27 06:09:50,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-10-27 06:09:50,395 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:09:50,396 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:50,396 INFO L424 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:09:50,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:50,397 INFO L82 PathProgramCache]: Analyzing trace with hash -773602765, now seen corresponding path program 1 times [2018-10-27 06:09:50,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:09:50,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:50,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:50,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:50,398 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:09:50,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:50,646 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 175 proven. 101 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-27 06:09:50,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:50,647 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 06:09:50,647 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 277 with the following transitions: [2018-10-27 06:09:50,647 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [53], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [173], [174], [178], [182], [186], [190], [194], [198], [202], [205], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [597], [599], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 06:09:50,650 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 06:09:50,650 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 06:09:51,327 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 06:09:51,328 INFO L272 AbstractInterpreter]: Visited 128 different actions 636 times. Merged at 10 different actions 44 times. Widened at 1 different actions 1 times. Found 11 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-27 06:09:51,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:51,335 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 06:09:51,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:51,335 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:09:51,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:51,344 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 06:09:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:51,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:51,652 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 245 proven. 2 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-27 06:09:51,652 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 06:09:51,938 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 245 proven. 2 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-27 06:09:51,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 06:09:51,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-10-27 06:09:51,961 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 06:09:51,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 06:09:51,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 06:09:51,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-10-27 06:09:51,962 INFO L87 Difference]: Start difference. First operand 9634 states and 11859 transitions. Second operand 9 states. [2018-10-27 06:09:52,802 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 13 [2018-10-27 06:09:55,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:55,341 INFO L93 Difference]: Finished difference Result 22050 states and 29886 transitions. [2018-10-27 06:09:55,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-27 06:09:55,342 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 276 [2018-10-27 06:09:55,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:09:55,342 INFO L225 Difference]: With dead ends: 22050 [2018-10-27 06:09:55,343 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 06:09:55,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 561 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2018-10-27 06:09:55,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 06:09:55,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 06:09:55,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 06:09:55,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 06:09:55,431 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 276 [2018-10-27 06:09:55,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:09:55,432 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:09:55,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 06:09:55,432 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:09:55,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 06:09:55,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-27 06:09:56,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:56,931 WARN L179 SmtUtils]: Spent 952.00 ms on a formula simplification. DAG size of input: 446 DAG size of output: 147 [2018-10-27 06:09:57,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:57,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:57,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:57,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:57,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:57,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:57,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:57,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:57,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:57,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:57,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:57,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:57,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:57,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:57,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:57,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:57,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:57,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:57,440 WARN L179 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 398 DAG size of output: 106 [2018-10-27 06:09:57,955 WARN L179 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 20 [2018-10-27 06:09:58,697 WARN L179 SmtUtils]: Spent 739.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 40 [2018-10-27 06:10:01,470 WARN L179 SmtUtils]: Spent 2.73 s on a formula simplification. DAG size of input: 285 DAG size of output: 100 [2018-10-27 06:10:02,160 WARN L179 SmtUtils]: Spent 680.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 73 [2018-10-27 06:10:02,707 WARN L179 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 71 [2018-10-27 06:10:02,710 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-27 06:10:02,711 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a7~0 |old(~a7~0)|) (= |old(~a20~0)| ~a20~0) (= ~a17~0 |old(~a17~0)|) (= |old(~a16~0)| ~a16~0)) [2018-10-27 06:10:02,711 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-27 06:10:02,711 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-10-27 06:10:02,711 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-10-27 06:10:02,712 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,712 INFO L425 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,712 INFO L425 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,712 INFO L425 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,712 INFO L425 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,712 INFO L425 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,712 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-10-27 06:10:02,713 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-10-27 06:10:02,713 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-10-27 06:10:02,713 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-10-27 06:10:02,713 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-10-27 06:10:02,713 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-10-27 06:10:02,713 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-10-27 06:10:02,713 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-10-27 06:10:02,713 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-10-27 06:10:02,713 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-10-27 06:10:02,714 INFO L425 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,714 INFO L425 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,714 INFO L425 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,714 INFO L425 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,714 INFO L425 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,714 INFO L425 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,714 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-10-27 06:10:02,714 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-10-27 06:10:02,714 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-10-27 06:10:02,715 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-10-27 06:10:02,715 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-10-27 06:10:02,715 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-10-27 06:10:02,715 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-10-27 06:10:02,715 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-10-27 06:10:02,715 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-10-27 06:10:02,715 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-10-27 06:10:02,715 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-10-27 06:10:02,715 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-10-27 06:10:02,716 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-10-27 06:10:02,716 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-10-27 06:10:02,716 INFO L425 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-10-27 06:10:02,716 INFO L425 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,716 INFO L425 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,716 INFO L425 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,716 INFO L425 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,716 INFO L425 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,717 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-10-27 06:10:02,717 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-10-27 06:10:02,717 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-10-27 06:10:02,717 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-10-27 06:10:02,717 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-10-27 06:10:02,717 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-10-27 06:10:02,717 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-10-27 06:10:02,717 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-10-27 06:10:02,718 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-10-27 06:10:02,718 INFO L425 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,718 INFO L425 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,718 INFO L425 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,718 INFO L425 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,718 INFO L425 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,718 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-10-27 06:10:02,718 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-10-27 06:10:02,718 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-10-27 06:10:02,719 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-10-27 06:10:02,719 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-10-27 06:10:02,719 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-10-27 06:10:02,719 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-10-27 06:10:02,719 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-10-27 06:10:02,719 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-10-27 06:10:02,719 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-10-27 06:10:02,719 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-10-27 06:10:02,719 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-10-27 06:10:02,719 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-10-27 06:10:02,720 INFO L425 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,720 INFO L425 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,720 INFO L425 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,720 INFO L425 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,720 INFO L425 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,720 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-10-27 06:10:02,720 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-10-27 06:10:02,720 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-10-27 06:10:02,721 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-10-27 06:10:02,721 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-10-27 06:10:02,721 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-10-27 06:10:02,721 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-10-27 06:10:02,721 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-10-27 06:10:02,721 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 515) no Hoare annotation was computed. [2018-10-27 06:10:02,721 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-10-27 06:10:02,721 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,721 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,722 INFO L425 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,722 INFO L425 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,722 INFO L425 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,722 INFO L425 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,722 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-10-27 06:10:02,722 INFO L425 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,722 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-10-27 06:10:02,722 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-10-27 06:10:02,722 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-10-27 06:10:02,722 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-10-27 06:10:02,723 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-10-27 06:10:02,723 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-10-27 06:10:02,723 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-10-27 06:10:02,723 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-10-27 06:10:02,723 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-10-27 06:10:02,723 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-10-27 06:10:02,723 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-10-27 06:10:02,723 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-10-27 06:10:02,723 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-10-27 06:10:02,723 INFO L425 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,723 INFO L425 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,724 INFO L425 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,724 INFO L425 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,724 INFO L425 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,724 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-10-27 06:10:02,724 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-10-27 06:10:02,724 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-10-27 06:10:02,724 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-10-27 06:10:02,724 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-10-27 06:10:02,724 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-10-27 06:10:02,725 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-10-27 06:10:02,725 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-10-27 06:10:02,725 INFO L425 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,725 INFO L425 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,725 INFO L425 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,725 INFO L425 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,725 INFO L425 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,725 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-10-27 06:10:02,725 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-10-27 06:10:02,726 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-10-27 06:10:02,726 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-10-27 06:10:02,726 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-10-27 06:10:02,726 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-10-27 06:10:02,726 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-10-27 06:10:02,726 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-10-27 06:10:02,726 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-10-27 06:10:02,726 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-10-27 06:10:02,727 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse22 (= 1 |old(~a17~0)|)) (.cse18 (= 13 |old(~a8~0)|)) (.cse16 (= 1 |old(~a21~0)|)) (.cse31 (= 1 |old(~a7~0)|)) (.cse33 (not (= ~a8~0 0))) (.cse34 (= ~a21~0 1)) (.cse35 (= ~a7~0 |old(~a7~0)|)) (.cse24 (= 1 ~a7~0)) (.cse32 (= |old(~a20~0)| ~a20~0)) (.cse36 (= ~a17~0 |old(~a17~0)|)) (.cse27 (= |old(~a16~0)| ~a16~0)) (.cse37 (not (= ~a8~0 13)))) (let ((.cse14 (not (= 5 |old(~a16~0)|))) (.cse21 (and .cse24 .cse32 .cse36 .cse27 .cse37)) (.cse10 (not (= |old(~a20~0)| 1))) (.cse4 (< 0 |old(~a17~0)|)) (.cse19 (and .cse32 .cse33 .cse27 .cse34 .cse37 .cse35 .cse36)) (.cse20 (< 0 |old(~a20~0)|)) (.cse15 (and (not .cse34) .cse24 .cse32 .cse36 .cse27)) (.cse17 (not .cse31)) (.cse6 (= ~a8~0 15)) (.cse0 (= 6 |old(~a16~0)|)) (.cse8 (not (= 15 |old(~a8~0)|))) (.cse1 (not (= 0 |old(~a7~0)|))) (.cse12 (and .cse32 .cse33 .cse27 .cse34 .cse35 .cse36)) (.cse9 (= 0 |old(~a16~0)|)) (.cse5 (= |calculate_output_#in~input| 0)) (.cse11 (= 0 |old(~a8~0)|)) (.cse2 (not .cse16)) (.cse7 (not (= 1 |old(~a20~0)|))) (.cse23 (not (= 4 |old(~a16~0)|))) (.cse3 (not (= 8 ~a12~0))) (.cse25 (= 1 ~a20~0)) (.cse26 (= 13 ~a8~0)) (.cse28 (= 1 ~a21~0)) (.cse29 (= 1 ~a17~0)) (.cse30 (not .cse18)) (.cse13 (not .cse22))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse10 .cse9 .cse3 .cse4 .cse5 .cse11 .cse12) (or .cse1 .cse2 .cse6 .cse3 .cse5 .cse13 .cse7 .cse8 .cse14) (or .cse6 .cse5 (or .cse1 .cse2 .cse8 (not (= 0 |old(~a20~0)|)) .cse14 .cse3 .cse13)) (or .cse15 (or .cse7 .cse16 .cse3) .cse17) (or .cse1 .cse2 .cse18 .cse9 .cse3 .cse19 .cse5 .cse11 .cse20) (or .cse0 .cse18 .cse21 .cse3 .cse17 .cse4 .cse20) (or .cse0 .cse21 .cse10 .cse18 .cse3 .cse17 .cse4) (or .cse0 .cse1 .cse2 .cse12 .cse9 .cse3 .cse22 .cse5 .cse11 .cse20) (or .cse1 .cse2 .cse7 .cse19 .cse18 .cse9 .cse3 .cse5 .cse11) (or .cse0 .cse16 .cse3 .cse17 .cse20 .cse15) (or .cse2 .cse7 .cse23 (and .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) .cse3 .cse17 .cse30 .cse13) (or .cse5 .cse6 (or (not .cse0) .cse1 .cse2 .cse7 .cse8 (not (= 0 |old(~a17~0)|)) .cse3)) (or .cse1 .cse2 .cse7 .cse12 .cse9 .cse3 .cse5 .cse11 .cse13) (or .cse2 .cse31 .cse7 .cse23 .cse3 (and (not (= ~a7~0 1)) .cse25 .cse26 .cse27 .cse28 .cse29) .cse30 .cse13)))) [2018-10-27 06:10:02,727 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-10-27 06:10:02,727 INFO L425 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,727 INFO L425 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,727 INFO L425 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,728 INFO L425 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,728 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-10-27 06:10:02,728 INFO L425 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,728 INFO L425 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,728 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-10-27 06:10:02,728 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-10-27 06:10:02,728 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-10-27 06:10:02,728 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-10-27 06:10:02,728 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-10-27 06:10:02,729 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-10-27 06:10:02,729 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-10-27 06:10:02,729 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-10-27 06:10:02,729 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-10-27 06:10:02,729 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-10-27 06:10:02,729 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-10-27 06:10:02,729 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-10-27 06:10:02,729 INFO L425 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,729 INFO L425 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,729 INFO L425 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,730 INFO L425 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,730 INFO L425 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,730 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-10-27 06:10:02,730 INFO L425 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,730 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-10-27 06:10:02,730 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-10-27 06:10:02,730 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-10-27 06:10:02,730 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-10-27 06:10:02,731 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-10-27 06:10:02,731 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-10-27 06:10:02,731 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-10-27 06:10:02,731 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-10-27 06:10:02,731 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-10-27 06:10:02,731 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-10-27 06:10:02,731 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-10-27 06:10:02,731 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-10-27 06:10:02,731 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-10-27 06:10:02,731 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-10-27 06:10:02,731 INFO L425 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,732 INFO L425 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,732 INFO L425 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,732 INFO L425 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,732 INFO L425 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,732 INFO L425 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:10:02,732 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-10-27 06:10:02,732 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-10-27 06:10:02,732 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-10-27 06:10:02,732 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-10-27 06:10:02,732 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-10-27 06:10:02,733 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-10-27 06:10:02,733 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-10-27 06:10:02,733 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-10-27 06:10:02,733 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-10-27 06:10:02,733 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-10-27 06:10:02,733 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-27 06:10:02,733 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a7~0 0) (= ~a8~0 15) (= ~a17~0 1) (= ~a12~0 8) (= ~a21~0 1) (= ~a20~0 1) (= ~a16~0 5)) [2018-10-27 06:10:02,733 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-27 06:10:02,733 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-27 06:10:02,734 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a21~0)|)) (not (= 1 |old(~a20~0)|)) (not (= 15 |old(~a8~0)|)) (and (= ~a8~0 15) (= ~a21~0 1) (= ~a7~0 |old(~a7~0)|) (= ~a17~0 |old(~a17~0)|) (= ~a20~0 1) (= ~a16~0 5)) (not (= 5 |old(~a16~0)|)) (not (= 8 ~a12~0)) (not (= 1 |old(~a17~0)|))) [2018-10-27 06:10:02,734 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-10-27 06:10:02,734 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse9 (= ~a21~0 1))) (let ((.cse1 (not .cse9)) (.cse5 (= ~a7~0 0)) (.cse6 (not (= ~a16~0 0))) (.cse7 (not (= main_~input~0 0))) (.cse8 (not (= ~a8~0 0))) (.cse4 (<= ~a20~0 0)) (.cse2 (= 1 ~a7~0)) (.cse0 (= 1 ~a20~0)) (.cse3 (not (= ~a16~0 6))) (.cse11 (<= ~a17~0 0)) (.cse10 (not (= ~a8~0 13)))) (or (not (= 1 |old(~a21~0)|)) (and .cse0 (= 13 ~a8~0) (= 4 ~a16~0) (= 1 ~a21~0) (= 1 ~a17~0)) (not (= 8 ~a12~0)) (not (= 1 |old(~a20~0)|)) (and .cse1 .cse2 .cse3 .cse4) (not (= 5 |old(~a16~0)|)) (and .cse5 .cse6 .cse7 .cse0 (= ~a17~0 |old(~a17~0)|) .cse8 .cse9) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse4 .cse10) (not (= 0 |old(~a7~0)|)) (and .cse5 .cse6 .cse7 .cse0 .cse8 .cse3 .cse11 .cse9) (not (= 1 |old(~a17~0)|)) (and .cse5 .cse6 .cse7 .cse0 .cse8 .cse9 .cse10) (not (= 15 |old(~a8~0)|)) (and .cse2 .cse3 .cse11 .cse10 .cse4) (and .cse1 .cse2 .cse0) (and .cse5 .cse6 .cse7 .cse8 .cse3 .cse9 (not (= ~a17~0 1)) .cse4) (and .cse2 .cse0 .cse3 .cse11 .cse10)))) [2018-10-27 06:10:02,734 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-10-27 06:10:02,734 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-10-27 06:10:02,734 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-10-27 06:10:02,735 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse3 (= ~a21~0 1))) (let ((.cse6 (not .cse3)) (.cse9 (not (= main_~input~0 0))) (.cse8 (= 1 ~a20~0)) (.cse7 (= 1 ~a7~0)) (.cse10 (not (= ~a16~0 6))) (.cse11 (<= ~a17~0 0)) (.cse5 (not (= ~a8~0 13))) (.cse4 (<= ~a20~0 0)) (.cse0 (= ~a7~0 0)) (.cse1 (not (= ~a16~0 0))) (.cse12 (= |old(~a20~0)| ~a20~0)) (.cse2 (not (= ~a8~0 0)))) (or (not (= 1 |old(~a21~0)|)) (not (= 8 ~a12~0)) (not (= 1 |old(~a20~0)|)) (not (= 5 |old(~a16~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse3 (not (= ~a17~0 1)) .cse4) (and .cse7 .cse8 .cse10 .cse11 .cse5) (and .cse8 (= 13 ~a8~0) (= 4 ~a16~0) (= 1 ~a21~0) (= 1 ~a17~0)) (and .cse6 .cse7 .cse10 .cse4) (and .cse0 .cse1 .cse12 .cse2 .cse10 .cse3 .cse5) (and .cse0 .cse1 .cse12 .cse2 .cse10 .cse11 .cse3) (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a17~0)|)) (and .cse0 .cse1 .cse9 .cse8 .cse2 .cse3 .cse5) (not (= 15 |old(~a8~0)|)) (and .cse7 .cse10 .cse11 .cse5 .cse4) (and .cse0 .cse1 .cse12 (= ~a17~0 |old(~a17~0)|) .cse2 .cse3)))) [2018-10-27 06:10:02,735 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-10-27 06:10:02,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 06:10:02 BoogieIcfgContainer [2018-10-27 06:10:02,752 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 06:10:02,753 INFO L168 Benchmark]: Toolchain (without parser) took 73996.09 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 2.8 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-10-27 06:10:02,754 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 06:10:02,754 INFO L168 Benchmark]: CACSL2BoogieTranslator took 641.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-27 06:10:02,755 INFO L168 Benchmark]: Boogie Procedure Inliner took 210.63 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -822.1 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2018-10-27 06:10:02,756 INFO L168 Benchmark]: Boogie Preprocessor took 105.36 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2018-10-27 06:10:02,757 INFO L168 Benchmark]: RCFGBuilder took 3773.39 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 105.2 MB). Peak memory consumption was 105.2 MB. Max. memory is 7.1 GB. [2018-10-27 06:10:02,757 INFO L168 Benchmark]: TraceAbstraction took 69259.61 ms. Allocated memory was 2.3 GB in the beginning and 3.5 GB in the end (delta: 1.2 GB). Free memory was 2.1 GB in the beginning and 2.8 GB in the end (delta: -741.2 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-10-27 06:10:02,763 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 641.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 210.63 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -822.1 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 105.36 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3773.39 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 105.2 MB). Peak memory consumption was 105.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 69259.61 ms. Allocated memory was 2.3 GB in the beginning and 3.5 GB in the end (delta: 1.2 GB). Free memory was 2.1 GB in the beginning and 2.8 GB in the end (delta: -741.2 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 515]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((!(1 == \old(a21)) || !(8 == a12)) || !(1 == \old(a20))) || !(5 == \old(a16))) || (((((a7 == 0 && !(a16 == 0)) && !(a8 == 0)) && a21 == 1) && a20 <= 0) && !(a8 == 13))) || ((!(a21 == 1) && 1 == a7) && 1 == a20)) || (((((((a7 == 0 && !(a16 == 0)) && !(input == 0)) && !(a8 == 0)) && !(a16 == 6)) && a21 == 1) && !(a17 == 1)) && a20 <= 0)) || ((((1 == a7 && 1 == a20) && !(a16 == 6)) && a17 <= 0) && !(a8 == 13))) || ((((1 == a20 && 13 == a8) && 4 == a16) && 1 == a21) && 1 == a17)) || (((!(a21 == 1) && 1 == a7) && !(a16 == 6)) && a20 <= 0)) || ((((((a7 == 0 && !(a16 == 0)) && \old(a20) == a20) && !(a8 == 0)) && !(a16 == 6)) && a21 == 1) && !(a8 == 13))) || ((((((a7 == 0 && !(a16 == 0)) && \old(a20) == a20) && !(a8 == 0)) && !(a16 == 6)) && a17 <= 0) && a21 == 1)) || !(0 == \old(a7))) || !(1 == \old(a17))) || ((((((a7 == 0 && !(a16 == 0)) && !(input == 0)) && 1 == a20) && !(a8 == 0)) && a21 == 1) && !(a8 == 13))) || !(15 == \old(a8))) || ((((1 == a7 && !(a16 == 6)) && a17 <= 0) && !(a8 == 13)) && a20 <= 0)) || (((((a7 == 0 && !(a16 == 0)) && \old(a20) == a20) && a17 == \old(a17)) && !(a8 == 0)) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 69.1s OverallTime, 13 OverallIterations, 6 TraceHistogramMax, 46.1s AutomataDifference, 0.0s DeadEndRemovalTime, 7.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1700 SDtfs, 11531 SDslu, 2269 SDs, 0 SdLazy, 13384 SolverSat, 2496 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.4s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 2942 GetRequests, 2770 SyntacticMatches, 12 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9634occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.5s AbstIntTime, 7 AbstIntIterations, 4 AbstIntStrong, 0.9974024527465205 AbsIntWeakeningRatio, 0.2023047375160051 AbsIntAvgWeakeningVarsNumRemoved, 29.04481434058899 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 13 MinimizatonAttempts, 654 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 519 PreInvPairs, 1118 NumberOfFragments, 1236 HoareAnnotationTreeSize, 519 FomulaSimplifications, 46294 FormulaSimplificationTreeSizeReduction, 1.9s HoareSimplificationTime, 7 FomulaSimplificationsInter, 10529 FormulaSimplificationTreeSizeReductionInter, 5.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 3399 NumberOfCodeBlocks, 3332 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 4359 ConstructedInterpolants, 0 QuantifiedInterpolants, 2487557 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2413 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 21 InterpolantComputations, 7 PerfectInterpolantSequences, 2964/3408 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...