java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/011b-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 09:11:01,556 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 09:11:01,557 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 09:11:01,570 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 09:11:01,570 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 09:11:01,571 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 09:11:01,572 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 09:11:01,576 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 09:11:01,577 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 09:11:01,579 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 09:11:01,579 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 09:11:01,580 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 09:11:01,581 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 09:11:01,582 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 09:11:01,585 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 09:11:01,585 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 09:11:01,587 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 09:11:01,596 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 09:11:01,598 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 09:11:01,598 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 09:11:01,599 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 09:11:01,604 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 09:11:01,604 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 09:11:01,604 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 09:11:01,605 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 09:11:01,606 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 09:11:01,608 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 09:11:01,609 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 09:11:01,610 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 09:11:01,610 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 09:11:01,611 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 09:11:01,611 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 09:11:01,612 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 09:11:01,617 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 09:11:01,618 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 09:11:01,618 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 09:11:01,641 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 09:11:01,641 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 09:11:01,642 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 09:11:01,642 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 09:11:01,643 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 09:11:01,643 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 09:11:01,643 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 09:11:01,643 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 09:11:01,645 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 09:11:01,645 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 09:11:01,645 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 09:11:01,645 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 09:11:01,645 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:11:01,646 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 09:11:01,646 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 09:11:01,646 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 09:11:01,646 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 09:11:01,646 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 09:11:01,647 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 09:11:01,647 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 09:11:01,647 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 09:11:01,650 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 09:11:01,650 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 09:11:01,699 INFO ]: Repository-Root is: /tmp [2018-06-25 09:11:01,714 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 09:11:01,717 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 09:11:01,718 INFO ]: Initializing SmtParser... [2018-06-25 09:11:01,718 INFO ]: SmtParser initialized [2018-06-25 09:11:01,719 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/011b-horn.smt2 [2018-06-25 09:11:01,720 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-25 09:11:01,805 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/011b-horn.smt2 unknown [2018-06-25 09:11:02,081 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/011b-horn.smt2 [2018-06-25 09:11:02,090 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 09:11:02,097 INFO ]: Walking toolchain with 4 elements. [2018-06-25 09:11:02,097 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 09:11:02,097 INFO ]: Initializing ChcToBoogie... [2018-06-25 09:11:02,097 INFO ]: ChcToBoogie initialized [2018-06-25 09:11:02,101 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:11:02" (1/1) ... [2018-06-25 09:11:02,153 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:11:02 Unit [2018-06-25 09:11:02,153 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 09:11:02,154 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 09:11:02,154 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 09:11:02,154 INFO ]: Boogie Preprocessor initialized [2018-06-25 09:11:02,177 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:11:02" (1/1) ... [2018-06-25 09:11:02,177 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:11:02" (1/1) ... [2018-06-25 09:11:02,185 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:11:02" (1/1) ... [2018-06-25 09:11:02,185 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:11:02" (1/1) ... [2018-06-25 09:11:02,202 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:11:02" (1/1) ... [2018-06-25 09:11:02,205 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:11:02" (1/1) ... [2018-06-25 09:11:02,216 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:11:02" (1/1) ... [2018-06-25 09:11:02,218 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 09:11:02,219 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 09:11:02,219 INFO ]: Initializing RCFGBuilder... [2018-06-25 09:11:02,219 INFO ]: RCFGBuilder initialized [2018-06-25 09:11:02,220 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:11:02" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:11:02,251 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 09:11:02,251 INFO ]: Found specification of procedure gotoProc [2018-06-25 09:11:02,251 INFO ]: Found implementation of procedure gotoProc [2018-06-25 09:11:02,251 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 09:11:02,251 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 09:11:02,251 INFO ]: Found implementation of procedure Ultimate.START [2018-06-25 09:11:02,857 INFO ]: Using library mode [2018-06-25 09:11:02,857 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:11:02 BoogieIcfgContainer [2018-06-25 09:11:02,857 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 09:11:02,858 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 09:11:02,858 INFO ]: Initializing TraceAbstraction... [2018-06-25 09:11:02,861 INFO ]: TraceAbstraction initialized [2018-06-25 09:11:02,861 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:11:02" (1/3) ... [2018-06-25 09:11:02,862 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47974d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 09:11:02, skipping insertion in model container [2018-06-25 09:11:02,862 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:11:02" (2/3) ... [2018-06-25 09:11:02,862 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47974d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 09:11:02, skipping insertion in model container [2018-06-25 09:11:02,862 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:11:02" (3/3) ... [2018-06-25 09:11:02,864 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 09:11:02,873 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 09:11:02,883 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 09:11:02,935 INFO ]: Using default assertion order modulation [2018-06-25 09:11:02,935 INFO ]: Interprodecural is true [2018-06-25 09:11:02,935 INFO ]: Hoare is false [2018-06-25 09:11:02,935 INFO ]: Compute interpolants for FPandBP [2018-06-25 09:11:02,935 INFO ]: Backedges is TWOTRACK [2018-06-25 09:11:02,935 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 09:11:02,935 INFO ]: Difference is false [2018-06-25 09:11:02,935 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 09:11:02,935 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 09:11:02,953 INFO ]: Start isEmpty. Operand 12 states. [2018-06-25 09:11:02,968 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 09:11:02,968 INFO ]: Found error trace [2018-06-25 09:11:02,971 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 09:11:02,972 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:02,977 INFO ]: Analyzing trace with hash 372276645, now seen corresponding path program 1 times [2018-06-25 09:11:02,980 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:02,980 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:03,016 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:03,016 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:03,016 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:03,039 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:03,069 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:03,071 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:11:03,071 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-25 09:11:03,073 INFO ]: Interpolant automaton has 2 states [2018-06-25 09:11:03,089 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-25 09:11:03,089 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-25 09:11:03,092 INFO ]: Start difference. First operand 12 states. Second operand 2 states. [2018-06-25 09:11:03,116 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:03,116 INFO ]: Finished difference Result 10 states and 34 transitions. [2018-06-25 09:11:03,116 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-25 09:11:03,117 INFO ]: Start accepts. Automaton has 2 states. Word has length 6 [2018-06-25 09:11:03,117 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:03,124 INFO ]: With dead ends: 10 [2018-06-25 09:11:03,125 INFO ]: Without dead ends: 10 [2018-06-25 09:11:03,126 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-25 09:11:03,144 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 09:11:03,157 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-25 09:11:03,158 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 09:11:03,161 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 34 transitions. [2018-06-25 09:11:03,162 INFO ]: Start accepts. Automaton has 10 states and 34 transitions. Word has length 6 [2018-06-25 09:11:03,163 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:03,163 INFO ]: Abstraction has 10 states and 34 transitions. [2018-06-25 09:11:03,163 INFO ]: Interpolant automaton has 2 states. [2018-06-25 09:11:03,163 INFO ]: Start isEmpty. Operand 10 states and 34 transitions. [2018-06-25 09:11:03,163 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:11:03,163 INFO ]: Found error trace [2018-06-25 09:11:03,163 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:03,164 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:03,164 INFO ]: Analyzing trace with hash -1331223366, now seen corresponding path program 1 times [2018-06-25 09:11:03,164 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:03,164 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:03,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:03,165 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:03,165 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:03,185 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:03,246 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:03,247 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:11:03,247 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:11:03,248 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:11:03,248 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:11:03,248 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:11:03,249 INFO ]: Start difference. First operand 10 states and 34 transitions. Second operand 3 states. [2018-06-25 09:11:03,510 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:03,510 INFO ]: Finished difference Result 11 states and 34 transitions. [2018-06-25 09:11:03,510 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:11:03,510 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 09:11:03,510 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:03,511 INFO ]: With dead ends: 11 [2018-06-25 09:11:03,511 INFO ]: Without dead ends: 10 [2018-06-25 09:11:03,512 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:11:03,512 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 09:11:03,514 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-25 09:11:03,514 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 09:11:03,515 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 31 transitions. [2018-06-25 09:11:03,515 INFO ]: Start accepts. Automaton has 10 states and 31 transitions. Word has length 7 [2018-06-25 09:11:03,515 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:03,515 INFO ]: Abstraction has 10 states and 31 transitions. [2018-06-25 09:11:03,515 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:11:03,515 INFO ]: Start isEmpty. Operand 10 states and 31 transitions. [2018-06-25 09:11:03,515 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:11:03,515 INFO ]: Found error trace [2018-06-25 09:11:03,515 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:03,515 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:03,516 INFO ]: Analyzing trace with hash -1343348303, now seen corresponding path program 1 times [2018-06-25 09:11:03,516 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:03,516 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:03,516 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:03,516 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:03,516 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:03,522 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:03,568 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:03,568 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:11:03,568 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:11:03,568 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:11:03,568 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:11:03,568 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:11:03,569 INFO ]: Start difference. First operand 10 states and 31 transitions. Second operand 3 states. [2018-06-25 09:11:03,722 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:03,722 INFO ]: Finished difference Result 11 states and 31 transitions. [2018-06-25 09:11:03,723 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:11:03,723 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 09:11:03,723 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:03,723 INFO ]: With dead ends: 11 [2018-06-25 09:11:03,723 INFO ]: Without dead ends: 10 [2018-06-25 09:11:03,724 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:11:03,724 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 09:11:03,725 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-25 09:11:03,725 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 09:11:03,726 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 27 transitions. [2018-06-25 09:11:03,726 INFO ]: Start accepts. Automaton has 10 states and 27 transitions. Word has length 7 [2018-06-25 09:11:03,726 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:03,726 INFO ]: Abstraction has 10 states and 27 transitions. [2018-06-25 09:11:03,726 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:11:03,726 INFO ]: Start isEmpty. Operand 10 states and 27 transitions. [2018-06-25 09:11:03,726 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:11:03,726 INFO ]: Found error trace [2018-06-25 09:11:03,726 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:03,726 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:03,727 INFO ]: Analyzing trace with hash -1323537288, now seen corresponding path program 1 times [2018-06-25 09:11:03,727 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:03,727 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:03,727 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:03,727 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:03,727 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:03,733 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:03,754 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:03,754 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:11:03,754 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:11:03,754 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:11:03,754 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:11:03,754 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:11:03,754 INFO ]: Start difference. First operand 10 states and 27 transitions. Second operand 3 states. [2018-06-25 09:11:03,826 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:03,826 INFO ]: Finished difference Result 11 states and 27 transitions. [2018-06-25 09:11:03,827 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:11:03,827 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 09:11:03,827 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:03,827 INFO ]: With dead ends: 11 [2018-06-25 09:11:03,827 INFO ]: Without dead ends: 10 [2018-06-25 09:11:03,828 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:11:03,828 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 09:11:03,829 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-25 09:11:03,829 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 09:11:03,829 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 25 transitions. [2018-06-25 09:11:03,830 INFO ]: Start accepts. Automaton has 10 states and 25 transitions. Word has length 7 [2018-06-25 09:11:03,830 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:03,830 INFO ]: Abstraction has 10 states and 25 transitions. [2018-06-25 09:11:03,830 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:11:03,830 INFO ]: Start isEmpty. Operand 10 states and 25 transitions. [2018-06-25 09:11:03,830 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:11:03,830 INFO ]: Found error trace [2018-06-25 09:11:03,830 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:03,830 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:03,830 INFO ]: Analyzing trace with hash -1335960135, now seen corresponding path program 1 times [2018-06-25 09:11:03,830 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:03,830 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:03,831 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:03,831 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:03,831 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:03,839 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:03,903 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:03,903 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:11:03,903 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:11:03,903 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:11:03,904 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:11:03,904 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:11:03,904 INFO ]: Start difference. First operand 10 states and 25 transitions. Second operand 3 states. [2018-06-25 09:11:03,933 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:03,933 INFO ]: Finished difference Result 11 states and 26 transitions. [2018-06-25 09:11:03,933 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:11:03,934 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 09:11:03,934 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:03,934 INFO ]: With dead ends: 11 [2018-06-25 09:11:03,934 INFO ]: Without dead ends: 11 [2018-06-25 09:11:03,934 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:11:03,934 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 09:11:03,936 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-25 09:11:03,936 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 09:11:03,937 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 26 transitions. [2018-06-25 09:11:03,937 INFO ]: Start accepts. Automaton has 11 states and 26 transitions. Word has length 7 [2018-06-25 09:11:03,937 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:03,937 INFO ]: Abstraction has 11 states and 26 transitions. [2018-06-25 09:11:03,937 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:11:03,937 INFO ]: Start isEmpty. Operand 11 states and 26 transitions. [2018-06-25 09:11:03,937 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:11:03,937 INFO ]: Found error trace [2018-06-25 09:11:03,937 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:03,937 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:03,938 INFO ]: Analyzing trace with hash -1348472355, now seen corresponding path program 1 times [2018-06-25 09:11:03,938 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:03,938 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:03,938 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:03,939 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:03,939 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:03,946 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:03,963 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:03,963 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:11:03,963 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:11:03,963 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:11:03,963 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:11:03,963 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:11:03,964 INFO ]: Start difference. First operand 11 states and 26 transitions. Second operand 3 states. [2018-06-25 09:11:04,096 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:04,096 INFO ]: Finished difference Result 15 states and 34 transitions. [2018-06-25 09:11:04,096 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:11:04,096 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 09:11:04,096 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:04,098 INFO ]: With dead ends: 15 [2018-06-25 09:11:04,098 INFO ]: Without dead ends: 15 [2018-06-25 09:11:04,098 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:11:04,099 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 09:11:04,100 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 12. [2018-06-25 09:11:04,101 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 09:11:04,101 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 29 transitions. [2018-06-25 09:11:04,101 INFO ]: Start accepts. Automaton has 12 states and 29 transitions. Word has length 7 [2018-06-25 09:11:04,101 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:04,101 INFO ]: Abstraction has 12 states and 29 transitions. [2018-06-25 09:11:04,101 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:11:04,101 INFO ]: Start isEmpty. Operand 12 states and 29 transitions. [2018-06-25 09:11:04,102 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:11:04,102 INFO ]: Found error trace [2018-06-25 09:11:04,102 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:04,102 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:04,102 INFO ]: Analyzing trace with hash 1525727634, now seen corresponding path program 1 times [2018-06-25 09:11:04,102 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:04,102 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:04,103 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:04,103 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:04,103 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:04,109 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:04,130 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:04,130 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:11:04,130 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:11:04,131 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:11:04,131 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:11:04,131 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:11:04,131 INFO ]: Start difference. First operand 12 states and 29 transitions. Second operand 3 states. [2018-06-25 09:11:04,145 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:04,145 INFO ]: Finished difference Result 14 states and 30 transitions. [2018-06-25 09:11:04,145 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:11:04,145 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 09:11:04,145 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:04,147 INFO ]: With dead ends: 14 [2018-06-25 09:11:04,147 INFO ]: Without dead ends: 13 [2018-06-25 09:11:04,148 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:11:04,148 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 09:11:04,149 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 11. [2018-06-25 09:11:04,149 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 09:11:04,150 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 27 transitions. [2018-06-25 09:11:04,150 INFO ]: Start accepts. Automaton has 11 states and 27 transitions. Word has length 8 [2018-06-25 09:11:04,150 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:04,150 INFO ]: Abstraction has 11 states and 27 transitions. [2018-06-25 09:11:04,150 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:11:04,150 INFO ]: Start isEmpty. Operand 11 states and 27 transitions. [2018-06-25 09:11:04,150 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:11:04,150 INFO ]: Found error trace [2018-06-25 09:11:04,150 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:04,150 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:04,151 INFO ]: Analyzing trace with hash 1121225436, now seen corresponding path program 1 times [2018-06-25 09:11:04,151 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:04,151 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:04,151 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:04,151 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:04,151 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:04,164 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:04,245 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:04,245 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:11:04,245 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:11:04,246 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:11:04,246 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:11:04,246 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:11:04,246 INFO ]: Start difference. First operand 11 states and 27 transitions. Second operand 4 states. [2018-06-25 09:11:04,348 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:04,349 INFO ]: Finished difference Result 14 states and 30 transitions. [2018-06-25 09:11:04,356 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:11:04,356 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-25 09:11:04,356 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:04,357 INFO ]: With dead ends: 14 [2018-06-25 09:11:04,357 INFO ]: Without dead ends: 14 [2018-06-25 09:11:04,357 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:11:04,357 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 09:11:04,358 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-06-25 09:11:04,359 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 09:11:04,359 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 28 transitions. [2018-06-25 09:11:04,359 INFO ]: Start accepts. Automaton has 12 states and 28 transitions. Word has length 8 [2018-06-25 09:11:04,359 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:04,359 INFO ]: Abstraction has 12 states and 28 transitions. [2018-06-25 09:11:04,359 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:11:04,359 INFO ]: Start isEmpty. Operand 12 states and 28 transitions. [2018-06-25 09:11:04,359 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:11:04,359 INFO ]: Found error trace [2018-06-25 09:11:04,359 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:04,359 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:04,360 INFO ]: Analyzing trace with hash 1121255227, now seen corresponding path program 1 times [2018-06-25 09:11:04,360 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:04,360 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:04,360 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:04,360 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:04,360 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:04,373 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:04,441 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:04,441 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:11:04,441 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:11:04,441 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:11:04,441 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:11:04,441 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:11:04,441 INFO ]: Start difference. First operand 12 states and 28 transitions. Second operand 3 states. [2018-06-25 09:11:04,496 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:04,496 INFO ]: Finished difference Result 14 states and 28 transitions. [2018-06-25 09:11:04,497 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:11:04,497 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 09:11:04,497 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:04,498 INFO ]: With dead ends: 14 [2018-06-25 09:11:04,498 INFO ]: Without dead ends: 13 [2018-06-25 09:11:04,498 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:11:04,498 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 09:11:04,499 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 11. [2018-06-25 09:11:04,499 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 09:11:04,499 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2018-06-25 09:11:04,500 INFO ]: Start accepts. Automaton has 11 states and 23 transitions. Word has length 8 [2018-06-25 09:11:04,500 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:04,500 INFO ]: Abstraction has 11 states and 23 transitions. [2018-06-25 09:11:04,500 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:11:04,500 INFO ]: Start isEmpty. Operand 11 states and 23 transitions. [2018-06-25 09:11:04,500 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:11:04,500 INFO ]: Found error trace [2018-06-25 09:11:04,500 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:04,500 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:04,500 INFO ]: Analyzing trace with hash 1158285440, now seen corresponding path program 1 times [2018-06-25 09:11:04,500 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:04,500 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:04,505 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:04,505 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:04,505 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:04,518 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:04,553 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:04,553 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:11:04,553 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:11:04,554 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:11:04,554 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:11:04,554 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:11:04,554 INFO ]: Start difference. First operand 11 states and 23 transitions. Second operand 3 states. [2018-06-25 09:11:04,568 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:04,568 INFO ]: Finished difference Result 11 states and 19 transitions. [2018-06-25 09:11:04,569 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:11:04,569 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 09:11:04,569 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:04,569 INFO ]: With dead ends: 11 [2018-06-25 09:11:04,569 INFO ]: Without dead ends: 11 [2018-06-25 09:11:04,570 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:11:04,570 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 09:11:04,571 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-25 09:11:04,571 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 09:11:04,571 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2018-06-25 09:11:04,571 INFO ]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 8 [2018-06-25 09:11:04,571 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:04,571 INFO ]: Abstraction has 11 states and 19 transitions. [2018-06-25 09:11:04,571 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:11:04,571 INFO ]: Start isEmpty. Operand 11 states and 19 transitions. [2018-06-25 09:11:04,571 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:11:04,571 INFO ]: Found error trace [2018-06-25 09:11:04,571 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:04,572 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:04,572 INFO ]: Analyzing trace with hash 1157481083, now seen corresponding path program 1 times [2018-06-25 09:11:04,572 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:04,572 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:04,572 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:04,572 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:04,572 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:04,585 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:04,603 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:04,603 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:11:04,603 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:11:04,603 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:11:04,603 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:11:04,603 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:11:04,604 INFO ]: Start difference. First operand 11 states and 19 transitions. Second operand 3 states. [2018-06-25 09:11:04,609 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:04,609 INFO ]: Finished difference Result 10 states and 14 transitions. [2018-06-25 09:11:04,610 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:11:04,610 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 09:11:04,610 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:04,610 INFO ]: With dead ends: 10 [2018-06-25 09:11:04,610 INFO ]: Without dead ends: 10 [2018-06-25 09:11:04,611 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:11:04,611 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 09:11:04,612 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-25 09:11:04,612 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 09:11:04,612 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2018-06-25 09:11:04,612 INFO ]: Start accepts. Automaton has 10 states and 14 transitions. Word has length 8 [2018-06-25 09:11:04,612 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:04,612 INFO ]: Abstraction has 10 states and 14 transitions. [2018-06-25 09:11:04,612 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:11:04,612 INFO ]: Start isEmpty. Operand 10 states and 14 transitions. [2018-06-25 09:11:04,612 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:11:04,612 INFO ]: Found error trace [2018-06-25 09:11:04,612 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:04,613 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:04,613 INFO ]: Analyzing trace with hash 1516330656, now seen corresponding path program 1 times [2018-06-25 09:11:04,613 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:04,613 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:04,613 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:04,613 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:04,613 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:04,628 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:04,665 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:04,665 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:11:04,684 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:11:04,684 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:11:04,685 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:11:04,685 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:11:04,685 INFO ]: Start difference. First operand 10 states and 14 transitions. Second operand 4 states. [2018-06-25 09:11:04,692 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:04,692 INFO ]: Finished difference Result 5 states and 5 transitions. [2018-06-25 09:11:04,692 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:11:04,692 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-25 09:11:04,692 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:04,692 INFO ]: With dead ends: 5 [2018-06-25 09:11:04,692 INFO ]: Without dead ends: 0 [2018-06-25 09:11:04,692 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 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-06-25 09:11:04,692 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-25 09:11:04,692 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-25 09:11:04,692 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-25 09:11:04,693 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-25 09:11:04,693 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2018-06-25 09:11:04,693 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:04,693 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-25 09:11:04,693 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:11:04,693 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-25 09:11:04,693 INFO ]: Finished isEmpty. No accepting run. [2018-06-25 09:11:04,697 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:11:04 BoogieIcfgContainer [2018-06-25 09:11:04,697 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:11:04,698 INFO ]: Toolchain (without parser) took 2607.30 ms. Allocated memory was 307.8 MB in the beginning and 325.6 MB in the end (delta: 17.8 MB). Free memory was 259.1 MB in the beginning and 272.0 MB in the end (delta: -12.9 MB). Peak memory consumption was 5.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:11:04,699 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 307.8 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:11:04,700 INFO ]: ChcToBoogie took 56.69 ms. Allocated memory is still 307.8 MB. Free memory was 259.1 MB in the beginning and 256.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:11:04,700 INFO ]: Boogie Preprocessor took 64.23 ms. Allocated memory is still 307.8 MB. Free memory was 256.2 MB in the beginning and 255.2 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 3.6 GB. [2018-06-25 09:11:04,701 INFO ]: RCFGBuilder took 638.24 ms. Allocated memory is still 307.8 MB. Free memory was 255.2 MB in the beginning and 238.2 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:11:04,701 INFO ]: TraceAbstraction took 1838.88 ms. Allocated memory was 307.8 MB in the beginning and 325.6 MB in the end (delta: 17.8 MB). Free memory was 237.2 MB in the beginning and 272.0 MB in the end (delta: -34.8 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:11:04,705 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 307.8 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 56.69 ms. Allocated memory is still 307.8 MB. Free memory was 259.1 MB in the beginning and 256.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 64.23 ms. Allocated memory is still 307.8 MB. Free memory was 256.2 MB in the beginning and 255.2 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 3.6 GB. * RCFGBuilder took 638.24 ms. Allocated memory is still 307.8 MB. Free memory was 255.2 MB in the beginning and 238.2 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 1838.88 ms. Allocated memory was 307.8 MB in the beginning and 325.6 MB in the end (delta: 17.8 MB). Free memory was 237.2 MB in the beginning and 272.0 MB in the end (delta: -34.8 MB). There was no memory consumed. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 12 locations, 1 error locations. SAFE Result, 1.7s OverallTime, 12 OverallIterations, 1 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 260 SDtfs, 48 SDslu, 144 SDs, 0 SdLazy, 91 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=0, 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, 12 MinimizatonAttempts, 9 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 976 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 4/4 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/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/011b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_09-11-04-719.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/011b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_09-11-04-719.csv Received shutdown request...