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.epf -i ../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 05:05:30,502 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 05:05:30,505 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 05:05:30,520 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 05:05:30,521 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 05:05:30,524 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 05:05:30,525 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 05:05:30,529 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 05:05:30,536 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 05:05:30,537 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 05:05:30,539 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 05:05:30,540 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 05:05:30,541 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 05:05:30,542 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 05:05:30,549 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 05:05:30,550 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 05:05:30,551 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 05:05:30,556 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 05:05:30,562 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 05:05:30,563 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 05:05:30,564 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 05:05:30,568 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 05:05:30,572 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 05:05:30,573 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 05:05:30,573 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 05:05:30,575 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 05:05:30,576 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 05:05:30,580 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 05:05:30,583 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 05:05:30,584 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 05:05:30,584 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 05:05:30,587 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 05:05:30,587 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 05:05:30,587 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 05:05:30,588 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 05:05:30,589 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 05:05:30,589 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-07 05:05:30,622 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 05:05:30,623 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 05:05:30,627 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 05:05:30,627 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 05:05:30,627 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 05:05:30,627 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 05:05:30,628 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 05:05:30,628 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 05:05:30,628 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 05:05:30,628 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 05:05:30,628 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 05:05:30,628 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 05:05:30,630 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 05:05:30,630 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 05:05:30,631 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 05:05:30,632 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 05:05:30,632 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 05:05:30,632 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 05:05:30,632 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 05:05:30,632 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 05:05:30,632 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 05:05:30,633 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 05:05:30,633 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 05:05:30,633 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 05:05:30,633 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 05:05:30,633 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 05:05:30,634 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 05:05:30,635 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 05:05:30,635 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 05:05:30,636 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 05:05:30,636 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 05:05:30,636 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 05:05:30,636 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 05:05:30,636 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 05:05:30,699 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 05:05:30,714 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 05:05:30,717 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 05:05:30,719 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 05:05:30,720 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 05:05:30,720 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i [2018-11-07 05:05:30,783 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ffa580e3/f118b983cdb94b22b8d55a1d47c9fb43/FLAGc20cdcc93 [2018-11-07 05:05:31,270 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 05:05:31,271 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i [2018-11-07 05:05:31,280 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ffa580e3/f118b983cdb94b22b8d55a1d47c9fb43/FLAGc20cdcc93 [2018-11-07 05:05:31,303 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ffa580e3/f118b983cdb94b22b8d55a1d47c9fb43 [2018-11-07 05:05:31,315 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 05:05:31,317 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 05:05:31,320 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 05:05:31,320 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 05:05:31,326 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 05:05:31,327 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:05:31" (1/1) ... [2018-11-07 05:05:31,330 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f964c77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:31, skipping insertion in model container [2018-11-07 05:05:31,330 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:05:31" (1/1) ... [2018-11-07 05:05:31,342 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 05:05:31,369 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 05:05:31,557 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 05:05:31,561 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 05:05:31,587 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 05:05:31,604 INFO L193 MainTranslator]: Completed translation [2018-11-07 05:05:31,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:31 WrapperNode [2018-11-07 05:05:31,604 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 05:05:31,605 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 05:05:31,605 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 05:05:31,606 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 05:05:31,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:31" (1/1) ... [2018-11-07 05:05:31,623 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:31" (1/1) ... [2018-11-07 05:05:31,630 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 05:05:31,630 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 05:05:31,631 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 05:05:31,631 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 05:05:31,642 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:31" (1/1) ... [2018-11-07 05:05:31,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:31" (1/1) ... [2018-11-07 05:05:31,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:31" (1/1) ... [2018-11-07 05:05:31,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:31" (1/1) ... [2018-11-07 05:05:31,647 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:31" (1/1) ... [2018-11-07 05:05:31,653 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:31" (1/1) ... [2018-11-07 05:05:31,654 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:31" (1/1) ... [2018-11-07 05:05:31,656 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 05:05:31,657 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 05:05:31,657 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 05:05:31,657 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 05:05:31,658 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05: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-07 05:05:31,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 05:05:31,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 05:05:31,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 05:05:31,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 05:05:31,817 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 05:05:31,817 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 05:05:31,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 05:05:31,818 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 05:05:32,353 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 05:05:32,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:05:32 BoogieIcfgContainer [2018-11-07 05:05:32,354 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 05:05:32,355 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 05:05:32,355 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 05:05:32,359 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 05:05:32,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:05:31" (1/3) ... [2018-11-07 05:05:32,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a4dc8bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:05:32, skipping insertion in model container [2018-11-07 05:05:32,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:31" (2/3) ... [2018-11-07 05:05:32,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a4dc8bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:05:32, skipping insertion in model container [2018-11-07 05:05:32,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:05:32" (3/3) ... [2018-11-07 05:05:32,363 INFO L112 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle_true-unreach-call_true-termination.i [2018-11-07 05:05:32,374 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 05:05:32,382 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 05:05:32,399 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 05:05:32,436 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 05:05:32,436 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 05:05:32,436 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 05:05:32,436 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 05:05:32,437 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 05:05:32,437 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 05:05:32,437 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 05:05:32,437 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 05:05:32,465 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-07 05:05:32,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-07 05:05:32,472 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:32,473 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:32,476 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:32,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:32,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1538012201, now seen corresponding path program 1 times [2018-11-07 05:05:32,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:32,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:32,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:05:32,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:32,537 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:32,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:32,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:05:32,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:05:32,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 05:05:32,611 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:05:32,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 05:05:32,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 05:05:32,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 05:05:32,633 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-11-07 05:05:32,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:32,666 INFO L93 Difference]: Finished difference Result 63 states and 94 transitions. [2018-11-07 05:05:32,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 05:05:32,668 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-07 05:05:32,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:32,688 INFO L225 Difference]: With dead ends: 63 [2018-11-07 05:05:32,689 INFO L226 Difference]: Without dead ends: 30 [2018-11-07 05:05:32,694 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 05:05:32,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-07 05:05:32,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-07 05:05:32,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-07 05:05:32,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2018-11-07 05:05:32,744 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 14 [2018-11-07 05:05:32,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:32,744 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2018-11-07 05:05:32,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 05:05:32,745 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2018-11-07 05:05:32,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-07 05:05:32,747 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:32,747 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:32,747 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:32,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:32,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1856547447, now seen corresponding path program 1 times [2018-11-07 05:05:32,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:32,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:32,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:05:32,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:32,750 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:32,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:05:32,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:05:32,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 05:05:32,876 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:05:32,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 05:05:32,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 05:05:32,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 05:05:32,879 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand 5 states. [2018-11-07 05:05:33,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:33,123 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-11-07 05:05:33,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 05:05:33,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-07 05:05:33,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:33,127 INFO L225 Difference]: With dead ends: 36 [2018-11-07 05:05:33,127 INFO L226 Difference]: Without dead ends: 34 [2018-11-07 05:05:33,129 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 05:05:33,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-07 05:05:33,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-07 05:05:33,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-07 05:05:33,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2018-11-07 05:05:33,142 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 16 [2018-11-07 05:05:33,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:33,143 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2018-11-07 05:05:33,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 05:05:33,143 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2018-11-07 05:05:33,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-07 05:05:33,144 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:33,144 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:33,144 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:33,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:33,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1929535109, now seen corresponding path program 1 times [2018-11-07 05:05:33,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:33,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:33,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:05:33,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:33,147 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:33,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:05:33,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:33,542 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:05:33,543 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-11-07 05:05:33,544 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [13], [19], [23], [27], [29], [32], [59], [62], [64], [67], [69], [70], [71], [72], [82], [83], [84] [2018-11-07 05:05:33,600 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 05:05:33,600 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 05:05:33,778 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 05:05:33,780 INFO L272 AbstractInterpreter]: Visited 19 different actions 23 times. Never merged. Never widened. Never found a fixpoint. Largest state had 8 variables. [2018-11-07 05:05:33,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:33,790 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 05:05:33,911 INFO L227 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 64% of their original sizes. [2018-11-07 05:05:33,911 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 05:05:34,250 INFO L415 sIntCurrentIteration]: We unified 20 AI predicates to 20 [2018-11-07 05:05:34,250 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 05:05:34,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 05:05:34,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 16 [2018-11-07 05:05:34,251 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:05:34,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 05:05:34,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 05:05:34,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-07 05:05:34,253 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand 10 states. [2018-11-07 05:05:35,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:35,275 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2018-11-07 05:05:35,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 05:05:35,275 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-11-07 05:05:35,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:35,277 INFO L225 Difference]: With dead ends: 54 [2018-11-07 05:05:35,277 INFO L226 Difference]: Without dead ends: 52 [2018-11-07 05:05:35,278 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-11-07 05:05:35,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-07 05:05:35,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-11-07 05:05:35,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-07 05:05:35,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2018-11-07 05:05:35,293 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 21 [2018-11-07 05:05:35,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:35,293 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2018-11-07 05:05:35,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 05:05:35,293 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2018-11-07 05:05:35,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-07 05:05:35,295 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:35,295 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:35,295 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:35,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:35,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1060690802, now seen corresponding path program 1 times [2018-11-07 05:05:35,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:35,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:35,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:05:35,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:35,298 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:35,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:35,731 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-07 05:05:35,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:35,731 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:05:35,732 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-11-07 05:05:35,732 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [13], [19], [23], [27], [29], [34], [39], [42], [44], [59], [62], [64], [67], [69], [70], [71], [72], [74], [75], [76], [77], [78] [2018-11-07 05:05:35,734 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 05:05:35,734 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 05:05:35,764 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 05:05:35,765 INFO L272 AbstractInterpreter]: Visited 24 different actions 32 times. Never merged. Never widened. Never found a fixpoint. Largest state had 10 variables. [2018-11-07 05:05:35,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:35,781 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 05:05:35,866 INFO L227 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 57.45% of their original sizes. [2018-11-07 05:05:35,868 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 05:05:36,204 INFO L415 sIntCurrentIteration]: We unified 28 AI predicates to 28 [2018-11-07 05:05:36,204 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 05:05:36,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 05:05:36,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [8] total 20 [2018-11-07 05:05:36,205 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:05:36,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 05:05:36,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 05:05:36,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-11-07 05:05:36,207 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand 14 states. [2018-11-07 05:05:37,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:37,864 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2018-11-07 05:05:37,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 05:05:37,865 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2018-11-07 05:05:37,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:37,868 INFO L225 Difference]: With dead ends: 76 [2018-11-07 05:05:37,868 INFO L226 Difference]: Without dead ends: 74 [2018-11-07 05:05:37,870 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2018-11-07 05:05:37,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-07 05:05:37,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 57. [2018-11-07 05:05:37,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-07 05:05:37,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2018-11-07 05:05:37,892 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 29 [2018-11-07 05:05:37,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:37,892 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2018-11-07 05:05:37,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 05:05:37,893 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2018-11-07 05:05:37,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-07 05:05:37,894 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:37,894 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:37,894 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:37,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:37,895 INFO L82 PathProgramCache]: Analyzing trace with hash 578348401, now seen corresponding path program 1 times [2018-11-07 05:05:37,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:37,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:37,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:05:37,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:37,897 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:38,033 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 05:05:38,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:38,034 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:05:38,034 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-11-07 05:05:38,035 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [13], [19], [23], [27], [29], [32], [52], [59], [62], [64], [67], [69], [70], [71], [72], [82], [83], [84], [85], [86], [87], [88] [2018-11-07 05:05:38,037 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 05:05:38,037 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 05:05:38,056 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 05:05:38,056 INFO L272 AbstractInterpreter]: Visited 24 different actions 36 times. Never merged. Never widened. Never found a fixpoint. Largest state had 9 variables. [2018-11-07 05:05:38,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:38,085 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 05:05:38,133 INFO L227 lantSequenceWeakener]: Weakened 19 states. On average, predicates are now at 69.47% of their original sizes. [2018-11-07 05:05:38,133 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 05:05:38,534 INFO L415 sIntCurrentIteration]: We unified 31 AI predicates to 31 [2018-11-07 05:05:38,535 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 05:05:38,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 05:05:38,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2018-11-07 05:05:38,536 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:05:38,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 05:05:38,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 05:05:38,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-11-07 05:05:38,537 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand 11 states. [2018-11-07 05:05:39,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:39,555 INFO L93 Difference]: Finished difference Result 81 states and 98 transitions. [2018-11-07 05:05:39,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 05:05:39,556 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-11-07 05:05:39,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:39,557 INFO L225 Difference]: With dead ends: 81 [2018-11-07 05:05:39,558 INFO L226 Difference]: Without dead ends: 74 [2018-11-07 05:05:39,559 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-11-07 05:05:39,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-07 05:05:39,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2018-11-07 05:05:39,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-07 05:05:39,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2018-11-07 05:05:39,577 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 32 [2018-11-07 05:05:39,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:39,577 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2018-11-07 05:05:39,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 05:05:39,578 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2018-11-07 05:05:39,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-07 05:05:39,579 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:39,579 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:39,579 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:39,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:39,580 INFO L82 PathProgramCache]: Analyzing trace with hash 434465614, now seen corresponding path program 1 times [2018-11-07 05:05:39,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:39,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:39,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:05:39,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:39,582 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:39,792 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 05:05:39,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:39,792 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:05:39,793 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-11-07 05:05:39,793 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [13], [19], [23], [27], [29], [34], [39], [42], [44], [59], [62], [64], [67], [69], [70], [71], [72], [74], [75], [76], [77], [78], [79], [80] [2018-11-07 05:05:39,795 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 05:05:39,795 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 05:05:39,815 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 05:05:39,816 INFO L272 AbstractInterpreter]: Visited 26 different actions 38 times. Never merged. Never widened. Never found a fixpoint. Largest state had 10 variables. [2018-11-07 05:05:39,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:39,827 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 05:05:39,869 INFO L227 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 66.25% of their original sizes. [2018-11-07 05:05:39,870 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 05:05:40,179 INFO L415 sIntCurrentIteration]: We unified 33 AI predicates to 33 [2018-11-07 05:05:40,179 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 05:05:40,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 05:05:40,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [10] total 22 [2018-11-07 05:05:40,180 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:05:40,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 05:05:40,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 05:05:40,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-11-07 05:05:40,181 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand 14 states. [2018-11-07 05:05:41,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:41,931 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2018-11-07 05:05:41,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 05:05:41,931 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-11-07 05:05:41,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:41,933 INFO L225 Difference]: With dead ends: 83 [2018-11-07 05:05:41,933 INFO L226 Difference]: Without dead ends: 81 [2018-11-07 05:05:41,934 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2018-11-07 05:05:41,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-07 05:05:41,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2018-11-07 05:05:41,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-07 05:05:41,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2018-11-07 05:05:41,952 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 34 [2018-11-07 05:05:41,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:41,953 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2018-11-07 05:05:41,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 05:05:41,953 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2018-11-07 05:05:41,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-07 05:05:41,955 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:41,955 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 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] [2018-11-07 05:05:41,956 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:41,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:41,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1684026049, now seen corresponding path program 1 times [2018-11-07 05:05:41,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:41,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:41,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:05:41,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:41,958 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:42,209 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 17 proven. 28 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 05:05:42,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:42,209 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:05:42,210 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-11-07 05:05:42,210 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [13], [19], [23], [27], [29], [34], [39], [42], [44], [59], [62], [64], [67], [69], [70], [71], [72], [74], [75], [76], [77], [78], [79], [80], [81] [2018-11-07 05:05:42,212 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 05:05:42,212 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 05:05:42,378 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 05:05:42,378 INFO L272 AbstractInterpreter]: Visited 27 different actions 249 times. Merged at 10 different actions 70 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 10 variables. [2018-11-07 05:05:42,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:42,410 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 05:05:42,471 INFO L227 lantSequenceWeakener]: Weakened 28 states. On average, predicates are now at 68.81% of their original sizes. [2018-11-07 05:05:42,471 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 05:05:43,073 INFO L415 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2018-11-07 05:05:43,074 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 05:05:43,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 05:05:43,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [8] total 25 [2018-11-07 05:05:43,075 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:05:43,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 05:05:43,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 05:05:43,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-11-07 05:05:43,076 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand 19 states. [2018-11-07 05:05:46,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:46,375 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2018-11-07 05:05:46,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 05:05:46,376 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2018-11-07 05:05:46,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:46,381 INFO L225 Difference]: With dead ends: 86 [2018-11-07 05:05:46,382 INFO L226 Difference]: Without dead ends: 82 [2018-11-07 05:05:46,382 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2018-11-07 05:05:46,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-07 05:05:46,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-11-07 05:05:46,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-07 05:05:46,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2018-11-07 05:05:46,412 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 55 [2018-11-07 05:05:46,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:46,412 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2018-11-07 05:05:46,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 05:05:46,412 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2018-11-07 05:05:46,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-07 05:05:46,418 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:46,418 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 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] [2018-11-07 05:05:46,418 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:46,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:46,418 INFO L82 PathProgramCache]: Analyzing trace with hash -2058374368, now seen corresponding path program 1 times [2018-11-07 05:05:46,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:46,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:46,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:05:46,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:46,423 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:46,944 WARN L179 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2018-11-07 05:05:47,096 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 05:05:48,251 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 24 proven. 23 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-11-07 05:05:48,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:48,251 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:05:48,252 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2018-11-07 05:05:48,252 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [13], [19], [23], [27], [29], [32], [34], [39], [42], [44], [52], [59], [62], [64], [67], [69], [70], [71], [72], [74], [75], [76], [77], [78], [79], [80], [81], [82], [83], [84], [85], [86], [87], [88] [2018-11-07 05:05:48,255 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 05:05:48,255 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 05:05:48,433 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 05:05:48,433 INFO L272 AbstractInterpreter]: Visited 36 different actions 449 times. Merged at 15 different actions 105 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 11 variables. [2018-11-07 05:05:48,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:48,463 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 05:05:48,511 INFO L227 lantSequenceWeakener]: Weakened 36 states. On average, predicates are now at 66.39% of their original sizes. [2018-11-07 05:05:48,512 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 05:05:50,614 INFO L415 sIntCurrentIteration]: We unified 57 AI predicates to 57 [2018-11-07 05:05:50,614 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 05:05:50,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 05:05:50,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [11] total 25 [2018-11-07 05:05:50,614 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:05:50,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 05:05:50,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 05:05:50,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-11-07 05:05:50,616 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 16 states. [2018-11-07 05:05:52,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:52,985 INFO L93 Difference]: Finished difference Result 115 states and 129 transitions. [2018-11-07 05:05:52,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 05:05:52,986 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2018-11-07 05:05:52,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:52,988 INFO L225 Difference]: With dead ends: 115 [2018-11-07 05:05:52,989 INFO L226 Difference]: Without dead ends: 102 [2018-11-07 05:05:52,989 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-11-07 05:05:52,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-07 05:05:53,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-11-07 05:05:53,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-07 05:05:53,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2018-11-07 05:05:53,019 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 58 [2018-11-07 05:05:53,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:53,019 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2018-11-07 05:05:53,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 05:05:53,020 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2018-11-07 05:05:53,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-07 05:05:53,022 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:53,022 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 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] [2018-11-07 05:05:53,022 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:53,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:53,023 INFO L82 PathProgramCache]: Analyzing trace with hash -2122664945, now seen corresponding path program 2 times [2018-11-07 05:05:53,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:53,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:53,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:05:53,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:53,024 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:53,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:53,314 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 44 proven. 48 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2018-11-07 05:05:53,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:53,315 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:05:53,315 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:05:53,317 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:05:53,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:53,317 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:05:53,332 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:05:53,332 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:05:53,376 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-07 05:05:53,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:05:53,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:05:53,906 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-07 05:05:54,376 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-11-07 05:05:54,444 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 68 proven. 20 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2018-11-07 05:05:54,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:05:55,017 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 68 proven. 20 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2018-11-07 05:05:55,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:05:55,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 21 [2018-11-07 05:05:55,049 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:05:55,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 05:05:55,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 05:05:55,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2018-11-07 05:05:55,051 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand 17 states. [2018-11-07 05:05:56,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:56,168 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2018-11-07 05:05:56,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 05:05:56,169 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 84 [2018-11-07 05:05:56,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:56,169 INFO L225 Difference]: With dead ends: 104 [2018-11-07 05:05:56,170 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 05:05:56,171 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 157 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=162, Invalid=708, Unknown=0, NotChecked=0, Total=870 [2018-11-07 05:05:56,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 05:05:56,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 05:05:56,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 05:05:56,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 05:05:56,172 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 84 [2018-11-07 05:05:56,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:56,172 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 05:05:56,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 05:05:56,173 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 05:05:56,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 05:05:56,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 05:05:56,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 05:05:56,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 05:05:58,621 WARN L179 SmtUtils]: Spent 1.91 s on a formula simplification. DAG size of input: 159 DAG size of output: 30 [2018-11-07 05:05:58,959 WARN L179 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 31 [2018-11-07 05:05:59,906 WARN L179 SmtUtils]: Spent 945.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 33 [2018-11-07 05:06:00,229 WARN L179 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 37 [2018-11-07 05:06:02,275 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 183 DAG size of output: 33 [2018-11-07 05:06:02,999 WARN L179 SmtUtils]: Spent 718.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 37 [2018-11-07 05:06:03,338 WARN L179 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 31 [2018-11-07 05:06:03,490 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 22 [2018-11-07 05:06:03,644 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 22 [2018-11-07 05:06:03,647 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-07 05:06:03,647 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 05:06:03,648 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 05:06:03,648 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-07 05:06:03,648 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 05:06:03,648 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 05:06:03,648 INFO L421 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (let ((.cse3 (+ main_~buflim~0 2))) (let ((.cse0 (<= main_~bufferlen~0 .cse3)) (.cse2 (<= (+ main_~buflim~0 3) main_~inlen~0)) (.cse1 (<= .cse3 main_~bufferlen~0))) (or (and .cse0 (= main_~buf~0 0) (= main_~in~0 0) .cse1 .cse2 (<= 1 (+ main_~in~0 main_~buflim~0)) (<= main_~inlen~0 (+ main_~buf~0 2147483647))) (and (<= main_~in~0 main_~buf~0) .cse0 (<= (+ main_~buf~0 3) main_~bufferlen~0) (<= main_~buf~0 main_~in~0) .cse2 .cse1 (<= 2 (* 2 main_~in~0)) (<= (* 2 main_~inlen~0) 4294967294))))) [2018-11-07 05:06:03,649 INFO L421 ceAbstractionStarter]: At program point L27-1(line 27) the Hoare annotation is: (let ((.cse3 (+ main_~buflim~0 2))) (let ((.cse0 (<= main_~bufferlen~0 .cse3)) (.cse2 (<= (+ main_~buflim~0 3) main_~inlen~0)) (.cse1 (<= .cse3 main_~bufferlen~0))) (or (and .cse0 (= main_~buf~0 0) (= main_~in~0 0) .cse1 .cse2 (<= 1 (+ main_~in~0 main_~buflim~0)) (<= main_~inlen~0 (+ main_~buf~0 2147483647))) (and (<= main_~in~0 main_~buf~0) .cse0 (<= (+ main_~buf~0 3) main_~bufferlen~0) (<= main_~buf~0 main_~in~0) .cse2 .cse1 (<= 2 (* 2 main_~in~0)) (<= (* 2 main_~inlen~0) 4294967294))))) [2018-11-07 05:06:03,649 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 42) no Hoare annotation was computed. [2018-11-07 05:06:03,649 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 23 34) no Hoare annotation was computed. [2018-11-07 05:06:03,649 INFO L425 ceAbstractionStarter]: For program point L23-2(lines 23 34) no Hoare annotation was computed. [2018-11-07 05:06:03,649 INFO L425 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-11-07 05:06:03,649 INFO L421 ceAbstractionStarter]: At program point L23-4(lines 23 34) the Hoare annotation is: (let ((.cse0 (* 2 main_~inlen~0)) (.cse5 (+ main_~buflim~0 2))) (let ((.cse1 (<= main_~bufferlen~0 .cse5)) (.cse2 (<= .cse5 main_~bufferlen~0)) (.cse3 (<= .cse0 4294967294)) (.cse4 (<= (+ main_~buf~0 2) main_~bufferlen~0))) (or (and (<= 2 .cse0) .cse1 (= main_~in~0 0) .cse2 .cse3 .cse4 (= main_~buf~0 0) (<= (+ main_~in~0 main_~buflim~0) 2147483644)) (and (<= main_~in~0 main_~buf~0) .cse1 (<= main_~buf~0 main_~in~0) (<= (+ main_~buflim~0 3) main_~inlen~0) .cse2 (<= 2 (* 2 main_~in~0)) .cse3 .cse4)))) [2018-11-07 05:06:03,649 INFO L425 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-11-07 05:06:03,650 INFO L421 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: (let ((.cse0 (+ main_~buflim~0 2))) (and (<= (* 2 main_~inlen~0) 4294967294) (<= main_~in~0 main_~buf~0) (<= main_~bufferlen~0 .cse0) (<= main_~buf~0 main_~in~0) (<= (+ main_~buflim~0 3) main_~inlen~0) (<= .cse0 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 2 (* 2 main_~in~0)))) [2018-11-07 05:06:03,650 INFO L421 ceAbstractionStarter]: At program point L32-1(line 32) the Hoare annotation is: (let ((.cse0 (+ main_~buflim~0 2))) (and (<= (* 2 main_~inlen~0) 4294967294) (<= main_~in~0 main_~buf~0) (<= main_~bufferlen~0 .cse0) (<= main_~buf~0 main_~in~0) (<= (+ main_~buflim~0 3) main_~inlen~0) (<= .cse0 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 2 (* 2 main_~in~0)))) [2018-11-07 05:06:03,650 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-07 05:06:03,650 INFO L428 ceAbstractionStarter]: At program point L41(lines 11 42) the Hoare annotation is: true [2018-11-07 05:06:03,650 INFO L421 ceAbstractionStarter]: At program point L33(lines 23 34) the Hoare annotation is: (let ((.cse4 (+ main_~buflim~0 2))) (let ((.cse0 (<= main_~bufferlen~0 .cse4)) (.cse1 (<= (+ main_~buflim~0 3) main_~inlen~0)) (.cse2 (<= .cse4 main_~bufferlen~0)) (.cse3 (<= (+ main_~buf~0 2) main_~bufferlen~0))) (or (and .cse0 (= main_~buf~0 0) (= main_~in~0 0) .cse1 .cse2 (<= main_~inlen~0 (+ main_~buf~0 2147483647)) .cse3) (and (<= main_~in~0 main_~buf~0) .cse0 (<= main_~buf~0 main_~in~0) .cse1 .cse2 (<= 2 (* 2 main_~in~0)) (<= (* 2 main_~inlen~0) 4294967294) .cse3)))) [2018-11-07 05:06:03,650 INFO L425 ceAbstractionStarter]: For program point L25(lines 25 26) no Hoare annotation was computed. [2018-11-07 05:06:03,651 INFO L425 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-11-07 05:06:03,651 INFO L425 ceAbstractionStarter]: For program point L17-1(lines 11 42) no Hoare annotation was computed. [2018-11-07 05:06:03,651 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 42) no Hoare annotation was computed. [2018-11-07 05:06:03,651 INFO L421 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (let ((.cse0 (* 2 main_~inlen~0)) (.cse8 (* 2 main_~in~0))) (let ((.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0)) (.cse4 (<= 2 .cse8)) (.cse5 (<= .cse8 4294967288)) (.cse1 (<= .cse0 4294967294)) (.cse6 (<= (+ main_~buf~0 1) main_~bufferlen~0))) (or (let ((.cse2 (+ main_~buf~0 main_~bufferlen~0))) (and (<= 2 .cse0) (= main_~buf~0 1) .cse1 (<= 3 .cse2) (<= .cse2 2147483647))) (and .cse3 .cse4 .cse5 .cse1 .cse6 (<= 2 (* 2 main_~buf~0))) (let ((.cse7 (+ main_~buflim~0 2))) (and .cse3 (<= .cse7 main_~bufferlen~0) .cse4 .cse5 .cse1 .cse6 (<= main_~bufferlen~0 .cse7) (<= 0 main_~buf~0) (<= 2 main_~bufferlen~0)))))) [2018-11-07 05:06:03,652 INFO L421 ceAbstractionStarter]: At program point L38-1(line 38) the Hoare annotation is: (let ((.cse0 (* 2 main_~inlen~0)) (.cse8 (* 2 main_~in~0))) (let ((.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0)) (.cse4 (<= 2 .cse8)) (.cse5 (<= .cse8 4294967288)) (.cse1 (<= .cse0 4294967294)) (.cse6 (<= (+ main_~buf~0 1) main_~bufferlen~0))) (or (let ((.cse2 (+ main_~buf~0 main_~bufferlen~0))) (and (<= 2 .cse0) (= main_~buf~0 1) .cse1 (<= 3 .cse2) (<= .cse2 2147483647))) (and .cse3 .cse4 .cse5 .cse1 .cse6 (<= 2 (* 2 main_~buf~0))) (let ((.cse7 (+ main_~buflim~0 2))) (and .cse3 (<= .cse7 main_~bufferlen~0) .cse4 .cse5 .cse1 .cse6 (<= main_~bufferlen~0 .cse7) (<= 0 main_~buf~0) (<= 2 main_~bufferlen~0)))))) [2018-11-07 05:06:03,652 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2018-11-07 05:06:03,652 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 42) the Hoare annotation is: true [2018-11-07 05:06:03,652 INFO L425 ceAbstractionStarter]: For program point L18(lines 11 42) no Hoare annotation was computed. [2018-11-07 05:06:03,652 INFO L425 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-11-07 05:06:03,652 INFO L421 ceAbstractionStarter]: At program point L35(line 35) the Hoare annotation is: (let ((.cse0 (* 2 main_~inlen~0)) (.cse5 (+ main_~buflim~0 2))) (let ((.cse1 (<= main_~bufferlen~0 .cse5)) (.cse2 (<= .cse5 main_~bufferlen~0)) (.cse3 (<= .cse0 4294967294)) (.cse4 (<= (+ main_~buf~0 2) main_~bufferlen~0))) (or (and (<= 2 .cse0) .cse1 (= main_~in~0 0) .cse2 .cse3 .cse4 (= main_~buf~0 0) (<= (+ main_~in~0 main_~buflim~0) 2147483644)) (and (<= main_~in~0 main_~buf~0) .cse1 (<= main_~buf~0 main_~in~0) (<= (+ main_~buflim~0 3) main_~inlen~0) .cse2 (<= 2 (* 2 main_~in~0)) .cse3 .cse4)))) [2018-11-07 05:06:03,652 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-07 05:06:03,652 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-07 05:06:03,653 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-07 05:06:03,653 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-07 05:06:03,653 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-07 05:06:03,653 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-07 05:06:03,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:06:03 BoogieIcfgContainer [2018-11-07 05:06:03,665 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 05:06:03,666 INFO L168 Benchmark]: Toolchain (without parser) took 32349.82 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -900.0 MB). Peak memory consumption was 858.1 MB. Max. memory is 7.1 GB. [2018-11-07 05:06:03,667 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 05:06:03,668 INFO L168 Benchmark]: CACSL2BoogieTranslator took 284.75 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2018-11-07 05:06:03,668 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.92 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 05:06:03,669 INFO L168 Benchmark]: Boogie Preprocessor took 25.82 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 05:06:03,670 INFO L168 Benchmark]: RCFGBuilder took 697.52 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -802.1 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2018-11-07 05:06:03,671 INFO L168 Benchmark]: TraceAbstraction took 31310.02 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 342.9 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -111.1 MB). Peak memory consumption was 904.1 MB. Max. memory is 7.1 GB. [2018-11-07 05:06:03,675 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 284.75 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 24.92 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.82 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 697.52 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -802.1 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 31310.02 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 342.9 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -111.1 MB). Peak memory consumption was 904.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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: 23]: Loop Invariant Derived loop invariant: ((((((bufferlen <= buflim + 2 && buf == 0) && in == 0) && buflim + 3 <= inlen) && buflim + 2 <= bufferlen) && inlen <= buf + 2147483647) && buf + 2 <= bufferlen) || (((((((in <= buf && bufferlen <= buflim + 2) && buf <= in) && buflim + 3 <= inlen) && buflim + 2 <= bufferlen) && 2 <= 2 * in) && 2 * inlen <= 4294967294) && buf + 2 <= bufferlen) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 36 locations, 1 error locations. SAFE Result, 31.2s OverallTime, 9 OverallIterations, 12 TraceHistogramMax, 12.5s AutomataDifference, 0.0s DeadEndRemovalTime, 7.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 314 SDtfs, 539 SDslu, 1305 SDs, 0 SdLazy, 606 SolverSat, 585 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 12 DeclaredPredicates, 459 GetRequests, 318 SyntacticMatches, 6 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 7.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.7s AbstIntTime, 6 AbstIntIterations, 6 AbstIntStrong, 0.9108223490510488 AbsIntWeakeningRatio, 0.5201793721973094 AbsIntAvgWeakeningVarsNumRemoved, 10.506726457399104 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 28 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 50 PreInvPairs, 83 NumberOfFragments, 636 HoareAnnotationTreeSize, 50 FomulaSimplifications, 9449 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 15 FomulaSimplificationsInter, 3955 FormulaSimplificationTreeSizeReductionInter, 6.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 427 NumberOfCodeBlocks, 410 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 500 ConstructedInterpolants, 0 QuantifiedInterpolants, 141603 SizeOfPredicates, 8 NumberOfNonLiveVariables, 129 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 844/1002 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...