java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label11_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 12:46:37,769 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 12:46:37,771 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 12:46:37,784 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 12:46:37,784 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 12:46:37,786 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 12:46:37,787 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 12:46:37,790 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 12:46:37,792 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 12:46:37,794 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 12:46:37,795 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 12:46:37,795 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 12:46:37,798 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 12:46:37,799 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 12:46:37,800 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 12:46:37,807 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 12:46:37,808 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 12:46:37,810 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 12:46:37,813 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 12:46:37,814 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 12:46:37,817 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 12:46:37,819 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 12:46:37,822 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 12:46:37,822 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 12:46:37,824 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 12:46:37,824 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 12:46:37,826 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 12:46:37,826 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 12:46:37,828 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 12:46:37,829 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 12:46:37,829 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 12:46:37,832 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 12:46:37,832 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 12:46:37,832 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 12:46:37,833 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 12:46:37,834 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 12:46:37,834 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-11-07 12:46:37,850 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 12:46:37,850 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 12:46:37,851 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 12:46:37,851 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 12:46:37,851 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 12:46:37,851 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 12:46:37,851 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 12:46:37,852 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 12:46:37,852 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 12:46:37,852 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 12:46:37,852 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 12:46:37,852 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 12:46:37,853 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 12:46:37,853 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 12:46:37,853 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 12:46:37,854 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 12:46:37,854 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 12:46:37,854 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 12:46:37,854 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 12:46:37,854 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 12:46:37,856 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 12:46:37,856 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 12:46:37,856 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 12:46:37,856 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 12:46:37,857 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 12:46:37,857 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 12:46:37,857 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 12:46:37,857 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 12:46:37,857 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 12:46:37,858 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 12:46:37,858 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 12:46:37,858 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 12:46:37,858 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 12:46:37,858 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 12:46:37,912 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 12:46:37,930 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 12:46:37,934 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 12:46:37,936 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 12:46:37,936 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 12:46:37,937 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label11_true-unreach-call_false-termination.c [2018-11-07 12:46:37,999 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd1dacc63/daa2f3ad3e614b889795fdf57af4398a/FLAG024196753 [2018-11-07 12:46:38,574 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 12:46:38,575 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label11_true-unreach-call_false-termination.c [2018-11-07 12:46:38,589 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd1dacc63/daa2f3ad3e614b889795fdf57af4398a/FLAG024196753 [2018-11-07 12:46:38,609 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd1dacc63/daa2f3ad3e614b889795fdf57af4398a [2018-11-07 12:46:38,622 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 12:46:38,624 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 12:46:38,625 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 12:46:38,625 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 12:46:38,632 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 12:46:38,633 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:46:38" (1/1) ... [2018-11-07 12:46:38,636 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41c639f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:38, skipping insertion in model container [2018-11-07 12:46:38,637 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:46:38" (1/1) ... [2018-11-07 12:46:38,647 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 12:46:38,709 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 12:46:39,237 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 12:46:39,249 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 12:46:39,387 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 12:46:39,406 INFO L193 MainTranslator]: Completed translation [2018-11-07 12:46:39,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:39 WrapperNode [2018-11-07 12:46:39,407 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 12:46:39,408 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 12:46:39,408 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 12:46:39,408 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 12:46:39,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:39" (1/1) ... [2018-11-07 12:46:39,435 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:39" (1/1) ... [2018-11-07 12:46:39,539 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 12:46:39,540 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 12:46:39,540 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 12:46:39,540 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 12:46:39,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:39" (1/1) ... [2018-11-07 12:46:39,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:39" (1/1) ... [2018-11-07 12:46:39,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:39" (1/1) ... [2018-11-07 12:46:39,570 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:39" (1/1) ... [2018-11-07 12:46:39,614 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:39" (1/1) ... [2018-11-07 12:46:39,634 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:39" (1/1) ... [2018-11-07 12:46:39,647 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:39" (1/1) ... [2018-11-07 12:46:39,655 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 12:46:39,655 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 12:46:39,656 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 12:46:39,656 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 12:46:39,657 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 12:46:39,718 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 12:46:39,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 12:46:39,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 12:46:39,719 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 12:46:39,719 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 12:46:39,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 12:46:39,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 12:46:39,720 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 12:46:39,720 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 12:46:42,852 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 12:46:42,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:46:42 BoogieIcfgContainer [2018-11-07 12:46:42,853 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 12:46:42,854 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 12:46:42,855 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 12:46:42,858 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 12:46:42,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:46:38" (1/3) ... [2018-11-07 12:46:42,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61df99e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:46:42, skipping insertion in model container [2018-11-07 12:46:42,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:39" (2/3) ... [2018-11-07 12:46:42,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61df99e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:46:42, skipping insertion in model container [2018-11-07 12:46:42,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:46:42" (3/3) ... [2018-11-07 12:46:42,862 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label11_true-unreach-call_false-termination.c [2018-11-07 12:46:42,872 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 12:46:42,881 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 12:46:42,895 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 12:46:42,933 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 12:46:42,933 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 12:46:42,934 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 12:46:42,934 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 12:46:42,934 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 12:46:42,935 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 12:46:42,935 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 12:46:42,935 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 12:46:42,962 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-11-07 12:46:42,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-07 12:46:42,976 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:46:42,977 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:46:42,980 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:46:42,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:46:42,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1894719720, now seen corresponding path program 1 times [2018-11-07 12:46:42,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:46:43,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:46:43,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:46:43,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:46:43,039 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:46:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:46:43,656 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:46:43,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:46:43,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:46:43,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 12:46:43,795 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:46:43,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:46:43,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:46:43,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:46:43,821 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-11-07 12:46:45,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:46:45,483 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-11-07 12:46:45,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:46:45,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2018-11-07 12:46:45,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:46:45,504 INFO L225 Difference]: With dead ends: 550 [2018-11-07 12:46:45,504 INFO L226 Difference]: Without dead ends: 340 [2018-11-07 12:46:45,511 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:46:45,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-07 12:46:45,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-11-07 12:46:45,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-07 12:46:45,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 562 transitions. [2018-11-07 12:46:45,588 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 562 transitions. Word has length 116 [2018-11-07 12:46:45,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:46:45,589 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 562 transitions. [2018-11-07 12:46:45,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:46:45,590 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 562 transitions. [2018-11-07 12:46:45,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-07 12:46:45,596 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:46:45,596 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:46:45,597 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:46:45,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:46:45,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1844932745, now seen corresponding path program 1 times [2018-11-07 12:46:45,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:46:45,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:46:45,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:46:45,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:46:45,600 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:46:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:46:45,851 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:46:45,966 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:46:45,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:46:45,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 12:46:45,967 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:46:45,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 12:46:45,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 12:46:45,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 12:46:45,970 INFO L87 Difference]: Start difference. First operand 340 states and 562 transitions. Second operand 6 states. [2018-11-07 12:46:47,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:46:47,706 INFO L93 Difference]: Finished difference Result 888 states and 1491 transitions. [2018-11-07 12:46:47,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 12:46:47,707 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-11-07 12:46:47,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:46:47,714 INFO L225 Difference]: With dead ends: 888 [2018-11-07 12:46:47,715 INFO L226 Difference]: Without dead ends: 554 [2018-11-07 12:46:47,721 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 12:46:47,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-11-07 12:46:47,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 539. [2018-11-07 12:46:47,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-11-07 12:46:47,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 827 transitions. [2018-11-07 12:46:47,774 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 827 transitions. Word has length 127 [2018-11-07 12:46:47,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:46:47,774 INFO L480 AbstractCegarLoop]: Abstraction has 539 states and 827 transitions. [2018-11-07 12:46:47,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 12:46:47,775 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 827 transitions. [2018-11-07 12:46:47,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-07 12:46:47,780 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:46:47,780 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:46:47,780 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:46:47,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:46:47,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1950525493, now seen corresponding path program 1 times [2018-11-07 12:46:47,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:46:47,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:46:47,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:46:47,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:46:47,783 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:46:47,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:46:48,393 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:46:48,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:46:48,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 12:46:48,394 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:46:48,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 12:46:48,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 12:46:48,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 12:46:48,396 INFO L87 Difference]: Start difference. First operand 539 states and 827 transitions. Second operand 5 states. [2018-11-07 12:46:50,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:46:50,649 INFO L93 Difference]: Finished difference Result 1210 states and 1896 transitions. [2018-11-07 12:46:50,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 12:46:50,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2018-11-07 12:46:50,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:46:50,657 INFO L225 Difference]: With dead ends: 1210 [2018-11-07 12:46:50,657 INFO L226 Difference]: Without dead ends: 536 [2018-11-07 12:46:50,660 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 12:46:50,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-11-07 12:46:50,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2018-11-07 12:46:50,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-11-07 12:46:50,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 787 transitions. [2018-11-07 12:46:50,709 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 787 transitions. Word has length 128 [2018-11-07 12:46:50,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:46:50,709 INFO L480 AbstractCegarLoop]: Abstraction has 536 states and 787 transitions. [2018-11-07 12:46:50,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 12:46:50,710 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 787 transitions. [2018-11-07 12:46:50,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-07 12:46:50,713 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:46:50,714 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:46:50,714 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:46:50,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:46:50,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1220128141, now seen corresponding path program 1 times [2018-11-07 12:46:50,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:46:50,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:46:50,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:46:50,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:46:50,716 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:46:50,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:46:51,072 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:46:51,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:46:51,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 12:46:51,073 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:46:51,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 12:46:51,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 12:46:51,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 12:46:51,075 INFO L87 Difference]: Start difference. First operand 536 states and 787 transitions. Second operand 5 states. [2018-11-07 12:46:53,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:46:53,012 INFO L93 Difference]: Finished difference Result 1204 states and 1799 transitions. [2018-11-07 12:46:53,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 12:46:53,012 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2018-11-07 12:46:53,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:46:53,016 INFO L225 Difference]: With dead ends: 1204 [2018-11-07 12:46:53,016 INFO L226 Difference]: Without dead ends: 535 [2018-11-07 12:46:53,018 INFO L604 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-11-07 12:46:53,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-11-07 12:46:53,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2018-11-07 12:46:53,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-11-07 12:46:53,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 782 transitions. [2018-11-07 12:46:53,035 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 782 transitions. Word has length 129 [2018-11-07 12:46:53,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:46:53,035 INFO L480 AbstractCegarLoop]: Abstraction has 535 states and 782 transitions. [2018-11-07 12:46:53,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 12:46:53,035 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 782 transitions. [2018-11-07 12:46:53,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-07 12:46:53,038 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:46:53,038 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:46:53,038 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:46:53,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:46:53,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1858048063, now seen corresponding path program 1 times [2018-11-07 12:46:53,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:46:53,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:46:53,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:46:53,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:46:53,040 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:46:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:46:53,220 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:46:53,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:46:53,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 12:46:53,220 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:46:53,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:46:53,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:46:53,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:46:53,221 INFO L87 Difference]: Start difference. First operand 535 states and 782 transitions. Second operand 3 states. [2018-11-07 12:46:54,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:46:54,050 INFO L93 Difference]: Finished difference Result 1521 states and 2300 transitions. [2018-11-07 12:46:54,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:46:54,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2018-11-07 12:46:54,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:46:54,059 INFO L225 Difference]: With dead ends: 1521 [2018-11-07 12:46:54,059 INFO L226 Difference]: Without dead ends: 992 [2018-11-07 12:46:54,063 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:46:54,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-11-07 12:46:54,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 992. [2018-11-07 12:46:54,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2018-11-07 12:46:54,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1411 transitions. [2018-11-07 12:46:54,101 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1411 transitions. Word has length 134 [2018-11-07 12:46:54,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:46:54,102 INFO L480 AbstractCegarLoop]: Abstraction has 992 states and 1411 transitions. [2018-11-07 12:46:54,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:46:54,102 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1411 transitions. [2018-11-07 12:46:54,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-07 12:46:54,107 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:46:54,107 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:46:54,108 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:46:54,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:46:54,108 INFO L82 PathProgramCache]: Analyzing trace with hash -865633433, now seen corresponding path program 1 times [2018-11-07 12:46:54,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:46:54,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:46:54,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:46:54,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:46:54,110 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:46:54,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:46:54,278 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:46:54,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:46:54,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 12:46:54,278 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:46:54,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 12:46:54,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 12:46:54,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 12:46:54,279 INFO L87 Difference]: Start difference. First operand 992 states and 1411 transitions. Second operand 6 states. [2018-11-07 12:46:55,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:46:55,433 INFO L93 Difference]: Finished difference Result 2947 states and 4374 transitions. [2018-11-07 12:46:55,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 12:46:55,435 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2018-11-07 12:46:55,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:46:55,449 INFO L225 Difference]: With dead ends: 2947 [2018-11-07 12:46:55,449 INFO L226 Difference]: Without dead ends: 1961 [2018-11-07 12:46:55,457 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 12:46:55,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2018-11-07 12:46:55,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1928. [2018-11-07 12:46:55,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2018-11-07 12:46:55,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2554 transitions. [2018-11-07 12:46:55,530 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2554 transitions. Word has length 135 [2018-11-07 12:46:55,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:46:55,531 INFO L480 AbstractCegarLoop]: Abstraction has 1928 states and 2554 transitions. [2018-11-07 12:46:55,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 12:46:55,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2554 transitions. [2018-11-07 12:46:55,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-07 12:46:55,540 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:46:55,540 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:46:55,541 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:46:55,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:46:55,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1578661412, now seen corresponding path program 1 times [2018-11-07 12:46:55,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:46:55,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:46:55,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:46:55,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:46:55,548 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:46:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:46:55,925 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 43 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:46:55,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:46:55,925 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:46:55,926 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 152 with the following transitions: [2018-11-07 12:46:55,929 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:46:55,982 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:46:55,982 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:46:58,812 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:46:58,814 INFO L272 AbstractInterpreter]: Visited 69 different actions 69 times. Never merged. Never widened. Never found a fixpoint. Largest state had 42 variables. [2018-11-07 12:46:58,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:46:58,854 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:47:02,744 INFO L227 lantSequenceWeakener]: Weakened 94 states. On average, predicates are now at 79.59% of their original sizes. [2018-11-07 12:47:02,745 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:47:03,829 INFO L415 sIntCurrentIteration]: We unified 150 AI predicates to 150 [2018-11-07 12:47:03,830 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:47:03,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:47:03,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2018-11-07 12:47:03,832 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:47:03,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 12:47:03,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 12:47:03,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-07 12:47:03,833 INFO L87 Difference]: Start difference. First operand 1928 states and 2554 transitions. Second operand 12 states. [2018-11-07 12:47:13,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:47:13,727 INFO L93 Difference]: Finished difference Result 3911 states and 5191 transitions. [2018-11-07 12:47:13,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 12:47:13,727 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 151 [2018-11-07 12:47:13,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:47:13,738 INFO L225 Difference]: With dead ends: 3911 [2018-11-07 12:47:13,738 INFO L226 Difference]: Without dead ends: 1989 [2018-11-07 12:47:13,745 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 156 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2018-11-07 12:47:13,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states. [2018-11-07 12:47:13,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 1989. [2018-11-07 12:47:13,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1989 states. [2018-11-07 12:47:13,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 2620 transitions. [2018-11-07 12:47:13,799 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 2620 transitions. Word has length 151 [2018-11-07 12:47:13,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:47:13,800 INFO L480 AbstractCegarLoop]: Abstraction has 1989 states and 2620 transitions. [2018-11-07 12:47:13,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 12:47:13,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 2620 transitions. [2018-11-07 12:47:13,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-07 12:47:13,808 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:47:13,808 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:47:13,809 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:47:13,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:47:13,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1993472409, now seen corresponding path program 1 times [2018-11-07 12:47:13,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:47:13,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:47:13,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:47:13,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:47:13,811 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:47:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:47:14,145 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 47 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 12:47:14,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:47:14,145 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:47:14,145 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 161 with the following transitions: [2018-11-07 12:47:14,146 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:47:14,152 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:47:14,152 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:47:16,282 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:47:16,283 INFO L272 AbstractInterpreter]: Visited 121 different actions 188 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 12:47:16,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:47:16,328 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:47:18,119 INFO L227 lantSequenceWeakener]: Weakened 69 states. On average, predicates are now at 81.38% of their original sizes. [2018-11-07 12:47:18,119 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:47:18,936 INFO L415 sIntCurrentIteration]: We unified 159 AI predicates to 159 [2018-11-07 12:47:18,939 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:47:18,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:47:18,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-07 12:47:18,939 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:47:18,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 12:47:18,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 12:47:18,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-11-07 12:47:18,941 INFO L87 Difference]: Start difference. First operand 1989 states and 2620 transitions. Second operand 18 states. [2018-11-07 12:47:38,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:47:38,843 INFO L93 Difference]: Finished difference Result 4196 states and 5533 transitions. [2018-11-07 12:47:38,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 12:47:38,844 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 160 [2018-11-07 12:47:38,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:47:38,856 INFO L225 Difference]: With dead ends: 4196 [2018-11-07 12:47:38,856 INFO L226 Difference]: Without dead ends: 2274 [2018-11-07 12:47:38,863 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 171 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=189, Invalid=681, Unknown=0, NotChecked=0, Total=870 [2018-11-07 12:47:38,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2274 states. [2018-11-07 12:47:38,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2274 to 2263. [2018-11-07 12:47:38,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2263 states. [2018-11-07 12:47:38,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 2263 states and 2914 transitions. [2018-11-07 12:47:38,929 INFO L78 Accepts]: Start accepts. Automaton has 2263 states and 2914 transitions. Word has length 160 [2018-11-07 12:47:38,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:47:38,929 INFO L480 AbstractCegarLoop]: Abstraction has 2263 states and 2914 transitions. [2018-11-07 12:47:38,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 12:47:38,930 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 2914 transitions. [2018-11-07 12:47:38,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-07 12:47:38,938 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:47:38,938 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:47:38,939 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:47:38,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:47:38,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1610890117, now seen corresponding path program 1 times [2018-11-07 12:47:38,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:47:38,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:47:38,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:47:38,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:47:38,941 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:47:38,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:47:39,195 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 87 proven. 15 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-07 12:47:39,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:47:39,196 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:47:39,196 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 194 with the following transitions: [2018-11-07 12:47:39,197 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:47:39,201 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:47:39,202 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:47:41,948 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:47:41,948 INFO L272 AbstractInterpreter]: Visited 121 different actions 188 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 12:47:41,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:47:41,955 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:47:44,719 INFO L227 lantSequenceWeakener]: Weakened 98 states. On average, predicates are now at 80.97% of their original sizes. [2018-11-07 12:47:44,719 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:47:46,131 INFO L415 sIntCurrentIteration]: We unified 192 AI predicates to 192 [2018-11-07 12:47:46,131 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:47:46,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:47:46,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [6] total 26 [2018-11-07 12:47:46,131 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:47:46,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 12:47:46,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 12:47:46,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2018-11-07 12:47:46,133 INFO L87 Difference]: Start difference. First operand 2263 states and 2914 transitions. Second operand 22 states. [2018-11-07 12:48:17,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:48:17,344 INFO L93 Difference]: Finished difference Result 4605 states and 5974 transitions. [2018-11-07 12:48:17,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 12:48:17,344 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 193 [2018-11-07 12:48:17,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:48:17,357 INFO L225 Difference]: With dead ends: 4605 [2018-11-07 12:48:17,357 INFO L226 Difference]: Without dead ends: 2683 [2018-11-07 12:48:17,365 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 206 GetRequests, 162 SyntacticMatches, 10 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=302, Invalid=958, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 12:48:17,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2683 states. [2018-11-07 12:48:17,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2683 to 2401. [2018-11-07 12:48:17,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2401 states. [2018-11-07 12:48:17,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2401 states and 3057 transitions. [2018-11-07 12:48:17,425 INFO L78 Accepts]: Start accepts. Automaton has 2401 states and 3057 transitions. Word has length 193 [2018-11-07 12:48:17,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:48:17,425 INFO L480 AbstractCegarLoop]: Abstraction has 2401 states and 3057 transitions. [2018-11-07 12:48:17,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 12:48:17,425 INFO L276 IsEmpty]: Start isEmpty. Operand 2401 states and 3057 transitions. [2018-11-07 12:48:17,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-07 12:48:17,434 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:48:17,434 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:48:17,434 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:48:17,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:48:17,435 INFO L82 PathProgramCache]: Analyzing trace with hash 281194242, now seen corresponding path program 1 times [2018-11-07 12:48:17,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:48:17,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:48:17,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:48:17,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:48:17,436 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:48:17,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:48:17,797 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 85 proven. 39 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 12:48:17,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:48:17,797 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:48:17,797 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 203 with the following transitions: [2018-11-07 12:48:17,797 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:48:17,802 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:48:17,802 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:48:22,477 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:48:22,478 INFO L272 AbstractInterpreter]: Visited 123 different actions 569 times. Merged at 9 different actions 50 times. Widened at 1 different actions 1 times. Found 11 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 12:48:22,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:48:22,485 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:48:22,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:48:22,486 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 12:48:22,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:48:22,497 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:48:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:48:22,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:48:22,846 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 103 proven. 2 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-07 12:48:22,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:48:23,089 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-07 12:48:23,289 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 91 proven. 31 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-07 12:48:23,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 12:48:23,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-07 12:48:23,312 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 12:48:23,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 12:48:23,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 12:48:23,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-07 12:48:23,314 INFO L87 Difference]: Start difference. First operand 2401 states and 3057 transitions. Second operand 11 states. [2018-11-07 12:48:27,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:48:27,432 INFO L93 Difference]: Finished difference Result 8864 states and 12047 transitions. [2018-11-07 12:48:27,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 12:48:27,432 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 202 [2018-11-07 12:48:27,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:48:27,462 INFO L225 Difference]: With dead ends: 8864 [2018-11-07 12:48:27,462 INFO L226 Difference]: Without dead ends: 6668 [2018-11-07 12:48:27,478 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 407 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2018-11-07 12:48:27,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6668 states. [2018-11-07 12:48:27,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6668 to 6461. [2018-11-07 12:48:27,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6461 states. [2018-11-07 12:48:27,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6461 states to 6461 states and 8219 transitions. [2018-11-07 12:48:27,662 INFO L78 Accepts]: Start accepts. Automaton has 6461 states and 8219 transitions. Word has length 202 [2018-11-07 12:48:27,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:48:27,662 INFO L480 AbstractCegarLoop]: Abstraction has 6461 states and 8219 transitions. [2018-11-07 12:48:27,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 12:48:27,662 INFO L276 IsEmpty]: Start isEmpty. Operand 6461 states and 8219 transitions. [2018-11-07 12:48:27,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-07 12:48:27,681 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:48:27,682 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:48:27,682 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:48:27,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:48:27,682 INFO L82 PathProgramCache]: Analyzing trace with hash 425931920, now seen corresponding path program 1 times [2018-11-07 12:48:27,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:48:27,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:48:27,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:48:27,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:48:27,684 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:48:27,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:48:28,161 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 12:48:28,319 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 131 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 12:48:28,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:48:28,319 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:48:28,319 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 212 with the following transitions: [2018-11-07 12:48:28,320 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [173], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:48:28,325 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:48:28,326 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:48:32,390 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:48:32,391 INFO L272 AbstractInterpreter]: Visited 122 different actions 312 times. Merged at 7 different actions 16 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-07 12:48:32,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:48:32,399 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:48:33,767 INFO L227 lantSequenceWeakener]: Weakened 208 states. On average, predicates are now at 80.36% of their original sizes. [2018-11-07 12:48:33,768 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:48:34,096 INFO L415 sIntCurrentIteration]: We unified 210 AI predicates to 210 [2018-11-07 12:48:34,096 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:48:34,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:48:34,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-07 12:48:34,097 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:48:34,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 12:48:34,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 12:48:34,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 12:48:34,098 INFO L87 Difference]: Start difference. First operand 6461 states and 8219 transitions. Second operand 11 states. [2018-11-07 12:48:44,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:48:44,044 INFO L93 Difference]: Finished difference Result 12860 states and 16425 transitions. [2018-11-07 12:48:44,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 12:48:44,044 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 211 [2018-11-07 12:48:44,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:48:44,074 INFO L225 Difference]: With dead ends: 12860 [2018-11-07 12:48:44,074 INFO L226 Difference]: Without dead ends: 6742 [2018-11-07 12:48:44,092 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 219 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-11-07 12:48:44,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6742 states. [2018-11-07 12:48:44,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6742 to 6737. [2018-11-07 12:48:44,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6737 states. [2018-11-07 12:48:44,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6737 states to 6737 states and 8515 transitions. [2018-11-07 12:48:44,278 INFO L78 Accepts]: Start accepts. Automaton has 6737 states and 8515 transitions. Word has length 211 [2018-11-07 12:48:44,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:48:44,279 INFO L480 AbstractCegarLoop]: Abstraction has 6737 states and 8515 transitions. [2018-11-07 12:48:44,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 12:48:44,279 INFO L276 IsEmpty]: Start isEmpty. Operand 6737 states and 8515 transitions. [2018-11-07 12:48:44,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-07 12:48:44,297 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:48:44,298 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:48:44,298 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:48:44,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:48:44,298 INFO L82 PathProgramCache]: Analyzing trace with hash 310011569, now seen corresponding path program 1 times [2018-11-07 12:48:44,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:48:44,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:48:44,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:48:44,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:48:44,301 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:48:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:48:44,838 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 12:48:45,029 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 109 proven. 15 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-07 12:48:45,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:48:45,030 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:48:45,030 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 216 with the following transitions: [2018-11-07 12:48:45,030 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [225], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:48:45,033 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:48:45,034 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:48:47,727 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:48:47,728 INFO L272 AbstractInterpreter]: Visited 121 different actions 188 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 12:48:47,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:48:47,729 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:48:49,666 INFO L227 lantSequenceWeakener]: Weakened 43 states. On average, predicates are now at 81.14% of their original sizes. [2018-11-07 12:48:49,666 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:48:50,456 INFO L415 sIntCurrentIteration]: We unified 214 AI predicates to 214 [2018-11-07 12:48:50,457 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:48:50,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:48:50,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [6] total 20 [2018-11-07 12:48:50,457 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:48:50,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 12:48:50,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 12:48:50,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-11-07 12:48:50,459 INFO L87 Difference]: Start difference. First operand 6737 states and 8515 transitions. Second operand 16 states. [2018-11-07 12:49:20,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:49:20,027 INFO L93 Difference]: Finished difference Result 13269 states and 16858 transitions. [2018-11-07 12:49:20,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 12:49:20,027 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 215 [2018-11-07 12:49:20,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:49:20,057 INFO L225 Difference]: With dead ends: 13269 [2018-11-07 12:49:20,057 INFO L226 Difference]: Without dead ends: 7151 [2018-11-07 12:49:20,075 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 226 GetRequests, 183 SyntacticMatches, 17 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2018-11-07 12:49:20,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7151 states. [2018-11-07 12:49:20,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7151 to 7149. [2018-11-07 12:49:20,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7149 states. [2018-11-07 12:49:20,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7149 states to 7149 states and 8952 transitions. [2018-11-07 12:49:20,229 INFO L78 Accepts]: Start accepts. Automaton has 7149 states and 8952 transitions. Word has length 215 [2018-11-07 12:49:20,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:49:20,230 INFO L480 AbstractCegarLoop]: Abstraction has 7149 states and 8952 transitions. [2018-11-07 12:49:20,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 12:49:20,230 INFO L276 IsEmpty]: Start isEmpty. Operand 7149 states and 8952 transitions. [2018-11-07 12:49:20,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-11-07 12:49:20,249 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:49:20,249 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:49:20,249 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:49:20,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:49:20,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1586568926, now seen corresponding path program 1 times [2018-11-07 12:49:20,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:49:20,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:20,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:49:20,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:20,251 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:49:20,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:49:20,510 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 157 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 12:49:20,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:49:20,511 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:49:20,511 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 228 with the following transitions: [2018-11-07 12:49:20,511 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:49:20,514 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:49:20,514 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:49:28,922 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:49:28,922 INFO L272 AbstractInterpreter]: Visited 123 different actions 1309 times. Merged at 9 different actions 117 times. Widened at 1 different actions 7 times. Found 28 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 12:49:28,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:49:28,939 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:49:28,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:49:28,939 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 12:49:28,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:49:28,949 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:49:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:49:29,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:49:29,169 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 140 proven. 14 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-07 12:49:29,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:49:29,525 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 152 proven. 2 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-07 12:49:29,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 12:49:29,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2018-11-07 12:49:29,547 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 12:49:29,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 12:49:29,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 12:49:29,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-07 12:49:29,549 INFO L87 Difference]: Start difference. First operand 7149 states and 8952 transitions. Second operand 8 states. [2018-11-07 12:49:32,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:49:32,661 INFO L93 Difference]: Finished difference Result 14356 states and 18513 transitions. [2018-11-07 12:49:32,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 12:49:32,661 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 227 [2018-11-07 12:49:32,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:49:32,689 INFO L225 Difference]: With dead ends: 14356 [2018-11-07 12:49:32,690 INFO L226 Difference]: Without dead ends: 8238 [2018-11-07 12:49:32,707 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 463 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2018-11-07 12:49:32,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8238 states. [2018-11-07 12:49:32,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8238 to 7787. [2018-11-07 12:49:32,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7787 states. [2018-11-07 12:49:32,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7787 states to 7787 states and 9345 transitions. [2018-11-07 12:49:32,887 INFO L78 Accepts]: Start accepts. Automaton has 7787 states and 9345 transitions. Word has length 227 [2018-11-07 12:49:32,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:49:32,887 INFO L480 AbstractCegarLoop]: Abstraction has 7787 states and 9345 transitions. [2018-11-07 12:49:32,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 12:49:32,887 INFO L276 IsEmpty]: Start isEmpty. Operand 7787 states and 9345 transitions. [2018-11-07 12:49:32,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-11-07 12:49:32,910 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:49:32,911 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:49:32,911 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:49:32,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:49:32,911 INFO L82 PathProgramCache]: Analyzing trace with hash 395172502, now seen corresponding path program 1 times [2018-11-07 12:49:32,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:49:32,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:32,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:49:32,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:32,913 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:49:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:49:33,459 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 200 proven. 61 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-07 12:49:33,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:49:33,459 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:49:33,460 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 247 with the following transitions: [2018-11-07 12:49:33,460 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [109], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:49:33,462 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:49:33,462 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:49:40,560 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:49:40,561 INFO L272 AbstractInterpreter]: Visited 123 different actions 930 times. Merged at 8 different actions 74 times. Widened at 1 different actions 4 times. Found 14 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 12:49:40,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:49:40,569 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:49:40,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:49:40,569 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 12:49:40,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:49:40,589 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:49:40,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:49:40,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:49:40,791 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 179 proven. 2 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-11-07 12:49:40,791 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:49:41,065 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 179 proven. 2 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-11-07 12:49:41,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 12:49:41,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-11-07 12:49:41,086 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 12:49:41,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 12:49:41,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 12:49:41,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-11-07 12:49:41,087 INFO L87 Difference]: Start difference. First operand 7787 states and 9345 transitions. Second operand 12 states. [2018-11-07 12:49:45,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:49:45,817 INFO L93 Difference]: Finished difference Result 14453 states and 18779 transitions. [2018-11-07 12:49:45,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 12:49:45,817 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 246 [2018-11-07 12:49:45,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:49:45,818 INFO L225 Difference]: With dead ends: 14453 [2018-11-07 12:49:45,818 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 12:49:45,857 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 513 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=457, Invalid=1895, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 12:49:45,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 12:49:45,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 12:49:45,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 12:49:45,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 12:49:45,858 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 246 [2018-11-07 12:49:45,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:49:45,858 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 12:49:45,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 12:49:45,859 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 12:49:45,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 12:49:45,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 12:49:46,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:46,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:46,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:46,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:46,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:46,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:46,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:46,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:46,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:46,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:46,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:46,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:46,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:46,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:46,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:46,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:46,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:46,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:46,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:46,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:46,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:46,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:46,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:46,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:46,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:46,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:46,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:46,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:46,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:46,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:46,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:47,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:47,062 WARN L179 SmtUtils]: Spent 741.00 ms on a formula simplification. DAG size of input: 400 DAG size of output: 292 [2018-11-07 12:49:47,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:47,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:47,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:47,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:47,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:47,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:47,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:47,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:47,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:47,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:47,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:47,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:47,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:47,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:47,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:47,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:47,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:47,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:47,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:47,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:47,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:47,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:47,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:47,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:47,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:47,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:47,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:47,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:47,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:47,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:47,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:47,835 WARN L179 SmtUtils]: Spent 770.00 ms on a formula simplification. DAG size of input: 400 DAG size of output: 314 [2018-11-07 12:49:48,233 WARN L179 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2018-11-07 12:49:48,719 WARN L179 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 86 [2018-11-07 12:49:52,849 WARN L179 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 353 DAG size of output: 181 [2018-11-07 12:49:54,793 WARN L179 SmtUtils]: Spent 1.92 s on a formula simplification. DAG size of input: 316 DAG size of output: 110 [2018-11-07 12:49:56,423 WARN L179 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 338 DAG size of output: 110 [2018-11-07 12:49:56,426 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 12:49:56,427 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a17~0 |old(~a17~0)|) (<= ~a21~0 |old(~a21~0)|) (= |old(~a7~0)| ~a7~0) (<= |old(~a8~0)| ~a8~0) (= |old(~a16~0)| ~a16~0) (= ~a20~0 |old(~a20~0)|)) [2018-11-07 12:49:56,427 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 12:49:56,427 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-07 12:49:56,427 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-07 12:49:56,427 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,427 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,428 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,428 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,428 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,428 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,428 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-07 12:49:56,428 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-07 12:49:56,428 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-07 12:49:56,428 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-07 12:49:56,428 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-07 12:49:56,429 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-07 12:49:56,429 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-07 12:49:56,429 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-07 12:49:56,429 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-07 12:49:56,429 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-07 12:49:56,429 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,429 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,429 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,429 INFO L425 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,429 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,429 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,429 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-07 12:49:56,430 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-07 12:49:56,430 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-07 12:49:56,430 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-07 12:49:56,430 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-07 12:49:56,430 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-07 12:49:56,430 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-07 12:49:56,430 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-07 12:49:56,430 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-07 12:49:56,430 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-07 12:49:56,431 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-07 12:49:56,431 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-07 12:49:56,431 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-07 12:49:56,431 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-07 12:49:56,431 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-11-07 12:49:56,431 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,431 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,431 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,431 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,432 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,432 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-07 12:49:56,432 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-07 12:49:56,432 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-07 12:49:56,432 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-07 12:49:56,432 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-07 12:49:56,432 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-07 12:49:56,432 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-07 12:49:56,432 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-07 12:49:56,432 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-07 12:49:56,433 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,433 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,433 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,433 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,433 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,433 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-07 12:49:56,433 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-07 12:49:56,433 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-07 12:49:56,433 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-07 12:49:56,434 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-07 12:49:56,434 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-07 12:49:56,434 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-07 12:49:56,434 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-07 12:49:56,434 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-07 12:49:56,434 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-07 12:49:56,434 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-07 12:49:56,434 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-07 12:49:56,434 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-07 12:49:56,435 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,435 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,435 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,435 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,435 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,435 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-07 12:49:56,435 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-07 12:49:56,435 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-07 12:49:56,435 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-07 12:49:56,435 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-07 12:49:56,436 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-07 12:49:56,436 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-07 12:49:56,436 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-07 12:49:56,436 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-07 12:49:56,436 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,436 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,436 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,436 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,436 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,436 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,436 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,437 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-07 12:49:56,437 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-07 12:49:56,437 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-07 12:49:56,437 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-07 12:49:56,437 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-07 12:49:56,437 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-07 12:49:56,437 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-07 12:49:56,437 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-07 12:49:56,437 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-07 12:49:56,437 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-07 12:49:56,437 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-07 12:49:56,438 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-07 12:49:56,438 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-07 12:49:56,438 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-07 12:49:56,438 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,438 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,438 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,438 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,438 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,438 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-07 12:49:56,438 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-07 12:49:56,438 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-07 12:49:56,439 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-07 12:49:56,439 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-07 12:49:56,439 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-07 12:49:56,439 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-07 12:49:56,439 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-07 12:49:56,439 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,439 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,439 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,439 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,439 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,440 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-07 12:49:56,440 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-07 12:49:56,440 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-07 12:49:56,440 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-07 12:49:56,440 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-07 12:49:56,440 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-07 12:49:56,440 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-07 12:49:56,440 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-07 12:49:56,440 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-07 12:49:56,440 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-07 12:49:56,441 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse6 (= 1 |old(~a17~0)|)) (.cse5 (= 4 |old(~a16~0)|))) (let ((.cse3 (< 0 |old(~a21~0)|)) (.cse18 (< 1 |old(~a17~0)|)) (.cse22 (< |old(~a17~0)| 0)) (.cse11 (< 6 |calculate_output_#in~input|)) (.cse7 (< |calculate_output_#in~input| 2)) (.cse31 (< 5 |calculate_output_#in~input|)) (.cse30 (< |calculate_output_#in~input| 1)) (.cse35 (not (= 0 |old(~a7~0)|))) (.cse37 (not (= 15 |old(~a8~0)|))) (.cse38 (not (= 0 |old(~a17~0)|))) (.cse32 (and (= ~a8~0 15) (= ~a21~0 1))) (.cse0 (= 6 |old(~a16~0)|)) (.cse1 (and (= ~a17~0 |old(~a17~0)|) (<= ~a21~0 |old(~a21~0)|) (= |old(~a7~0)| ~a7~0) (= ~a16~0 |old(~a16~0)|) (<= |old(~a8~0)| ~a8~0) (= ~a20~0 |old(~a20~0)|))) (.cse41 (< |old(~a8~0)| 14)) (.cse4 (< 0 |old(~a20~0)|)) (.cse36 (not (= 1 |old(~a21~0)|))) (.cse33 (= 1 |old(~a7~0)|)) (.cse42 (not (= 1 |old(~a20~0)|))) (.cse34 (not .cse5)) (.cse2 (not (= 8 ~a12~0))) (.cse43 (= 1 ~a20~0)) (.cse44 (= 13 ~a8~0)) (.cse45 (= |old(~a16~0)| ~a16~0)) (.cse46 (= 1 ~a21~0)) (.cse47 (= 1 ~a17~0)) (.cse48 (not (= 13 |old(~a8~0)|))) (.cse40 (not .cse6))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse1 .cse2 (< |old(~a20~0)| 1) .cse6 .cse3) (or (let ((.cse8 (not (= ~v~0 22))) (.cse9 (< |old(~a16~0)| 4)) (.cse10 (not (= ~u~0 21))) (.cse12 (not (= |old(~a21~0)| 1))) (.cse13 (not (= ~b~0 2))) (.cse14 (not (= ~y~0 25))) (.cse15 (not (= |old(~a7~0)| 0))) (.cse16 (not (= 3 ~c~0))) (.cse17 (not (= |old(~a20~0)| 1))) (.cse19 (not (= ~a~0 1))) (.cse20 (< 5 |old(~a16~0)|)) (.cse21 (not (= 26 ~z~0))) (.cse23 (not (= ~x~0 24))) (.cse24 (not (= ~a12~0 8))) (.cse25 (not (= ~e~0 5))) (.cse26 (not (= |old(~a8~0)| 15))) (.cse27 (not (= ~d~0 4))) (.cse28 (not (= 6 ~f~0))) (.cse29 (not (= ~w~0 23)))) (and (or .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) (or .cse8 .cse9 .cse10 .cse30 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse31 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29))) .cse32 .cse5) (or .cse33 .cse34 .cse1 .cse2 .cse6) (or .cse11 .cse32 (let ((.cse39 (not (= 5 |old(~a16~0)|)))) (and (or .cse35 .cse36 .cse37 .cse38 (not (= 0 |old(~a20~0)|)) .cse39 .cse2) (or .cse35 .cse36 .cse37 .cse39 .cse2 (< |old(~a20~0)| 0) .cse40))) .cse4 .cse30) (or .cse0 .cse5 .cse41 .cse2 .cse6 .cse1) (or .cse0 .cse33 .cse1 .cse41 .cse2) (or .cse1 (or .cse0 .cse42 .cse2 .cse3)) (or .cse33 .cse41 .cse2 .cse1 .cse4) (or (or .cse35 .cse36 .cse2 .cse18 (< |old(~a16~0)| 5) (< 6 |old(~a16~0)|) .cse42 .cse37 .cse22 .cse6) .cse32) (or .cse33 .cse1 .cse5 .cse42 .cse2 .cse40) (or .cse34 (and (or .cse11 .cse7) (or .cse31 .cse30)) (or .cse35 .cse36 .cse42 .cse37 .cse38 .cse2) .cse32) (or .cse36 .cse42 .cse34 (and (= 1 ~a7~0) .cse43 .cse44 .cse45 .cse46 .cse47) .cse2 (not .cse33) .cse48 .cse40) (or .cse33 .cse41 .cse2 .cse6 .cse1) (or .cse0 .cse1 .cse41 .cse2 .cse6 .cse4) (or .cse36 .cse33 .cse42 .cse34 .cse2 (and (not (= ~a7~0 1)) .cse43 .cse44 .cse45 .cse46 .cse47) .cse48 .cse40)))) [2018-11-07 12:49:56,441 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-07 12:49:56,441 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,441 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,441 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,441 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,441 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,441 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-07 12:49:56,442 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,442 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-07 12:49:56,442 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-07 12:49:56,442 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-07 12:49:56,442 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-07 12:49:56,442 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-07 12:49:56,442 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-07 12:49:56,442 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-07 12:49:56,442 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-07 12:49:56,442 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-07 12:49:56,443 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-07 12:49:56,443 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 503) no Hoare annotation was computed. [2018-11-07 12:49:56,443 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-07 12:49:56,443 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-07 12:49:56,443 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,443 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,443 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,443 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,443 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,444 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,444 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-07 12:49:56,444 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-07 12:49:56,444 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-07 12:49:56,444 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-07 12:49:56,444 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-07 12:49:56,444 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-07 12:49:56,444 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-07 12:49:56,444 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-07 12:49:56,444 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-07 12:49:56,444 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-07 12:49:56,445 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-07 12:49:56,445 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-07 12:49:56,445 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-07 12:49:56,445 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-07 12:49:56,445 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-07 12:49:56,445 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,445 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,445 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,445 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,445 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,446 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:56,446 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-07 12:49:56,446 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-07 12:49:56,446 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-07 12:49:56,446 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-07 12:49:56,446 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-07 12:49:56,446 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-07 12:49:56,446 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-07 12:49:56,446 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-07 12:49:56,446 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-07 12:49:56,446 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-07 12:49:56,447 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 12:49:56,447 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~a8~0 15) (= ~z~0 26) (= ~a17~0 1) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~a7~0 0) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~b~0 2) (= ~a~0 1) (= ~a12~0 8) (= ~a20~0 1) (= ~a16~0 5)) [2018-11-07 12:49:56,447 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 12:49:56,447 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 12:49:56,447 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= |old(~a16~0)| 5)) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= |old(~a7~0)| 0)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (and (= ~a21~0 1) (= ~a8~0 15) (= ~a16~0 |old(~a16~0)|) (= ~a7~0 0) (= ~a17~0 |old(~a17~0)|) (= ~a20~0 1)) (not (= ~x~0 24)) (not (= |old(~a17~0)| 1)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= |old(~a8~0)| 15)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-11-07 12:49:56,447 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-11-07 12:49:56,448 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse1 (= ~a16~0 4))) (let ((.cse5 (<= ~a20~0 0)) (.cse3 (<= 14 ~a8~0)) (.cse2 (not (= ~a17~0 1))) (.cse0 (not (= ~a7~0 1))) (.cse6 (not .cse1)) (.cse7 (= 1 ~a17~0)) (.cse8 (<= ~a21~0 0)) (.cse9 (= |old(~a20~0)| ~a20~0)) (.cse4 (not (= ~a16~0 6)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2 .cse5) (and .cse3 .cse4 .cse2 .cse6) (and .cse0 .cse3 .cse5) (and (= 1 ~a20~0) (= 13 ~a8~0) (= 4 ~a16~0) (= 1 ~a21~0) .cse7) (and .cse8 .cse2 (<= 1 ~a20~0) .cse6) (not (= 3 ~c~0)) (not (= 1 |old(~a21~0)|)) (and .cse0 .cse3 .cse4) (not (= 4 ~d~0)) (and .cse8 .cse4 .cse5) (not (= 2 ~b~0)) (not (= ~y~0 25)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (and .cse0 .cse3 .cse2) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and .cse0 .cse9 .cse6 .cse7) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= 15 |old(~a8~0)|)) (not (= ~a~0 1)) (and .cse8 .cse9 .cse4) (not (= |old(~a17~0)| 1)) (not (= 6 ~f~0))))) [2018-11-07 12:49:56,448 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-11-07 12:49:56,448 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-07 12:49:56,448 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-07 12:49:56,448 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse1 (= ~a16~0 4))) (let ((.cse5 (<= ~a20~0 0)) (.cse3 (<= 14 ~a8~0)) (.cse2 (not (= ~a17~0 1))) (.cse0 (not (= ~a7~0 1))) (.cse6 (not .cse1)) (.cse7 (= 1 ~a17~0)) (.cse8 (<= ~a21~0 0)) (.cse9 (= |old(~a20~0)| ~a20~0)) (.cse4 (not (= ~a16~0 6)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2 .cse5) (and .cse3 .cse4 .cse2 .cse6) (and .cse0 .cse3 .cse5) (and (= 1 ~a20~0) (= 13 ~a8~0) (= 4 ~a16~0) (= 1 ~a21~0) .cse7) (and .cse8 .cse2 (<= 1 ~a20~0) .cse6) (not (= 3 ~c~0)) (not (= 1 |old(~a21~0)|)) (and .cse0 .cse3 .cse4) (not (= 4 ~d~0)) (and .cse8 .cse4 .cse5) (not (= 2 ~b~0)) (not (= ~y~0 25)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (and .cse0 .cse3 .cse2) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and .cse0 .cse9 .cse6 .cse7) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= 15 |old(~a8~0)|)) (not (= ~a~0 1)) (and .cse8 .cse9 .cse4) (not (= |old(~a17~0)| 1)) (not (= 6 ~f~0))))) [2018-11-07 12:49:56,448 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-11-07 12:49:56,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:49:56 BoogieIcfgContainer [2018-11-07 12:49:56,468 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 12:49:56,469 INFO L168 Benchmark]: Toolchain (without parser) took 197846.79 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -702.9 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2018-11-07 12:49:56,471 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 12:49:56,471 INFO L168 Benchmark]: CACSL2BoogieTranslator took 781.94 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-11-07 12:49:56,472 INFO L168 Benchmark]: Boogie Procedure Inliner took 131.98 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -836.6 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. [2018-11-07 12:49:56,473 INFO L168 Benchmark]: Boogie Preprocessor took 115.09 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.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. [2018-11-07 12:49:56,473 INFO L168 Benchmark]: RCFGBuilder took 3197.90 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: 115.5 MB). Peak memory consumption was 115.5 MB. Max. memory is 7.1 GB. [2018-11-07 12:49:56,474 INFO L168 Benchmark]: TraceAbstraction took 193614.05 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: -37.4 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2018-11-07 12:49:56,481 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.20 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 781.94 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 131.98 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -836.6 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 115.09 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.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3197.90 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: 115.5 MB). Peak memory consumption was 115.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 193614.05 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: -37.4 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 503]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((!(a7 == 1) && a16 == 4) && !(a17 == 1)) || (((14 <= a8 && !(a16 == 6)) && !(a17 == 1)) && a20 <= 0)) || (((14 <= a8 && !(a16 == 6)) && !(a17 == 1)) && !(a16 == 4))) || ((!(a7 == 1) && 14 <= a8) && a20 <= 0)) || ((((1 == a20 && 13 == a8) && 4 == a16) && 1 == a21) && 1 == a17)) || (((a21 <= 0 && !(a17 == 1)) && 1 <= a20) && !(a16 == 4))) || !(3 == c)) || !(1 == \old(a21))) || ((!(a7 == 1) && 14 <= a8) && !(a16 == 6))) || !(4 == d)) || ((a21 <= 0 && !(a16 == 6)) && a20 <= 0)) || !(2 == b)) || !(y == 25)) || !(x == 24)) || !(a12 == 8)) || !(e == 5)) || ((!(a7 == 1) && 14 <= a8) && !(a17 == 1))) || !(21 == u)) || !(22 == v)) || (((!(a7 == 1) && \old(a20) == a20) && !(a16 == 4)) && 1 == a17)) || !(z == 26)) || !(\old(a16) == 5)) || !(0 == \old(a7))) || !(\old(a20) == 1)) || !(23 == w)) || !(15 == \old(a8))) || !(a == 1)) || ((a21 <= 0 && \old(a20) == a20) && !(a16 == 6))) || !(\old(a17) == 1)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 193.5s OverallTime, 14 OverallIterations, 5 TraceHistogramMax, 122.4s AutomataDifference, 0.0s DeadEndRemovalTime, 10.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 2046 SDtfs, 12104 SDslu, 2543 SDs, 0 SdLazy, 16288 SolverSat, 2268 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 74.6s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 2499 GetRequests, 2225 SyntacticMatches, 44 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1781 ImplicationChecksByTransitivity, 9.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7787occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 34.8s AbstIntTime, 8 AbstIntIterations, 5 AbstIntStrong, 0.9971236788284303 AbsIntWeakeningRatio, 0.22162162162162163 AbsIntAvgWeakeningVarsNumRemoved, 20.915675675675676 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 1006 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 360 PreInvPairs, 632 NumberOfFragments, 1457 HoareAnnotationTreeSize, 360 FomulaSimplifications, 23633 FormulaSimplificationTreeSizeReduction, 1.9s HoareSimplificationTime, 7 FomulaSimplificationsInter, 21469 FormulaSimplificationTreeSizeReductionInter, 8.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 3049 NumberOfCodeBlocks, 3049 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3704 ConstructedInterpolants, 0 QuantifiedInterpolants, 2005031 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1832 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 20 InterpolantComputations, 6 PerfectInterpolantSequences, 2336/2540 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...