java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 09:12:53,513 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 09:12:53,515 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 09:12:53,527 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 09:12:53,527 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 09:12:53,528 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 09:12:53,530 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 09:12:53,532 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 09:12:53,533 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 09:12:53,534 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 09:12:53,535 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 09:12:53,536 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 09:12:53,537 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 09:12:53,538 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 09:12:53,539 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 09:12:53,540 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 09:12:53,541 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 09:12:53,543 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 09:12:53,545 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 09:12:53,546 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 09:12:53,548 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 09:12:53,549 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 09:12:53,551 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 09:12:53,554 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 09:12:53,554 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 09:12:53,557 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 09:12:53,558 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 09:12:53,559 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 09:12:53,563 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 09:12:53,564 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 09:12:53,564 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 09:12:53,565 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 09:12:53,565 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 09:12:53,565 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 09:12:53,568 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 09:12:53,568 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 09:12:53,569 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-27 09:12:53,602 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 09:12:53,602 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 09:12:53,603 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 09:12:53,603 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 09:12:53,603 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 09:12:53,603 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 09:12:53,604 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-27 09:12:53,604 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 09:12:53,604 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-27 09:12:53,604 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 09:12:53,605 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 09:12:53,605 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 09:12:53,605 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 09:12:53,605 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 09:12:53,606 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 09:12:53,606 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 09:12:53,606 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 09:12:53,607 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 09:12:53,608 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 09:12:53,608 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 09:12:53,608 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 09:12:53,608 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 09:12:53,609 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 09:12:53,609 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 09:12:53,609 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 09:12:53,609 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 09:12:53,609 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 09:12:53,610 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 09:12:53,610 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 09:12:53,610 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 09:12:53,611 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 09:12:53,611 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 09:12:53,611 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 09:12:53,611 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 09:12:53,611 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 09:12:53,611 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 09:12:53,680 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 09:12:53,698 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 09:12:53,702 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 09:12:53,704 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 09:12:53,704 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 09:12:53,706 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i [2018-10-27 09:12:53,769 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/5694ffa61/734a223373014dd5aece6ca258d6b3f4/FLAG3fc042d80 [2018-10-27 09:12:54,243 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 09:12:54,245 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i [2018-10-27 09:12:54,252 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/5694ffa61/734a223373014dd5aece6ca258d6b3f4/FLAG3fc042d80 [2018-10-27 09:12:54,271 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/5694ffa61/734a223373014dd5aece6ca258d6b3f4 [2018-10-27 09:12:54,283 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 09:12:54,285 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 09:12:54,286 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 09:12:54,286 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 09:12:54,291 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 09:12:54,292 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 09:12:54" (1/1) ... [2018-10-27 09:12:54,295 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34c07b72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:12:54, skipping insertion in model container [2018-10-27 09:12:54,295 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 09:12:54" (1/1) ... [2018-10-27 09:12:54,305 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 09:12:54,327 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 09:12:54,511 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 09:12:54,515 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 09:12:54,535 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 09:12:54,551 INFO L193 MainTranslator]: Completed translation [2018-10-27 09:12:54,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:12:54 WrapperNode [2018-10-27 09:12:54,552 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 09:12:54,552 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 09:12:54,553 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 09:12:54,553 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 09:12:54,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:12:54" (1/1) ... [2018-10-27 09:12:54,569 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:12:54" (1/1) ... [2018-10-27 09:12:54,575 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 09:12:54,576 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 09:12:54,577 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 09:12:54,577 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 09:12:54,587 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:12:54" (1/1) ... [2018-10-27 09:12:54,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:12:54" (1/1) ... [2018-10-27 09:12:54,588 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:12:54" (1/1) ... [2018-10-27 09:12:54,588 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:12:54" (1/1) ... [2018-10-27 09:12:54,592 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:12:54" (1/1) ... [2018-10-27 09:12:54,603 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:12:54" (1/1) ... [2018-10-27 09:12:54,606 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:12:54" (1/1) ... [2018-10-27 09:12:54,608 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 09:12:54,608 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 09:12:54,609 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 09:12:54,610 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 09:12:54,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:12:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 09:12:54,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 09:12:54,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 09:12:54,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 09:12:54,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 09:12:54,734 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 09:12:54,734 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 09:12:54,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-27 09:12:54,734 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-27 09:12:55,147 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 09:12:55,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 09:12:55 BoogieIcfgContainer [2018-10-27 09:12:55,148 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 09:12:55,149 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 09:12:55,150 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 09:12:55,153 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 09:12:55,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 09:12:54" (1/3) ... [2018-10-27 09:12:55,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@668fdb2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 09:12:55, skipping insertion in model container [2018-10-27 09:12:55,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:12:54" (2/3) ... [2018-10-27 09:12:55,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@668fdb2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 09:12:55, skipping insertion in model container [2018-10-27 09:12:55,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 09:12:55" (3/3) ... [2018-10-27 09:12:55,157 INFO L112 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle_true-unreach-call_true-termination.i [2018-10-27 09:12:55,167 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 09:12:55,176 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 09:12:55,194 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 09:12:55,230 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 09:12:55,230 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 09:12:55,230 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 09:12:55,230 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 09:12:55,231 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 09:12:55,231 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 09:12:55,231 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 09:12:55,231 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 09:12:55,251 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-10-27 09:12:55,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-27 09:12:55,258 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:12:55,259 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:12:55,262 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:12:55,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:12:55,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1538012201, now seen corresponding path program 1 times [2018-10-27 09:12:55,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:12:55,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:12:55,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:12:55,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:12:55,328 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:12:55,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:12:55,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:12:55,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 09:12:55,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 09:12:55,403 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:12:55,408 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-27 09:12:55,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 09:12:55,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 09:12:55,422 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-10-27 09:12:55,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:12:55,450 INFO L93 Difference]: Finished difference Result 63 states and 94 transitions. [2018-10-27 09:12:55,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 09:12:55,451 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-10-27 09:12:55,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:12:55,461 INFO L225 Difference]: With dead ends: 63 [2018-10-27 09:12:55,461 INFO L226 Difference]: Without dead ends: 30 [2018-10-27 09:12:55,465 INFO L605 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-10-27 09:12:55,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-27 09:12:55,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-10-27 09:12:55,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-27 09:12:55,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2018-10-27 09:12:55,516 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 14 [2018-10-27 09:12:55,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:12:55,517 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2018-10-27 09:12:55,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-27 09:12:55,517 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2018-10-27 09:12:55,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-27 09:12:55,519 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:12:55,519 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:12:55,520 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:12:55,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:12:55,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1856547447, now seen corresponding path program 1 times [2018-10-27 09:12:55,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:12:55,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:12:55,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:12:55,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:12:55,522 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:12:55,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:12:55,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:12:55,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 09:12:55,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 09:12:55,810 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:12:55,811 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 09:12:55,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 09:12:55,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 09:12:55,813 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand 5 states. [2018-10-27 09:12:56,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:12:56,110 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-10-27 09:12:56,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 09:12:56,110 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-10-27 09:12:56,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:12:56,112 INFO L225 Difference]: With dead ends: 36 [2018-10-27 09:12:56,112 INFO L226 Difference]: Without dead ends: 34 [2018-10-27 09:12:56,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-27 09:12:56,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-27 09:12:56,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-10-27 09:12:56,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-27 09:12:56,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2018-10-27 09:12:56,125 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 16 [2018-10-27 09:12:56,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:12:56,125 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2018-10-27 09:12:56,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 09:12:56,125 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2018-10-27 09:12:56,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-27 09:12:56,126 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:12:56,127 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-10-27 09:12:56,127 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:12:56,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:12:56,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1929535109, now seen corresponding path program 1 times [2018-10-27 09:12:56,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:12:56,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:12:56,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:12:56,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:12:56,129 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:12:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:12:56,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:12:56,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:12:56,499 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:12:56,503 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-10-27 09:12:56,505 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [13], [19], [23], [27], [29], [32], [59], [62], [64], [67], [69], [70], [71], [72], [82], [83], [84] [2018-10-27 09:12:56,535 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:12:56,535 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:12:56,650 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 09:12:56,652 INFO L272 AbstractInterpreter]: Visited 20 different actions 25 times. Never merged. Never widened. Never found a fixpoint. Largest state had 8 variables. [2018-10-27 09:12:56,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:12:56,666 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 09:12:56,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:12:56,666 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:12:56,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:12:56,678 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:12:56,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:12:56,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:12:56,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:12:56,833 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:12:56,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:12:56,942 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 09:12:56,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [8] total 13 [2018-10-27 09:12:56,942 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:12:56,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 09:12:56,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 09:12:56,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-10-27 09:12:56,944 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand 6 states. [2018-10-27 09:12:57,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:12:57,270 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2018-10-27 09:12:57,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 09:12:57,271 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-10-27 09:12:57,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:12:57,272 INFO L225 Difference]: With dead ends: 50 [2018-10-27 09:12:57,273 INFO L226 Difference]: Without dead ends: 48 [2018-10-27 09:12:57,273 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-10-27 09:12:57,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-27 09:12:57,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-10-27 09:12:57,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-27 09:12:57,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2018-10-27 09:12:57,285 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 21 [2018-10-27 09:12:57,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:12:57,286 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2018-10-27 09:12:57,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 09:12:57,286 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2018-10-27 09:12:57,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-27 09:12:57,288 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:12:57,288 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-10-27 09:12:57,289 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:12:57,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:12:57,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1060690802, now seen corresponding path program 1 times [2018-10-27 09:12:57,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:12:57,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:12:57,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:12:57,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:12:57,291 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:12:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:12:57,547 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 09:12:57,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:12:57,548 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:12:57,548 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-10-27 09:12:57,549 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-10-27 09:12:57,550 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:12:57,551 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:12:57,591 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 09:12:57,591 INFO L272 AbstractInterpreter]: Visited 25 different actions 35 times. Never merged. Never widened. Never found a fixpoint. Largest state had 10 variables. [2018-10-27 09:12:57,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:12:57,630 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 09:12:57,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:12:57,630 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:12:57,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:12:57,659 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:12:57,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:12:57,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:12:57,873 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 09:12:57,874 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:12:57,955 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 09:12:57,978 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 09:12:57,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [8] total 11 [2018-10-27 09:12:57,978 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:12:57,979 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 09:12:57,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 09:12:57,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-10-27 09:12:57,979 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand 6 states. [2018-10-27 09:12:58,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:12:58,137 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2018-10-27 09:12:58,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 09:12:58,138 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-10-27 09:12:58,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:12:58,140 INFO L225 Difference]: With dead ends: 57 [2018-10-27 09:12:58,140 INFO L226 Difference]: Without dead ends: 55 [2018-10-27 09:12:58,141 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-10-27 09:12:58,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-27 09:12:58,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2018-10-27 09:12:58,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-27 09:12:58,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2018-10-27 09:12:58,153 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 29 [2018-10-27 09:12:58,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:12:58,153 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2018-10-27 09:12:58,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 09:12:58,153 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2018-10-27 09:12:58,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-27 09:12:58,155 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:12:58,155 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-10-27 09:12:58,155 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:12:58,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:12:58,156 INFO L82 PathProgramCache]: Analyzing trace with hash 578348401, now seen corresponding path program 1 times [2018-10-27 09:12:58,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:12:58,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:12:58,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:12:58,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:12:58,157 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:12:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:12:58,321 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 09:12:58,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:12:58,322 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:12:58,322 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-10-27 09:12:58,323 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-10-27 09:12:58,324 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:12:58,325 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:12:58,356 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 09:12:58,357 INFO L272 AbstractInterpreter]: Visited 25 different actions 40 times. Never merged. Never widened. Never found a fixpoint. Largest state had 9 variables. [2018-10-27 09:12:58,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:12:58,378 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 09:12:58,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:12:58,379 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:12:58,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:12:58,391 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:12:58,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:12:58,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:12:58,562 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-27 09:12:58,562 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:12:58,667 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-27 09:12:58,689 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 09:12:58,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [9] total 13 [2018-10-27 09:12:58,689 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:12:58,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 09:12:58,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 09:12:58,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-10-27 09:12:58,691 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand 7 states. [2018-10-27 09:12:58,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:12:58,978 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2018-10-27 09:12:58,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 09:12:58,979 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-10-27 09:12:58,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:12:58,983 INFO L225 Difference]: With dead ends: 73 [2018-10-27 09:12:58,983 INFO L226 Difference]: Without dead ends: 66 [2018-10-27 09:12:58,987 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-10-27 09:12:58,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-27 09:12:58,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-10-27 09:12:58,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-27 09:12:58,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 78 transitions. [2018-10-27 09:12:58,999 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 78 transitions. Word has length 32 [2018-10-27 09:12:58,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:12:59,000 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 78 transitions. [2018-10-27 09:12:59,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 09:12:59,000 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2018-10-27 09:12:59,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-27 09:12:59,001 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:12:59,001 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-10-27 09:12:59,002 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:12:59,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:12:59,002 INFO L82 PathProgramCache]: Analyzing trace with hash 434465614, now seen corresponding path program 1 times [2018-10-27 09:12:59,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:12:59,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:12:59,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:12:59,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:12:59,004 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:12:59,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:12:59,172 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 09:12:59,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:12:59,172 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:12:59,172 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-10-27 09:12:59,173 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-10-27 09:12:59,174 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:12:59,174 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:12:59,209 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 09:12:59,209 INFO L272 AbstractInterpreter]: Visited 27 different actions 42 times. Never merged. Never widened. Never found a fixpoint. Largest state had 10 variables. [2018-10-27 09:12:59,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:12:59,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 09:12:59,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:12:59,221 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:12:59,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:12:59,230 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:12:59,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:12:59,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:12:59,350 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-27 09:12:59,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:12:59,438 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-27 09:12:59,459 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 09:12:59,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [10] total 17 [2018-10-27 09:12:59,459 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:12:59,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 09:12:59,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 09:12:59,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-10-27 09:12:59,461 INFO L87 Difference]: Start difference. First operand 64 states and 78 transitions. Second operand 8 states. [2018-10-27 09:12:59,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:12:59,678 INFO L93 Difference]: Finished difference Result 75 states and 89 transitions. [2018-10-27 09:12:59,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 09:12:59,679 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-10-27 09:12:59,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:12:59,680 INFO L225 Difference]: With dead ends: 75 [2018-10-27 09:12:59,680 INFO L226 Difference]: Without dead ends: 73 [2018-10-27 09:12:59,681 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2018-10-27 09:12:59,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-27 09:12:59,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2018-10-27 09:12:59,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-27 09:12:59,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2018-10-27 09:12:59,694 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 34 [2018-10-27 09:12:59,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:12:59,694 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2018-10-27 09:12:59,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 09:12:59,695 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2018-10-27 09:12:59,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-27 09:12:59,697 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:12:59,697 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-10-27 09:12:59,697 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:12:59,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:12:59,698 INFO L82 PathProgramCache]: Analyzing trace with hash -2058374368, now seen corresponding path program 1 times [2018-10-27 09:12:59,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:12:59,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:12:59,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:12:59,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:12:59,699 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:12:59,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:12:59,943 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 24 proven. 23 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-10-27 09:12:59,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:12:59,944 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:12:59,944 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2018-10-27 09:12:59,944 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-10-27 09:12:59,946 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:12:59,947 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:13:00,115 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 09:13:00,115 INFO L272 AbstractInterpreter]: Visited 37 different actions 198 times. Merged at 15 different actions 30 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 11 variables. [2018-10-27 09:13:00,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:13:00,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 09:13:00,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:13:00,137 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:13:00,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:13:00,148 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:13:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:13:00,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:13:00,691 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 13 proven. 22 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-10-27 09:13:00,691 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:13:00,956 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 13 proven. 22 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-10-27 09:13:00,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:13:00,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2018-10-27 09:13:00,979 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:13:00,979 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-27 09:13:00,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-27 09:13:00,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2018-10-27 09:13:00,982 INFO L87 Difference]: Start difference. First operand 68 states and 81 transitions. Second operand 18 states. [2018-10-27 09:13:02,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:13:02,212 INFO L93 Difference]: Finished difference Result 108 states and 137 transitions. [2018-10-27 09:13:02,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 09:13:02,212 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 58 [2018-10-27 09:13:02,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:13:02,218 INFO L225 Difference]: With dead ends: 108 [2018-10-27 09:13:02,218 INFO L226 Difference]: Without dead ends: 96 [2018-10-27 09:13:02,219 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 103 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=162, Invalid=650, Unknown=0, NotChecked=0, Total=812 [2018-10-27 09:13:02,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-10-27 09:13:02,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-10-27 09:13:02,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-10-27 09:13:02,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 115 transitions. [2018-10-27 09:13:02,236 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 115 transitions. Word has length 58 [2018-10-27 09:13:02,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:13:02,236 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 115 transitions. [2018-10-27 09:13:02,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-27 09:13:02,236 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 115 transitions. [2018-10-27 09:13:02,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-27 09:13:02,238 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:13:02,239 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 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] [2018-10-27 09:13:02,239 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:13:02,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:13:02,239 INFO L82 PathProgramCache]: Analyzing trace with hash 574589245, now seen corresponding path program 1 times [2018-10-27 09:13:02,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:13:02,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:13:02,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:13:02,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:13:02,241 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:13:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:13:02,386 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 13 proven. 29 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-10-27 09:13:02,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:13:02,387 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:13:02,387 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2018-10-27 09:13:02,387 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-10-27 09:13:02,389 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:13:02,389 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:13:02,446 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 09:13:02,446 INFO L272 AbstractInterpreter]: Visited 28 different actions 111 times. Merged at 10 different actions 20 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 10 variables. [2018-10-27 09:13:02,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:13:02,457 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 09:13:02,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:13:02,457 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:13:02,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:13:02,465 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:13:02,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:13:02,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:13:02,894 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-10-27 09:13:02,895 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:13:03,018 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-10-27 09:13:03,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:13:03,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 16 [2018-10-27 09:13:03,039 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:13:03,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-27 09:13:03,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-27 09:13:03,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-10-27 09:13:03,040 INFO L87 Difference]: Start difference. First operand 96 states and 115 transitions. Second operand 16 states. [2018-10-27 09:13:03,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:13:03,644 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2018-10-27 09:13:03,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 09:13:03,644 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 60 [2018-10-27 09:13:03,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:13:03,646 INFO L225 Difference]: With dead ends: 106 [2018-10-27 09:13:03,646 INFO L226 Difference]: Without dead ends: 104 [2018-10-27 09:13:03,647 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 110 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2018-10-27 09:13:03,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-27 09:13:03,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-10-27 09:13:03,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-27 09:13:03,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 121 transitions. [2018-10-27 09:13:03,663 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 121 transitions. Word has length 60 [2018-10-27 09:13:03,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:13:03,663 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 121 transitions. [2018-10-27 09:13:03,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-27 09:13:03,664 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 121 transitions. [2018-10-27 09:13:03,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-27 09:13:03,665 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:13:03,665 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:13:03,666 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:13:03,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:13:03,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1079113108, now seen corresponding path program 2 times [2018-10-27 09:13:03,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:13:03,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:13:03,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:13:03,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:13:03,668 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:13:03,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:13:03,859 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 44 proven. 50 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2018-10-27 09:13:03,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:13:03,860 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:13:03,860 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:13:03,861 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:13:03,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:13:03,861 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:13:03,872 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 09:13:03,872 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 09:13:03,966 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-27 09:13:03,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:13:03,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:13:04,408 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 45 proven. 37 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-10-27 09:13:04,409 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:13:05,700 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 45 proven. 37 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-10-27 09:13:05,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:13:05,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 15] total 31 [2018-10-27 09:13:05,740 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:13:05,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-27 09:13:05,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-27 09:13:05,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=789, Unknown=0, NotChecked=0, Total=930 [2018-10-27 09:13:05,741 INFO L87 Difference]: Start difference. First operand 104 states and 121 transitions. Second operand 23 states. [2018-10-27 09:13:06,748 WARN L179 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2018-10-27 09:13:07,175 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2018-10-27 09:13:08,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:13:08,357 INFO L93 Difference]: Finished difference Result 115 states and 132 transitions. [2018-10-27 09:13:08,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-27 09:13:08,358 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 86 [2018-10-27 09:13:08,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:13:08,360 INFO L225 Difference]: With dead ends: 115 [2018-10-27 09:13:08,360 INFO L226 Difference]: Without dead ends: 113 [2018-10-27 09:13:08,362 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 154 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=390, Invalid=1680, Unknown=0, NotChecked=0, Total=2070 [2018-10-27 09:13:08,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-27 09:13:08,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2018-10-27 09:13:08,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-10-27 09:13:08,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2018-10-27 09:13:08,375 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 86 [2018-10-27 09:13:08,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:13:08,376 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2018-10-27 09:13:08,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-27 09:13:08,376 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2018-10-27 09:13:08,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-27 09:13:08,378 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:13:08,378 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:13:08,379 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:13:08,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:13:08,379 INFO L82 PathProgramCache]: Analyzing trace with hash -795584450, now seen corresponding path program 2 times [2018-10-27 09:13:08,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:13:08,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:13:08,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:13:08,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:13:08,381 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:13:08,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:13:09,159 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 14 [2018-10-27 09:13:09,316 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 64 proven. 81 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2018-10-27 09:13:09,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:13:09,316 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:13:09,316 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:13:09,316 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:13:09,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:13:09,317 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:13:09,335 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 09:13:09,335 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 09:13:09,403 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-27 09:13:09,403 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:13:09,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:13:09,685 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 100 proven. 29 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2018-10-27 09:13:09,686 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:13:10,103 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 100 proven. 29 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2018-10-27 09:13:10,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:13:10,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 21 [2018-10-27 09:13:10,124 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:13:10,124 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-27 09:13:10,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-27 09:13:10,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2018-10-27 09:13:10,125 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand 17 states. [2018-10-27 09:13:10,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:13:10,740 INFO L93 Difference]: Finished difference Result 108 states and 124 transitions. [2018-10-27 09:13:10,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 09:13:10,748 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 110 [2018-10-27 09:13:10,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:13:10,749 INFO L225 Difference]: With dead ends: 108 [2018-10-27 09:13:10,749 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 09:13:10,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 209 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=162, Invalid=708, Unknown=0, NotChecked=0, Total=870 [2018-10-27 09:13:10,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 09:13:10,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 09:13:10,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 09:13:10,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 09:13:10,751 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 110 [2018-10-27 09:13:10,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:13:10,752 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 09:13:10,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-27 09:13:10,752 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 09:13:10,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 09:13:10,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-27 09:13:10,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:10,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:11,001 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2018-10-27 09:13:11,112 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2018-10-27 09:13:11,237 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 27 [2018-10-27 09:13:11,455 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 27 [2018-10-27 09:13:11,712 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-27 09:13:11,712 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-27 09:13:11,712 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-27 09:13:11,712 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-27 09:13:11,712 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-27 09:13:11,712 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-27 09:13:11,713 INFO L421 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (let ((.cse0 (< main_~bufferlen~0 main_~inlen~0)) (.cse1 (<= (+ main_~buf~0 3) main_~bufferlen~0)) (.cse2 (+ main_~buflim~0 2))) (or (and (<= 0 main_~in~0) (<= main_~in~0 0) .cse0 .cse1 (= main_~bufferlen~0 .cse2) (= main_~buf~0 0)) (and .cse0 (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= main_~bufferlen~0 .cse2) (<= 1 main_~in~0) .cse1 (<= 0 main_~buf~0) (<= .cse2 main_~bufferlen~0)))) [2018-10-27 09:13:11,713 INFO L421 ceAbstractionStarter]: At program point L27-1(line 27) the Hoare annotation is: (let ((.cse0 (< main_~bufferlen~0 main_~inlen~0)) (.cse1 (<= (+ main_~buf~0 3) main_~bufferlen~0)) (.cse2 (+ main_~buflim~0 2))) (or (and (<= 0 main_~in~0) (<= main_~in~0 0) .cse0 .cse1 (= main_~bufferlen~0 .cse2) (= main_~buf~0 0)) (and .cse0 (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= main_~bufferlen~0 .cse2) (<= 1 main_~in~0) .cse1 (<= 0 main_~buf~0) (<= .cse2 main_~bufferlen~0)))) [2018-10-27 09:13:11,713 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 42) no Hoare annotation was computed. [2018-10-27 09:13:11,713 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 23 34) no Hoare annotation was computed. [2018-10-27 09:13:11,713 INFO L425 ceAbstractionStarter]: For program point L23-2(lines 23 34) no Hoare annotation was computed. [2018-10-27 09:13:11,714 INFO L425 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-10-27 09:13:11,714 INFO L421 ceAbstractionStarter]: At program point L23-4(lines 23 34) the Hoare annotation is: (let ((.cse1 (<= 1 main_~in~0)) (.cse0 (<= 0 main_~buf~0)) (.cse2 (<= (+ main_~buf~0 2) main_~bufferlen~0))) (or (and (<= main_~buf~0 0) (<= 0 main_~in~0) .cse0 (<= 2 main_~bufferlen~0)) (and (<= main_~buf~0 2) .cse1 .cse0 (<= 3 main_~inlen~0) .cse2) (let ((.cse3 (+ main_~buflim~0 2))) (and (< main_~bufferlen~0 main_~inlen~0) (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= main_~bufferlen~0 .cse3) .cse1 .cse0 (<= .cse3 main_~bufferlen~0) .cse2)))) [2018-10-27 09:13:11,714 INFO L425 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-10-27 09:13:11,714 INFO L421 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: (let ((.cse0 (+ main_~buflim~0 2))) (and (< main_~bufferlen~0 main_~inlen~0) (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= main_~bufferlen~0 .cse0) (<= 1 main_~in~0) (<= 0 main_~buf~0) (<= .cse0 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0))) [2018-10-27 09:13:11,714 INFO L421 ceAbstractionStarter]: At program point L32-1(line 32) the Hoare annotation is: (let ((.cse0 (+ main_~buflim~0 2))) (and (< main_~bufferlen~0 main_~inlen~0) (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= main_~bufferlen~0 .cse0) (<= 1 main_~in~0) (<= 0 main_~buf~0) (<= .cse0 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0))) [2018-10-27 09:13:11,714 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-10-27 09:13:11,715 INFO L428 ceAbstractionStarter]: At program point L41(lines 11 42) the Hoare annotation is: true [2018-10-27 09:13:11,715 INFO L421 ceAbstractionStarter]: At program point L33(lines 23 34) the Hoare annotation is: (let ((.cse0 (< main_~bufferlen~0 main_~inlen~0)) (.cse1 (+ main_~buflim~0 2))) (or (and (<= 0 main_~in~0) (<= main_~in~0 0) .cse0 (= main_~bufferlen~0 .cse1) (= main_~buf~0 0) (<= 2 main_~bufferlen~0)) (and .cse0 (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= main_~bufferlen~0 .cse1) (<= 1 main_~in~0) (<= 0 main_~buf~0) (<= .cse1 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0)))) [2018-10-27 09:13:11,715 INFO L425 ceAbstractionStarter]: For program point L25(lines 25 26) no Hoare annotation was computed. [2018-10-27 09:13:11,715 INFO L425 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-10-27 09:13:11,715 INFO L425 ceAbstractionStarter]: For program point L17-1(lines 11 42) no Hoare annotation was computed. [2018-10-27 09:13:11,715 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 42) no Hoare annotation was computed. [2018-10-27 09:13:11,715 INFO L421 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (let ((.cse0 (and (<= 0 main_~in~0) (<= 0 main_~buf~0)))) (or (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (and (<= 3 main_~inlen~0) .cse0) (< 1 main_~bufferlen~0)) (and (<= main_~buf~0 1) .cse0 (<= 2 main_~bufferlen~0)))) [2018-10-27 09:13:11,715 INFO L421 ceAbstractionStarter]: At program point L38-1(line 38) the Hoare annotation is: (let ((.cse0 (and (<= 0 main_~in~0) (<= 0 main_~buf~0)))) (or (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (and (<= 3 main_~inlen~0) .cse0) (< 1 main_~bufferlen~0)) (and (<= main_~buf~0 1) .cse0 (<= 2 main_~bufferlen~0)))) [2018-10-27 09:13:11,715 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2018-10-27 09:13:11,715 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 42) the Hoare annotation is: true [2018-10-27 09:13:11,716 INFO L425 ceAbstractionStarter]: For program point L18(lines 11 42) no Hoare annotation was computed. [2018-10-27 09:13:11,716 INFO L425 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-10-27 09:13:11,716 INFO L421 ceAbstractionStarter]: At program point L35(line 35) the Hoare annotation is: (let ((.cse1 (<= 1 main_~in~0)) (.cse0 (<= 0 main_~buf~0)) (.cse2 (<= (+ main_~buf~0 2) main_~bufferlen~0))) (or (and (<= main_~buf~0 0) (<= 0 main_~in~0) .cse0 (<= 2 main_~bufferlen~0)) (and (<= main_~buf~0 2) .cse1 .cse0 (<= 3 main_~inlen~0) .cse2) (let ((.cse3 (+ main_~buflim~0 2))) (and (< main_~bufferlen~0 main_~inlen~0) (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= main_~bufferlen~0 .cse3) .cse1 .cse0 (<= .cse3 main_~bufferlen~0) .cse2)))) [2018-10-27 09:13:11,716 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-10-27 09:13:11,716 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-10-27 09:13:11,716 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-10-27 09:13:11,716 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-10-27 09:13:11,716 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-10-27 09:13:11,716 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-10-27 09:13:11,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 09:13:11 BoogieIcfgContainer [2018-10-27 09:13:11,730 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 09:13:11,731 INFO L168 Benchmark]: Toolchain (without parser) took 17447.22 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 873.5 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -344.1 MB). Peak memory consumption was 529.3 MB. Max. memory is 7.1 GB. [2018-10-27 09:13:11,732 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 09:13:11,733 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.03 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-27 09:13:11,734 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.15 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-10-27 09:13:11,734 INFO L168 Benchmark]: Boogie Preprocessor took 32.14 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-10-27 09:13:11,735 INFO L168 Benchmark]: RCFGBuilder took 540.20 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -796.9 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2018-10-27 09:13:11,736 INFO L168 Benchmark]: TraceAbstraction took 16580.71 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 134.7 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 442.2 MB). Peak memory consumption was 576.9 MB. Max. memory is 7.1 GB. [2018-10-27 09:13:11,740 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.33 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 266.03 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 23.15 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 32.14 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 540.20 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -796.9 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16580.71 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 134.7 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 442.2 MB). Peak memory consumption was 576.9 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: (((((0 <= in && in <= 0) && bufferlen < inlen) && bufferlen == buflim + 2) && buf == 0) && 2 <= bufferlen) || ((((((bufferlen < inlen && in + bufferlen + 1 <= buf + inlen) && bufferlen <= buflim + 2) && 1 <= in) && 0 <= buf) && buflim + 2 <= bufferlen) && 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, 16.4s OverallTime, 10 OverallIterations, 16 TraceHistogramMax, 6.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 368 SDtfs, 506 SDslu, 1385 SDs, 0 SdLazy, 1394 SolverSat, 544 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1002 GetRequests, 790 SyntacticMatches, 35 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1193 ImplicationChecksByTransitivity, 8.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 6 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 19 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 58 PreInvPairs, 100 NumberOfFragments, 441 HoareAnnotationTreeSize, 58 FomulaSimplifications, 806 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 15 FomulaSimplificationsInter, 1193 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 890 NumberOfCodeBlocks, 851 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1294 ConstructedInterpolants, 0 QuantifiedInterpolants, 386614 SizeOfPredicates, 37 NumberOfNonLiveVariables, 783 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 26 InterpolantComputations, 10 PerfectInterpolantSequences, 2650/3048 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...