java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/loops/n.c11_true-unreach-call_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 16:34:09,593 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 16:34:09,595 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 16:34:09,608 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 16:34:09,608 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 16:34:09,609 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 16:34:09,611 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 16:34:09,613 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 16:34:09,615 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 16:34:09,616 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 16:34:09,617 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 16:34:09,617 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 16:34:09,618 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 16:34:09,619 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 16:34:09,620 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 16:34:09,621 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 16:34:09,622 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 16:34:09,624 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 16:34:09,626 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 16:34:09,628 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 16:34:09,629 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 16:34:09,631 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 16:34:09,633 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 16:34:09,633 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 16:34:09,634 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 16:34:09,635 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 16:34:09,636 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 16:34:09,637 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 16:34:09,638 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 16:34:09,639 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 16:34:09,640 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 16:34:09,640 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 16:34:09,641 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 16:34:09,641 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 16:34:09,642 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 16:34:09,643 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 16:34:09,643 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-11-07 16:34:09,660 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 16:34:09,660 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 16:34:09,661 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 16:34:09,661 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 16:34:09,662 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 16:34:09,662 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 16:34:09,662 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 16:34:09,662 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 16:34:09,663 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 16:34:09,663 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 16:34:09,663 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 16:34:09,663 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 16:34:09,664 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 16:34:09,664 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 16:34:09,664 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 16:34:09,665 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 16:34:09,665 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 16:34:09,665 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 16:34:09,665 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 16:34:09,665 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 16:34:09,666 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 16:34:09,666 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 16:34:09,666 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 16:34:09,666 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 16:34:09,667 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 16:34:09,667 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 16:34:09,667 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 16:34:09,667 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 16:34:09,667 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 16:34:09,668 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 16:34:09,668 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 16:34:09,668 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 16:34:09,668 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 16:34:09,668 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 16:34:09,717 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 16:34:09,739 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 16:34:09,744 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 16:34:09,745 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 16:34:09,746 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 16:34:09,747 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/n.c11_true-unreach-call_false-termination.i [2018-11-07 16:34:09,819 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d745b468/f519be1c5e02436ea7f78c5788784e9e/FLAG08552719c [2018-11-07 16:34:10,309 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 16:34:10,310 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/n.c11_true-unreach-call_false-termination.i [2018-11-07 16:34:10,318 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d745b468/f519be1c5e02436ea7f78c5788784e9e/FLAG08552719c [2018-11-07 16:34:10,340 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d745b468/f519be1c5e02436ea7f78c5788784e9e [2018-11-07 16:34:10,352 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 16:34:10,353 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 16:34:10,354 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 16:34:10,354 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 16:34:10,359 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 16:34:10,360 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:34:10" (1/1) ... [2018-11-07 16:34:10,363 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f02a909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:10, skipping insertion in model container [2018-11-07 16:34:10,363 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:34:10" (1/1) ... [2018-11-07 16:34:10,375 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 16:34:10,402 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 16:34:10,613 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:34:10,618 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 16:34:10,636 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:34:10,659 INFO L193 MainTranslator]: Completed translation [2018-11-07 16:34:10,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:10 WrapperNode [2018-11-07 16:34:10,659 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 16:34:10,661 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 16:34:10,661 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 16:34:10,661 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 16:34:10,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:10" (1/1) ... [2018-11-07 16:34:10,679 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:10" (1/1) ... [2018-11-07 16:34:10,687 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 16:34:10,688 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 16:34:10,688 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 16:34:10,688 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 16:34:10,700 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:10" (1/1) ... [2018-11-07 16:34:10,700 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:10" (1/1) ... [2018-11-07 16:34:10,704 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:10" (1/1) ... [2018-11-07 16:34:10,705 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:10" (1/1) ... [2018-11-07 16:34:10,710 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:10" (1/1) ... [2018-11-07 16:34:10,718 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:10" (1/1) ... [2018-11-07 16:34:10,720 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:10" (1/1) ... [2018-11-07 16:34:10,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 16:34:10,724 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 16:34:10,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 16:34:10,725 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 16:34:10,726 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 16:34:10,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 16:34:10,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 16:34:10,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 16:34:10,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 16:34:10,897 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 16:34:10,897 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 16:34:10,898 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 16:34:10,898 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 16:34:11,135 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 16:34:11,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:34:11 BoogieIcfgContainer [2018-11-07 16:34:11,136 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 16:34:11,137 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 16:34:11,137 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 16:34:11,140 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 16:34:11,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:34:10" (1/3) ... [2018-11-07 16:34:11,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@229855ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:34:11, skipping insertion in model container [2018-11-07 16:34:11,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:10" (2/3) ... [2018-11-07 16:34:11,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@229855ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:34:11, skipping insertion in model container [2018-11-07 16:34:11,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:34:11" (3/3) ... [2018-11-07 16:34:11,144 INFO L112 eAbstractionObserver]: Analyzing ICFG n.c11_true-unreach-call_false-termination.i [2018-11-07 16:34:11,156 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 16:34:11,165 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 16:34:11,190 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 16:34:11,233 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 16:34:11,234 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 16:34:11,234 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 16:34:11,234 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 16:34:11,235 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 16:34:11,235 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 16:34:11,235 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 16:34:11,235 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 16:34:11,259 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-11-07 16:34:11,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-07 16:34:11,267 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:34:11,268 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:34:11,271 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:34:11,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:34:11,278 INFO L82 PathProgramCache]: Analyzing trace with hash -2008095039, now seen corresponding path program 1 times [2018-11-07 16:34:11,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:34:11,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:34:11,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:34:11,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:34:11,354 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:34:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:34:11,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:11,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:34:11,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 16:34:11,412 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:34:11,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 16:34:11,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 16:34:11,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 16:34:11,434 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-07 16:34:11,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:34:11,458 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-07 16:34:11,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 16:34:11,460 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-07 16:34:11,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:34:11,470 INFO L225 Difference]: With dead ends: 33 [2018-11-07 16:34:11,470 INFO L226 Difference]: Without dead ends: 14 [2018-11-07 16:34:11,474 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 16:34:11,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-07 16:34:11,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-07 16:34:11,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-07 16:34:11,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-11-07 16:34:11,514 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2018-11-07 16:34:11,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:34:11,515 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-07 16:34:11,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 16:34:11,515 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-07 16:34:11,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-07 16:34:11,516 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:34:11,516 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:34:11,517 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:34:11,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:34:11,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1715940768, now seen corresponding path program 1 times [2018-11-07 16:34:11,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:34:11,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:34:11,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:34:11,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:34:11,520 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:34:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:34:11,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:11,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:34:11,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 16:34:11,670 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:34:11,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 16:34:11,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 16:34:11,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 16:34:11,674 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2018-11-07 16:34:11,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:34:11,786 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-07 16:34:11,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 16:34:11,786 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-07 16:34:11,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:34:11,787 INFO L225 Difference]: With dead ends: 30 [2018-11-07 16:34:11,787 INFO L226 Difference]: Without dead ends: 18 [2018-11-07 16:34:11,789 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:34:11,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-07 16:34:11,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-07 16:34:11,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-07 16:34:11,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-07 16:34:11,795 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 11 [2018-11-07 16:34:11,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:34:11,795 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-07 16:34:11,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 16:34:11,795 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-07 16:34:11,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-07 16:34:11,796 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:34:11,796 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:34:11,796 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:34:11,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:34:11,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1048902920, now seen corresponding path program 1 times [2018-11-07 16:34:11,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:34:11,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:34:11,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:34:11,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:34:11,799 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:34:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:34:11,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:11,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:34:11,952 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:34:11,953 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-11-07 16:34:11,955 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [19], [21], [28], [31], [33], [39], [40], [41], [43] [2018-11-07 16:34:11,990 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:34:11,990 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:34:12,087 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:34:12,269 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:34:12,270 INFO L272 AbstractInterpreter]: Visited 14 different actions 77 times. Merged at 5 different actions 35 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 5 variables. [2018-11-07 16:34:12,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:34:12,294 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:34:12,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:34:12,295 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:34:12,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:34:12,308 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:34:12,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:34:12,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:34:12,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:12,484 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:34:12,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:12,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:34:12,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-11-07 16:34:12,860 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:34:12,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 16:34:12,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 16:34:12,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-07 16:34:12,862 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 6 states. [2018-11-07 16:34:12,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:34:12,976 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-07 16:34:12,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 16:34:12,977 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-07 16:34:12,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:34:12,978 INFO L225 Difference]: With dead ends: 34 [2018-11-07 16:34:12,979 INFO L226 Difference]: Without dead ends: 22 [2018-11-07 16:34:12,980 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-11-07 16:34:12,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-07 16:34:12,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-07 16:34:12,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-07 16:34:12,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-07 16:34:12,986 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 15 [2018-11-07 16:34:12,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:34:12,986 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-07 16:34:12,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 16:34:12,986 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-07 16:34:12,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 16:34:12,987 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:34:12,987 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:34:12,988 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:34:12,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:34:12,988 INFO L82 PathProgramCache]: Analyzing trace with hash 452778096, now seen corresponding path program 2 times [2018-11-07 16:34:12,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:34:12,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:34:12,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:34:12,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:34:12,990 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:34:13,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:34:13,230 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:13,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:34:13,231 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:34:13,231 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:34:13,231 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:34:13,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:34:13,232 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:34:13,247 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:34:13,247 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:34:13,261 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 16:34:13,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:34:13,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:34:13,334 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:13,334 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:34:13,620 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:13,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:34:13,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 13 [2018-11-07 16:34:13,648 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:34:13,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 16:34:13,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 16:34:13,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-11-07 16:34:13,650 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 7 states. [2018-11-07 16:34:14,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:34:14,077 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-07 16:34:14,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 16:34:14,077 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-07 16:34:14,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:34:14,079 INFO L225 Difference]: With dead ends: 42 [2018-11-07 16:34:14,079 INFO L226 Difference]: Without dead ends: 26 [2018-11-07 16:34:14,081 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-11-07 16:34:14,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-07 16:34:14,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-07 16:34:14,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-07 16:34:14,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-11-07 16:34:14,086 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 19 [2018-11-07 16:34:14,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:34:14,086 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-07 16:34:14,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 16:34:14,087 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-07 16:34:14,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 16:34:14,087 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:34:14,088 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:34:14,088 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:34:14,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:34:14,088 INFO L82 PathProgramCache]: Analyzing trace with hash -137838632, now seen corresponding path program 3 times [2018-11-07 16:34:14,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:34:14,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:34:14,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:34:14,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:34:14,090 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:34:14,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:34:14,280 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:14,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:34:14,281 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:34:14,281 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:34:14,281 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:34:14,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:34:14,281 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:34:14,290 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:34:14,290 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:34:14,303 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:34:14,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:34:14,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:34:14,329 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:14,329 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:34:14,554 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:14,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:34:14,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2018-11-07 16:34:14,575 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:34:14,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 16:34:14,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 16:34:14,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-11-07 16:34:14,576 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 8 states. [2018-11-07 16:34:14,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:34:14,738 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-07 16:34:14,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 16:34:14,742 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-07 16:34:14,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:34:14,743 INFO L225 Difference]: With dead ends: 50 [2018-11-07 16:34:14,743 INFO L226 Difference]: Without dead ends: 30 [2018-11-07 16:34:14,744 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-11-07 16:34:14,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-07 16:34:14,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-07 16:34:14,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-07 16:34:14,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-11-07 16:34:14,750 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 23 [2018-11-07 16:34:14,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:34:14,750 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-11-07 16:34:14,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 16:34:14,751 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-07 16:34:14,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-07 16:34:14,751 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:34:14,752 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:34:14,752 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:34:14,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:34:14,752 INFO L82 PathProgramCache]: Analyzing trace with hash 872592192, now seen corresponding path program 4 times [2018-11-07 16:34:14,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:34:14,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:34:14,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:34:14,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:34:14,759 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:34:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:34:15,012 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:15,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:34:15,012 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:34:15,013 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:34:15,013 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:34:15,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:34:15,013 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11-07 16:34:15,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:34:15,022 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:34:15,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:34:15,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:34:15,100 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:15,100 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:34:15,328 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:15,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:34:15,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2018-11-07 16:34:15,350 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:34:15,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 16:34:15,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 16:34:15,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-11-07 16:34:15,352 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 9 states. [2018-11-07 16:34:15,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:34:15,446 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2018-11-07 16:34:15,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 16:34:15,447 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-11-07 16:34:15,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:34:15,448 INFO L225 Difference]: With dead ends: 48 [2018-11-07 16:34:15,448 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 16:34:15,449 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-11-07 16:34:15,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 16:34:15,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 16:34:15,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 16:34:15,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 16:34:15,450 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-11-07 16:34:15,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:34:15,450 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 16:34:15,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 16:34:15,450 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 16:34:15,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 16:34:15,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 16:34:15,586 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-07 16:34:15,587 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 16:34:15,587 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 16:34:15,587 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-07 16:34:15,587 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 16:34:15,587 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 16:34:15,588 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 9 21) the Hoare annotation is: true [2018-11-07 16:34:15,588 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 9 21) no Hoare annotation was computed. [2018-11-07 16:34:15,588 INFO L425 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-11-07 16:34:15,588 INFO L425 ceAbstractionStarter]: For program point L14(lines 14 15) no Hoare annotation was computed. [2018-11-07 16:34:15,588 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 9 21) no Hoare annotation was computed. [2018-11-07 16:34:15,588 INFO L425 ceAbstractionStarter]: For program point L13-1(lines 13 18) no Hoare annotation was computed. [2018-11-07 16:34:15,589 INFO L425 ceAbstractionStarter]: For program point L14-2(lines 14 15) no Hoare annotation was computed. [2018-11-07 16:34:15,589 INFO L421 ceAbstractionStarter]: At program point L13-3(lines 13 18) the Hoare annotation is: (or (and (<= main_~len~0 0) (<= 0 main_~len~0)) (and (<= 4 main_~len~0) (<= main_~len~0 4)) (and (<= main_~len~0 2) (<= 2 main_~len~0)) (and (<= 1 main_~len~0) (<= main_~len~0 1)) (and (<= main_~len~0 3) (<= 3 main_~len~0))) [2018-11-07 16:34:15,589 INFO L421 ceAbstractionStarter]: At program point L13-4(lines 13 18) the Hoare annotation is: (or (and (<= main_~len~0 0) (<= 0 main_~len~0)) (and (<= 4 main_~len~0) (<= main_~len~0 4)) (and (<= main_~len~0 2) (<= 2 main_~len~0)) (and (<= 1 main_~len~0) (<= main_~len~0 1)) (and (<= main_~len~0 3) (<= 3 main_~len~0))) [2018-11-07 16:34:15,589 INFO L425 ceAbstractionStarter]: For program point L3-2(lines 2 7) no Hoare annotation was computed. [2018-11-07 16:34:15,589 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 2 7) the Hoare annotation is: true [2018-11-07 16:34:15,590 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 2 7) no Hoare annotation was computed. [2018-11-07 16:34:15,591 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2018-11-07 16:34:15,591 INFO L425 ceAbstractionStarter]: For program point L4(line 4) no Hoare annotation was computed. [2018-11-07 16:34:15,591 INFO L425 ceAbstractionStarter]: For program point L3(lines 3 5) no Hoare annotation was computed. [2018-11-07 16:34:15,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:34:15 BoogieIcfgContainer [2018-11-07 16:34:15,605 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 16:34:15,605 INFO L168 Benchmark]: Toolchain (without parser) took 5253.33 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 770.7 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -562.2 MB). Peak memory consumption was 208.5 MB. Max. memory is 7.1 GB. [2018-11-07 16:34:15,608 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 16:34:15,608 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.76 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-11-07 16:34:15,609 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.95 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 16:34:15,610 INFO L168 Benchmark]: Boogie Preprocessor took 36.36 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 16:34:15,610 INFO L168 Benchmark]: RCFGBuilder took 411.80 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 770.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -826.5 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2018-11-07 16:34:15,612 INFO L168 Benchmark]: TraceAbstraction took 4467.62 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. [2018-11-07 16:34:15,616 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 305.76 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 26.95 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 36.36 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 411.80 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 770.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -826.5 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4467.62 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: 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: 13]: Loop Invariant Derived loop invariant: ((((len <= 0 && 0 <= len) || (4 <= len && len <= 4)) || (len <= 2 && 2 <= len)) || (1 <= len && len <= 1)) || (len <= 3 && 3 <= len) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. SAFE Result, 4.3s OverallTime, 6 OverallIterations, 5 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 99 SDtfs, 14 SDslu, 336 SDs, 0 SdLazy, 220 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 144 SyntacticMatches, 9 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 17 PreInvPairs, 27 NumberOfFragments, 77 HoareAnnotationTreeSize, 17 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 189 NumberOfCodeBlocks, 189 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 259 ConstructedInterpolants, 0 QuantifiedInterpolants, 27141 SizeOfPredicates, 8 NumberOfNonLiveVariables, 156 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 3/180 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...