java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HiddenInequality.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c372c2b [2018-10-02 12:18:25,865 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 12:18:25,867 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 12:18:25,878 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 12:18:25,879 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 12:18:25,880 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 12:18:25,881 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 12:18:25,883 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 12:18:25,885 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 12:18:25,885 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 12:18:25,886 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 12:18:25,887 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 12:18:25,888 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 12:18:25,889 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 12:18:25,890 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 12:18:25,891 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 12:18:25,891 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 12:18:25,893 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 12:18:25,895 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 12:18:25,897 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 12:18:25,898 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 12:18:25,899 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 12:18:25,902 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 12:18:25,902 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 12:18:25,902 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 12:18:25,903 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 12:18:25,904 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 12:18:25,905 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 12:18:25,906 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 12:18:25,907 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 12:18:25,908 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 12:18:25,909 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 12:18:25,909 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 12:18:25,910 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 12:18:25,913 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 12:18:25,914 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 12:18:25,914 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-02 12:18:25,942 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 12:18:25,943 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 12:18:25,944 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 12:18:25,944 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 12:18:25,945 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 12:18:25,945 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 12:18:25,945 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 12:18:25,945 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 12:18:25,946 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 12:18:25,946 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 12:18:25,946 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 12:18:25,946 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 12:18:25,948 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 12:18:25,948 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 12:18:25,948 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 12:18:25,948 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 12:18:25,949 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 12:18:25,949 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 12:18:25,949 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 12:18:25,949 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 12:18:25,949 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 12:18:25,950 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 12:18:25,950 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 12:18:25,950 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 12:18:25,950 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 12:18:25,950 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 12:18:25,950 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 12:18:25,951 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 12:18:25,951 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 12:18:25,951 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 12:18:25,951 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-02 12:18:26,026 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 12:18:26,040 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 12:18:26,048 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 12:18:26,049 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 12:18:26,050 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 12:18:26,051 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HiddenInequality.bpl [2018-10-02 12:18:26,051 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HiddenInequality.bpl' [2018-10-02 12:18:26,100 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 12:18:26,104 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 12:18:26,105 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 12:18:26,105 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 12:18:26,105 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 12:18:26,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:18:26" (1/1) ... [2018-10-02 12:18:26,138 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:18:26" (1/1) ... [2018-10-02 12:18:26,146 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 12:18:26,147 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 12:18:26,147 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 12:18:26,148 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 12:18:26,158 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:18:26" (1/1) ... [2018-10-02 12:18:26,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:18:26" (1/1) ... [2018-10-02 12:18:26,159 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:18:26" (1/1) ... [2018-10-02 12:18:26,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:18:26" (1/1) ... [2018-10-02 12:18:26,162 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:18:26" (1/1) ... [2018-10-02 12:18:26,167 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:18:26" (1/1) ... [2018-10-02 12:18:26,168 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:18:26" (1/1) ... [2018-10-02 12:18:26,169 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 12:18:26,170 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 12:18:26,170 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 12:18:26,170 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 12:18:26,171 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:18:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 12:18:26,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-02 12:18:26,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-02 12:18:26,447 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-02 12:18:26,448 INFO L202 PluginConnector]: Adding new model HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:18:26 BoogieIcfgContainer [2018-10-02 12:18:26,448 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 12:18:26,449 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 12:18:26,449 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 12:18:26,455 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 12:18:26,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:18:26" (1/2) ... [2018-10-02 12:18:26,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b70d378 and model type HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:18:26, skipping insertion in model container [2018-10-02 12:18:26,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:18:26" (2/2) ... [2018-10-02 12:18:26,460 INFO L112 eAbstractionObserver]: Analyzing ICFG HiddenInequality.bpl [2018-10-02 12:18:26,471 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 12:18:26,481 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-02 12:18:26,537 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 12:18:26,538 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 12:18:26,538 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 12:18:26,538 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 12:18:26,539 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 12:18:26,539 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 12:18:26,539 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 12:18:26,539 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 12:18:26,539 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 12:18:26,552 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-10-02 12:18:26,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-02 12:18:26,558 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:18:26,559 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-02 12:18:26,560 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:18:26,566 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:18:26,566 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2018-10-02 12:18:26,568 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:18:26,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:18:26,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:26,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:18:26,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:18:26,715 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-02 12:18:26,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:18:26,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:18:26,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:18:26,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:18:26,738 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:18:26,741 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-10-02 12:18:26,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:18:26,819 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-02 12:18:26,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:18:26,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-10-02 12:18:26,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:18:26,831 INFO L225 Difference]: With dead ends: 11 [2018-10-02 12:18:26,831 INFO L226 Difference]: Without dead ends: 5 [2018-10-02 12:18:26,834 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:18:26,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-10-02 12:18:26,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-10-02 12:18:26,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-02 12:18:26,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-10-02 12:18:26,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-10-02 12:18:26,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:18:26,866 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-10-02 12:18:26,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:18:26,867 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-10-02 12:18:26,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-02 12:18:26,867 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:18:26,867 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-02 12:18:26,868 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:18:26,868 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:18:26,868 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2018-10-02 12:18:26,868 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:18:26,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:18:26,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:26,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:18:26,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:26,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:18:26,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:18:26,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:18:26,983 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:18:27,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:18:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:18:27,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:18:27,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:18:27,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:18:27,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-02 12:18:27,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 12:18:27,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 12:18:27,136 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:18:27,136 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-10-02 12:18:27,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:18:27,231 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-10-02 12:18:27,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-02 12:18:27,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-10-02 12:18:27,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:18:27,232 INFO L225 Difference]: With dead ends: 8 [2018-10-02 12:18:27,233 INFO L226 Difference]: Without dead ends: 6 [2018-10-02 12:18:27,234 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:18:27,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-10-02 12:18:27,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-10-02 12:18:27,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-02 12:18:27,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-10-02 12:18:27,237 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-10-02 12:18:27,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:18:27,238 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-10-02 12:18:27,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 12:18:27,238 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-10-02 12:18:27,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-02 12:18:27,239 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:18:27,239 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-10-02 12:18:27,239 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:18:27,239 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:18:27,240 INFO L82 PathProgramCache]: Analyzing trace with hash 28752352, now seen corresponding path program 2 times [2018-10-02 12:18:27,240 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:18:27,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:18:27,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:27,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:18:27,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:27,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:18:27,326 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:18:27,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:18:27,326 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:18:27,342 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:18:27,352 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:18:27,353 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:18:27,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:18:27,388 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:18:27,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:18:27,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-02 12:18:27,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-02 12:18:27,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-02 12:18:27,408 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:18:27,408 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-10-02 12:18:27,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:18:27,562 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-02 12:18:27,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-02 12:18:27,563 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-02 12:18:27,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:18:27,564 INFO L225 Difference]: With dead ends: 9 [2018-10-02 12:18:27,564 INFO L226 Difference]: Without dead ends: 7 [2018-10-02 12:18:27,565 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:18:27,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-02 12:18:27,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-02 12:18:27,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-02 12:18:27,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-02 12:18:27,568 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-10-02 12:18:27,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:18:27,568 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-02 12:18:27,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-02 12:18:27,569 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-02 12:18:27,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-02 12:18:27,569 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:18:27,569 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-10-02 12:18:27,570 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:18:27,570 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:18:27,570 INFO L82 PathProgramCache]: Analyzing trace with hash 891320966, now seen corresponding path program 3 times [2018-10-02 12:18:27,570 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:18:27,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:18:27,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:27,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:18:27,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:18:27,732 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-02 12:18:27,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:18:27,733 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:18:27,748 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:18:27,795 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-02 12:18:27,796 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:18:27,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:18:27,835 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-02 12:18:27,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:18:27,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-02 12:18:27,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-02 12:18:27,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-02 12:18:27,856 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:18:27,856 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-10-02 12:18:27,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:18:27,984 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-10-02 12:18:27,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-02 12:18:27,985 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-10-02 12:18:27,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:18:27,985 INFO L225 Difference]: With dead ends: 10 [2018-10-02 12:18:27,985 INFO L226 Difference]: Without dead ends: 8 [2018-10-02 12:18:27,986 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime [2018-10-02 12:18:27,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-10-02 12:18:27,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-10-02 12:18:27,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-02 12:18:27,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-10-02 12:18:27,988 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-10-02 12:18:27,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:18:27,989 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-10-02 12:18:27,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-02 12:18:27,989 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-10-02 12:18:27,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-02 12:18:27,990 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:18:27,990 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-10-02 12:18:27,990 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:18:27,991 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:18:27,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144224, now seen corresponding path program 4 times [2018-10-02 12:18:27,991 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:18:27,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:18:27,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:27,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:18:27,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:28,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:18:28,084 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:18:28,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:18:28,085 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:18:28,096 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 12:18:28,122 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 12:18:28,124 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:18:28,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:18:28,225 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:18:28,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:18:28,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-02 12:18:28,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 12:18:28,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 12:18:28,247 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:18:28,247 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-10-02 12:18:28,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:18:28,323 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-02 12:18:28,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-02 12:18:28,323 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-10-02 12:18:28,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:18:28,324 INFO L225 Difference]: With dead ends: 11 [2018-10-02 12:18:28,324 INFO L226 Difference]: Without dead ends: 9 [2018-10-02 12:18:28,324 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:18:28,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-02 12:18:28,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-02 12:18:28,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-02 12:18:28,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-02 12:18:28,328 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-10-02 12:18:28,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:18:28,328 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-02 12:18:28,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 12:18:28,328 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-02 12:18:28,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 12:18:28,329 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:18:28,329 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-10-02 12:18:28,329 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:18:28,329 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:18:28,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894150, now seen corresponding path program 5 times [2018-10-02 12:18:28,329 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:18:28,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:18:28,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:28,330 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:18:28,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:18:28,415 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:18:28,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:18:28,416 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-02 12:18:28,424 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 12:18:28,435 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-02 12:18:28,436 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:18:28,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:18:28,467 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:18:28,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:18:28,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-02 12:18:28,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 12:18:28,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 12:18:28,490 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:18:28,490 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-10-02 12:18:29,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:18:29,022 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-10-02 12:18:29,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-02 12:18:29,024 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-02 12:18:29,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:18:29,025 INFO L225 Difference]: With dead ends: 12 [2018-10-02 12:18:29,025 INFO L226 Difference]: Without dead ends: 10 [2018-10-02 12:18:29,026 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:18:29,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-10-02 12:18:29,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-10-02 12:18:29,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-02 12:18:29,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-10-02 12:18:29,029 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-10-02 12:18:29,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:18:29,030 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-10-02 12:18:29,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 12:18:29,030 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-10-02 12:18:29,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-02 12:18:29,031 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:18:29,031 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-10-02 12:18:29,031 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:18:29,031 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:18:29,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141856, now seen corresponding path program 6 times [2018-10-02 12:18:29,032 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:18:29,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:18:29,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:29,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:18:29,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:29,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:18:29,192 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:18:29,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:18:29,193 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-02 12:18:29,208 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 12:18:29,218 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-10-02 12:18:29,218 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:18:29,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:18:29,270 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:18:29,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:18:29,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-02 12:18:29,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 12:18:29,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 12:18:29,292 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:18:29,292 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-10-02 12:18:29,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:18:29,355 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-02 12:18:29,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-02 12:18:29,357 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-10-02 12:18:29,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:18:29,358 INFO L225 Difference]: With dead ends: 13 [2018-10-02 12:18:29,358 INFO L226 Difference]: Without dead ends: 11 [2018-10-02 12:18:29,358 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:18:29,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-02 12:18:29,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-02 12:18:29,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-02 12:18:29,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-02 12:18:29,361 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-10-02 12:18:29,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:18:29,361 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-02 12:18:29,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 12:18:29,362 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-02 12:18:29,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-02 12:18:29,362 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:18:29,362 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-10-02 12:18:29,362 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:18:29,363 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:18:29,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820742, now seen corresponding path program 7 times [2018-10-02 12:18:29,363 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:18:29,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:18:29,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:29,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:18:29,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:29,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:18:29,469 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:18:29,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:18:29,469 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-02 12:18:29,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:18:29,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:18:29,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:18:29,551 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:18:29,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:18:29,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-02 12:18:29,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-02 12:18:29,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-02 12:18:29,573 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:18:29,573 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-10-02 12:18:29,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:18:29,676 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-10-02 12:18:29,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-02 12:18:29,677 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-10-02 12:18:29,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:18:29,678 INFO L225 Difference]: With dead ends: 14 [2018-10-02 12:18:29,678 INFO L226 Difference]: Without dead ends: 12 [2018-10-02 12:18:29,679 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:18:29,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-02 12:18:29,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-10-02 12:18:29,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-02 12:18:29,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-10-02 12:18:29,681 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-10-02 12:18:29,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:18:29,682 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-10-02 12:18:29,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-02 12:18:29,682 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-10-02 12:18:29,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-02 12:18:29,682 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:18:29,683 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-10-02 12:18:29,683 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:18:29,683 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:18:29,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166496, now seen corresponding path program 8 times [2018-10-02 12:18:29,683 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:18:29,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:18:29,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:29,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:18:29,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:29,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:18:29,874 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:18:29,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:18:29,875 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:18:29,887 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:18:29,896 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:18:29,896 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:18:29,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:18:29,944 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:18:29,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:18:29,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-02 12:18:29,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-02 12:18:29,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-02 12:18:29,968 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:18:29,968 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-10-02 12:18:30,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:18:30,085 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-10-02 12:18:30,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-02 12:18:30,087 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-10-02 12:18:30,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:18:30,088 INFO L225 Difference]: With dead ends: 15 [2018-10-02 12:18:30,088 INFO L226 Difference]: Without dead ends: 13 [2018-10-02 12:18:30,089 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime [2018-10-02 12:18:30,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-02 12:18:30,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-10-02 12:18:30,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-02 12:18:30,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-02 12:18:30,092 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-10-02 12:18:30,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:18:30,092 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-02 12:18:30,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-02 12:18:30,093 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-02 12:18:30,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 12:18:30,093 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:18:30,093 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-10-02 12:18:30,094 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:18:30,094 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:18:30,094 INFO L82 PathProgramCache]: Analyzing trace with hash -562523066, now seen corresponding path program 9 times [2018-10-02 12:18:30,094 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:18:30,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:18:30,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:30,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:18:30,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:18:30,210 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:18:30,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:18:30,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-02 12:18:30,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-02 12:18:30,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-02 12:18:30,212 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:18:30,212 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-10-02 12:18:30,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:18:30,307 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-02 12:18:30,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-02 12:18:30,307 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-10-02 12:18:30,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:18:30,308 INFO L225 Difference]: With dead ends: 13 [2018-10-02 12:18:30,308 INFO L226 Difference]: Without dead ends: 0 [2018-10-02 12:18:30,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:18:30,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-02 12:18:30,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-02 12:18:30,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-02 12:18:30,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-02 12:18:30,310 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2018-10-02 12:18:30,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:18:30,310 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-02 12:18:30,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-02 12:18:30,311 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-02 12:18:30,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-02 12:18:30,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-02 12:18:30,420 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 22 30) no Hoare annotation was computed. [2018-10-02 12:18:30,421 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 22 30) no Hoare annotation was computed. [2018-10-02 12:18:30,421 INFO L425 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-10-02 12:18:30,421 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 22 30) no Hoare annotation was computed. [2018-10-02 12:18:30,421 INFO L421 ceAbstractionStarter]: At program point L25-1(lines 25 28) the Hoare annotation is: (or (<= 9 s) (and (<= i 0) (<= 0 s)) (and (<= 4 s) (<= i 4)) (and (<= i 1) (<= 1 s)) (and (<= 8 s) (<= i 8)) (and (<= i 3) (<= 3 s)) (and (<= i 7) (<= 7 s)) (and (<= 5 s) (<= i 5)) (and (<= i 6) (<= 6 s)) (and (<= i 2) (<= 2 s))) [2018-10-02 12:18:30,421 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 29) no Hoare annotation was computed. [2018-10-02 12:18:30,433 INFO L202 PluginConnector]: Adding new model HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 12:18:30 BoogieIcfgContainer [2018-10-02 12:18:30,433 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 12:18:30,434 INFO L168 Benchmark]: Toolchain (without parser) took 4332.75 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 288.2 MB). Peak memory consumption was 288.2 MB. Max. memory is 7.1 GB. [2018-10-02 12:18:30,436 INFO L168 Benchmark]: Boogie PL CUP Parser 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-02 12:18:30,437 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.14 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-02 12:18:30,438 INFO L168 Benchmark]: Boogie Preprocessor took 21.88 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-02 12:18:30,438 INFO L168 Benchmark]: RCFGBuilder took 278.48 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-02 12:18:30,439 INFO L168 Benchmark]: TraceAbstraction took 3983.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 267.0 MB). Peak memory consumption was 267.0 MB. Max. memory is 7.1 GB. [2018-10-02 12:18:30,445 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser 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. * Boogie Procedure Inliner took 42.14 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. * Boogie Preprocessor took 21.88 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. * RCFGBuilder took 278.48 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3983.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 267.0 MB). Peak memory consumption was 267.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 29]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((((((((9 <= s || (i <= 0 && 0 <= s)) || (4 <= s && i <= 4)) || (i <= 1 && 1 <= s)) || (8 <= s && i <= 8)) || (i <= 3 && 3 <= s)) || (i <= 7 && 7 <= s)) || (5 <= s && i <= 5)) || (i <= 6 && 6 <= s)) || (i <= 2 && 2 <= s) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 3.8s OverallTime, 10 OverallIterations, 9 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 31 SDtfs, 4 SDslu, 43 SDs, 0 SdLazy, 118 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 10 NumberOfFragments, 67 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 2443 SizeOfPredicates, 7 NumberOfNonLiveVariables, 244 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 18 InterpolantComputations, 2 PerfectInterpolantSequences, 45/285 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/HiddenInequality.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-02_12-18-30-459.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/HiddenInequality.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-02_12-18-30-459.csv Received shutdown request...