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-acceleration/underapprox_true-unreach-call1_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 09:10:18,433 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 09:10:18,435 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 09:10:18,451 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 09:10:18,451 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 09:10:18,454 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 09:10:18,455 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 09:10:18,458 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 09:10:18,460 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 09:10:18,462 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 09:10:18,465 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 09:10:18,465 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 09:10:18,466 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 09:10:18,467 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 09:10:18,468 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 09:10:18,471 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 09:10:18,472 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 09:10:18,481 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 09:10:18,483 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 09:10:18,486 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 09:10:18,487 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 09:10:18,490 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 09:10:18,494 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 09:10:18,495 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 09:10:18,496 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 09:10:18,497 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 09:10:18,498 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 09:10:18,498 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 09:10:18,499 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 09:10:18,502 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 09:10:18,502 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 09:10:18,503 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 09:10:18,504 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 09:10:18,504 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 09:10:18,505 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 09:10:18,505 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 09:10:18,506 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:10:18,530 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 09:10:18,530 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 09:10:18,531 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 09:10:18,534 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 09:10:18,534 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 09:10:18,534 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 09:10:18,535 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-27 09:10:18,535 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 09:10:18,535 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-27 09:10:18,536 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 09:10:18,536 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 09:10:18,536 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 09:10:18,536 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 09:10:18,536 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 09:10:18,537 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 09:10:18,537 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 09:10:18,538 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 09:10:18,538 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 09:10:18,538 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 09:10:18,538 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 09:10:18,538 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 09:10:18,539 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 09:10:18,539 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 09:10:18,539 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 09:10:18,539 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 09:10:18,539 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 09:10:18,541 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 09:10:18,542 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 09:10:18,542 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 09:10:18,542 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 09:10:18,542 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 09:10:18,542 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 09:10:18,543 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 09:10:18,543 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 09:10:18,543 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 09:10:18,543 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 09:10:18,614 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 09:10:18,632 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 09:10:18,636 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 09:10:18,638 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 09:10:18,638 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 09:10:18,639 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loop-acceleration/underapprox_true-unreach-call1_true-termination.i [2018-10-27 09:10:18,715 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/891030bfb/4dad78f0f131452482f4e00630cc1d08/FLAG8649f57b0 [2018-10-27 09:10:19,171 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 09:10:19,172 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_true-unreach-call1_true-termination.i [2018-10-27 09:10:19,177 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/891030bfb/4dad78f0f131452482f4e00630cc1d08/FLAG8649f57b0 [2018-10-27 09:10:19,194 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/891030bfb/4dad78f0f131452482f4e00630cc1d08 [2018-10-27 09:10:19,207 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 09:10:19,209 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 09:10:19,210 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 09:10:19,210 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 09:10:19,215 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 09:10:19,216 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 09:10:19" (1/1) ... [2018-10-27 09:10:19,220 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4da79cd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:10:19, skipping insertion in model container [2018-10-27 09:10:19,220 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 09:10:19" (1/1) ... [2018-10-27 09:10:19,231 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 09:10:19,253 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 09:10:19,412 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 09:10:19,416 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 09:10:19,433 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 09:10:19,449 INFO L193 MainTranslator]: Completed translation [2018-10-27 09:10:19,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:10:19 WrapperNode [2018-10-27 09:10:19,450 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 09:10:19,451 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 09:10:19,451 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 09:10:19,451 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 09:10:19,460 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:10:19" (1/1) ... [2018-10-27 09:10:19,466 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:10:19" (1/1) ... [2018-10-27 09:10:19,472 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 09:10:19,473 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 09:10:19,473 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 09:10:19,473 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 09:10:19,483 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:10:19" (1/1) ... [2018-10-27 09:10:19,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:10:19" (1/1) ... [2018-10-27 09:10:19,484 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:10:19" (1/1) ... [2018-10-27 09:10:19,484 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:10:19" (1/1) ... [2018-10-27 09:10:19,488 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:10:19" (1/1) ... [2018-10-27 09:10:19,493 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:10:19" (1/1) ... [2018-10-27 09:10:19,494 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:10:19" (1/1) ... [2018-10-27 09:10:19,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 09:10:19,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 09:10:19,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 09:10:19,496 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 09:10:19,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:10:19" (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:10:19,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 09:10:19,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 09:10:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 09:10:19,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 09:10:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 09:10:19,556 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 09:10:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-27 09:10:19,557 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-27 09:10:19,813 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 09:10:19,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 09:10:19 BoogieIcfgContainer [2018-10-27 09:10:19,813 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 09:10:19,814 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 09:10:19,814 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 09:10:19,818 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 09:10:19,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 09:10:19" (1/3) ... [2018-10-27 09:10:19,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@825ca39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 09:10:19, skipping insertion in model container [2018-10-27 09:10:19,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:10:19" (2/3) ... [2018-10-27 09:10:19,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@825ca39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 09:10:19, skipping insertion in model container [2018-10-27 09:10:19,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 09:10:19" (3/3) ... [2018-10-27 09:10:19,821 INFO L112 eAbstractionObserver]: Analyzing ICFG underapprox_true-unreach-call1_true-termination.i [2018-10-27 09:10:19,831 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 09:10:19,839 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 09:10:19,857 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 09:10:19,887 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 09:10:19,888 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 09:10:19,888 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 09:10:19,888 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 09:10:19,888 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 09:10:19,888 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 09:10:19,888 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 09:10:19,889 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 09:10:19,905 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-10-27 09:10:19,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-27 09:10:19,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:10:19,913 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:10:19,915 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:10:19,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:10:19,921 INFO L82 PathProgramCache]: Analyzing trace with hash -10373566, now seen corresponding path program 1 times [2018-10-27 09:10:19,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:10:19,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:10:19,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:10:19,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:10:19,973 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:10:20,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:10:20,031 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:10:20,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 09:10:20,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 09:10:20,033 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:10:20,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-27 09:10:20,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 09:10:20,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 09:10:20,051 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-10-27 09:10:20,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:10:20,072 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-10-27 09:10:20,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 09:10:20,073 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-10-27 09:10:20,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:10:20,080 INFO L225 Difference]: With dead ends: 29 [2018-10-27 09:10:20,081 INFO L226 Difference]: Without dead ends: 12 [2018-10-27 09:10:20,084 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:10:20,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-27 09:10:20,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-10-27 09:10:20,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-27 09:10:20,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-10-27 09:10:20,119 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-10-27 09:10:20,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:10:20,120 INFO L481 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-10-27 09:10:20,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-27 09:10:20,120 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-10-27 09:10:20,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-27 09:10:20,121 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:10:20,121 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:10:20,121 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:10:20,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:10:20,122 INFO L82 PathProgramCache]: Analyzing trace with hash -571410792, now seen corresponding path program 1 times [2018-10-27 09:10:20,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:10:20,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:10:20,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:10:20,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:10:20,124 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:10:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:10:20,219 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:10:20,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 09:10:20,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 09:10:20,220 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:10:20,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 09:10:20,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 09:10:20,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 09:10:20,223 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2018-10-27 09:10:20,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:10:20,252 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-27 09:10:20,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 09:10:20,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-10-27 09:10:20,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:10:20,253 INFO L225 Difference]: With dead ends: 19 [2018-10-27 09:10:20,254 INFO L226 Difference]: Without dead ends: 14 [2018-10-27 09:10:20,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 09:10:20,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-10-27 09:10:20,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-10-27 09:10:20,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-27 09:10:20,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-10-27 09:10:20,260 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-10-27 09:10:20,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:10:20,260 INFO L481 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-10-27 09:10:20,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 09:10:20,260 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-10-27 09:10:20,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-27 09:10:20,261 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:10:20,261 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:10:20,261 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:10:20,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:10:20,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1625028318, now seen corresponding path program 1 times [2018-10-27 09:10:20,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:10:20,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:10:20,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:10:20,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:10:20,264 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:10:20,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:10:20,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:10:20,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:10:20,462 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:10:20,463 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-10-27 09:10:20,464 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [20], [23], [25], [31], [32], [33], [35] [2018-10-27 09:10:20,497 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:10:20,497 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:10:20,705 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 09:10:20,707 INFO L272 AbstractInterpreter]: Visited 12 different actions 18 times. Merged at 2 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 3 variables. [2018-10-27 09:10:20,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:10:20,753 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 09:10:20,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:10:20,753 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:10:20,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:10:20,771 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:10:20,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:10:20,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:10:20,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:10:20,919 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:10:21,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:10:21,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:10:21,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-10-27 09:10:21,101 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:10:21,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 09:10:21,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 09:10:21,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-27 09:10:21,102 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 4 states. [2018-10-27 09:10:21,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:10:21,139 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-27 09:10:21,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 09:10:21,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-10-27 09:10:21,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:10:21,143 INFO L225 Difference]: With dead ends: 21 [2018-10-27 09:10:21,143 INFO L226 Difference]: Without dead ends: 16 [2018-10-27 09:10:21,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-27 09:10:21,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-27 09:10:21,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-10-27 09:10:21,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-27 09:10:21,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-10-27 09:10:21,148 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-10-27 09:10:21,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:10:21,149 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-10-27 09:10:21,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 09:10:21,149 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-10-27 09:10:21,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-27 09:10:21,150 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:10:21,150 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:10:21,150 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:10:21,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:10:21,151 INFO L82 PathProgramCache]: Analyzing trace with hash -720896604, now seen corresponding path program 2 times [2018-10-27 09:10:21,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:10:21,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:10:21,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:10:21,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:10:21,153 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:10:21,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:10:21,346 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:10:21,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:10:21,348 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:10:21,348 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:10:21,349 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:10:21,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:10:21,349 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:10:21,362 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 09:10:21,362 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 09:10:21,424 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-27 09:10:21,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:10:21,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:10:21,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:10:21,465 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:10:21,703 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:10:21,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:10:21,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-10-27 09:10:21,729 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:10:21,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 09:10:21,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 09:10:21,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-27 09:10:21,731 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 5 states. [2018-10-27 09:10:21,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:10:21,765 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-27 09:10:21,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 09:10:21,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-10-27 09:10:21,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:10:21,766 INFO L225 Difference]: With dead ends: 23 [2018-10-27 09:10:21,766 INFO L226 Difference]: Without dead ends: 18 [2018-10-27 09:10:21,767 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-27 09:10:21,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-27 09:10:21,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-10-27 09:10:21,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-27 09:10:21,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-10-27 09:10:21,771 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-10-27 09:10:21,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:10:21,772 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-10-27 09:10:21,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 09:10:21,772 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-10-27 09:10:21,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-27 09:10:21,774 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:10:21,774 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:10:21,774 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:10:21,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:10:21,775 INFO L82 PathProgramCache]: Analyzing trace with hash -296916246, now seen corresponding path program 3 times [2018-10-27 09:10:21,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:10:21,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:10:21,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:10:21,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:10:21,777 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:10:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:10:21,925 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:10:21,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:10:21,925 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:10:21,926 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:10:21,926 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:10:21,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:10:21,926 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:10:21,934 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 09:10:21,934 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 09:10:21,948 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 09:10:21,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:10:21,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:10:21,979 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:10:21,979 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:10:22,078 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:10:22,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:10:22,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-10-27 09:10:22,098 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:10:22,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 09:10:22,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 09:10:22,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-10-27 09:10:22,099 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 6 states. [2018-10-27 09:10:22,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:10:22,159 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-10-27 09:10:22,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 09:10:22,159 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-10-27 09:10:22,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:10:22,161 INFO L225 Difference]: With dead ends: 25 [2018-10-27 09:10:22,161 INFO L226 Difference]: Without dead ends: 20 [2018-10-27 09:10:22,162 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-10-27 09:10:22,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-27 09:10:22,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-10-27 09:10:22,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-27 09:10:22,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-10-27 09:10:22,167 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2018-10-27 09:10:22,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:10:22,167 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-10-27 09:10:22,168 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 09:10:22,168 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-10-27 09:10:22,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-27 09:10:22,168 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:10:22,169 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:10:22,169 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:10:22,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:10:22,169 INFO L82 PathProgramCache]: Analyzing trace with hash -873685328, now seen corresponding path program 4 times [2018-10-27 09:10:22,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:10:22,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:10:22,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:10:22,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:10:22,171 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:10:22,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:10:22,335 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:10:22,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:10:22,335 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:10:22,335 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:10:22,336 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:10:22,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:10:22,338 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:10:22,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:10:22,349 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:10:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:10:22,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:10:22,396 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:10:22,396 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:10:22,564 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:10:22,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:10:22,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-10-27 09:10:22,585 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:10:22,585 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 09:10:22,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 09:10:22,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-10-27 09:10:22,586 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 7 states. [2018-10-27 09:10:22,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:10:22,640 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-10-27 09:10:22,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 09:10:22,641 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-10-27 09:10:22,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:10:22,642 INFO L225 Difference]: With dead ends: 27 [2018-10-27 09:10:22,643 INFO L226 Difference]: Without dead ends: 22 [2018-10-27 09:10:22,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-10-27 09:10:22,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-27 09:10:22,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-27 09:10:22,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-27 09:10:22,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-10-27 09:10:22,649 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2018-10-27 09:10:22,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:10:22,650 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-10-27 09:10:22,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 09:10:22,650 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-10-27 09:10:22,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-27 09:10:22,651 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:10:22,651 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:10:22,651 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:10:22,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:10:22,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1097991946, now seen corresponding path program 5 times [2018-10-27 09:10:22,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:10:22,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:10:22,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:10:22,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:10:22,653 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:10:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:10:23,081 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:10:23,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:10:23,082 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:10:23,082 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:10:23,083 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:10:23,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:10:23,083 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:10:23,091 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 09:10:23,091 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 09:10:23,139 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-27 09:10:23,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:10:23,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:10:23,208 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:10:23,209 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:10:23,485 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:10:23,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:10:23,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2018-10-27 09:10:23,506 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:10:23,507 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 09:10:23,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 09:10:23,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-10-27 09:10:23,508 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 8 states. [2018-10-27 09:10:23,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:10:23,571 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-10-27 09:10:23,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 09:10:23,572 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-10-27 09:10:23,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:10:23,573 INFO L225 Difference]: With dead ends: 29 [2018-10-27 09:10:23,573 INFO L226 Difference]: Without dead ends: 24 [2018-10-27 09:10:23,574 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-10-27 09:10:23,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-27 09:10:23,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-10-27 09:10:23,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-27 09:10:23,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-10-27 09:10:23,579 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2018-10-27 09:10:23,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:10:23,579 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-10-27 09:10:23,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 09:10:23,579 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-10-27 09:10:23,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-27 09:10:23,580 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:10:23,581 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:10:23,581 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:10:23,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:10:23,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1908287044, now seen corresponding path program 6 times [2018-10-27 09:10:23,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:10:23,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:10:23,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:10:23,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:10:23,583 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:10:23,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:10:25,465 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-27 09:10:27,908 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* 715827883 c_main_~y~0) 357913936))) (<= .cse0 (* 1073741824 (div .cse0 1073741824)))) is different from false [2018-10-27 09:10:46,713 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 18 refuted. 12 times theorem prover too weak. 0 trivial. 12 not checked. [2018-10-27 09:10:46,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:10:46,713 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:10:46,713 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:10:46,713 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:10:46,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:10:46,714 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:10:46,721 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 09:10:46,721 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 09:10:46,746 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 09:10:46,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:10:46,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:10:50,890 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 19 [2018-10-27 09:10:53,125 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:10:53,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:11:52,837 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 40 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:11:52,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:11:52,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 26 [2018-10-27 09:11:52,858 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:11:52,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-27 09:11:52,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-27 09:11:52,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=455, Unknown=31, NotChecked=46, Total=650 [2018-10-27 09:11:52,859 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 19 states. [2018-10-27 09:11:54,296 WARN L179 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 24 [2018-10-27 09:11:54,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:11:54,303 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-10-27 09:11:54,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 09:11:54,305 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2018-10-27 09:11:54,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:11:54,305 INFO L225 Difference]: With dead ends: 31 [2018-10-27 09:11:54,306 INFO L226 Difference]: Without dead ends: 26 [2018-10-27 09:11:54,306 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 90.2s TimeCoverageRelationStatistics Valid=124, Invalid=499, Unknown=31, NotChecked=48, Total=702 [2018-10-27 09:11:54,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-27 09:11:54,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-10-27 09:11:54,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-27 09:11:54,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-10-27 09:11:54,312 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2018-10-27 09:11:54,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:11:54,312 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-10-27 09:11:54,312 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-27 09:11:54,313 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-10-27 09:11:54,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-27 09:11:54,313 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:11:54,313 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:11:54,314 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:11:54,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:11:54,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1082171650, now seen corresponding path program 7 times [2018-10-27 09:11:54,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:11:54,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:11:54,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:11:54,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:11:54,316 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:11:54,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:11:54,667 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:11:54,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:11:54,667 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:11:54,668 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:11:54,668 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:11:54,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:11:54,668 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:11:54,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:11:54,676 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:11:54,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:11:54,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:11:54,744 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:11:54,745 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:11:55,099 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:11:55,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:11:55,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2018-10-27 09:11:55,120 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:11:55,121 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 09:11:55,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 09:11:55,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-10-27 09:11:55,121 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 9 states. [2018-10-27 09:11:55,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:11:55,189 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-10-27 09:11:55,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 09:11:55,190 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-10-27 09:11:55,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:11:55,191 INFO L225 Difference]: With dead ends: 26 [2018-10-27 09:11:55,191 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 09:11:55,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-10-27 09:11:55,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 09:11:55,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 09:11:55,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 09:11:55,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 09:11:55,193 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-10-27 09:11:55,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:11:55,193 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 09:11:55,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 09:11:55,193 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 09:11:55,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 09:11:55,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-27 09:11:55,329 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-27 09:11:55,330 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-27 09:11:55,330 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-27 09:11:55,330 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-27 09:11:55,330 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-27 09:11:55,330 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-27 09:11:55,330 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 8 16) the Hoare annotation is: true [2018-10-27 09:11:55,330 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 8 16) no Hoare annotation was computed. [2018-10-27 09:11:55,330 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 8 16) no Hoare annotation was computed. [2018-10-27 09:11:55,330 INFO L425 ceAbstractionStarter]: For program point L11-1(lines 11 14) no Hoare annotation was computed. [2018-10-27 09:11:55,331 INFO L421 ceAbstractionStarter]: At program point L11-3(lines 11 14) the Hoare annotation is: (or (and (<= main_~x~0 1) (exists ((v_main_~y~0_26 Int)) (and (<= 1 v_main_~y~0_26) (= (* 2 v_main_~y~0_26) main_~y~0) (<= v_main_~y~0_26 1))) (<= 1 main_~x~0)) (and (<= main_~x~0 6) (exists ((v_main_~y~0_26 Int)) (and (<= 1 v_main_~y~0_26) (= main_~y~0 (* 64 v_main_~y~0_26)) (<= v_main_~y~0_26 1))) (<= 6 main_~x~0)) (and (exists ((v_main_~y~0_26 Int)) (and (<= 1 v_main_~y~0_26) (= (* 16 v_main_~y~0_26) main_~y~0) (<= v_main_~y~0_26 1))) (<= 4 main_~x~0) (<= main_~x~0 4)) (and (<= 1 main_~y~0) (<= main_~x~0 0) (<= main_~y~0 1) (<= 0 main_~x~0)) (and (<= main_~x~0 3) (exists ((v_main_~y~0_26 Int)) (and (<= 1 v_main_~y~0_26) (= main_~y~0 (* 8 v_main_~y~0_26)) (<= v_main_~y~0_26 1))) (<= 3 main_~x~0)) (and (<= 5 main_~x~0) (exists ((v_main_~y~0_26 Int)) (and (= main_~y~0 (* 32 v_main_~y~0_26)) (<= 1 v_main_~y~0_26) (<= v_main_~y~0_26 1))) (<= main_~x~0 5)) (and (exists ((v_main_~y~0_26 Int)) (and (<= 1 v_main_~y~0_26) (= main_~y~0 (* 4 v_main_~y~0_26)) (<= v_main_~y~0_26 1))) (<= 2 main_~x~0) (<= main_~x~0 2))) [2018-10-27 09:11:55,331 INFO L421 ceAbstractionStarter]: At program point L11-4(lines 11 14) the Hoare annotation is: (exists ((v_main_~y~0_26 Int)) (and (<= 1 v_main_~y~0_26) (= main_~y~0 (* 64 v_main_~y~0_26)) (<= v_main_~y~0_26 1))) [2018-10-27 09:11:55,331 INFO L425 ceAbstractionStarter]: For program point L3-2(lines 2 7) no Hoare annotation was computed. [2018-10-27 09:11:55,331 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 2 7) the Hoare annotation is: true [2018-10-27 09:11:55,331 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 2 7) no Hoare annotation was computed. [2018-10-27 09:11:55,331 INFO L425 ceAbstractionStarter]: For program point L4(line 4) no Hoare annotation was computed. [2018-10-27 09:11:55,332 INFO L425 ceAbstractionStarter]: For program point L3(lines 3 5) no Hoare annotation was computed. [2018-10-27 09:11:55,332 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2018-10-27 09:11:55,338 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,339 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,339 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,339 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,339 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,339 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,340 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,340 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,340 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,340 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,340 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,341 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,341 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,341 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,341 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,341 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,342 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,342 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,349 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,349 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,349 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,349 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,350 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,350 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,350 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,350 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,350 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,351 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,351 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,351 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,351 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,352 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,352 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,352 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,352 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,353 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 09:11:55 BoogieIcfgContainer [2018-10-27 09:11:55,355 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 09:11:55,356 INFO L168 Benchmark]: Toolchain (without parser) took 96148.94 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.5 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -423.1 MB). Peak memory consumption was 333.5 MB. Max. memory is 7.1 GB. [2018-10-27 09:11:55,358 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-10-27 09:11:55,358 INFO L168 Benchmark]: CACSL2BoogieTranslator took 240.32 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:11:55,359 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 09:11:55,360 INFO L168 Benchmark]: Boogie Preprocessor took 22.45 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:11:55,360 INFO L168 Benchmark]: RCFGBuilder took 317.79 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -809.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. [2018-10-27 09:11:55,361 INFO L168 Benchmark]: TraceAbstraction took 95541.24 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 376.2 MB). Peak memory consumption was 376.2 MB. Max. memory is 7.1 GB. [2018-10-27 09:11:55,366 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 240.32 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 22.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.45 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 317.79 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -809.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 95541.24 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 376.2 MB). Peak memory consumption was 376.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] * 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: 11]: Loop Invariant [2018-10-27 09:11:55,379 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,379 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,380 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,383 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,384 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,384 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,384 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,384 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,384 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,385 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,385 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,385 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,385 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,385 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,386 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,386 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,386 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,386 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,388 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,388 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,389 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,389 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,389 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,389 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,390 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,395 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,395 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,395 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,396 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,396 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,396 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,396 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,396 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,397 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,397 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-10-27 09:11:55,397 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] Derived loop invariant: (((((((x <= 1 && (\exists v_main_~y~0_26 : int :: (1 <= v_main_~y~0_26 && 2 * v_main_~y~0_26 == y) && v_main_~y~0_26 <= 1)) && 1 <= x) || ((x <= 6 && (\exists v_main_~y~0_26 : int :: (1 <= v_main_~y~0_26 && y == 64 * v_main_~y~0_26) && v_main_~y~0_26 <= 1)) && 6 <= x)) || (((\exists v_main_~y~0_26 : int :: (1 <= v_main_~y~0_26 && 16 * v_main_~y~0_26 == y) && v_main_~y~0_26 <= 1) && 4 <= x) && x <= 4)) || (((1 <= y && x <= 0) && y <= 1) && 0 <= x)) || ((x <= 3 && (\exists v_main_~y~0_26 : int :: (1 <= v_main_~y~0_26 && y == 8 * v_main_~y~0_26) && v_main_~y~0_26 <= 1)) && 3 <= x)) || ((5 <= x && (\exists v_main_~y~0_26 : int :: (y == 32 * v_main_~y~0_26 && 1 <= v_main_~y~0_26) && v_main_~y~0_26 <= 1)) && x <= 5)) || (((\exists v_main_~y~0_26 : int :: (1 <= v_main_~y~0_26 && y == 4 * v_main_~y~0_26) && v_main_~y~0_26 <= 1) && 2 <= x) && x <= 2) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 18 locations, 1 error locations. SAFE Result, 95.4s OverallTime, 9 OverallIterations, 8 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 127 SDtfs, 2 SDslu, 475 SDs, 0 SdLazy, 279 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 316 GetRequests, 227 SyntacticMatches, 9 SemanticMatches, 80 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 92.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 15 PreInvPairs, 23 NumberOfFragments, 152 HoareAnnotationTreeSize, 15 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 92.2s InterpolantComputationTime, 287 NumberOfCodeBlocks, 287 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 397 ConstructedInterpolants, 15 QuantifiedInterpolants, 38623 SizeOfPredicates, 7 NumberOfNonLiveVariables, 343 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 23 InterpolantComputations, 2 PerfectInterpolantSequences, 42/504 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...