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-133090d [2018-10-04 09:22:35,795 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 09:22:35,797 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 09:22:35,808 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 09:22:35,808 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 09:22:35,809 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 09:22:35,810 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 09:22:35,812 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 09:22:35,814 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 09:22:35,815 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 09:22:35,816 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 09:22:35,816 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 09:22:35,817 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 09:22:35,818 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 09:22:35,819 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 09:22:35,821 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 09:22:35,822 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 09:22:35,823 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 09:22:35,825 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 09:22:35,832 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 09:22:35,833 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 09:22:35,834 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 09:22:35,836 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 09:22:35,837 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 09:22:35,837 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 09:22:35,838 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 09:22:35,838 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 09:22:35,839 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 09:22:35,840 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 09:22:35,841 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 09:22:35,841 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 09:22:35,842 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 09:22:35,842 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 09:22:35,842 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 09:22:35,843 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 09:22:35,843 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 09:22:35,844 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 09:22:35,858 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 09:22:35,859 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 09:22:35,859 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 09:22:35,860 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 09:22:35,860 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 09:22:35,860 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 09:22:35,861 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 09:22:35,861 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 09:22:35,861 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 09:22:35,861 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 09:22:35,861 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 09:22:35,862 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 09:22:35,862 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 09:22:35,862 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 09:22:35,862 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 09:22:35,862 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 09:22:35,863 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 09:22:35,863 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 09:22:35,863 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 09:22:35,863 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 09:22:35,863 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 09:22:35,863 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 09:22:35,864 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:22:35,864 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 09:22:35,864 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 09:22:35,864 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 09:22:35,864 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 09:22:35,865 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 09:22:35,865 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 09:22:35,865 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 09:22:35,918 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 09:22:35,932 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 09:22:35,937 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 09:22:35,940 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 09:22:35,940 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 09:22:35,941 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 09:22:35,941 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum04.i_3.bpl' [2018-10-04 09:22:35,998 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 09:22:35,999 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 09:22:36,000 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 09:22:36,000 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 09:22:36,000 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 09:22:36,019 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 09:22:35" (1/1) ... [2018-10-04 09:22:36,031 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 09:22:35" (1/1) ... [2018-10-04 09:22:36,036 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 09:22:36,037 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 09:22:36,037 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 09:22:36,037 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 09:22:36,048 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 09:22:35" (1/1) ... [2018-10-04 09:22:36,048 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 09:22:35" (1/1) ... [2018-10-04 09:22:36,049 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 09:22:35" (1/1) ... [2018-10-04 09:22:36,049 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 09:22:35" (1/1) ... [2018-10-04 09:22:36,052 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 09:22:35" (1/1) ... [2018-10-04 09:22:36,053 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 09:22:35" (1/1) ... [2018-10-04 09:22:36,054 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 09:22:35" (1/1) ... [2018-10-04 09:22:36,055 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 09:22:36,056 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 09:22:36,056 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 09:22:36,056 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 09:22:36,057 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 09:22:35" (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 09:22:36,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 09:22:36,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 09:22:36,351 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 09:22:36,352 INFO L202 PluginConnector]: Adding new model sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:22:36 BoogieIcfgContainer [2018-10-04 09:22:36,352 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 09:22:36,353 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 09:22:36,353 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 09:22:36,356 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 09:22:36,357 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 09:22:35" (1/2) ... [2018-10-04 09:22:36,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6986c96b and model type sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 09:22:36, skipping insertion in model container [2018-10-04 09:22:36,358 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 09:22:36" (2/2) ... [2018-10-04 09:22:36,360 INFO L112 eAbstractionObserver]: Analyzing ICFG sum04.i_3.bpl [2018-10-04 09:22:36,370 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 09:22:36,377 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 09:22:36,428 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 09:22:36,429 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 09:22:36,430 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 09:22:36,430 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 09:22:36,430 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 09:22:36,430 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 09:22:36,431 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 09:22:36,431 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 09:22:36,431 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 09:22:36,447 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-10-04 09:22:36,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 09:22:36,453 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:36,454 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-04 09:22:36,456 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:36,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:36,463 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-10-04 09:22:36,465 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:36,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:36,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:36,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:36,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:36,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:36,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 09:22:36,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:36,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:22:36,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:36,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:36,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:36,687 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-10-04 09:22:36,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:36,745 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-10-04 09:22:36,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:36,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-10-04 09:22:36,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:36,756 INFO L225 Difference]: With dead ends: 11 [2018-10-04 09:22:36,757 INFO L226 Difference]: Without dead ends: 7 [2018-10-04 09:22:36,761 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 09:22:36,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-04 09:22:36,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-04 09:22:36,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-04 09:22:36,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-04 09:22:36,803 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-10-04 09:22:36,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:36,803 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-04 09:22:36,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:36,804 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-04 09:22:36,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 09:22:36,805 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:36,805 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-10-04 09:22:36,805 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:36,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:36,806 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2018-10-04 09:22:36,806 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:36,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:36,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:36,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:36,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:36,922 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 09:22:36,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:22:36,923 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 09:22:36,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:36,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:22:37,005 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 09:22:37,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:22:37,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-04 09:22:37,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:22:37,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:22:37,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-04 09:22:37,041 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2018-10-04 09:22:37,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:37,148 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-04 09:22:37,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 09:22:37,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-10-04 09:22:37,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:37,151 INFO L225 Difference]: With dead ends: 11 [2018-10-04 09:22:37,151 INFO L226 Difference]: Without dead ends: 9 [2018-10-04 09:22:37,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-04 09:22:37,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-04 09:22:37,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-04 09:22:37,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-04 09:22:37,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-04 09:22:37,156 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-10-04 09:22:37,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:37,156 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-04 09:22:37,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:22:37,156 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-04 09:22:37,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:22:37,157 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:37,157 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-10-04 09:22:37,157 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:37,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:37,158 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2018-10-04 09:22:37,158 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:37,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:37,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:37,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:37,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:37,407 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 09:22:37,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:22:37,407 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 09:22:37,419 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:22:37,459 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:22:37,459 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:22:37,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:22:37,466 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 09:22:37,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:22:37,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 09:22:37,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 09:22:37,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 09:22:37,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-04 09:22:37,493 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2018-10-04 09:22:37,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:37,556 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-04 09:22:37,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:22:37,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-10-04 09:22:37,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:37,557 INFO L225 Difference]: With dead ends: 13 [2018-10-04 09:22:37,557 INFO L226 Difference]: Without dead ends: 11 [2018-10-04 09:22:37,558 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-04 09:22:37,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-04 09:22:37,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-04 09:22:37,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-04 09:22:37,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-04 09:22:37,561 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-10-04 09:22:37,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:37,561 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-04 09:22:37,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 09:22:37,562 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-04 09:22:37,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 09:22:37,562 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:37,562 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-10-04 09:22:37,563 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:37,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:37,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2018-10-04 09:22:37,563 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:37,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:37,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:37,565 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:22:37,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:37,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:37,691 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 09:22:37,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:22:37,691 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 09:22:37,700 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:22:37,720 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-04 09:22:37,720 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:22:37,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:22:37,728 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 09:22:37,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:22:37,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 09:22:37,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 09:22:37,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 09:22:37,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-04 09:22:37,750 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-10-04 09:22:37,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:37,821 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-10-04 09:22:37,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 09:22:37,821 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-10-04 09:22:37,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:37,822 INFO L225 Difference]: With dead ends: 15 [2018-10-04 09:22:37,822 INFO L226 Difference]: Without dead ends: 13 [2018-10-04 09:22:37,822 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 09:22:37,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-04 09:22:37,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-10-04 09:22:37,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-04 09:22:37,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-04 09:22:37,826 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-10-04 09:22:37,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:37,827 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-04 09:22:37,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 09:22:37,827 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-04 09:22:37,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:22:37,828 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:37,828 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-10-04 09:22:37,828 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:37,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:37,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2018-10-04 09:22:37,829 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:37,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:37,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:37,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:22:37,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:37,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:38,119 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 09:22:38,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:22:38,119 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 09:22:38,129 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:22:38,145 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:22:38,145 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:22:38,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:22:38,155 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 09:22:38,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:22:38,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 09:22:38,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:22:38,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:22:38,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-04 09:22:38,181 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 7 states. [2018-10-04 09:22:38,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:38,261 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-10-04 09:22:38,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 09:22:38,262 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-10-04 09:22:38,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:38,263 INFO L225 Difference]: With dead ends: 17 [2018-10-04 09:22:38,264 INFO L226 Difference]: Without dead ends: 15 [2018-10-04 09:22:38,265 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 09:22:38,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-04 09:22:38,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-04 09:22:38,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-04 09:22:38,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-04 09:22:38,270 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-10-04 09:22:38,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:38,271 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-04 09:22:38,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:22:38,271 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-04 09:22:38,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 09:22:38,272 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:38,272 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-10-04 09:22:38,272 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:38,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:38,273 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2018-10-04 09:22:38,273 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:38,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:38,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:38,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:22:38,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:38,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:38,425 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 09:22:38,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:22:38,426 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 09:22:38,441 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:22:38,484 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 09:22:38,484 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:22:38,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:22:38,494 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 09:22:38,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:22:38,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:22:38,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:22:38,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:22:38,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 09:22:38,517 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2018-10-04 09:22:38,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:38,549 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-04 09:22:38,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:22:38,552 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-10-04 09:22:38,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:38,553 INFO L225 Difference]: With dead ends: 19 [2018-10-04 09:22:38,553 INFO L226 Difference]: Without dead ends: 17 [2018-10-04 09:22:38,554 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 09:22:38,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-04 09:22:38,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-04 09:22:38,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-04 09:22:38,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-04 09:22:38,558 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-10-04 09:22:38,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:38,558 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-04 09:22:38,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:22:38,559 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-04 09:22:38,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:22:38,559 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:38,559 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-10-04 09:22:38,560 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:38,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:38,560 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2018-10-04 09:22:38,560 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:38,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:38,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:38,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:22:38,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:38,686 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 09:22:38,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:22:38,687 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 09:22:38,702 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:22:38,716 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 09:22:38,717 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:22:38,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:22:38,726 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 09:22:38,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:22:38,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:22:38,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:22:38,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:22:38,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 09:22:38,751 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 9 states. [2018-10-04 09:22:38,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:38,780 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-04 09:22:38,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:22:38,782 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-04 09:22:38,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:38,783 INFO L225 Difference]: With dead ends: 21 [2018-10-04 09:22:38,783 INFO L226 Difference]: Without dead ends: 19 [2018-10-04 09:22:38,783 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 09:22:38,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-04 09:22:38,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-04 09:22:38,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-04 09:22:38,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-04 09:22:38,788 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-10-04 09:22:38,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:38,788 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-04 09:22:38,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:22:38,789 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-04 09:22:38,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 09:22:38,789 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:38,789 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-10-04 09:22:38,790 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:38,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:38,790 INFO L82 PathProgramCache]: Analyzing trace with hash 67088221, now seen corresponding path program 7 times [2018-10-04 09:22:38,790 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:38,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:38,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:38,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:22:38,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:38,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:39,195 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 09:22:39,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:22:39,197 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 09:22:39,212 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 09:22:39,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:39,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:22:39,256 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 09:22:39,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:22:39,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:22:39,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:22:39,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:22:39,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 09:22:39,290 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2018-10-04 09:22:39,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:39,369 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-04 09:22:39,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:22:39,369 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-10-04 09:22:39,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:39,370 INFO L225 Difference]: With dead ends: 23 [2018-10-04 09:22:39,370 INFO L226 Difference]: Without dead ends: 21 [2018-10-04 09:22:39,371 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 09:22:39,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-04 09:22:39,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-04 09:22:39,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-04 09:22:39,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-04 09:22:39,374 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-10-04 09:22:39,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:39,375 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-04 09:22:39,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:22:39,375 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-04 09:22:39,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 09:22:39,376 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:39,376 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-10-04 09:22:39,376 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:39,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:39,377 INFO L82 PathProgramCache]: Analyzing trace with hash 47323031, now seen corresponding path program 8 times [2018-10-04 09:22:39,377 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:39,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:39,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:39,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:39,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:39,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:39,603 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 09:22:39,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:22:39,604 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 09:22:39,621 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:22:39,633 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:22:39,634 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:22:39,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:22:39,673 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 09:22:39,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:22:39,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:22:39,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:22:39,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:22:39,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-04 09:22:39,696 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 11 states. [2018-10-04 09:22:39,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:39,861 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-10-04 09:22:39,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:22:39,862 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-10-04 09:22:39,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:39,863 INFO L225 Difference]: With dead ends: 25 [2018-10-04 09:22:39,863 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 09:22:39,864 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-04 09:22:39,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 09:22:39,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-04 09:22:39,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-04 09:22:39,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-04 09:22:39,869 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-10-04 09:22:39,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:39,870 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-10-04 09:22:39,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:22:39,870 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-04 09:22:39,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 09:22:39,870 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:39,871 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2018-10-04 09:22:39,871 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:39,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:39,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1767155375, now seen corresponding path program 9 times [2018-10-04 09:22:39,872 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:39,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:39,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:39,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:22:39,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:39,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:40,193 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 09:22:40,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:40,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-04 09:22:40,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:22:40,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:22:40,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 09:22:40,195 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 11 states. [2018-10-04 09:22:40,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:40,224 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-04 09:22:40,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:22:40,224 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-10-04 09:22:40,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:40,224 INFO L225 Difference]: With dead ends: 23 [2018-10-04 09:22:40,225 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 09:22:40,225 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 09:22:40,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 09:22:40,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 09:22:40,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 09:22:40,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 09:22:40,226 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2018-10-04 09:22:40,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:40,226 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 09:22:40,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:22:40,226 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 09:22:40,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 09:22:40,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 09:22:40,422 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-10-04 09:22:40,536 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-10-04 09:22:40,539 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 38) no Hoare annotation was computed. [2018-10-04 09:22:40,540 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 38) no Hoare annotation was computed. [2018-10-04 09:22:40,540 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 38) no Hoare annotation was computed. [2018-10-04 09:22:40,540 INFO L421 ceAbstractionStarter]: At program point L28(lines 28 36) the Hoare annotation is: false [2018-10-04 09:22:40,541 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 09:22:40,541 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 37) no Hoare annotation was computed. [2018-10-04 09:22:40,541 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 09:22:40,556 INFO L202 PluginConnector]: Adding new model sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 09:22:40 BoogieIcfgContainer [2018-10-04 09:22:40,556 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 09:22:40,557 INFO L168 Benchmark]: Toolchain (without parser) took 4559.00 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-04 09:22:40,558 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 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 09:22:40,559 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.71 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 09:22:40,560 INFO L168 Benchmark]: Boogie Preprocessor took 18.34 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 09:22:40,560 INFO L168 Benchmark]: RCFGBuilder took 296.18 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 09:22:40,561 INFO L168 Benchmark]: TraceAbstraction took 4203.41 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.1 MB). Peak memory consumption was 267.1 MB. Max. memory is 7.1 GB. [2018-10-04 09:22:40,565 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.19 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 36.71 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 18.34 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 296.18 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 4203.41 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.1 MB). Peak memory consumption was 267.1 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, 4.1s OverallTime, 10 OverallIterations, 10 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s 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.7s 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.2s SatisfiabilityAnalysisTime, 2.1s 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_09-22-40-579.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_09-22-40-579.csv Received shutdown request...