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-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label34_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 17:14:29,575 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 17:14:29,579 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 17:14:29,598 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 17:14:29,598 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 17:14:29,600 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 17:14:29,601 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 17:14:29,603 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 17:14:29,604 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 17:14:29,605 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 17:14:29,606 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 17:14:29,606 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 17:14:29,607 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 17:14:29,608 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 17:14:29,609 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 17:14:29,610 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 17:14:29,611 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 17:14:29,613 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 17:14:29,615 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 17:14:29,617 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 17:14:29,618 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 17:14:29,619 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 17:14:29,621 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 17:14:29,622 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 17:14:29,622 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 17:14:29,623 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 17:14:29,624 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 17:14:29,625 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 17:14:29,625 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 17:14:29,627 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 17:14:29,627 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 17:14:29,627 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 17:14:29,628 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 17:14:29,628 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 17:14:29,629 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 17:14:29,630 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 17:14:29,630 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-LIM.epf [2018-11-12 17:14:29,646 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 17:14:29,646 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 17:14:29,647 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 17:14:29,647 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 17:14:29,647 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 17:14:29,648 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 17:14:29,648 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 17:14:29,648 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 17:14:29,648 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 17:14:29,648 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 17:14:29,649 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 17:14:29,649 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 17:14:29,649 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 17:14:29,650 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 17:14:29,650 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 17:14:29,650 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 17:14:29,650 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 17:14:29,650 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 17:14:29,650 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 17:14:29,651 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 17:14:29,651 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 17:14:29,651 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 17:14:29,651 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 17:14:29,651 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 17:14:29,652 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 17:14:29,652 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 17:14:29,652 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 17:14:29,652 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 17:14:29,652 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 17:14:29,653 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 17:14:29,653 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 17:14:29,653 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 17:14:29,653 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 17:14:29,654 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 17:14:29,654 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 17:14:29,732 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 17:14:29,745 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 17:14:29,749 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 17:14:29,751 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 17:14:29,751 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 17:14:29,752 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label34_true-unreach-call_false-termination.c [2018-11-12 17:14:29,816 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ab1e8143/bf0baa7468634889b7fe0beb4b9fccfe/FLAGaea656dcb [2018-11-12 17:14:30,464 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 17:14:30,468 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label34_true-unreach-call_false-termination.c [2018-11-12 17:14:30,487 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ab1e8143/bf0baa7468634889b7fe0beb4b9fccfe/FLAGaea656dcb [2018-11-12 17:14:30,509 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ab1e8143/bf0baa7468634889b7fe0beb4b9fccfe [2018-11-12 17:14:30,522 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 17:14:30,525 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 17:14:30,526 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 17:14:30,526 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 17:14:30,532 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 17:14:30,533 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:14:30" (1/1) ... [2018-11-12 17:14:30,536 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38263162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:14:30, skipping insertion in model container [2018-11-12 17:14:30,536 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:14:30" (1/1) ... [2018-11-12 17:14:30,547 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 17:14:30,618 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 17:14:31,072 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:14:31,084 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 17:14:31,215 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:14:31,233 INFO L193 MainTranslator]: Completed translation [2018-11-12 17:14:31,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:14:31 WrapperNode [2018-11-12 17:14:31,234 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 17:14:31,235 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 17:14:31,235 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 17:14:31,235 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 17:14:31,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:14:31" (1/1) ... [2018-11-12 17:14:31,361 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:14:31" (1/1) ... [2018-11-12 17:14:31,372 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 17:14:31,372 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 17:14:31,372 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 17:14:31,373 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 17:14:31,385 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:14:31" (1/1) ... [2018-11-12 17:14:31,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:14:31" (1/1) ... [2018-11-12 17:14:31,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:14:31" (1/1) ... [2018-11-12 17:14:31,395 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:14:31" (1/1) ... [2018-11-12 17:14:31,432 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:14:31" (1/1) ... [2018-11-12 17:14:31,455 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:14:31" (1/1) ... [2018-11-12 17:14:31,463 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:14:31" (1/1) ... [2018-11-12 17:14:31,469 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 17:14:31,470 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 17:14:31,470 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 17:14:31,470 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 17:14:31,471 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:14:31" (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-12 17:14:31,544 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 17:14:31,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 17:14:31,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 17:14:31,544 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 17:14:31,544 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 17:14:31,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 17:14:31,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 17:14:31,545 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 17:14:31,545 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 17:14:34,806 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 17:14:34,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:14:34 BoogieIcfgContainer [2018-11-12 17:14:34,809 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 17:14:34,810 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 17:14:34,810 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 17:14:34,817 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 17:14:34,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:14:30" (1/3) ... [2018-11-12 17:14:34,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a6d354 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:14:34, skipping insertion in model container [2018-11-12 17:14:34,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:14:31" (2/3) ... [2018-11-12 17:14:34,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a6d354 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:14:34, skipping insertion in model container [2018-11-12 17:14:34,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:14:34" (3/3) ... [2018-11-12 17:14:34,823 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label34_true-unreach-call_false-termination.c [2018-11-12 17:14:34,834 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 17:14:34,844 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 17:14:34,863 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 17:14:34,903 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 17:14:34,904 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 17:14:34,904 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 17:14:34,904 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 17:14:34,904 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 17:14:34,905 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 17:14:34,905 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 17:14:34,905 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 17:14:34,936 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-12 17:14:34,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-12 17:14:34,949 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:14:34,950 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] [2018-11-12 17:14:34,953 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:14:34,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:34,961 INFO L82 PathProgramCache]: Analyzing trace with hash -2048669081, now seen corresponding path program 1 times [2018-11-12 17:14:34,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:14:35,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:35,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:35,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:35,024 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:14:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:35,613 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:14:35,751 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-12 17:14:35,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:14:35,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 17:14:35,755 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:14:35,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:14:35,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:14:35,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:14:35,782 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-11-12 17:14:37,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:14:37,327 INFO L93 Difference]: Finished difference Result 618 states and 1056 transitions. [2018-11-12 17:14:37,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:14:37,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2018-11-12 17:14:37,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:14:37,348 INFO L225 Difference]: With dead ends: 618 [2018-11-12 17:14:37,348 INFO L226 Difference]: Without dead ends: 379 [2018-11-12 17:14:37,356 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:14:37,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-11-12 17:14:37,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2018-11-12 17:14:37,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-11-12 17:14:37,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 621 transitions. [2018-11-12 17:14:37,436 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 621 transitions. Word has length 105 [2018-11-12 17:14:37,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:14:37,438 INFO L480 AbstractCegarLoop]: Abstraction has 379 states and 621 transitions. [2018-11-12 17:14:37,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:14:37,438 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 621 transitions. [2018-11-12 17:14:37,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-12 17:14:37,446 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:14:37,446 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:14:37,446 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:14:37,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:37,447 INFO L82 PathProgramCache]: Analyzing trace with hash -926147150, now seen corresponding path program 1 times [2018-11-12 17:14:37,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:14:37,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:37,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:37,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:37,449 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:14:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:37,624 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:14:37,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:14:37,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 17:14:37,625 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:14:37,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 17:14:37,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 17:14:37,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 17:14:37,628 INFO L87 Difference]: Start difference. First operand 379 states and 621 transitions. Second operand 6 states. [2018-11-12 17:14:39,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:14:39,787 INFO L93 Difference]: Finished difference Result 1231 states and 2094 transitions. [2018-11-12 17:14:39,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-12 17:14:39,794 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2018-11-12 17:14:39,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:14:39,809 INFO L225 Difference]: With dead ends: 1231 [2018-11-12 17:14:39,809 INFO L226 Difference]: Without dead ends: 858 [2018-11-12 17:14:39,817 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 17:14:39,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2018-11-12 17:14:39,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 821. [2018-11-12 17:14:39,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-11-12 17:14:39,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1290 transitions. [2018-11-12 17:14:39,891 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1290 transitions. Word has length 121 [2018-11-12 17:14:39,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:14:39,891 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 1290 transitions. [2018-11-12 17:14:39,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 17:14:39,892 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1290 transitions. [2018-11-12 17:14:39,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-12 17:14:39,900 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:14:39,901 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] [2018-11-12 17:14:39,901 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:14:39,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:39,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1688257955, now seen corresponding path program 1 times [2018-11-12 17:14:39,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:14:39,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:39,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:39,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:39,904 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:14:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:40,130 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-12 17:14:40,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:14:40,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 17:14:40,131 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:14:40,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 17:14:40,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 17:14:40,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 17:14:40,133 INFO L87 Difference]: Start difference. First operand 821 states and 1290 transitions. Second operand 6 states. [2018-11-12 17:14:43,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:14:43,847 INFO L93 Difference]: Finished difference Result 2553 states and 4218 transitions. [2018-11-12 17:14:43,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 17:14:43,848 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2018-11-12 17:14:43,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:14:43,870 INFO L225 Difference]: With dead ends: 2553 [2018-11-12 17:14:43,870 INFO L226 Difference]: Without dead ends: 1738 [2018-11-12 17:14:43,878 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-12 17:14:43,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2018-11-12 17:14:43,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1680. [2018-11-12 17:14:43,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1680 states. [2018-11-12 17:14:43,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 2538 transitions. [2018-11-12 17:14:43,952 INFO L78 Accepts]: Start accepts. Automaton has 1680 states and 2538 transitions. Word has length 128 [2018-11-12 17:14:43,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:14:43,953 INFO L480 AbstractCegarLoop]: Abstraction has 1680 states and 2538 transitions. [2018-11-12 17:14:43,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 17:14:43,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 2538 transitions. [2018-11-12 17:14:43,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-12 17:14:43,959 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:14:43,959 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:14:43,959 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:14:43,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:43,960 INFO L82 PathProgramCache]: Analyzing trace with hash -690130107, now seen corresponding path program 1 times [2018-11-12 17:14:43,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:14:43,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:43,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:43,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:43,961 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:14:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:44,116 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-12 17:14:44,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:14:44,116 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:14:44,117 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 131 with the following transitions: [2018-11-12 17:14:44,120 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [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], [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], [511], [513], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:14:44,172 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:14:44,172 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:14:44,999 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:14:45,004 INFO L272 AbstractInterpreter]: Visited 106 different actions 106 times. Never merged. Never widened. Performed 1626 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1626 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 38 variables. [2018-11-12 17:14:45,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:45,049 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:14:45,635 INFO L227 lantSequenceWeakener]: Weakened 108 states. On average, predicates are now at 81% of their original sizes. [2018-11-12 17:14:45,635 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:14:46,867 INFO L415 sIntCurrentIteration]: We unified 129 AI predicates to 129 [2018-11-12 17:14:46,867 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:14:46,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:14:46,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 18 [2018-11-12 17:14:46,868 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:14:46,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-12 17:14:46,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-12 17:14:46,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-11-12 17:14:46,870 INFO L87 Difference]: Start difference. First operand 1680 states and 2538 transitions. Second operand 14 states. [2018-11-12 17:15:03,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:15:03,360 INFO L93 Difference]: Finished difference Result 3652 states and 5496 transitions. [2018-11-12 17:15:03,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-12 17:15:03,360 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 130 [2018-11-12 17:15:03,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:15:03,371 INFO L225 Difference]: With dead ends: 3652 [2018-11-12 17:15:03,371 INFO L226 Difference]: Without dead ends: 1978 [2018-11-12 17:15:03,378 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 142 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=193, Invalid=509, Unknown=0, NotChecked=0, Total=702 [2018-11-12 17:15:03,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2018-11-12 17:15:03,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1825. [2018-11-12 17:15:03,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1825 states. [2018-11-12 17:15:03,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1825 states to 1825 states and 2690 transitions. [2018-11-12 17:15:03,431 INFO L78 Accepts]: Start accepts. Automaton has 1825 states and 2690 transitions. Word has length 130 [2018-11-12 17:15:03,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:15:03,432 INFO L480 AbstractCegarLoop]: Abstraction has 1825 states and 2690 transitions. [2018-11-12 17:15:03,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-12 17:15:03,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1825 states and 2690 transitions. [2018-11-12 17:15:03,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-12 17:15:03,438 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:15:03,438 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:15:03,438 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:15:03,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:15:03,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1874144486, now seen corresponding path program 1 times [2018-11-12 17:15:03,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:15:03,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:03,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:15:03,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:03,440 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:15:03,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:15:03,745 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 32 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 17:15:03,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:15:03,746 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:15:03,746 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 141 with the following transitions: [2018-11-12 17:15:03,747 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [33], [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], [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], [511], [513], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:15:03,752 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:15:03,752 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:15:04,872 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:15:04,873 INFO L272 AbstractInterpreter]: Visited 110 different actions 323 times. Merged at 7 different actions 15 times. Never widened. Performed 4985 root evaluator evaluations with a maximum evaluation depth of 5. Performed 4985 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-12 17:15:04,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:15:04,912 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:15:05,242 INFO L227 lantSequenceWeakener]: Weakened 137 states. On average, predicates are now at 80.77% of their original sizes. [2018-11-12 17:15:05,243 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:15:06,187 INFO L415 sIntCurrentIteration]: We unified 139 AI predicates to 139 [2018-11-12 17:15:06,188 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:15:06,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:15:06,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2018-11-12 17:15:06,188 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:15:06,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:15:06,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:15:06,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:15:06,190 INFO L87 Difference]: Start difference. First operand 1825 states and 2690 transitions. Second operand 11 states. [2018-11-12 17:15:16,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:15:16,897 INFO L93 Difference]: Finished difference Result 5044 states and 7507 transitions. [2018-11-12 17:15:16,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-12 17:15:16,897 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 140 [2018-11-12 17:15:16,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:15:16,915 INFO L225 Difference]: With dead ends: 5044 [2018-11-12 17:15:16,916 INFO L226 Difference]: Without dead ends: 3225 [2018-11-12 17:15:16,924 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 152 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2018-11-12 17:15:16,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3225 states. [2018-11-12 17:15:17,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3225 to 3101. [2018-11-12 17:15:17,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3101 states. [2018-11-12 17:15:17,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3101 states to 3101 states and 4214 transitions. [2018-11-12 17:15:17,028 INFO L78 Accepts]: Start accepts. Automaton has 3101 states and 4214 transitions. Word has length 140 [2018-11-12 17:15:17,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:15:17,029 INFO L480 AbstractCegarLoop]: Abstraction has 3101 states and 4214 transitions. [2018-11-12 17:15:17,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:15:17,029 INFO L276 IsEmpty]: Start isEmpty. Operand 3101 states and 4214 transitions. [2018-11-12 17:15:17,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-12 17:15:17,036 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:15:17,036 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 17:15:17,037 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:15:17,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:15:17,037 INFO L82 PathProgramCache]: Analyzing trace with hash 506322742, now seen corresponding path program 1 times [2018-11-12 17:15:17,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:15:17,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:17,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:15:17,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:17,039 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:15:17,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:15:17,212 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-12 17:15:17,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:15:17,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 17:15:17,213 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:15:17,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:15:17,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:15:17,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:15:17,214 INFO L87 Difference]: Start difference. First operand 3101 states and 4214 transitions. Second operand 3 states. [2018-11-12 17:15:18,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:15:18,453 INFO L93 Difference]: Finished difference Result 7464 states and 10620 transitions. [2018-11-12 17:15:18,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:15:18,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2018-11-12 17:15:18,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:15:18,473 INFO L225 Difference]: With dead ends: 7464 [2018-11-12 17:15:18,473 INFO L226 Difference]: Without dead ends: 2848 [2018-11-12 17:15:18,491 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:15:18,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2848 states. [2018-11-12 17:15:18,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2848 to 2752. [2018-11-12 17:15:18,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2752 states. [2018-11-12 17:15:18,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2752 states to 2752 states and 3577 transitions. [2018-11-12 17:15:18,569 INFO L78 Accepts]: Start accepts. Automaton has 2752 states and 3577 transitions. Word has length 142 [2018-11-12 17:15:18,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:15:18,569 INFO L480 AbstractCegarLoop]: Abstraction has 2752 states and 3577 transitions. [2018-11-12 17:15:18,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:15:18,569 INFO L276 IsEmpty]: Start isEmpty. Operand 2752 states and 3577 transitions. [2018-11-12 17:15:18,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-12 17:15:18,578 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:15:18,578 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:15:18,578 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:15:18,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:15:18,579 INFO L82 PathProgramCache]: Analyzing trace with hash 395061556, now seen corresponding path program 1 times [2018-11-12 17:15:18,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:15:18,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:18,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:15:18,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:18,580 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:15:18,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:15:18,722 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 57 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-12 17:15:18,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:15:18,722 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:15:18,722 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 157 with the following transitions: [2018-11-12 17:15:18,723 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [33], [34], [38], [42], [45], [50], [52], [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], [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], [511], [513], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:15:18,728 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:15:18,729 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:15:19,043 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:15:19,044 INFO L272 AbstractInterpreter]: Visited 110 different actions 216 times. Merged at 5 different actions 7 times. Never widened. Performed 3040 root evaluator evaluations with a maximum evaluation depth of 4. Performed 3040 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-11-12 17:15:19,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:15:19,050 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:15:19,468 INFO L227 lantSequenceWeakener]: Weakened 65 states. On average, predicates are now at 80.77% of their original sizes. [2018-11-12 17:15:19,468 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:15:19,902 INFO L415 sIntCurrentIteration]: We unified 155 AI predicates to 155 [2018-11-12 17:15:19,902 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:15:19,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:15:19,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-12 17:15:19,902 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:15:19,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 17:15:19,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 17:15:19,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-11-12 17:15:19,903 INFO L87 Difference]: Start difference. First operand 2752 states and 3577 transitions. Second operand 18 states. [2018-11-12 17:15:31,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:15:31,795 INFO L93 Difference]: Finished difference Result 5958 states and 7778 transitions. [2018-11-12 17:15:31,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-12 17:15:31,795 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 156 [2018-11-12 17:15:31,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:15:31,812 INFO L225 Difference]: With dead ends: 5958 [2018-11-12 17:15:31,812 INFO L226 Difference]: Without dead ends: 3212 [2018-11-12 17:15:31,820 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 170 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2018-11-12 17:15:31,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3212 states. [2018-11-12 17:15:31,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3212 to 3202. [2018-11-12 17:15:31,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3202 states. [2018-11-12 17:15:31,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3202 states to 3202 states and 4099 transitions. [2018-11-12 17:15:31,898 INFO L78 Accepts]: Start accepts. Automaton has 3202 states and 4099 transitions. Word has length 156 [2018-11-12 17:15:31,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:15:31,898 INFO L480 AbstractCegarLoop]: Abstraction has 3202 states and 4099 transitions. [2018-11-12 17:15:31,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 17:15:31,898 INFO L276 IsEmpty]: Start isEmpty. Operand 3202 states and 4099 transitions. [2018-11-12 17:15:31,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-12 17:15:31,910 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:15:31,910 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2018-11-12 17:15:31,910 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:15:31,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:15:31,911 INFO L82 PathProgramCache]: Analyzing trace with hash -514313326, now seen corresponding path program 1 times [2018-11-12 17:15:31,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:15:31,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:31,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:15:31,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:31,912 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:15:31,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:15:32,321 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 82 proven. 16 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 17:15:32,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:15:32,321 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:15:32,321 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 182 with the following transitions: [2018-11-12 17:15:32,322 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [25], [26], [30], [33], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [127], [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], [511], [513], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:15:32,331 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:15:32,331 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:15:33,219 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:15:33,220 INFO L272 AbstractInterpreter]: Visited 111 different actions 441 times. Merged at 8 different actions 30 times. Never widened. Performed 7214 root evaluator evaluations with a maximum evaluation depth of 4. Performed 7214 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 7 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-12 17:15:33,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:15:33,224 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:15:33,482 INFO L227 lantSequenceWeakener]: Weakened 178 states. On average, predicates are now at 80.76% of their original sizes. [2018-11-12 17:15:33,482 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:15:33,574 INFO L415 sIntCurrentIteration]: We unified 180 AI predicates to 180 [2018-11-12 17:15:33,575 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:15:33,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:15:33,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-12 17:15:33,575 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:15:33,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-12 17:15:33,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-12 17:15:33,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-12 17:15:33,576 INFO L87 Difference]: Start difference. First operand 3202 states and 4099 transitions. Second operand 10 states. [2018-11-12 17:15:38,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:15:38,822 INFO L93 Difference]: Finished difference Result 7752 states and 9919 transitions. [2018-11-12 17:15:38,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 17:15:38,822 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 181 [2018-11-12 17:15:38,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:15:38,838 INFO L225 Difference]: With dead ends: 7752 [2018-11-12 17:15:38,839 INFO L226 Difference]: Without dead ends: 3701 [2018-11-12 17:15:38,849 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 189 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-11-12 17:15:38,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3701 states. [2018-11-12 17:15:38,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3701 to 3664. [2018-11-12 17:15:38,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3664 states. [2018-11-12 17:15:38,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3664 states to 3664 states and 4591 transitions. [2018-11-12 17:15:38,945 INFO L78 Accepts]: Start accepts. Automaton has 3664 states and 4591 transitions. Word has length 181 [2018-11-12 17:15:38,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:15:38,945 INFO L480 AbstractCegarLoop]: Abstraction has 3664 states and 4591 transitions. [2018-11-12 17:15:38,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-12 17:15:38,945 INFO L276 IsEmpty]: Start isEmpty. Operand 3664 states and 4591 transitions. [2018-11-12 17:15:38,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-11-12 17:15:38,957 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:15:38,957 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:15:38,958 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:15:38,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:15:38,958 INFO L82 PathProgramCache]: Analyzing trace with hash 2046908186, now seen corresponding path program 1 times [2018-11-12 17:15:38,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:15:38,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:38,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:15:38,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:38,960 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:15:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:15:39,447 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 139 proven. 66 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-11-12 17:15:39,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:15:39,448 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:15:39,448 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 235 with the following transitions: [2018-11-12 17:15:39,448 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], [123], [124], [128], [131], [132], [136], [140], [144], [148], [152], [155], [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], [511], [513], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:15:39,451 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:15:39,451 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:15:39,997 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:15:39,997 INFO L272 AbstractInterpreter]: Visited 111 different actions 338 times. Merged at 8 different actions 27 times. Never widened. Performed 4694 root evaluator evaluations with a maximum evaluation depth of 4. Performed 4694 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 6 fixpoints after 4 different actions. Largest state had 38 variables. [2018-11-12 17:15:40,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:15:40,004 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:15:40,312 INFO L227 lantSequenceWeakener]: Weakened 231 states. On average, predicates are now at 80.71% of their original sizes. [2018-11-12 17:15:40,312 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:15:40,714 INFO L415 sIntCurrentIteration]: We unified 233 AI predicates to 233 [2018-11-12 17:15:40,714 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:15:40,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:15:40,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-12 17:15:40,715 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:15:40,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:15:40,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:15:40,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:15:40,716 INFO L87 Difference]: Start difference. First operand 3664 states and 4591 transitions. Second operand 11 states. [2018-11-12 17:15:47,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:15:47,912 INFO L93 Difference]: Finished difference Result 8997 states and 11403 transitions. [2018-11-12 17:15:47,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-12 17:15:47,912 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 234 [2018-11-12 17:15:47,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:15:47,934 INFO L225 Difference]: With dead ends: 8997 [2018-11-12 17:15:47,934 INFO L226 Difference]: Without dead ends: 5339 [2018-11-12 17:15:47,945 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 244 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-11-12 17:15:47,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5339 states. [2018-11-12 17:15:48,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5339 to 4730. [2018-11-12 17:15:48,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4730 states. [2018-11-12 17:15:48,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4730 states to 4730 states and 5883 transitions. [2018-11-12 17:15:48,063 INFO L78 Accepts]: Start accepts. Automaton has 4730 states and 5883 transitions. Word has length 234 [2018-11-12 17:15:48,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:15:48,063 INFO L480 AbstractCegarLoop]: Abstraction has 4730 states and 5883 transitions. [2018-11-12 17:15:48,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:15:48,063 INFO L276 IsEmpty]: Start isEmpty. Operand 4730 states and 5883 transitions. [2018-11-12 17:15:48,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-11-12 17:15:48,077 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:15:48,077 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-12 17:15:48,077 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:15:48,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:15:48,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1634446796, now seen corresponding path program 1 times [2018-11-12 17:15:48,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:15:48,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:48,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:15:48,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:48,079 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:15:48,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:15:48,661 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-12 17:15:48,876 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-12 17:15:49,100 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 262 proven. 132 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-12 17:15:49,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:15:49,101 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:15:49,101 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 299 with the following transitions: [2018-11-12 17:15:49,101 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], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [155], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [205], [209], [210], [214], [218], [222], [233], [236], [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], [511], [513], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:15:49,104 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:15:49,104 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:15:49,547 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:15:49,547 INFO L272 AbstractInterpreter]: Visited 112 different actions 330 times. Merged at 7 different actions 18 times. Never widened. Performed 4575 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4575 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-12 17:15:49,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:15:49,555 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:15:50,168 INFO L227 lantSequenceWeakener]: Weakened 294 states. On average, predicates are now at 80.7% of their original sizes. [2018-11-12 17:15:50,168 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:15:50,288 INFO L415 sIntCurrentIteration]: We unified 297 AI predicates to 297 [2018-11-12 17:15:50,288 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:15:50,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:15:50,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21 [2018-11-12 17:15:50,288 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:15:50,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:15:50,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:15:50,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:15:50,290 INFO L87 Difference]: Start difference. First operand 4730 states and 5883 transitions. Second operand 11 states. [2018-11-12 17:15:58,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:15:58,771 INFO L93 Difference]: Finished difference Result 10984 states and 13689 transitions. [2018-11-12 17:15:58,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-12 17:15:58,771 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 298 [2018-11-12 17:15:58,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:15:58,791 INFO L225 Difference]: With dead ends: 10984 [2018-11-12 17:15:58,791 INFO L226 Difference]: Without dead ends: 6110 [2018-11-12 17:15:58,802 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 309 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2018-11-12 17:15:58,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6110 states. [2018-11-12 17:15:58,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6110 to 6080. [2018-11-12 17:15:58,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6080 states. [2018-11-12 17:15:58,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6080 states to 6080 states and 7548 transitions. [2018-11-12 17:15:58,940 INFO L78 Accepts]: Start accepts. Automaton has 6080 states and 7548 transitions. Word has length 298 [2018-11-12 17:15:58,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:15:58,940 INFO L480 AbstractCegarLoop]: Abstraction has 6080 states and 7548 transitions. [2018-11-12 17:15:58,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:15:58,941 INFO L276 IsEmpty]: Start isEmpty. Operand 6080 states and 7548 transitions. [2018-11-12 17:15:58,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-11-12 17:15:58,957 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:15:58,958 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 17:15:58,958 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:15:58,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:15:58,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1810787464, now seen corresponding path program 1 times [2018-11-12 17:15:58,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:15:58,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:58,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:15:58,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:58,960 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:15:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:15:59,200 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:15:59,569 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 206 proven. 103 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-11-12 17:15:59,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:15:59,570 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:15:59,570 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 306 with the following transitions: [2018-11-12 17:15:59,570 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [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], [155], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [205], [209], [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], [351], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [511], [513], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:15:59,572 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:15:59,572 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:16:00,407 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:16:00,407 INFO L272 AbstractInterpreter]: Visited 114 different actions 570 times. Merged at 9 different actions 50 times. Widened at 1 different actions 1 times. Performed 8338 root evaluator evaluations with a maximum evaluation depth of 6. Performed 8338 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 12 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-12 17:16:00,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:16:00,415 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:16:00,785 INFO L227 lantSequenceWeakener]: Weakened 302 states. On average, predicates are now at 80.74% of their original sizes. [2018-11-12 17:16:00,786 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:16:01,000 INFO L415 sIntCurrentIteration]: We unified 304 AI predicates to 304 [2018-11-12 17:16:01,000 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:16:01,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:16:01,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2018-11-12 17:16:01,000 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:16:01,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-12 17:16:01,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-12 17:16:01,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-11-12 17:16:01,002 INFO L87 Difference]: Start difference. First operand 6080 states and 7548 transitions. Second operand 12 states. [2018-11-12 17:16:12,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:16:12,004 INFO L93 Difference]: Finished difference Result 13466 states and 16806 transitions. [2018-11-12 17:16:12,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-12 17:16:12,004 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 305 [2018-11-12 17:16:12,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:16:12,022 INFO L225 Difference]: With dead ends: 13466 [2018-11-12 17:16:12,022 INFO L226 Difference]: Without dead ends: 7057 [2018-11-12 17:16:12,038 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 322 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=693, Unknown=0, NotChecked=0, Total=870 [2018-11-12 17:16:12,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7057 states. [2018-11-12 17:16:12,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7057 to 6995. [2018-11-12 17:16:12,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6995 states. [2018-11-12 17:16:12,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6995 states to 6995 states and 8720 transitions. [2018-11-12 17:16:12,179 INFO L78 Accepts]: Start accepts. Automaton has 6995 states and 8720 transitions. Word has length 305 [2018-11-12 17:16:12,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:16:12,179 INFO L480 AbstractCegarLoop]: Abstraction has 6995 states and 8720 transitions. [2018-11-12 17:16:12,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-12 17:16:12,180 INFO L276 IsEmpty]: Start isEmpty. Operand 6995 states and 8720 transitions. [2018-11-12 17:16:12,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-11-12 17:16:12,198 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:16:12,198 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 17:16:12,198 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:16:12,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:16:12,199 INFO L82 PathProgramCache]: Analyzing trace with hash -2064525851, now seen corresponding path program 1 times [2018-11-12 17:16:12,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:16:12,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:12,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:16:12,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:12,200 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:16:12,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:16:12,479 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:16:12,618 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 206 proven. 108 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-11-12 17:16:12,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:16:12,619 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:16:12,619 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 308 with the following transitions: [2018-11-12 17:16:12,619 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [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], [155], [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], [301], [306], [308], [309], [313], [317], [321], [325], [329], [333], [344], [348], [351], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [511], [513], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:16:12,621 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:16:12,622 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:16:13,685 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:16:13,685 INFO L272 AbstractInterpreter]: Visited 114 different actions 559 times. Merged at 8 different actions 40 times. Widened at 1 different actions 1 times. Performed 8339 root evaluator evaluations with a maximum evaluation depth of 6. Performed 8339 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 8 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-12 17:16:13,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:16:13,693 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:16:13,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:16:13,693 INFO L192 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-12 17:16:13,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:16:13,703 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:16:13,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:16:13,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:16:14,107 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 220 proven. 2 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2018-11-12 17:16:14,107 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:16:14,975 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 206 proven. 108 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-11-12 17:16:14,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:16:14,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-11-12 17:16:14,997 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:16:14,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 17:16:14,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 17:16:14,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-11-12 17:16:14,998 INFO L87 Difference]: Start difference. First operand 6995 states and 8720 transitions. Second operand 9 states. [2018-11-12 17:16:17,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:16:17,205 INFO L93 Difference]: Finished difference Result 12124 states and 15231 transitions. [2018-11-12 17:16:17,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-12 17:16:17,206 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 307 [2018-11-12 17:16:17,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:16:17,206 INFO L225 Difference]: With dead ends: 12124 [2018-11-12 17:16:17,206 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 17:16:17,222 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 642 GetRequests, 620 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2018-11-12 17:16:17,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 17:16:17,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 17:16:17,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 17:16:17,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 17:16:17,223 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 307 [2018-11-12 17:16:17,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:16:17,223 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 17:16:17,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 17:16:17,224 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 17:16:17,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 17:16:17,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 17:16:18,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:18,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:18,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:18,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:18,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:18,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:18,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:18,358 WARN L179 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 248 DAG size of output: 200 [2018-11-12 17:16:18,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:18,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:18,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:18,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:18,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:18,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:18,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:18,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:18,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:18,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:19,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:19,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:19,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:19,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:19,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:19,197 WARN L179 SmtUtils]: Spent 836.00 ms on a formula simplification. DAG size of input: 314 DAG size of output: 248 [2018-11-12 17:16:19,690 WARN L179 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2018-11-12 17:16:19,958 WARN L179 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 77 [2018-11-12 17:16:24,702 WARN L179 SmtUtils]: Spent 4.72 s on a formula simplification. DAG size of input: 351 DAG size of output: 111 [2018-11-12 17:16:25,693 WARN L179 SmtUtils]: Spent 980.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 101 [2018-11-12 17:16:27,171 WARN L179 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 271 DAG size of output: 110 [2018-11-12 17:16:27,175 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-12 17:16:27,175 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a28~0)| ~a28~0) (= |old(~a19~0)| ~a19~0) (= ~a11~0 |old(~a11~0)|) (= |old(~a25~0)| ~a25~0)) [2018-11-12 17:16:27,175 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-12 17:16:27,176 INFO L425 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,176 INFO L425 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,176 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,176 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,176 INFO L425 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,176 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-12 17:16:27,176 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-12 17:16:27,176 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-12 17:16:27,176 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-12 17:16:27,177 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-12 17:16:27,177 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-12 17:16:27,177 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-12 17:16:27,177 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-12 17:16:27,177 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-12 17:16:27,177 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-12 17:16:27,177 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-12 17:16:27,177 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-12 17:16:27,177 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-12 17:16:27,178 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,178 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,178 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,178 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,178 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-12 17:16:27,178 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,178 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-12 17:16:27,178 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-12 17:16:27,178 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-12 17:16:27,179 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-12 17:16:27,179 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-12 17:16:27,179 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-12 17:16:27,179 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-12 17:16:27,179 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-12 17:16:27,179 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-12 17:16:27,179 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-12 17:16:27,179 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-12 17:16:27,179 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-12 17:16:27,180 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-12 17:16:27,180 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-12 17:16:27,180 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-12 17:16:27,180 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,180 INFO L425 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,180 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,180 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,180 INFO L425 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,180 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-12 17:16:27,180 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-12 17:16:27,181 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-12 17:16:27,181 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-12 17:16:27,181 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-12 17:16:27,181 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-12 17:16:27,181 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-12 17:16:27,181 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-12 17:16:27,181 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-12 17:16:27,181 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-12 17:16:27,181 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-12 17:16:27,181 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,182 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,182 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,182 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,182 INFO L425 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,182 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-12 17:16:27,182 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-12 17:16:27,182 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-12 17:16:27,182 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-12 17:16:27,182 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-12 17:16:27,183 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-12 17:16:27,183 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-12 17:16:27,183 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-12 17:16:27,183 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-12 17:16:27,183 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-12 17:16:27,183 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-12 17:16:27,183 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-12 17:16:27,183 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-12 17:16:27,183 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,184 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,184 INFO L425 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,184 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,184 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,184 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-12 17:16:27,184 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 466) no Hoare annotation was computed. [2018-11-12 17:16:27,184 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-12 17:16:27,184 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-12 17:16:27,184 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-12 17:16:27,185 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-12 17:16:27,185 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-12 17:16:27,185 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-12 17:16:27,185 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-12 17:16:27,185 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-12 17:16:27,185 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-12 17:16:27,185 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-12 17:16:27,185 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-12 17:16:27,185 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-12 17:16:27,186 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-12 17:16:27,186 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-12 17:16:27,186 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-12 17:16:27,186 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,186 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,186 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,186 INFO L425 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,186 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-12 17:16:27,186 INFO L425 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,187 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-12 17:16:27,187 INFO L425 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,187 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-12 17:16:27,187 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-12 17:16:27,187 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-12 17:16:27,187 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,187 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,187 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-12 17:16:27,188 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-12 17:16:27,188 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-12 17:16:27,188 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-12 17:16:27,188 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-12 17:16:27,188 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-12 17:16:27,188 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-12 17:16:27,188 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-12 17:16:27,188 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-12 17:16:27,188 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-12 17:16:27,188 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-12 17:16:27,188 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,189 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,189 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,189 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,189 INFO L425 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,189 INFO L425 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,189 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-12 17:16:27,189 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-12 17:16:27,189 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-12 17:16:27,189 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-12 17:16:27,189 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-12 17:16:27,189 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-12 17:16:27,189 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-12 17:16:27,189 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-12 17:16:27,190 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-12 17:16:27,190 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-12 17:16:27,190 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-12 17:16:27,190 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,190 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,190 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,190 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,190 INFO L425 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,190 INFO L425 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,190 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-12 17:16:27,191 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-12 17:16:27,191 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-12 17:16:27,191 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-12 17:16:27,191 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-12 17:16:27,191 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-12 17:16:27,191 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-12 17:16:27,191 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-12 17:16:27,191 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-12 17:16:27,191 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-12 17:16:27,191 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-12 17:16:27,191 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-12 17:16:27,191 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-12 17:16:27,191 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-12 17:16:27,192 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,192 INFO L425 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,192 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,192 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse1 (< |old(~a28~0)| 10)) (.cse4 (= 1 |old(~a25~0)|)) (.cse14 (< 1 |old(~a19~0)|)) (.cse23 (= |old(~a28~0)| ~a28~0)) (.cse0 (= 7 |old(~a17~0)|)) (.cse2 (not (= ~a17~0 7))) (.cse22 (= |old(~a11~0)| |old(~a19~0)|)) (.cse24 (< 10 |old(~a28~0)|)) (.cse20 (not (= 8 |old(~a17~0)|))) (.cse17 (= |old(~a19~0)| ~a19~0)) (.cse19 (= ~a17~0 8)) (.cse5 (< 6 |calculate_output_#in~input|)) (.cse6 (not (= 1 ~a21~0))) (.cse15 (= |old(~a25~0)| ~a25~0)) (.cse16 (<= 7 ~a28~0)) (.cse18 (= 1 ~a11~0)) (.cse7 (< |old(~a25~0)| 0)) (.cse3 (not (= 1 |old(~a11~0)|))) (.cse8 (< |old(~a28~0)| 7)) (.cse21 (not (= 1 |old(~a19~0)|))) (.cse9 (< 1 |old(~a25~0)|)) (.cse10 (< 11 |old(~a28~0)|)) (.cse11 (< 8 |old(~a17~0)|)) (.cse12 (< |calculate_output_#in~input| 1)) (.cse13 (< |old(~a17~0)| 7))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse6 .cse0 .cse7 .cse3 .cse8 .cse2 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse14 .cse5 .cse6 (< (+ |old(~a19~0)| 1) 0) (< 3 |old(~a25~0)|) .cse7 .cse3 .cse8 .cse4 (< 21 |old(~a28~0)|) (and .cse15 .cse16 .cse17 .cse18 (<= ~a28~0 21) .cse19) .cse20 .cse12) (or .cse5 .cse6 (not (= 7 |old(~a28~0)|)) (not .cse4) .cse3 .cse21 (= ~a28~0 7) .cse20 .cse12) (or (and .cse17 .cse18 .cse15) .cse22 .cse3) (or (and .cse23 .cse17 .cse18 .cse15) .cse1 .cse3 .cse4) (or .cse5 .cse6 .cse7 .cse3 .cse8 .cse24 (<= ~a28~0 10) .cse21 .cse9 .cse20 .cse12) (or (or .cse14 .cse5 .cse6 (not (= 0 |old(~a11~0)|)) (< |old(~a19~0)| 0) .cse9 .cse10) .cse7 .cse8 (and .cse15 .cse17 .cse23 (= ~a11~0 0) .cse19) .cse20 .cse12) (or .cse0 .cse2 .cse22 .cse3) (or .cse5 .cse3 (<= 9 ~a28~0) (or .cse24 .cse6 .cse21 .cse9 (< |old(~a28~0)| 9) .cse20 .cse7) .cse12) (or .cse6 .cse20 (and .cse17 .cse18 .cse19 .cse15) .cse3 (not (= 0 |old(~a25~0)|))) (or .cse5 .cse6 (and .cse15 .cse16 (<= ~a28~0 11) .cse18 (= ~a19~0 1) (<= ~a17~0 8) (<= 7 ~a17~0)) .cse7 .cse3 .cse8 .cse21 .cse9 .cse10 .cse11 .cse12 .cse13))) [2018-11-12 17:16:27,192 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,193 INFO L425 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,193 INFO L425 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,193 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-12 17:16:27,193 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-12 17:16:27,193 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-12 17:16:27,193 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-12 17:16:27,193 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-12 17:16:27,193 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-12 17:16:27,193 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-12 17:16:27,193 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-12 17:16:27,193 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-12 17:16:27,194 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-12 17:16:27,194 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-12 17:16:27,194 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-12 17:16:27,194 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-12 17:16:27,194 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,194 INFO L425 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,194 INFO L425 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,194 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,194 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,194 INFO L425 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,194 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-12 17:16:27,194 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-12 17:16:27,194 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-12 17:16:27,194 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-12 17:16:27,194 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-12 17:16:27,195 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-12 17:16:27,195 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-12 17:16:27,195 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-12 17:16:27,195 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-12 17:16:27,195 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-12 17:16:27,195 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-12 17:16:27,195 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-12 17:16:27,195 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-12 17:16:27,195 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-12 17:16:27,195 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-12 17:16:27,195 INFO L425 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-11-12 17:16:27,195 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,195 INFO L425 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,195 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,195 INFO L425 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,195 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:27,196 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-12 17:16:27,196 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-12 17:16:27,196 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-12 17:16:27,196 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-12 17:16:27,196 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-12 17:16:27,196 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-12 17:16:27,196 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-12 17:16:27,196 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-12 17:16:27,196 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-12 17:16:27,196 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-12 17:16:27,196 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-12 17:16:27,196 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-12 17:16:27,196 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-12 17:16:27,196 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-12 17:16:27,196 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-12 17:16:27,197 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-12 17:16:27,197 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-12 17:16:27,197 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-12 17:16:27,197 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-12 17:16:27,197 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-12 17:16:27,197 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~z~0 26) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a~0 1) (= ~a19~0 1) (= ~a28~0 7)) [2018-11-12 17:16:27,197 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-12 17:16:27,197 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-12 17:16:27,197 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= |old(~a11~0)| 0)) (and (= ~a25~0 0) (= ~a19~0 1) (= ~a11~0 |old(~a11~0)|) (= |old(~a28~0)| ~a28~0) (= ~a17~0 8)) (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= ~a21~0 1)) (not (= ~y~0 25)) (not (= 3 ~c~0)) (not (= |old(~a25~0)| 0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= 8 |old(~a17~0)|)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-11-12 17:16:27,197 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-12 17:16:27,198 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse10 (= ~a25~0 1))) (let ((.cse3 (= 1 ~a11~0)) (.cse8 (<= ~a19~0 1)) (.cse4 (= ~a17~0 8)) (.cse9 (<= ~a28~0 11)) (.cse2 (<= 0 ~a25~0)) (.cse6 (= ~a11~0 0)) (.cse7 (<= 0 ~a19~0)) (.cse0 (not .cse10)) (.cse1 (<= 7 ~a28~0)) (.cse5 (<= ~a25~0 1))) (or (and (<= ~a25~0 3) .cse0 .cse1 .cse2 .cse3 .cse4) (and (= ~a25~0 0) .cse3 .cse4) (and (<= ~a28~0 10) .cse1 .cse5 .cse2 .cse6 .cse7 .cse8 .cse4 (not (= ~a28~0 9))) (not (= ~a21~0 1)) (not (= ~y~0 25)) (and .cse3 (not (= ~a19~0 ~a11~0))) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (and .cse8 .cse4 (and .cse9 .cse6 .cse7 (and (<= 9 ~a28~0) .cse10) (<= 1 main_~input~0) (<= main_~input~0 6))) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (not (= 3 ~c~0)) (and (<= 10 ~a28~0) .cse0 .cse3) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (and .cse1 .cse5 .cse9 .cse2 .cse3 (<= ~a17~0 8) (<= 7 ~a17~0)) (and .cse8 .cse4 (and .cse9 .cse2 .cse6 .cse7 .cse0 .cse1 .cse5)) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0))))) [2018-11-12 17:16:27,198 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-11-12 17:16:27,198 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-11-12 17:16:27,198 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse6 (= ~a17~0 8)) (.cse1 (not (= ~a25~0 1))) (.cse0 (<= 1 main_~input~0)) (.cse2 (<= main_~input~0 6)) (.cse3 (<= 7 ~a28~0)) (.cse8 (<= ~a25~0 1)) (.cse7 (<= ~a28~0 11)) (.cse4 (<= 0 ~a25~0)) (.cse5 (= 1 ~a11~0))) (or (and (<= ~a25~0 3) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (= ~a25~0 0) .cse5 .cse6) (not (= ~a21~0 1)) (not (= ~y~0 25)) (and .cse5 (not (= ~a19~0 ~a11~0))) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (not (= ~z~0 26)) (and .cse4 (and .cse7 (= ~a11~0 0) (<= 0 ~a19~0) .cse0 .cse2 .cse3 .cse8) (<= ~a19~0 1) .cse6) (not (= 0 |old(~a25~0)|)) (not (= 3 ~c~0)) (and (<= 10 ~a28~0) .cse1 .cse5) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (and .cse0 .cse2 .cse3 .cse8 .cse7 .cse4 .cse5 (<= ~a17~0 8) (<= 7 ~a17~0)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0)))) [2018-11-12 17:16:27,198 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-11-12 17:16:27,198 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-12 17:16:27,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:16:27 BoogieIcfgContainer [2018-11-12 17:16:27,213 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 17:16:27,214 INFO L168 Benchmark]: Toolchain (without parser) took 116691.16 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -50.5 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-11-12 17:16:27,218 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 17:16:27,219 INFO L168 Benchmark]: CACSL2BoogieTranslator took 708.56 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-12 17:16:27,219 INFO L168 Benchmark]: Boogie Procedure Inliner took 137.00 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 732.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -809.4 MB). Peak memory consumption was 18.1 MB. Max. memory is 7.1 GB. [2018-11-12 17:16:27,220 INFO L168 Benchmark]: Boogie Preprocessor took 97.18 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2018-11-12 17:16:27,226 INFO L168 Benchmark]: RCFGBuilder took 3338.88 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 104.6 MB). Peak memory consumption was 104.6 MB. Max. memory is 7.1 GB. [2018-11-12 17:16:27,227 INFO L168 Benchmark]: TraceAbstraction took 112403.07 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 1.5 GB in the end (delta: 609.2 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-11-12 17:16:27,232 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 708.56 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 137.00 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 732.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -809.4 MB). Peak memory consumption was 18.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 97.18 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3338.88 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 104.6 MB). Peak memory consumption was 104.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 112403.07 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 1.5 GB in the end (delta: 609.2 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 466]: 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: ((((((((((((((((((((((((((((a25 <= 3 && !(a25 == 1)) && 7 <= a28) && 0 <= a25) && 1 == a11) && a17 == 8) || ((a25 == 0 && 1 == a11) && a17 == 8)) || ((((((((a28 <= 10 && 7 <= a28) && a25 <= 1) && 0 <= a25) && a11 == 0) && 0 <= a19) && a19 <= 1) && a17 == 8) && !(a28 == 9))) || !(a21 == 1)) || !(y == 25)) || (1 == a11 && !(a19 == a11))) || !(1 == \old(a19))) || !(x == 24)) || !(e == 5)) || !(d == 4)) || !(21 == u)) || !(22 == v)) || !(\old(a11) == 0)) || ((a19 <= 1 && a17 == 8) && ((((a28 <= 11 && a11 == 0) && 0 <= a19) && 9 <= a28 && a25 == 1) && 1 <= input) && input <= 6)) || !(z == 26)) || !(0 == \old(a25))) || !(3 == c)) || ((10 <= a28 && !(a25 == 1)) && 1 == a11)) || !(23 == w)) || !(\old(a28) == 7)) || !(a == 1)) || ((((((7 <= a28 && a25 <= 1) && a28 <= 11) && 0 <= a25) && 1 == a11) && a17 <= 8) && 7 <= a17)) || ((a19 <= 1 && a17 == 8) && (((((a28 <= 11 && 0 <= a25) && a11 == 0) && 0 <= a19) && !(a25 == 1)) && 7 <= a28) && a25 <= 1)) || !(\old(a17) == 8)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 112.3s OverallTime, 12 OverallIterations, 6 TraceHistogramMax, 82.2s AutomataDifference, 0.0s DeadEndRemovalTime, 9.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 1934 SDtfs, 10461 SDslu, 2970 SDs, 0 SdLazy, 14705 SolverSat, 2366 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.6s Time, PredicateUnifierStatistics: 14 DeclaredPredicates, 2199 GetRequests, 1993 SyntacticMatches, 6 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 976 ImplicationChecksByTransitivity, 7.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6995occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 6.2s AbstIntTime, 8 AbstIntIterations, 7 AbstIntStrong, 0.9965531705983606 AbsIntWeakeningRatio, 0.2115518441196938 AbsIntAvgWeakeningVarsNumRemoved, 29.604036186499652 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 1216 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 274 PreInvPairs, 398 NumberOfFragments, 1043 HoareAnnotationTreeSize, 274 FomulaSimplifications, 67533 FormulaSimplificationTreeSizeReduction, 1.9s HoareSimplificationTime, 7 FomulaSimplificationsInter, 28964 FormulaSimplificationTreeSizeReductionInter, 7.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 2554 NumberOfCodeBlocks, 2554 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2847 ConstructedInterpolants, 0 QuantifiedInterpolants, 1656942 SizeOfPredicates, 0 NumberOfNonLiveVariables, 649 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 2031/2600 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...