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/Problem02_label14_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 12:53:15,608 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 12:53:15,611 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 12:53:15,628 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 12:53:15,628 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 12:53:15,630 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 12:53:15,631 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 12:53:15,634 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 12:53:15,637 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 12:53:15,638 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 12:53:15,638 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 12:53:15,640 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 12:53:15,641 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 12:53:15,648 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 12:53:15,649 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 12:53:15,652 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 12:53:15,653 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 12:53:15,658 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 12:53:15,662 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 12:53:15,664 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 12:53:15,665 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 12:53:15,668 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 12:53:15,670 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 12:53:15,672 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 12:53:15,672 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 12:53:15,673 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 12:53:15,674 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 12:53:15,676 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 12:53:15,677 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 12:53:15,678 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 12:53:15,678 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 12:53:15,679 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 12:53:15,679 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 12:53:15,679 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 12:53:15,682 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 12:53:15,683 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 12:53:15,683 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:53:15,709 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 12:53:15,709 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 12:53:15,710 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 12:53:15,710 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 12:53:15,710 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 12:53:15,713 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 12:53:15,713 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 12:53:15,714 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 12:53:15,714 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 12:53:15,714 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 12:53:15,714 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 12:53:15,715 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 12:53:15,715 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 12:53:15,717 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 12:53:15,717 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 12:53:15,717 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 12:53:15,717 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 12:53:15,717 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 12:53:15,718 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 12:53:15,718 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 12:53:15,718 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 12:53:15,718 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 12:53:15,719 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 12:53:15,720 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 12:53:15,720 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 12:53:15,720 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 12:53:15,720 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 12:53:15,721 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 12:53:15,721 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 12:53:15,721 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 12:53:15,721 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 12:53:15,721 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 12:53:15,722 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 12:53:15,722 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 12:53:15,782 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 12:53:15,795 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 12:53:15,799 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 12:53:15,800 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 12:53:15,801 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 12:53:15,801 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label14_true-unreach-call_false-termination.c [2018-11-07 12:53:15,863 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e20cdf63/a098e491e505466c816dd7e987335bbd/FLAG8072f7afa [2018-11-07 12:53:16,413 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 12:53:16,414 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label14_true-unreach-call_false-termination.c [2018-11-07 12:53:16,431 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e20cdf63/a098e491e505466c816dd7e987335bbd/FLAG8072f7afa [2018-11-07 12:53:16,448 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e20cdf63/a098e491e505466c816dd7e987335bbd [2018-11-07 12:53:16,459 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 12:53:16,461 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 12:53:16,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 12:53:16,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 12:53:16,467 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 12:53:16,468 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:53:16" (1/1) ... [2018-11-07 12:53:16,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@429b8899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:16, skipping insertion in model container [2018-11-07 12:53:16,472 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:53:16" (1/1) ... [2018-11-07 12:53:16,484 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 12:53:16,564 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 12:53:17,102 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 12:53:17,107 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 12:53:17,229 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 12:53:17,249 INFO L193 MainTranslator]: Completed translation [2018-11-07 12:53:17,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:17 WrapperNode [2018-11-07 12:53:17,250 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 12:53:17,251 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 12:53:17,251 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 12:53:17,251 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 12:53:17,260 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:53:17" (1/1) ... [2018-11-07 12:53:17,280 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:53:17" (1/1) ... [2018-11-07 12:53:17,374 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 12:53:17,374 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 12:53:17,375 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 12:53:17,375 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 12:53:17,385 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:17" (1/1) ... [2018-11-07 12:53:17,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:17" (1/1) ... [2018-11-07 12:53:17,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:17" (1/1) ... [2018-11-07 12:53:17,394 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:17" (1/1) ... [2018-11-07 12:53:17,464 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:17" (1/1) ... [2018-11-07 12:53:17,478 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:17" (1/1) ... [2018-11-07 12:53:17,488 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:17" (1/1) ... [2018-11-07 12:53:17,497 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 12:53:17,498 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 12:53:17,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 12:53:17,498 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 12:53:17,500 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:17" (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:53:17,573 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 12:53:17,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 12:53:17,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 12:53:17,573 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 12:53:17,573 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 12:53:17,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 12:53:17,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 12:53:17,576 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 12:53:17,576 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 12:53:21,212 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 12:53:21,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:53:21 BoogieIcfgContainer [2018-11-07 12:53:21,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 12:53:21,216 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 12:53:21,216 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 12:53:21,225 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 12:53:21,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:53:16" (1/3) ... [2018-11-07 12:53:21,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f4b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:53:21, skipping insertion in model container [2018-11-07 12:53:21,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:17" (2/3) ... [2018-11-07 12:53:21,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f4b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:53:21, skipping insertion in model container [2018-11-07 12:53:21,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:53:21" (3/3) ... [2018-11-07 12:53:21,229 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label14_true-unreach-call_false-termination.c [2018-11-07 12:53:21,242 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 12:53:21,252 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 12:53:21,270 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 12:53:21,309 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 12:53:21,309 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 12:53:21,310 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 12:53:21,310 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 12:53:21,310 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 12:53:21,310 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 12:53:21,311 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 12:53:21,311 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 12:53:21,340 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-07 12:53:21,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-07 12:53:21,355 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:53:21,357 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:53:21,359 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:53:21,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:53:21,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1648799080, now seen corresponding path program 1 times [2018-11-07 12:53:21,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:53:21,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:21,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:53:21,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:21,419 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:53:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:53:22,009 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:53:22,074 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:53:22,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:53:22,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 12:53:22,077 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:53:22,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:53:22,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:53:22,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:53:22,103 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-11-07 12:53:23,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:53:23,592 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-11-07 12:53:23,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:53:23,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2018-11-07 12:53:23,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:53:23,613 INFO L225 Difference]: With dead ends: 621 [2018-11-07 12:53:23,613 INFO L226 Difference]: Without dead ends: 382 [2018-11-07 12:53:23,621 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:53:23,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-07 12:53:23,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-11-07 12:53:23,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-11-07 12:53:23,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-11-07 12:53:23,730 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 124 [2018-11-07 12:53:23,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:53:23,731 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-11-07 12:53:23,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:53:23,732 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-11-07 12:53:23,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-07 12:53:23,740 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:53:23,741 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:53:23,741 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:53:23,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:53:23,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1971063541, now seen corresponding path program 1 times [2018-11-07 12:53:23,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:53:23,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:23,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:53:23,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:23,744 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:53:23,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:53:24,346 WARN L179 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-07 12:53:24,604 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:53:24,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:53:24,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 12:53:24,605 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:53:24,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 12:53:24,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 12:53:24,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 12:53:24,608 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-11-07 12:53:26,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:53:26,433 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-11-07 12:53:26,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 12:53:26,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2018-11-07 12:53:26,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:53:26,440 INFO L225 Difference]: With dead ends: 903 [2018-11-07 12:53:26,441 INFO L226 Difference]: Without dead ends: 381 [2018-11-07 12:53:26,446 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 12:53:26,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-11-07 12:53:26,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-11-07 12:53:26,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-11-07 12:53:26,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-11-07 12:53:26,473 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 133 [2018-11-07 12:53:26,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:53:26,474 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-11-07 12:53:26,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 12:53:26,474 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-11-07 12:53:26,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-07 12:53:26,477 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:53:26,477 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:53:26,478 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:53:26,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:53:26,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1740193815, now seen corresponding path program 1 times [2018-11-07 12:53:26,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:53:26,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:26,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:53:26,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:26,480 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:53:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:53:26,919 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:53:26,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:53:26,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 12:53:26,920 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:53:26,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 12:53:26,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 12:53:26,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 12:53:26,922 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-11-07 12:53:28,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:53:28,809 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-11-07 12:53:28,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 12:53:28,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2018-11-07 12:53:28,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:53:28,815 INFO L225 Difference]: With dead ends: 901 [2018-11-07 12:53:28,816 INFO L226 Difference]: Without dead ends: 380 [2018-11-07 12:53:28,819 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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:53:28,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-11-07 12:53:28,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-11-07 12:53:28,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-11-07 12:53:28,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-11-07 12:53:28,838 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 139 [2018-11-07 12:53:28,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:53:28,838 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-11-07 12:53:28,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 12:53:28,839 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-11-07 12:53:28,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-07 12:53:28,841 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:53:28,841 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:53:28,842 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:53:28,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:53:28,842 INFO L82 PathProgramCache]: Analyzing trace with hash -295510606, now seen corresponding path program 1 times [2018-11-07 12:53:28,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:53:28,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:28,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:53:28,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:28,844 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:53:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:53:29,082 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:53:29,271 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:53:29,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:53:29,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 12:53:29,271 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:53:29,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 12:53:29,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 12:53:29,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 12:53:29,273 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-11-07 12:53:32,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:53:32,226 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-11-07 12:53:32,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 12:53:32,227 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 147 [2018-11-07 12:53:32,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:53:32,233 INFO L225 Difference]: With dead ends: 1193 [2018-11-07 12:53:32,233 INFO L226 Difference]: Without dead ends: 819 [2018-11-07 12:53:32,235 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:53:32,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-11-07 12:53:32,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-11-07 12:53:32,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-11-07 12:53:32,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-11-07 12:53:32,272 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 147 [2018-11-07 12:53:32,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:53:32,272 INFO L480 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-11-07 12:53:32,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 12:53:32,272 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-11-07 12:53:32,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-07 12:53:32,276 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:53:32,276 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:32,276 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:53:32,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:53:32,277 INFO L82 PathProgramCache]: Analyzing trace with hash -431421266, now seen corresponding path program 1 times [2018-11-07 12:53:32,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:53:32,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:32,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:53:32,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:32,278 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:53:32,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:53:32,736 WARN L179 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-07 12:53:32,984 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-07 12:53:33,067 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:53:33,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:53:33,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 12:53:33,068 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:53:33,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 12:53:33,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 12:53:33,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 12:53:33,069 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-11-07 12:53:34,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:53:34,665 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-11-07 12:53:34,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 12:53:34,674 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 149 [2018-11-07 12:53:34,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:53:34,679 INFO L225 Difference]: With dead ends: 1753 [2018-11-07 12:53:34,680 INFO L226 Difference]: Without dead ends: 804 [2018-11-07 12:53:34,683 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 12:53:34,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-11-07 12:53:34,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-11-07 12:53:34,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-11-07 12:53:34,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-11-07 12:53:34,708 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 149 [2018-11-07 12:53:34,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:53:34,708 INFO L480 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-11-07 12:53:34,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 12:53:34,708 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-11-07 12:53:34,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-07 12:53:34,712 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:53:34,712 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:34,712 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:53:34,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:53:34,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1643086762, now seen corresponding path program 1 times [2018-11-07 12:53:34,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:53:34,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:34,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:53:34,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:34,714 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:53:34,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:53:35,084 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-07 12:53:35,312 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-07 12:53:35,367 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:53:35,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:53:35,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 12:53:35,368 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:53:35,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 12:53:35,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 12:53:35,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 12:53:35,369 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-11-07 12:53:37,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:53:37,135 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-11-07 12:53:37,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 12:53:37,136 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2018-11-07 12:53:37,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:53:37,144 INFO L225 Difference]: With dead ends: 1747 [2018-11-07 12:53:37,144 INFO L226 Difference]: Without dead ends: 801 [2018-11-07 12:53:37,148 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 12:53:37,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-11-07 12:53:37,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-11-07 12:53:37,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-11-07 12:53:37,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-11-07 12:53:37,187 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 151 [2018-11-07 12:53:37,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:53:37,188 INFO L480 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-11-07 12:53:37,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 12:53:37,188 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-11-07 12:53:37,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-07 12:53:37,198 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:53:37,198 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:37,198 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:53:37,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:53:37,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1909626462, now seen corresponding path program 1 times [2018-11-07 12:53:37,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:53:37,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:37,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:53:37,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:37,207 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:53:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:53:37,419 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:53:37,650 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:53:37,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:53:37,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 12:53:37,650 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:53:37,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 12:53:37,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 12:53:37,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 12:53:37,651 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-11-07 12:53:38,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:53:38,784 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-11-07 12:53:38,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 12:53:38,791 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 155 [2018-11-07 12:53:38,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:53:38,801 INFO L225 Difference]: With dead ends: 2381 [2018-11-07 12:53:38,801 INFO L226 Difference]: Without dead ends: 1586 [2018-11-07 12:53:38,806 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 12:53:38,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-11-07 12:53:38,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-11-07 12:53:38,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-11-07 12:53:38,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-11-07 12:53:38,853 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 155 [2018-11-07 12:53:38,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:53:38,854 INFO L480 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-11-07 12:53:38,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 12:53:38,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-11-07 12:53:38,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-07 12:53:38,861 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:53:38,861 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:53:38,862 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:53:38,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:53:38,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1663549744, now seen corresponding path program 1 times [2018-11-07 12:53:38,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:53:38,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:38,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:53:38,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:38,864 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:53:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:53:39,084 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:53:39,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:53:39,085 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:53:39,086 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 191 with the following transitions: [2018-11-07 12:53:39,088 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [663], [665], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:53:39,156 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:53:39,157 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:53:40,462 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:53:40,465 INFO L272 AbstractInterpreter]: Visited 128 different actions 252 times. Merged at 5 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-11-07 12:53:40,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:53:40,510 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:53:41,489 INFO L227 lantSequenceWeakener]: Weakened 101 states. On average, predicates are now at 81.15% of their original sizes. [2018-11-07 12:53:41,489 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:53:42,815 INFO L415 sIntCurrentIteration]: We unified 189 AI predicates to 189 [2018-11-07 12:53:42,815 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:53:42,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:53:42,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-07 12:53:42,816 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:53:42,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 12:53:42,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 12:53:42,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-11-07 12:53:42,818 INFO L87 Difference]: Start difference. First operand 1558 states and 2225 transitions. Second operand 18 states. [2018-11-07 12:54:06,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:54:06,947 INFO L93 Difference]: Finished difference Result 3716 states and 5313 transitions. [2018-11-07 12:54:06,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 12:54:06,947 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 190 [2018-11-07 12:54:06,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:54:06,958 INFO L225 Difference]: With dead ends: 3716 [2018-11-07 12:54:06,958 INFO L226 Difference]: Without dead ends: 2164 [2018-11-07 12:54:06,965 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 203 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=182, Invalid=810, Unknown=0, NotChecked=0, Total=992 [2018-11-07 12:54:06,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2164 states. [2018-11-07 12:54:07,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 2152. [2018-11-07 12:54:07,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2152 states. [2018-11-07 12:54:07,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 2889 transitions. [2018-11-07 12:54:07,023 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 2889 transitions. Word has length 190 [2018-11-07 12:54:07,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:54:07,024 INFO L480 AbstractCegarLoop]: Abstraction has 2152 states and 2889 transitions. [2018-11-07 12:54:07,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 12:54:07,024 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 2889 transitions. [2018-11-07 12:54:07,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-11-07 12:54:07,033 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:54:07,033 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 12:54:07,034 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:54:07,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:07,034 INFO L82 PathProgramCache]: Analyzing trace with hash 2065239331, now seen corresponding path program 1 times [2018-11-07 12:54:07,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:54:07,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:07,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:54:07,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:07,036 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:54:07,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:54:07,274 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:54:07,356 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 85 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:54:07,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:54:07,357 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:54:07,357 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 196 with the following transitions: [2018-11-07 12:54:07,358 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [119], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [663], [665], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:54:07,364 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:54:07,364 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:54:08,075 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:54:08,075 INFO L272 AbstractInterpreter]: Visited 130 different actions 386 times. Merged at 7 different actions 20 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 12:54:08,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:08,082 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:54:08,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:54:08,082 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:54:08,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:54:08,097 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:54:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:54:08,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:54:08,638 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 12:54:08,639 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:54:08,870 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 12:54:08,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 12:54:08,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 16 [2018-11-07 12:54:08,891 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 12:54:08,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 12:54:08,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 12:54:08,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-11-07 12:54:08,893 INFO L87 Difference]: Start difference. First operand 2152 states and 2889 transitions. Second operand 14 states. [2018-11-07 12:54:10,749 WARN L179 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-11-07 12:54:13,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:54:13,955 INFO L93 Difference]: Finished difference Result 6996 states and 9851 transitions. [2018-11-07 12:54:13,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 12:54:13,958 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 195 [2018-11-07 12:54:13,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:54:13,975 INFO L225 Difference]: With dead ends: 6996 [2018-11-07 12:54:13,975 INFO L226 Difference]: Without dead ends: 3161 [2018-11-07 12:54:13,995 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 402 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 12:54:13,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3161 states. [2018-11-07 12:54:14,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3161 to 3115. [2018-11-07 12:54:14,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2018-11-07 12:54:14,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 3698 transitions. [2018-11-07 12:54:14,085 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 3698 transitions. Word has length 195 [2018-11-07 12:54:14,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:54:14,086 INFO L480 AbstractCegarLoop]: Abstraction has 3115 states and 3698 transitions. [2018-11-07 12:54:14,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 12:54:14,086 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 3698 transitions. [2018-11-07 12:54:14,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-07 12:54:14,096 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:54:14,096 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:54:14,097 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:54:14,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:14,097 INFO L82 PathProgramCache]: Analyzing trace with hash 920027209, now seen corresponding path program 1 times [2018-11-07 12:54:14,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:54:14,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:14,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:54:14,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:14,099 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:54:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:54:14,433 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 88 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 12:54:14,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:54:14,434 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:54:14,434 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 205 with the following transitions: [2018-11-07 12:54:14,434 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [663], [665], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:54:14,441 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:54:14,442 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:54:15,218 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:54:15,219 INFO L272 AbstractInterpreter]: Visited 129 different actions 262 times. Merged at 7 different actions 15 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 12:54:15,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:15,257 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:54:16,164 INFO L227 lantSequenceWeakener]: Weakened 115 states. On average, predicates are now at 81.14% of their original sizes. [2018-11-07 12:54:16,164 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:54:18,846 INFO L415 sIntCurrentIteration]: We unified 203 AI predicates to 203 [2018-11-07 12:54:18,847 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:54:18,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:54:18,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-07 12:54:18,847 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:54:18,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 12:54:18,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 12:54:18,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-11-07 12:54:18,849 INFO L87 Difference]: Start difference. First operand 3115 states and 3698 transitions. Second operand 18 states. [2018-11-07 12:54:30,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:54:30,113 INFO L93 Difference]: Finished difference Result 6692 states and 8092 transitions. [2018-11-07 12:54:30,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 12:54:30,113 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 204 [2018-11-07 12:54:30,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:54:30,129 INFO L225 Difference]: With dead ends: 6692 [2018-11-07 12:54:30,130 INFO L226 Difference]: Without dead ends: 3872 [2018-11-07 12:54:30,137 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 216 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=175, Invalid=755, Unknown=0, NotChecked=0, Total=930 [2018-11-07 12:54:30,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3872 states. [2018-11-07 12:54:30,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3872 to 3713. [2018-11-07 12:54:30,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3713 states. [2018-11-07 12:54:30,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3713 states to 3713 states and 4349 transitions. [2018-11-07 12:54:30,229 INFO L78 Accepts]: Start accepts. Automaton has 3713 states and 4349 transitions. Word has length 204 [2018-11-07 12:54:30,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:54:30,230 INFO L480 AbstractCegarLoop]: Abstraction has 3713 states and 4349 transitions. [2018-11-07 12:54:30,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 12:54:30,230 INFO L276 IsEmpty]: Start isEmpty. Operand 3713 states and 4349 transitions. [2018-11-07 12:54:30,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-07 12:54:30,239 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:54:30,239 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 12:54:30,239 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:54:30,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:30,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1880112569, now seen corresponding path program 1 times [2018-11-07 12:54:30,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:54:30,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:30,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:54:30,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:30,241 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:54:30,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:54:30,664 WARN L179 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 8 [2018-11-07 12:54:31,107 WARN L179 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-07 12:54:31,362 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 93 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:54:31,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:54:31,362 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:54:31,363 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 212 with the following transitions: [2018-11-07 12:54:31,363 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [324], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [663], [665], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:54:31,368 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:54:31,368 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:54:32,198 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:54:32,198 INFO L272 AbstractInterpreter]: Visited 129 different actions 383 times. Merged at 7 different actions 20 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 12:54:32,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:32,234 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:54:32,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:54:32,234 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) [2018-11-07 12:54:32,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:54:32,578 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 12:54:32,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:54:32,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:54:32,755 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 12:54:32,756 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:54:32,848 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 12:54:32,868 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:54:32,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2018-11-07 12:54:32,869 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:54:32,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:54:32,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:54:32,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-07 12:54:32,870 INFO L87 Difference]: Start difference. First operand 3713 states and 4349 transitions. Second operand 3 states. [2018-11-07 12:54:33,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:54:33,817 INFO L93 Difference]: Finished difference Result 6649 states and 7874 transitions. [2018-11-07 12:54:33,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:54:33,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2018-11-07 12:54:33,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:54:33,821 INFO L225 Difference]: With dead ends: 6649 [2018-11-07 12:54:33,821 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 12:54:33,837 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-07 12:54:33,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 12:54:33,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 12:54:33,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 12:54:33,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 12:54:33,838 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 211 [2018-11-07 12:54:33,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:54:33,838 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 12:54:33,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:54:33,838 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 12:54:33,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 12:54:33,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 12:54:33,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:54:33,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:54:33,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:54:33,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:54:33,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:54:34,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:54:34,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:54:34,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:54:34,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:54:34,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:54:34,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:54:34,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:54:34,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:54:34,287 WARN L179 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2018-11-07 12:54:36,545 WARN L179 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 205 DAG size of output: 107 [2018-11-07 12:54:37,216 WARN L179 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 49 [2018-11-07 12:54:37,610 WARN L179 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 49 [2018-11-07 12:54:37,613 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 12:54:37,613 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a17~0)| ~a17~0) (= |old(~a25~0)| ~a25~0) (= ~a28~0 |old(~a28~0)|)) [2018-11-07 12:54:37,613 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 12:54:37,613 INFO L425 ceAbstractionStarter]: For program point L564(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,613 INFO L425 ceAbstractionStarter]: For program point L531(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,613 INFO L425 ceAbstractionStarter]: For program point L498(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,614 INFO L425 ceAbstractionStarter]: For program point L465(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,614 INFO L425 ceAbstractionStarter]: For program point L432(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,614 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-07 12:54:37,614 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-07 12:54:37,614 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-07 12:54:37,614 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-07 12:54:37,614 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-07 12:54:37,614 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-07 12:54:37,614 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-07 12:54:37,614 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-07 12:54:37,614 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-07 12:54:37,615 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-07 12:54:37,615 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-07 12:54:37,615 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-07 12:54:37,615 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-07 12:54:37,615 INFO L425 ceAbstractionStarter]: For program point L567(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,615 INFO L425 ceAbstractionStarter]: For program point L534(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,615 INFO L425 ceAbstractionStarter]: For program point L501(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,615 INFO L425 ceAbstractionStarter]: For program point L468(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,615 INFO L425 ceAbstractionStarter]: For program point L435(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,615 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-07 12:54:37,615 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-07 12:54:37,615 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-07 12:54:37,616 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-07 12:54:37,616 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-07 12:54:37,616 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-07 12:54:37,616 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-07 12:54:37,616 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-07 12:54:37,616 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-07 12:54:37,616 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-07 12:54:37,616 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-07 12:54:37,616 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-07 12:54:37,616 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-07 12:54:37,616 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-07 12:54:37,617 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-07 12:54:37,617 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-07 12:54:37,617 INFO L425 ceAbstractionStarter]: For program point L570(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,617 INFO L425 ceAbstractionStarter]: For program point L537(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,617 INFO L425 ceAbstractionStarter]: For program point L504(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,617 INFO L425 ceAbstractionStarter]: For program point L471(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,617 INFO L425 ceAbstractionStarter]: For program point L438(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,617 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-07 12:54:37,617 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-07 12:54:37,617 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-07 12:54:37,618 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-07 12:54:37,618 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-07 12:54:37,618 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-07 12:54:37,618 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-07 12:54:37,618 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-07 12:54:37,618 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-07 12:54:37,618 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 523) no Hoare annotation was computed. [2018-11-07 12:54:37,618 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-07 12:54:37,619 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-07 12:54:37,619 INFO L425 ceAbstractionStarter]: For program point L573(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,619 INFO L425 ceAbstractionStarter]: For program point L540(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,619 INFO L425 ceAbstractionStarter]: For program point L507(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,619 INFO L425 ceAbstractionStarter]: For program point L474(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,619 INFO L425 ceAbstractionStarter]: For program point L441(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,619 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-07 12:54:37,619 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-07 12:54:37,619 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-07 12:54:37,620 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-07 12:54:37,620 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-07 12:54:37,620 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-07 12:54:37,620 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-07 12:54:37,620 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-07 12:54:37,620 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-07 12:54:37,620 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-07 12:54:37,620 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-07 12:54:37,620 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-07 12:54:37,621 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-07 12:54:37,621 INFO L425 ceAbstractionStarter]: For program point L576(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,621 INFO L425 ceAbstractionStarter]: For program point L543(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,621 INFO L425 ceAbstractionStarter]: For program point L510(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,621 INFO L425 ceAbstractionStarter]: For program point L477(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,621 INFO L425 ceAbstractionStarter]: For program point L444(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,621 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-07 12:54:37,621 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-07 12:54:37,621 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-07 12:54:37,621 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-07 12:54:37,622 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-07 12:54:37,622 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-07 12:54:37,622 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-07 12:54:37,622 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-07 12:54:37,622 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-07 12:54:37,622 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-07 12:54:37,622 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-07 12:54:37,622 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-07 12:54:37,622 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-07 12:54:37,623 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-07 12:54:37,623 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-07 12:54:37,623 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-07 12:54:37,623 INFO L425 ceAbstractionStarter]: For program point L579(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,623 INFO L425 ceAbstractionStarter]: For program point L546(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,623 INFO L425 ceAbstractionStarter]: For program point L513(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,623 INFO L425 ceAbstractionStarter]: For program point L480(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,623 INFO L425 ceAbstractionStarter]: For program point L447(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,623 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-07 12:54:37,624 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-07 12:54:37,624 INFO L425 ceAbstractionStarter]: For program point L414-1(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,624 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-07 12:54:37,624 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-07 12:54:37,624 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-07 12:54:37,624 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,624 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,624 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-07 12:54:37,624 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-07 12:54:37,624 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-07 12:54:37,624 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-07 12:54:37,625 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-07 12:54:37,625 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-07 12:54:37,625 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-07 12:54:37,625 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-07 12:54:37,625 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-07 12:54:37,625 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-07 12:54:37,625 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-07 12:54:37,625 INFO L425 ceAbstractionStarter]: For program point L582(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,625 INFO L425 ceAbstractionStarter]: For program point L549(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,625 INFO L425 ceAbstractionStarter]: For program point L516(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,625 INFO L425 ceAbstractionStarter]: For program point L483(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,625 INFO L425 ceAbstractionStarter]: For program point L450(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,625 INFO L425 ceAbstractionStarter]: For program point L417(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,625 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-07 12:54:37,626 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-07 12:54:37,626 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-07 12:54:37,626 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-07 12:54:37,626 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-07 12:54:37,626 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-07 12:54:37,626 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-07 12:54:37,626 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-07 12:54:37,626 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-07 12:54:37,626 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-07 12:54:37,626 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-07 12:54:37,626 INFO L425 ceAbstractionStarter]: For program point L585(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,626 INFO L425 ceAbstractionStarter]: For program point L552(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,627 INFO L425 ceAbstractionStarter]: For program point L519(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,627 INFO L425 ceAbstractionStarter]: For program point L486(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,627 INFO L425 ceAbstractionStarter]: For program point L453(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,627 INFO L425 ceAbstractionStarter]: For program point L420(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,627 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-07 12:54:37,627 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-07 12:54:37,627 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-07 12:54:37,627 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-07 12:54:37,628 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-07 12:54:37,628 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-07 12:54:37,628 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-07 12:54:37,628 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-07 12:54:37,628 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-07 12:54:37,628 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-07 12:54:37,628 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-07 12:54:37,628 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-07 12:54:37,628 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-07 12:54:37,629 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-07 12:54:37,629 INFO L425 ceAbstractionStarter]: For program point L588(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,629 INFO L425 ceAbstractionStarter]: For program point L555(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,629 INFO L425 ceAbstractionStarter]: For program point L489(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,629 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,630 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse9 (= 1 |old(~a19~0)|)) (.cse0 (not (= 1 ~a21~0))) (.cse30 (not (= 0 |old(~a11~0)|))) (.cse15 (= 1 |old(~a25~0)|)) (.cse1 (= 1 |old(~a11~0)|)) (.cse12 (= 1 ~a11~0)) (.cse13 (= 1 ~a19~0)) (.cse27 (= |old(~a17~0)| ~a17~0)) (.cse28 (= |old(~a25~0)| ~a25~0)) (.cse29 (= ~a28~0 |old(~a28~0)|))) (let ((.cse3 (and .cse27 .cse28 .cse29)) (.cse7 (and .cse27 .cse29 (= ~a25~0 1))) (.cse19 (not (= 10 |old(~a28~0)|))) (.cse4 (< 7 |old(~a17~0)|)) (.cse10 (not (= 7 |old(~a28~0)|))) (.cse25 (and .cse12 .cse13)) (.cse11 (not (= 8 |old(~a17~0)|))) (.cse6 (= 9 |old(~a28~0)|)) (.cse14 (not .cse1)) (.cse26 (not (= ~a11~0 1))) (.cse5 (not .cse15)) (.cse16 (< 6 |calculate_output_#in~input|)) (.cse22 (and (= ~a11~0 0) (= ~a19~0 1))) (.cse17 (and (or .cse0 .cse30 (not (= 0 |old(~a25~0)|))) (or .cse0 (< |old(~a28~0)| 8) .cse30))) (.cse18 (< |old(~a25~0)| 0)) (.cse24 (< 9 |old(~a28~0)|)) (.cse20 (not .cse9)) (.cse21 (< 1 |old(~a25~0)|)) (.cse2 (= 8 |old(~a28~0)|)) (.cse8 (not (= |old(~a17~0)| 8))) (.cse23 (< |calculate_output_#in~input| 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse5 .cse2 .cse6 .cse7 .cse8) (or .cse9 .cse0 .cse10 .cse11 (and .cse12 (not .cse13)) .cse14 .cse15) (or .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse8 .cse23) (or .cse0 .cse2 .cse6 .cse3 .cse4) (or .cse0 .cse2 .cse3 .cse8 .cse15) (or .cse16 .cse5 .cse17 .cse24 .cse22 .cse20 .cse8 .cse23) (or .cse0 .cse5 .cse2 .cse7 .cse4) (or .cse25 .cse0 .cse19 .cse5 .cse20 .cse11 .cse14) (or .cse0 .cse1 .cse2 .cse26 .cse4) (or .cse0 .cse10 .cse5 .cse20 .cse14 .cse25 (not (= 7 |old(~a17~0)|))) (or .cse0 .cse5 .cse20 .cse11 (and .cse12 (= 1 ~a25~0) (= 9 ~a28~0) (= 8 ~a17~0) .cse13) (not .cse6) .cse14) (or .cse0 .cse1 .cse8 (and .cse27 .cse28 .cse29 .cse26)) (or .cse22 (or .cse16 (or .cse0 .cse5 (< |old(~a28~0)| 9) .cse30) .cse20 (< 11 |old(~a28~0)|) .cse8 .cse23)) (or .cse16 .cse22 .cse17 .cse18 (< |old(~a28~0)| 7) .cse24 .cse20 .cse21 .cse2 .cse8 .cse23)))) [2018-11-07 12:54:37,630 INFO L425 ceAbstractionStarter]: For program point L456(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,630 INFO L425 ceAbstractionStarter]: For program point L423(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,630 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-07 12:54:37,630 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-07 12:54:37,630 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-07 12:54:37,631 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-07 12:54:37,631 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-07 12:54:37,631 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-07 12:54:37,631 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-07 12:54:37,631 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-07 12:54:37,631 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-07 12:54:37,631 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-07 12:54:37,631 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-07 12:54:37,631 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-07 12:54:37,632 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-07 12:54:37,632 INFO L425 ceAbstractionStarter]: For program point L591(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,632 INFO L425 ceAbstractionStarter]: For program point L558(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,632 INFO L425 ceAbstractionStarter]: For program point L525(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,632 INFO L425 ceAbstractionStarter]: For program point L492(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,632 INFO L425 ceAbstractionStarter]: For program point L459(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,632 INFO L425 ceAbstractionStarter]: For program point L426(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,632 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-07 12:54:37,632 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-07 12:54:37,633 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-07 12:54:37,633 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-07 12:54:37,633 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-07 12:54:37,633 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-07 12:54:37,633 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-07 12:54:37,633 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-07 12:54:37,633 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-07 12:54:37,633 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-07 12:54:37,633 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-07 12:54:37,634 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-07 12:54:37,634 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-07 12:54:37,634 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-07 12:54:37,634 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-07 12:54:37,634 INFO L425 ceAbstractionStarter]: For program point L594(lines 594 596) no Hoare annotation was computed. [2018-11-07 12:54:37,634 INFO L425 ceAbstractionStarter]: For program point L561(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,634 INFO L425 ceAbstractionStarter]: For program point L528(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,634 INFO L425 ceAbstractionStarter]: For program point L495(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,635 INFO L425 ceAbstractionStarter]: For program point L462(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,635 INFO L425 ceAbstractionStarter]: For program point L429(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:37,635 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-07 12:54:37,635 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-07 12:54:37,635 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-07 12:54:37,635 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-07 12:54:37,635 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-07 12:54:37,635 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-07 12:54:37,635 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-07 12:54:37,635 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-07 12:54:37,636 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-07 12:54:37,636 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-07 12:54:37,636 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-07 12:54:37,636 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-07 12:54:37,636 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-07 12:54:37,636 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-07 12:54:37,636 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-07 12:54:37,636 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-07 12:54:37,636 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-07 12:54:37,637 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-07 12:54:37,637 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-07 12:54:37,637 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 12:54:37,637 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a19~0 1) (= ~a28~0 7) (= ~a21~0 1)) [2018-11-07 12:54:37,637 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 12:54:37,637 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 12:54:37,637 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (not (= 1 |old(~a19~0)|)) (and (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a19~0 1) (= ~a28~0 |old(~a28~0)|)) (not (= 0 |old(~a11~0)|)) (not (= 8 |old(~a17~0)|)) (not (= 0 |old(~a25~0)|))) [2018-11-07 12:54:37,637 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-07 12:54:37,638 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse1 (not (= ~a11~0 1))) (.cse4 (= ~a25~0 1)) (.cse0 (= |old(~a17~0)| ~a17~0)) (.cse2 (<= ~a17~0 7)) (.cse3 (not (= ~a28~0 8))) (.cse5 (not (= ~a28~0 9)))) (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (not (= 0 |old(~a11~0)|)) (and .cse0 .cse1) (and (= 9 ~a28~0) (= 8 ~a17~0) (= 1 ~a19~0)) (not (= 0 |old(~a25~0)|)) (and .cse2 .cse3 .cse4) (and .cse0 .cse3 .cse5) (and .cse2 .cse3 .cse1) (not (= 1 |old(~a19~0)|)) (and (not .cse4) .cse0 .cse3) (not (= 8 |old(~a17~0)|)) (and .cse2 .cse3 .cse5))) [2018-11-07 12:54:37,638 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-11-07 12:54:37,638 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-11-07 12:54:37,638 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse1 (not (= ~a11~0 1))) (.cse4 (= ~a25~0 1)) (.cse0 (= |old(~a17~0)| ~a17~0)) (.cse2 (<= ~a17~0 7)) (.cse3 (not (= ~a28~0 8))) (.cse5 (not (= ~a28~0 9)))) (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (not (= 0 |old(~a11~0)|)) (and .cse0 .cse1) (and (= 9 ~a28~0) (= 8 ~a17~0) (= 1 ~a19~0)) (not (= 0 |old(~a25~0)|)) (and .cse2 .cse3 .cse4) (and .cse0 .cse3 .cse5) (and .cse2 .cse3 .cse1) (not (= 1 |old(~a19~0)|)) (and (not .cse4) .cse0 .cse3) (not (= 8 |old(~a17~0)|)) (and .cse2 .cse3 .cse5))) [2018-11-07 12:54:37,638 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-11-07 12:54:37,638 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-07 12:54:37,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:54:37 BoogieIcfgContainer [2018-11-07 12:54:37,651 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 12:54:37,652 INFO L168 Benchmark]: Toolchain (without parser) took 81191.67 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 815.3 MB. Max. memory is 7.1 GB. [2018-11-07 12:54:37,653 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 12:54:37,653 INFO L168 Benchmark]: CACSL2BoogieTranslator took 788.33 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-07 12:54:37,654 INFO L168 Benchmark]: Boogie Procedure Inliner took 123.14 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 721.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -802.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. [2018-11-07 12:54:37,655 INFO L168 Benchmark]: Boogie Preprocessor took 122.97 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 12:54:37,656 INFO L168 Benchmark]: RCFGBuilder took 3715.45 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 105.8 MB). Peak memory consumption was 105.8 MB. Max. memory is 7.1 GB. [2018-11-07 12:54:37,656 INFO L168 Benchmark]: TraceAbstraction took 76434.68 ms. Allocated memory was 2.2 GB in the beginning and 3.4 GB in the end (delta: 1.1 GB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -389.5 MB). Peak memory consumption was 758.7 MB. Max. memory is 7.1 GB. [2018-11-07 12:54:37,661 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 788.33 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 123.14 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 721.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -802.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 122.97 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3715.45 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 105.8 MB). Peak memory consumption was 105.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 76434.68 ms. Allocated memory was 2.2 GB in the beginning and 3.4 GB in the end (delta: 1.1 GB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -389.5 MB). Peak memory consumption was 758.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 523]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((((((!(1 == a21) || !(7 == \old(a28))) || !(0 == \old(a11))) || (\old(a17) == a17 && !(a11 == 1))) || ((9 == a28 && 8 == a17) && 1 == a19)) || !(0 == \old(a25))) || ((a17 <= 7 && !(a28 == 8)) && a25 == 1)) || ((\old(a17) == a17 && !(a28 == 8)) && !(a28 == 9))) || ((a17 <= 7 && !(a28 == 8)) && !(a11 == 1))) || !(1 == \old(a19))) || ((!(a25 == 1) && \old(a17) == a17) && !(a28 == 8))) || !(8 == \old(a17))) || ((a17 <= 7 && !(a28 == 8)) && !(a28 == 9)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 76.3s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 54.2s AutomataDifference, 0.0s DeadEndRemovalTime, 3.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 1493 SDtfs, 9095 SDslu, 1906 SDs, 0 SdLazy, 12712 SolverSat, 2126 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.5s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 1337 GetRequests, 1206 SyntacticMatches, 8 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 10.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3713occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.8s AbstIntTime, 4 AbstIntIterations, 2 AbstIntStrong, 0.9973038990370928 AbsIntWeakeningRatio, 0.1836734693877551 AbsIntAvgWeakeningVarsNumRemoved, 24.979591836734695 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 257 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 117 PreInvPairs, 187 NumberOfFragments, 825 HoareAnnotationTreeSize, 117 FomulaSimplifications, 4939 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 3478 FormulaSimplificationTreeSizeReductionInter, 3.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 2204 NumberOfCodeBlocks, 2204 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2595 ConstructedInterpolants, 0 QuantifiedInterpolants, 1995476 SizeOfPredicates, 1 NumberOfNonLiveVariables, 968 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 891/957 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...