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.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum04.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:28:21,815 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:28:21,817 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:28:21,829 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:28:21,829 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:28:21,830 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:28:21,831 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:28:21,833 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:28:21,835 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:28:21,835 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:28:21,836 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:28:21,837 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:28:21,838 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:28:21,839 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:28:21,840 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:28:21,840 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:28:21,841 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:28:21,843 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:28:21,845 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:28:21,847 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:28:21,848 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:28:21,850 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:28:21,852 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:28:21,852 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:28:21,853 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:28:21,854 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:28:21,855 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:28:21,855 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:28:21,856 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:28:21,863 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:28:21,863 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:28:21,864 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:28:21,864 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:28:21,864 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:28:21,865 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:28:21,866 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:28:21,866 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-04 12:28:21,881 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:28:21,882 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:28:21,883 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:28:21,883 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:28:21,883 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:28:21,884 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:28:21,884 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:28:21,884 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:28:21,884 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:28:21,884 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:28:21,885 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:28:21,885 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:28:21,885 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:28:21,885 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:28:21,885 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:28:21,886 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:28:21,886 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:28:21,886 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:28:21,886 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:28:21,886 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:28:21,886 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:28:21,887 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:28:21,887 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:28:21,887 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:28:21,887 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:28:21,887 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:28:21,888 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:28:21,888 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:28:21,888 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:28:21,888 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:28:21,944 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:28:21,957 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:28:21,962 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:28:21,963 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:28:21,964 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:28:21,965 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum04.i_3.bpl [2018-10-04 12:28:21,965 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum04.i_3.bpl' [2018-10-04 12:28:22,012 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:28:22,014 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:28:22,015 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:28:22,015 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:28:22,015 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:28:22,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:22" (1/1) ... [2018-10-04 12:28:22,047 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:22" (1/1) ... [2018-10-04 12:28:22,053 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:28:22,053 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:28:22,054 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:28:22,054 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:28:22,065 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:22" (1/1) ... [2018-10-04 12:28:22,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:22" (1/1) ... [2018-10-04 12:28:22,065 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:22" (1/1) ... [2018-10-04 12:28:22,066 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:22" (1/1) ... [2018-10-04 12:28:22,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:22" (1/1) ... [2018-10-04 12:28:22,070 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:22" (1/1) ... [2018-10-04 12:28:22,073 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:22" (1/1) ... [2018-10-04 12:28:22,074 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:28:22,075 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:28:22,075 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:28:22,075 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:28:22,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:22" (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-04 12:28:22,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 12:28:22,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 12:28:22,382 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 12:28:22,383 INFO L202 PluginConnector]: Adding new model sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:28:22 BoogieIcfgContainer [2018-10-04 12:28:22,383 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:28:22,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:28:22,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:28:22,387 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:28:22,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:22" (1/2) ... [2018-10-04 12:28:22,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ca9b77d and model type sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:28:22, skipping insertion in model container [2018-10-04 12:28:22,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:28:22" (2/2) ... [2018-10-04 12:28:22,390 INFO L112 eAbstractionObserver]: Analyzing ICFG sum04.i_3.bpl [2018-10-04 12:28:22,400 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:28:22,408 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:28:22,460 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:28:22,461 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:28:22,461 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:28:22,461 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:28:22,462 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:28:22,462 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:28:22,462 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:28:22,462 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:28:22,462 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:28:22,479 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-10-04 12:28:22,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 12:28:22,494 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:22,495 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-04 12:28:22,496 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:22,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:22,509 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-10-04 12:28:22,511 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:22,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:22,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:22,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:22,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:22,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:22,661 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-04 12:28:22,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:28:22,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:28:22,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:28:22,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:28:22,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:22,685 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-10-04 12:28:22,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:22,739 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-10-04 12:28:22,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:28:22,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-10-04 12:28:22,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:22,751 INFO L225 Difference]: With dead ends: 11 [2018-10-04 12:28:22,751 INFO L226 Difference]: Without dead ends: 7 [2018-10-04 12:28:22,755 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-04 12:28:22,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-04 12:28:22,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-04 12:28:22,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-04 12:28:22,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-04 12:28:22,790 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-10-04 12:28:22,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:22,790 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-04 12:28:22,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:28:22,791 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-04 12:28:22,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 12:28:22,791 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:22,792 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-10-04 12:28:22,792 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:22,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:22,792 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2018-10-04 12:28:22,793 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:22,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:22,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:22,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:22,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:22,939 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-04 12:28:22,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:28:22,939 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-04 12:28:22,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:22,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:23,013 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-04 12:28:23,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:28:23,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-04 12:28:23,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:28:23,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:28:23,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:28:23,036 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2018-10-04 12:28:23,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:23,091 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-04 12:28:23,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:28:23,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-10-04 12:28:23,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:23,092 INFO L225 Difference]: With dead ends: 11 [2018-10-04 12:28:23,092 INFO L226 Difference]: Without dead ends: 9 [2018-10-04 12:28:23,096 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:28:23,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-04 12:28:23,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-04 12:28:23,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-04 12:28:23,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-04 12:28:23,099 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-10-04 12:28:23,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:23,099 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-04 12:28:23,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:28:23,099 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-04 12:28:23,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:28:23,102 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:23,102 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-10-04 12:28:23,102 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:23,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:23,104 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2018-10-04 12:28:23,104 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:23,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:23,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:23,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:23,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:23,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:23,181 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-04 12:28:23,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:28:23,182 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-04 12:28:23,191 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:28:23,214 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:28:23,214 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:28:23,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:23,221 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-04 12:28:23,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:28:23,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 12:28:23,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:28:23,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:28:23,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:28:23,246 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2018-10-04 12:28:23,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:23,283 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-04 12:28:23,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:28:23,283 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-10-04 12:28:23,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:23,284 INFO L225 Difference]: With dead ends: 13 [2018-10-04 12:28:23,284 INFO L226 Difference]: Without dead ends: 11 [2018-10-04 12:28:23,284 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:28:23,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-04 12:28:23,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-04 12:28:23,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-04 12:28:23,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-04 12:28:23,288 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-10-04 12:28:23,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:23,288 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-04 12:28:23,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:28:23,289 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-04 12:28:23,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:28:23,289 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:23,289 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-10-04 12:28:23,290 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:23,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:23,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2018-10-04 12:28:23,291 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:23,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:23,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:23,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:28:23,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:23,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:23,371 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-04 12:28:23,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:28:23,372 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-04 12:28:23,391 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:28:23,452 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-04 12:28:23,452 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:28:23,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:23,461 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-04 12:28:23,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:28:23,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 12:28:23,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:28:23,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:28:23,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-04 12:28:23,484 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-10-04 12:28:23,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:23,565 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-10-04 12:28:23,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:28:23,566 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-10-04 12:28:23,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:23,566 INFO L225 Difference]: With dead ends: 15 [2018-10-04 12:28:23,566 INFO L226 Difference]: Without dead ends: 13 [2018-10-04 12:28:23,567 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-04 12:28:23,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-04 12:28:23,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-10-04 12:28:23,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-04 12:28:23,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-04 12:28:23,574 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-10-04 12:28:23,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:23,574 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-04 12:28:23,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:28:23,574 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-04 12:28:23,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:28:23,575 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:23,575 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-10-04 12:28:23,576 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:23,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:23,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2018-10-04 12:28:23,576 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:23,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:23,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:23,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:28:23,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:23,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:23,828 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-04 12:28:23,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:28:23,828 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-04 12:28:23,840 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:28:23,856 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:28:23,856 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:28:23,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:23,867 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-04 12:28:23,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:28:23,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:28:23,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:28:23,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:28:23,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:28:23,895 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 7 states. [2018-10-04 12:28:23,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:23,962 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-10-04 12:28:23,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:28:23,963 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-10-04 12:28:23,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:23,964 INFO L225 Difference]: With dead ends: 17 [2018-10-04 12:28:23,965 INFO L226 Difference]: Without dead ends: 15 [2018-10-04 12:28:23,965 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:28:23,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-04 12:28:23,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-04 12:28:23,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-04 12:28:23,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-04 12:28:23,970 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-10-04 12:28:23,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:23,970 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-04 12:28:23,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:28:23,970 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-04 12:28:23,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:28:23,971 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:23,971 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-10-04 12:28:23,972 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:23,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:23,972 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2018-10-04 12:28:23,973 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:23,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:23,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:23,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:28:23,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:23,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:24,127 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-04 12:28:24,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:28:24,128 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-04 12:28:24,138 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:28:24,172 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 12:28:24,173 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:28:24,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:24,182 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-04 12:28:24,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:28:24,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:28:24,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:28:24,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:28:24,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:28:24,206 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2018-10-04 12:28:24,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:24,323 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-04 12:28:24,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:28:24,326 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-10-04 12:28:24,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:24,326 INFO L225 Difference]: With dead ends: 19 [2018-10-04 12:28:24,326 INFO L226 Difference]: Without dead ends: 17 [2018-10-04 12:28:24,327 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:28:24,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-04 12:28:24,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-04 12:28:24,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-04 12:28:24,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-04 12:28:24,331 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-10-04 12:28:24,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:24,332 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-04 12:28:24,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:28:24,332 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-04 12:28:24,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:28:24,333 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:24,333 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-10-04 12:28:24,333 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:24,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:24,334 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2018-10-04 12:28:24,334 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:24,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:24,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:24,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:28:24,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:24,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:24,459 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-04 12:28:24,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:28:24,460 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-04 12:28:24,475 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:28:24,490 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 12:28:24,490 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:28:24,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:24,500 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-04 12:28:24,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:28:24,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:28:24,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:28:24,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:28:24,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:28:24,525 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 9 states. [2018-10-04 12:28:24,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:24,564 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-04 12:28:24,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:28:24,565 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-04 12:28:24,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:24,566 INFO L225 Difference]: With dead ends: 21 [2018-10-04 12:28:24,566 INFO L226 Difference]: Without dead ends: 19 [2018-10-04 12:28:24,567 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:28:24,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-04 12:28:24,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-04 12:28:24,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-04 12:28:24,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-04 12:28:24,571 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-10-04 12:28:24,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:24,572 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-04 12:28:24,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:28:24,572 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-04 12:28:24,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:28:24,573 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:24,573 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-10-04 12:28:24,573 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:24,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:24,574 INFO L82 PathProgramCache]: Analyzing trace with hash 67088221, now seen corresponding path program 7 times [2018-10-04 12:28:24,574 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:24,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:24,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:24,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:28:24,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:24,910 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:24,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:28:24,910 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) [2018-10-04 12:28:24,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:28:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:24,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:24,970 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:25,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:28:25,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:28:25,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:28:25,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:28:25,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:28:25,006 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2018-10-04 12:28:25,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:25,104 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-04 12:28:25,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:28:25,104 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-10-04 12:28:25,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:25,105 INFO L225 Difference]: With dead ends: 23 [2018-10-04 12:28:25,105 INFO L226 Difference]: Without dead ends: 21 [2018-10-04 12:28:25,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:28:25,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-04 12:28:25,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-04 12:28:25,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-04 12:28:25,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-04 12:28:25,111 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-10-04 12:28:25,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:25,111 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-04 12:28:25,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:28:25,111 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-04 12:28:25,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 12:28:25,112 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:25,112 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-10-04 12:28:25,113 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:25,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:25,113 INFO L82 PathProgramCache]: Analyzing trace with hash 47323031, now seen corresponding path program 8 times [2018-10-04 12:28:25,113 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:25,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:25,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:25,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:25,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:25,423 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:25,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:28:25,424 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-04 12:28:25,441 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:28:25,466 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:28:25,466 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:28:25,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:25,485 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:25,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:28:25,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:28:25,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:28:25,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:28:25,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:28:25,512 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 11 states. [2018-10-04 12:28:25,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:25,655 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-10-04 12:28:25,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:28:25,656 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-10-04 12:28:25,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:25,658 INFO L225 Difference]: With dead ends: 25 [2018-10-04 12:28:25,658 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 12:28:25,659 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:28:25,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 12:28:25,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-04 12:28:25,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-04 12:28:25,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-04 12:28:25,664 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-10-04 12:28:25,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:25,664 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-10-04 12:28:25,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:28:25,665 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-04 12:28:25,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 12:28:25,665 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:25,665 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2018-10-04 12:28:25,666 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:25,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:25,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1767155375, now seen corresponding path program 9 times [2018-10-04 12:28:25,666 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:25,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:25,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:25,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:28:25,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:25,985 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:25,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:28:25,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-04 12:28:25,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:28:25,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:28:25,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:28:25,987 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 11 states. [2018-10-04 12:28:26,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:26,017 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-04 12:28:26,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:28:26,017 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-10-04 12:28:26,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:26,018 INFO L225 Difference]: With dead ends: 23 [2018-10-04 12:28:26,018 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 12:28:26,019 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:28:26,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 12:28:26,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 12:28:26,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 12:28:26,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 12:28:26,020 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2018-10-04 12:28:26,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:26,020 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 12:28:26,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:28:26,020 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 12:28:26,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 12:28:26,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 12:28:26,203 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-10-04 12:28:26,313 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-10-04 12:28:26,316 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 38) no Hoare annotation was computed. [2018-10-04 12:28:26,317 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 38) no Hoare annotation was computed. [2018-10-04 12:28:26,317 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 38) no Hoare annotation was computed. [2018-10-04 12:28:26,317 INFO L421 ceAbstractionStarter]: At program point L28(lines 28 36) the Hoare annotation is: false [2018-10-04 12:28:26,317 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 37) no Hoare annotation was computed. [2018-10-04 12:28:26,318 INFO L421 ceAbstractionStarter]: At program point L18(lines 18 29) the Hoare annotation is: (or (and (<= 1 ULTIMATE.start_main_~i~4) (<= ULTIMATE.start_main_~sn~4 0) (<= 0 ULTIMATE.start_main_~sn~4) (<= ULTIMATE.start_main_~i~4 1)) (and (<= 3 ULTIMATE.start_main_~i~4) (<= ULTIMATE.start_main_~i~4 3) (<= 4 ULTIMATE.start_main_~sn~4) (<= ULTIMATE.start_main_~sn~4 4)) (and (<= ULTIMATE.start_main_~sn~4 10) (<= 6 ULTIMATE.start_main_~i~4) (<= 10 ULTIMATE.start_main_~sn~4) (<= ULTIMATE.start_main_~i~4 6)) (and (<= 9 ULTIMATE.start_main_~i~4) (<= ULTIMATE.start_main_~sn~4 16) (<= 16 ULTIMATE.start_main_~sn~4)) (and (<= ULTIMATE.start_main_~sn~4 6) (<= ULTIMATE.start_main_~i~4 4) (<= 6 ULTIMATE.start_main_~sn~4) (<= 4 ULTIMATE.start_main_~i~4)) (and (<= 2 ULTIMATE.start_main_~sn~4) (<= 2 ULTIMATE.start_main_~i~4) (<= ULTIMATE.start_main_~i~4 2) (<= ULTIMATE.start_main_~sn~4 2)) (and (<= 8 ULTIMATE.start_main_~sn~4) (<= ULTIMATE.start_main_~i~4 5) (<= 5 ULTIMATE.start_main_~i~4) (<= ULTIMATE.start_main_~sn~4 8)) (and (<= ULTIMATE.start_main_~i~4 7) (<= ULTIMATE.start_main_~sn~4 12) (<= 7 ULTIMATE.start_main_~i~4) (<= 12 ULTIMATE.start_main_~sn~4)) (and (<= ULTIMATE.start_main_~sn~4 14) (<= ULTIMATE.start_main_~i~4 8) (<= 8 ULTIMATE.start_main_~i~4) (<= 14 ULTIMATE.start_main_~sn~4))) [2018-10-04 12:28:26,318 INFO L421 ceAbstractionStarter]: At program point L35(lines 15 35) the Hoare annotation is: (or (and (<= 1 ULTIMATE.start_main_~i~4) (<= ULTIMATE.start_main_~sn~4 0) (<= 0 ULTIMATE.start_main_~sn~4) (<= ULTIMATE.start_main_~i~4 1)) (and (<= 3 ULTIMATE.start_main_~i~4) (<= ULTIMATE.start_main_~i~4 3) (<= 4 ULTIMATE.start_main_~sn~4) (<= ULTIMATE.start_main_~sn~4 4)) (and (<= 9 ULTIMATE.start_main_~i~4) (<= ULTIMATE.start_main_~sn~4 16) (<= 16 ULTIMATE.start_main_~sn~4)) (and (<= ULTIMATE.start_main_~sn~4 10) (<= 6 ULTIMATE.start_main_~i~4) (<= 10 ULTIMATE.start_main_~sn~4) (<= ULTIMATE.start_main_~i~4 6)) (and (<= ULTIMATE.start_main_~sn~4 6) (<= ULTIMATE.start_main_~i~4 4) (<= 6 ULTIMATE.start_main_~sn~4) (<= 4 ULTIMATE.start_main_~i~4)) (and (<= 2 ULTIMATE.start_main_~sn~4) (<= 2 ULTIMATE.start_main_~i~4) (<= ULTIMATE.start_main_~i~4 2) (<= ULTIMATE.start_main_~sn~4 2)) (and (<= 8 ULTIMATE.start_main_~sn~4) (<= ULTIMATE.start_main_~i~4 5) (<= 5 ULTIMATE.start_main_~i~4) (<= ULTIMATE.start_main_~sn~4 8)) (and (<= ULTIMATE.start_main_~i~4 7) (<= ULTIMATE.start_main_~sn~4 12) (<= 7 ULTIMATE.start_main_~i~4) (<= 12 ULTIMATE.start_main_~sn~4)) (and (<= ULTIMATE.start_main_~sn~4 14) (<= ULTIMATE.start_main_~i~4 8) (<= 8 ULTIMATE.start_main_~i~4) (<= 14 ULTIMATE.start_main_~sn~4))) [2018-10-04 12:28:26,333 INFO L202 PluginConnector]: Adding new model sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:28:26 BoogieIcfgContainer [2018-10-04 12:28:26,333 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:28:26,334 INFO L168 Benchmark]: Toolchain (without parser) took 4320.59 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.1 MB). Peak memory consumption was 288.1 MB. Max. memory is 7.1 GB. [2018-10-04 12:28:26,335 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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-04 12:28:26,335 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.00 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-04 12:28:26,336 INFO L168 Benchmark]: Boogie Preprocessor took 21.30 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-04 12:28:26,337 INFO L168 Benchmark]: RCFGBuilder took 307.77 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-04 12:28:26,337 INFO L168 Benchmark]: TraceAbstraction took 3949.22 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-04 12:28:26,345 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.20 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 38.00 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.30 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 307.77 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 3949.22 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: 37]: 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: 28]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((((((((((1 <= main_~i~4 && main_~sn~4 <= 0) && 0 <= main_~sn~4) && main_~i~4 <= 1) || (((3 <= main_~i~4 && main_~i~4 <= 3) && 4 <= main_~sn~4) && main_~sn~4 <= 4)) || (((main_~sn~4 <= 10 && 6 <= main_~i~4) && 10 <= main_~sn~4) && main_~i~4 <= 6)) || ((9 <= main_~i~4 && main_~sn~4 <= 16) && 16 <= main_~sn~4)) || (((main_~sn~4 <= 6 && main_~i~4 <= 4) && 6 <= main_~sn~4) && 4 <= main_~i~4)) || (((2 <= main_~sn~4 && 2 <= main_~i~4) && main_~i~4 <= 2) && main_~sn~4 <= 2)) || (((8 <= main_~sn~4 && main_~i~4 <= 5) && 5 <= main_~i~4) && main_~sn~4 <= 8)) || (((main_~i~4 <= 7 && main_~sn~4 <= 12) && 7 <= main_~i~4) && 12 <= main_~sn~4)) || (((main_~sn~4 <= 14 && main_~i~4 <= 8) && 8 <= main_~i~4) && 14 <= main_~sn~4) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: ((((((((((1 <= main_~i~4 && main_~sn~4 <= 0) && 0 <= main_~sn~4) && main_~i~4 <= 1) || (((3 <= main_~i~4 && main_~i~4 <= 3) && 4 <= main_~sn~4) && main_~sn~4 <= 4)) || ((9 <= main_~i~4 && main_~sn~4 <= 16) && 16 <= main_~sn~4)) || (((main_~sn~4 <= 10 && 6 <= main_~i~4) && 10 <= main_~sn~4) && main_~i~4 <= 6)) || (((main_~sn~4 <= 6 && main_~i~4 <= 4) && 6 <= main_~sn~4) && 4 <= main_~i~4)) || (((2 <= main_~sn~4 && 2 <= main_~i~4) && main_~i~4 <= 2) && main_~sn~4 <= 2)) || (((8 <= main_~sn~4 && main_~i~4 <= 5) && 5 <= main_~i~4) && main_~sn~4 <= 8)) || (((main_~i~4 <= 7 && main_~sn~4 <= 12) && 7 <= main_~i~4) && 12 <= main_~sn~4)) || (((main_~sn~4 <= 14 && main_~i~4 <= 8) && 8 <= main_~i~4) && 14 <= main_~sn~4) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 3.8s OverallTime, 10 OverallIterations, 10 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 54 SDtfs, 0 SDslu, 159 SDs, 0 SdLazy, 193 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred 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, 3 LocationsWithAnnotation, 3 PreInvPairs, 21 NumberOfFragments, 231 HoareAnnotationTreeSize, 3 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 234 NumberOfCodeBlocks, 234 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 216 ConstructedInterpolants, 0 QuantifiedInterpolants, 11490 SizeOfPredicates, 9 NumberOfNonLiveVariables, 336 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 18 InterpolantComputations, 2 PerfectInterpolantSequences, 90/570 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/sum04.i_3.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-28-26-373.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/sum04.i_3.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-28-26-373.csv Received shutdown request...