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/011-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 09:11:11,530 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 09:11:11,532 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 09:11:11,547 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 09:11:11,547 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 09:11:11,549 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 09:11:11,550 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 09:11:11,554 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 09:11:11,556 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 09:11:11,556 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 09:11:11,557 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 09:11:11,557 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 09:11:11,560 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 09:11:11,561 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 09:11:11,562 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 09:11:11,562 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 09:11:11,566 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 09:11:11,568 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 09:11:11,580 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 09:11:11,581 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 09:11:11,582 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 09:11:11,584 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 09:11:11,585 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 09:11:11,585 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 09:11:11,585 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 09:11:11,586 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 09:11:11,590 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 09:11:11,591 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 09:11:11,592 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 09:11:11,592 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 09:11:11,593 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 09:11:11,593 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 09:11:11,594 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 09:11:11,598 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 09:11:11,598 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 09:11:11,599 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:11,619 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 09:11:11,620 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 09:11:11,620 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 09:11:11,620 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 09:11:11,621 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 09:11:11,621 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 09:11:11,622 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 09:11:11,622 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 09:11:11,622 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 09:11:11,622 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 09:11:11,622 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 09:11:11,625 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 09:11:11,625 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:11:11,626 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 09:11:11,626 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 09:11:11,626 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 09:11:11,626 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 09:11:11,626 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 09:11:11,627 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 09:11:11,627 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 09:11:11,627 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 09:11:11,628 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 09:11:11,629 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 09:11:11,675 INFO ]: Repository-Root is: /tmp [2018-06-25 09:11:11,688 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 09:11:11,692 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 09:11:11,693 INFO ]: Initializing SmtParser... [2018-06-25 09:11:11,693 INFO ]: SmtParser initialized [2018-06-25 09:11:11,694 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/011-horn.smt2 [2018-06-25 09:11:11,695 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:11,764 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/011-horn.smt2 unknown [2018-06-25 09:11:12,071 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/011-horn.smt2 [2018-06-25 09:11:12,076 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 09:11:12,081 INFO ]: Walking toolchain with 4 elements. [2018-06-25 09:11:12,081 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 09:11:12,081 INFO ]: Initializing ChcToBoogie... [2018-06-25 09:11:12,081 INFO ]: ChcToBoogie initialized [2018-06-25 09:11:12,085 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:11:12" (1/1) ... [2018-06-25 09:11:12,145 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:11:12 Unit [2018-06-25 09:11:12,145 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 09:11:12,146 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 09:11:12,146 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 09:11:12,146 INFO ]: Boogie Preprocessor initialized [2018-06-25 09:11:12,171 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:11:12" (1/1) ... [2018-06-25 09:11:12,172 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:11:12" (1/1) ... [2018-06-25 09:11:12,179 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:11:12" (1/1) ... [2018-06-25 09:11:12,180 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:11:12" (1/1) ... [2018-06-25 09:11:12,188 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:11:12" (1/1) ... [2018-06-25 09:11:12,191 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:11:12" (1/1) ... [2018-06-25 09:11:12,193 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:11:12" (1/1) ... [2018-06-25 09:11:12,195 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 09:11:12,196 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 09:11:12,196 INFO ]: Initializing RCFGBuilder... [2018-06-25 09:11:12,196 INFO ]: RCFGBuilder initialized [2018-06-25 09:11:12,197 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:11:12" (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) [2018-06-25 09:11:12,215 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 09:11:12,215 INFO ]: Found specification of procedure gotoProc [2018-06-25 09:11:12,215 INFO ]: Found implementation of procedure gotoProc [2018-06-25 09:11:12,216 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 09:11:12,216 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 09:11:12,216 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:11:12,859 INFO ]: Using library mode [2018-06-25 09:11:12,860 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:11:12 BoogieIcfgContainer [2018-06-25 09:11:12,860 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 09:11:12,861 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 09:11:12,861 INFO ]: Initializing TraceAbstraction... [2018-06-25 09:11:12,865 INFO ]: TraceAbstraction initialized [2018-06-25 09:11:12,865 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:11:12" (1/3) ... [2018-06-25 09:11:12,866 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68a0d160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 09:11:12, skipping insertion in model container [2018-06-25 09:11:12,866 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:11:12" (2/3) ... [2018-06-25 09:11:12,866 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68a0d160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 09:11:12, skipping insertion in model container [2018-06-25 09:11:12,866 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:11:12" (3/3) ... [2018-06-25 09:11:12,868 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 09:11:12,878 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 09:11:12,887 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 09:11:12,938 INFO ]: Using default assertion order modulation [2018-06-25 09:11:12,938 INFO ]: Interprodecural is true [2018-06-25 09:11:12,938 INFO ]: Hoare is false [2018-06-25 09:11:12,938 INFO ]: Compute interpolants for FPandBP [2018-06-25 09:11:12,938 INFO ]: Backedges is TWOTRACK [2018-06-25 09:11:12,938 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 09:11:12,939 INFO ]: Difference is false [2018-06-25 09:11:12,939 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 09:11:12,939 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 09:11:12,957 INFO ]: Start isEmpty. Operand 12 states. [2018-06-25 09:11:12,970 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 09:11:12,970 INFO ]: Found error trace [2018-06-25 09:11:12,971 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 09:11:12,971 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:12,979 INFO ]: Analyzing trace with hash 372276645, now seen corresponding path program 1 times [2018-06-25 09:11:12,981 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:12,982 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:13,029 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:13,029 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:13,029 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:13,062 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:13,094 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:13,096 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:11:13,097 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-25 09:11:13,099 INFO ]: Interpolant automaton has 2 states [2018-06-25 09:11:13,116 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-25 09:11:13,116 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-25 09:11:13,119 INFO ]: Start difference. First operand 12 states. Second operand 2 states. [2018-06-25 09:11:13,145 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:13,145 INFO ]: Finished difference Result 10 states and 34 transitions. [2018-06-25 09:11:13,145 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-25 09:11:13,146 INFO ]: Start accepts. Automaton has 2 states. Word has length 6 [2018-06-25 09:11:13,147 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:13,155 INFO ]: With dead ends: 10 [2018-06-25 09:11:13,155 INFO ]: Without dead ends: 10 [2018-06-25 09:11:13,156 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:13,172 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 09:11:13,187 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-25 09:11:13,188 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 09:11:13,189 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 34 transitions. [2018-06-25 09:11:13,190 INFO ]: Start accepts. Automaton has 10 states and 34 transitions. Word has length 6 [2018-06-25 09:11:13,192 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:13,192 INFO ]: Abstraction has 10 states and 34 transitions. [2018-06-25 09:11:13,192 INFO ]: Interpolant automaton has 2 states. [2018-06-25 09:11:13,192 INFO ]: Start isEmpty. Operand 10 states and 34 transitions. [2018-06-25 09:11:13,192 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:11:13,192 INFO ]: Found error trace [2018-06-25 09:11:13,192 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:13,192 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:13,192 INFO ]: Analyzing trace with hash -1331223366, now seen corresponding path program 1 times [2018-06-25 09:11:13,193 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:13,193 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:13,193 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:13,193 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:13,193 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:13,215 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:13,288 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:13,288 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:11:13,289 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:11:13,290 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:11:13,290 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:11:13,290 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:11:13,290 INFO ]: Start difference. First operand 10 states and 34 transitions. Second operand 3 states. [2018-06-25 09:11:13,497 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:13,497 INFO ]: Finished difference Result 11 states and 34 transitions. [2018-06-25 09:11:13,497 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:11:13,497 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 09:11:13,497 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:13,498 INFO ]: With dead ends: 11 [2018-06-25 09:11:13,498 INFO ]: Without dead ends: 10 [2018-06-25 09:11:13,499 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:13,499 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 09:11:13,501 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-25 09:11:13,501 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 09:11:13,501 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 31 transitions. [2018-06-25 09:11:13,501 INFO ]: Start accepts. Automaton has 10 states and 31 transitions. Word has length 7 [2018-06-25 09:11:13,502 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:13,502 INFO ]: Abstraction has 10 states and 31 transitions. [2018-06-25 09:11:13,502 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:11:13,502 INFO ]: Start isEmpty. Operand 10 states and 31 transitions. [2018-06-25 09:11:13,502 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:11:13,502 INFO ]: Found error trace [2018-06-25 09:11:13,502 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:13,502 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:13,502 INFO ]: Analyzing trace with hash -1343348303, now seen corresponding path program 1 times [2018-06-25 09:11:13,502 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:13,502 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:13,503 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:13,503 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:13,503 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:13,509 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:13,545 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:13,545 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:11:13,545 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:11:13,546 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:11:13,546 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:11:13,546 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:11:13,546 INFO ]: Start difference. First operand 10 states and 31 transitions. Second operand 3 states. [2018-06-25 09:11:13,670 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:13,670 INFO ]: Finished difference Result 11 states and 31 transitions. [2018-06-25 09:11:13,670 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:11:13,670 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 09:11:13,670 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:13,671 INFO ]: With dead ends: 11 [2018-06-25 09:11:13,671 INFO ]: Without dead ends: 10 [2018-06-25 09:11:13,671 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:13,671 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 09:11:13,673 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-25 09:11:13,673 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 09:11:13,673 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 27 transitions. [2018-06-25 09:11:13,673 INFO ]: Start accepts. Automaton has 10 states and 27 transitions. Word has length 7 [2018-06-25 09:11:13,673 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:13,673 INFO ]: Abstraction has 10 states and 27 transitions. [2018-06-25 09:11:13,673 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:11:13,673 INFO ]: Start isEmpty. Operand 10 states and 27 transitions. [2018-06-25 09:11:13,674 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:11:13,674 INFO ]: Found error trace [2018-06-25 09:11:13,674 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:13,674 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:13,674 INFO ]: Analyzing trace with hash -1323537288, now seen corresponding path program 1 times [2018-06-25 09:11:13,674 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:13,674 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:13,675 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:13,675 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:13,675 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:13,681 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:13,738 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:13,738 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:11:13,738 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:11:13,738 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:11:13,738 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:11:13,738 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:11:13,739 INFO ]: Start difference. First operand 10 states and 27 transitions. Second operand 3 states. [2018-06-25 09:11:13,811 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:13,811 INFO ]: Finished difference Result 11 states and 27 transitions. [2018-06-25 09:11:13,812 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:11:13,812 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 09:11:13,812 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:13,812 INFO ]: With dead ends: 11 [2018-06-25 09:11:13,812 INFO ]: Without dead ends: 10 [2018-06-25 09:11:13,812 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:13,813 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 09:11:13,814 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-25 09:11:13,814 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 09:11:13,815 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 25 transitions. [2018-06-25 09:11:13,815 INFO ]: Start accepts. Automaton has 10 states and 25 transitions. Word has length 7 [2018-06-25 09:11:13,815 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:13,815 INFO ]: Abstraction has 10 states and 25 transitions. [2018-06-25 09:11:13,815 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:11:13,815 INFO ]: Start isEmpty. Operand 10 states and 25 transitions. [2018-06-25 09:11:13,815 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:11:13,815 INFO ]: Found error trace [2018-06-25 09:11:13,815 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:13,815 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:13,815 INFO ]: Analyzing trace with hash -1335960135, now seen corresponding path program 1 times [2018-06-25 09:11:13,815 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:13,816 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:13,816 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:13,816 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:13,816 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:13,825 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:13,871 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:13,871 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:11:13,871 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:11:13,871 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:11:13,872 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:11:13,872 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:11:13,872 INFO ]: Start difference. First operand 10 states and 25 transitions. Second operand 3 states. [2018-06-25 09:11:13,907 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:13,907 INFO ]: Finished difference Result 11 states and 26 transitions. [2018-06-25 09:11:13,907 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:11:13,907 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 09:11:13,907 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:13,908 INFO ]: With dead ends: 11 [2018-06-25 09:11:13,908 INFO ]: Without dead ends: 11 [2018-06-25 09:11:13,908 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:13,908 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 09:11:13,911 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-25 09:11:13,911 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 09:11:13,911 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 26 transitions. [2018-06-25 09:11:13,911 INFO ]: Start accepts. Automaton has 11 states and 26 transitions. Word has length 7 [2018-06-25 09:11:13,911 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:13,911 INFO ]: Abstraction has 11 states and 26 transitions. [2018-06-25 09:11:13,911 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:11:13,911 INFO ]: Start isEmpty. Operand 11 states and 26 transitions. [2018-06-25 09:11:13,912 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:11:13,912 INFO ]: Found error trace [2018-06-25 09:11:13,912 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:13,912 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:13,912 INFO ]: Analyzing trace with hash -1348472355, now seen corresponding path program 1 times [2018-06-25 09:11:13,912 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:13,912 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:13,914 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:13,914 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:13,914 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:13,929 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:13,956 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:13,956 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:11:13,956 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:11:13,956 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:11:13,956 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:11:13,956 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:11:13,957 INFO ]: Start difference. First operand 11 states and 26 transitions. Second operand 3 states. [2018-06-25 09:11:13,997 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:13,997 INFO ]: Finished difference Result 15 states and 34 transitions. [2018-06-25 09:11:13,997 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:11:13,997 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 09:11:13,998 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:14,000 INFO ]: With dead ends: 15 [2018-06-25 09:11:14,000 INFO ]: Without dead ends: 15 [2018-06-25 09:11:14,000 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:14,000 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 09:11:14,004 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 12. [2018-06-25 09:11:14,004 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 09:11:14,004 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 29 transitions. [2018-06-25 09:11:14,005 INFO ]: Start accepts. Automaton has 12 states and 29 transitions. Word has length 7 [2018-06-25 09:11:14,005 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:14,005 INFO ]: Abstraction has 12 states and 29 transitions. [2018-06-25 09:11:14,005 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:11:14,005 INFO ]: Start isEmpty. Operand 12 states and 29 transitions. [2018-06-25 09:11:14,005 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:11:14,005 INFO ]: Found error trace [2018-06-25 09:11:14,005 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:14,005 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:14,005 INFO ]: Analyzing trace with hash 1525727634, now seen corresponding path program 1 times [2018-06-25 09:11:14,005 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:14,005 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:14,006 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:14,006 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:14,006 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:14,018 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:14,090 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:14,090 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:11:14,090 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:11:14,090 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:11:14,090 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:11:14,090 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:11:14,090 INFO ]: Start difference. First operand 12 states and 29 transitions. Second operand 3 states. [2018-06-25 09:11:14,159 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:14,159 INFO ]: Finished difference Result 14 states and 30 transitions. [2018-06-25 09:11:14,161 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:11:14,161 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 09:11:14,162 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:14,162 INFO ]: With dead ends: 14 [2018-06-25 09:11:14,162 INFO ]: Without dead ends: 13 [2018-06-25 09:11:14,162 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:14,162 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 09:11:14,164 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 11. [2018-06-25 09:11:14,164 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 09:11:14,165 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 27 transitions. [2018-06-25 09:11:14,165 INFO ]: Start accepts. Automaton has 11 states and 27 transitions. Word has length 8 [2018-06-25 09:11:14,165 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:14,165 INFO ]: Abstraction has 11 states and 27 transitions. [2018-06-25 09:11:14,165 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:11:14,165 INFO ]: Start isEmpty. Operand 11 states and 27 transitions. [2018-06-25 09:11:14,165 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:11:14,165 INFO ]: Found error trace [2018-06-25 09:11:14,165 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:14,165 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:14,165 INFO ]: Analyzing trace with hash 1121225436, now seen corresponding path program 1 times [2018-06-25 09:11:14,165 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:14,165 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:14,168 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:14,168 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:14,168 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:14,192 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:14,405 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:14,406 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:11:14,406 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:11:14,406 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:11:14,406 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:11:14,406 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:11:14,406 INFO ]: Start difference. First operand 11 states and 27 transitions. Second operand 4 states. [2018-06-25 09:11:14,523 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:14,523 INFO ]: Finished difference Result 14 states and 30 transitions. [2018-06-25 09:11:14,523 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:11:14,524 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-25 09:11:14,524 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:14,524 INFO ]: With dead ends: 14 [2018-06-25 09:11:14,524 INFO ]: Without dead ends: 14 [2018-06-25 09:11:14,524 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:11:14,525 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 09:11:14,526 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-06-25 09:11:14,526 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 09:11:14,527 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 28 transitions. [2018-06-25 09:11:14,527 INFO ]: Start accepts. Automaton has 12 states and 28 transitions. Word has length 8 [2018-06-25 09:11:14,527 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:14,527 INFO ]: Abstraction has 12 states and 28 transitions. [2018-06-25 09:11:14,527 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:11:14,527 INFO ]: Start isEmpty. Operand 12 states and 28 transitions. [2018-06-25 09:11:14,527 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:11:14,527 INFO ]: Found error trace [2018-06-25 09:11:14,527 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:14,527 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:14,527 INFO ]: Analyzing trace with hash 1121255227, now seen corresponding path program 1 times [2018-06-25 09:11:14,527 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:14,527 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:14,528 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:14,528 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:14,528 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:14,535 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:14,556 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:14,556 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:11:14,556 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:11:14,556 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:11:14,556 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:11:14,556 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:11:14,556 INFO ]: Start difference. First operand 12 states and 28 transitions. Second operand 3 states. [2018-06-25 09:11:14,562 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:14,562 INFO ]: Finished difference Result 14 states and 28 transitions. [2018-06-25 09:11:14,562 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:11:14,562 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 09:11:14,562 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:14,563 INFO ]: With dead ends: 14 [2018-06-25 09:11:14,563 INFO ]: Without dead ends: 13 [2018-06-25 09:11:14,563 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:14,563 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 09:11:14,564 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 11. [2018-06-25 09:11:14,564 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 09:11:14,565 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2018-06-25 09:11:14,565 INFO ]: Start accepts. Automaton has 11 states and 23 transitions. Word has length 8 [2018-06-25 09:11:14,565 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:14,565 INFO ]: Abstraction has 11 states and 23 transitions. [2018-06-25 09:11:14,565 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:11:14,565 INFO ]: Start isEmpty. Operand 11 states and 23 transitions. [2018-06-25 09:11:14,565 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:11:14,565 INFO ]: Found error trace [2018-06-25 09:11:14,565 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:14,565 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:14,566 INFO ]: Analyzing trace with hash 1158285440, now seen corresponding path program 1 times [2018-06-25 09:11:14,566 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:14,566 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:14,566 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:14,566 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:14,566 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:14,575 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:14,635 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:14,635 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:11:14,635 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:11:14,636 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:11:14,636 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:11:14,636 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:11:14,636 INFO ]: Start difference. First operand 11 states and 23 transitions. Second operand 3 states. [2018-06-25 09:11:14,675 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:14,675 INFO ]: Finished difference Result 11 states and 19 transitions. [2018-06-25 09:11:14,676 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:11:14,676 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 09:11:14,676 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:14,676 INFO ]: With dead ends: 11 [2018-06-25 09:11:14,676 INFO ]: Without dead ends: 11 [2018-06-25 09:11:14,677 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:14,677 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 09:11:14,678 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-25 09:11:14,678 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 09:11:14,678 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2018-06-25 09:11:14,678 INFO ]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 8 [2018-06-25 09:11:14,679 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:14,679 INFO ]: Abstraction has 11 states and 19 transitions. [2018-06-25 09:11:14,679 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:11:14,679 INFO ]: Start isEmpty. Operand 11 states and 19 transitions. [2018-06-25 09:11:14,679 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:11:14,679 INFO ]: Found error trace [2018-06-25 09:11:14,679 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:14,679 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:14,679 INFO ]: Analyzing trace with hash 1157481083, now seen corresponding path program 1 times [2018-06-25 09:11:14,679 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:14,679 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:14,680 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:14,680 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:14,680 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:14,702 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:14,783 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:14,783 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:11:14,783 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:11:14,784 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:11:14,784 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:11:14,784 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:11:14,784 INFO ]: Start difference. First operand 11 states and 19 transitions. Second operand 3 states. [2018-06-25 09:11:14,791 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:14,791 INFO ]: Finished difference Result 10 states and 14 transitions. [2018-06-25 09:11:14,792 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:11:14,792 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 09:11:14,792 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:14,792 INFO ]: With dead ends: 10 [2018-06-25 09:11:14,792 INFO ]: Without dead ends: 10 [2018-06-25 09:11:14,793 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:14,793 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 09:11:14,794 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-25 09:11:14,794 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 09:11:14,794 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2018-06-25 09:11:14,794 INFO ]: Start accepts. Automaton has 10 states and 14 transitions. Word has length 8 [2018-06-25 09:11:14,794 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:14,794 INFO ]: Abstraction has 10 states and 14 transitions. [2018-06-25 09:11:14,794 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:11:14,794 INFO ]: Start isEmpty. Operand 10 states and 14 transitions. [2018-06-25 09:11:14,795 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:11:14,795 INFO ]: Found error trace [2018-06-25 09:11:14,795 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:14,795 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:14,795 INFO ]: Analyzing trace with hash 1516330656, now seen corresponding path program 1 times [2018-06-25 09:11:14,795 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:14,795 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:14,796 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:14,796 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:14,796 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:14,806 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:14,857 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:14,857 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:11:14,857 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:11:14,857 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:11:14,858 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:11:14,858 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:11:14,858 INFO ]: Start difference. First operand 10 states and 14 transitions. Second operand 4 states. [2018-06-25 09:11:14,866 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:14,866 INFO ]: Finished difference Result 5 states and 5 transitions. [2018-06-25 09:11:14,866 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:11:14,867 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-25 09:11:14,867 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:14,867 INFO ]: With dead ends: 5 [2018-06-25 09:11:14,867 INFO ]: Without dead ends: 0 [2018-06-25 09:11:14,867 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:14,867 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-25 09:11:14,867 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-25 09:11:14,867 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-25 09:11:14,867 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-25 09:11:14,867 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2018-06-25 09:11:14,867 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:14,867 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-25 09:11:14,867 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:11:14,867 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-25 09:11:14,867 INFO ]: Finished isEmpty. No accepting run. [2018-06-25 09:11:14,871 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:11:14 BoogieIcfgContainer [2018-06-25 09:11:14,871 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:11:14,872 INFO ]: Toolchain (without parser) took 2795.99 ms. Allocated memory was 304.1 MB in the beginning and 323.5 MB in the end (delta: 19.4 MB). Free memory was 254.5 MB in the beginning and 268.3 MB in the end (delta: -13.8 MB). Peak memory consumption was 5.6 MB. Max. memory is 3.6 GB. [2018-06-25 09:11:14,873 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 304.1 MB. Free memory is still 268.6 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:11:14,874 INFO ]: ChcToBoogie took 64.39 ms. Allocated memory is still 304.1 MB. Free memory was 254.5 MB in the beginning and 252.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:11:14,874 INFO ]: Boogie Preprocessor took 49.29 ms. Allocated memory is still 304.1 MB. Free memory was 252.5 MB in the beginning and 250.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:11:14,875 INFO ]: RCFGBuilder took 664.01 ms. Allocated memory is still 304.1 MB. Free memory was 250.5 MB in the beginning and 234.5 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:11:14,875 INFO ]: TraceAbstraction took 2010.51 ms. Allocated memory was 304.1 MB in the beginning and 323.5 MB in the end (delta: 19.4 MB). Free memory was 232.5 MB in the beginning and 268.3 MB in the end (delta: -35.8 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:11:14,878 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 304.1 MB. Free memory is still 268.6 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 64.39 ms. Allocated memory is still 304.1 MB. Free memory was 254.5 MB in the beginning and 252.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 49.29 ms. Allocated memory is still 304.1 MB. Free memory was 252.5 MB in the beginning and 250.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 664.01 ms. Allocated memory is still 304.1 MB. Free memory was 250.5 MB in the beginning and 234.5 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 2010.51 ms. Allocated memory was 304.1 MB in the beginning and 323.5 MB in the end (delta: 19.4 MB). Free memory was 232.5 MB in the beginning and 268.3 MB in the end (delta: -35.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.9s OverallTime, 12 OverallIterations, 1 TraceHistogramMax, 0.8s 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.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s 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.7s 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/011-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_09-11-14-888.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/011-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_09-11-14-888.csv Received shutdown request...