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/002-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 09:03:44,725 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 09:03:44,727 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 09:03:44,738 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 09:03:44,739 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 09:03:44,739 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 09:03:44,741 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 09:03:44,742 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 09:03:44,744 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 09:03:44,745 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 09:03:44,745 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 09:03:44,746 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 09:03:44,747 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 09:03:44,748 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 09:03:44,748 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 09:03:44,749 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 09:03:44,756 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 09:03:44,758 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 09:03:44,759 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 09:03:44,760 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 09:03:44,761 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 09:03:44,764 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 09:03:44,764 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 09:03:44,764 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 09:03:44,765 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 09:03:44,766 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 09:03:44,771 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 09:03:44,772 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 09:03:44,773 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 09:03:44,773 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 09:03:44,774 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 09:03:44,775 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 09:03:44,775 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 09:03:44,776 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 09:03:44,776 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 09:03:44,777 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:03:44,791 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 09:03:44,791 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 09:03:44,792 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 09:03:44,792 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 09:03:44,793 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 09:03:44,793 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 09:03:44,793 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 09:03:44,793 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 09:03:44,794 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 09:03:44,795 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 09:03:44,795 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 09:03:44,795 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 09:03:44,795 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:03:44,796 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 09:03:44,796 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 09:03:44,796 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 09:03:44,796 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 09:03:44,796 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 09:03:44,797 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 09:03:44,797 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 09:03:44,797 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 09:03:44,798 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 09:03:44,798 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 09:03:44,845 INFO ]: Repository-Root is: /tmp [2018-06-25 09:03:44,857 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 09:03:44,863 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 09:03:44,864 INFO ]: Initializing SmtParser... [2018-06-25 09:03:44,865 INFO ]: SmtParser initialized [2018-06-25 09:03:44,865 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/002-horn.smt2 [2018-06-25 09:03:44,866 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:03:44,958 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/002-horn.smt2 unknown [2018-06-25 09:03:45,210 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/002-horn.smt2 [2018-06-25 09:03:45,215 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 09:03:45,221 INFO ]: Walking toolchain with 4 elements. [2018-06-25 09:03:45,222 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 09:03:45,222 INFO ]: Initializing ChcToBoogie... [2018-06-25 09:03:45,222 INFO ]: ChcToBoogie initialized [2018-06-25 09:03:45,225 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:03:45" (1/1) ... [2018-06-25 09:03:45,282 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:03:45 Unit [2018-06-25 09:03:45,282 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 09:03:45,285 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 09:03:45,285 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 09:03:45,285 INFO ]: Boogie Preprocessor initialized [2018-06-25 09:03:45,306 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:03:45" (1/1) ... [2018-06-25 09:03:45,307 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:03:45" (1/1) ... [2018-06-25 09:03:45,313 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:03:45" (1/1) ... [2018-06-25 09:03:45,313 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:03:45" (1/1) ... [2018-06-25 09:03:45,318 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:03:45" (1/1) ... [2018-06-25 09:03:45,331 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:03:45" (1/1) ... [2018-06-25 09:03:45,332 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:03:45" (1/1) ... [2018-06-25 09:03:45,334 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 09:03:45,334 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 09:03:45,334 INFO ]: Initializing RCFGBuilder... [2018-06-25 09:03:45,334 INFO ]: RCFGBuilder initialized [2018-06-25 09:03:45,335 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:03:45" (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:03:45,354 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 09:03:45,355 INFO ]: Found specification of procedure gotoProc [2018-06-25 09:03:45,355 INFO ]: Found implementation of procedure gotoProc [2018-06-25 09:03:45,355 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 09:03:45,355 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 09:03:45,355 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:03:45,663 INFO ]: Using library mode [2018-06-25 09:03:45,664 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:03:45 BoogieIcfgContainer [2018-06-25 09:03:45,714 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 09:03:45,716 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 09:03:45,716 INFO ]: Initializing TraceAbstraction... [2018-06-25 09:03:45,719 INFO ]: TraceAbstraction initialized [2018-06-25 09:03:45,719 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:03:45" (1/3) ... [2018-06-25 09:03:45,720 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4701b646 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 09:03:45, skipping insertion in model container [2018-06-25 09:03:45,720 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:03:45" (2/3) ... [2018-06-25 09:03:45,721 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4701b646 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 09:03:45, skipping insertion in model container [2018-06-25 09:03:45,721 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:03:45" (3/3) ... [2018-06-25 09:03:45,723 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 09:03:45,730 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 09:03:45,737 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 09:03:45,775 INFO ]: Using default assertion order modulation [2018-06-25 09:03:45,776 INFO ]: Interprodecural is true [2018-06-25 09:03:45,776 INFO ]: Hoare is false [2018-06-25 09:03:45,776 INFO ]: Compute interpolants for FPandBP [2018-06-25 09:03:45,776 INFO ]: Backedges is TWOTRACK [2018-06-25 09:03:45,776 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 09:03:45,776 INFO ]: Difference is false [2018-06-25 09:03:45,776 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 09:03:45,776 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 09:03:45,787 INFO ]: Start isEmpty. Operand 12 states. [2018-06-25 09:03:45,797 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 09:03:45,797 INFO ]: Found error trace [2018-06-25 09:03:45,798 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 09:03:45,798 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:45,803 INFO ]: Analyzing trace with hash -1689093723, now seen corresponding path program 1 times [2018-06-25 09:03:45,804 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:45,805 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:45,846 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:45,846 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:45,846 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:45,870 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:45,895 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:03:45,897 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:03:45,897 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-25 09:03:45,898 INFO ]: Interpolant automaton has 2 states [2018-06-25 09:03:45,909 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-25 09:03:45,910 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-25 09:03:45,911 INFO ]: Start difference. First operand 12 states. Second operand 2 states. [2018-06-25 09:03:45,927 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:45,928 INFO ]: Finished difference Result 10 states and 18 transitions. [2018-06-25 09:03:45,928 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-25 09:03:45,929 INFO ]: Start accepts. Automaton has 2 states. Word has length 6 [2018-06-25 09:03:45,929 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:45,937 INFO ]: With dead ends: 10 [2018-06-25 09:03:45,937 INFO ]: Without dead ends: 10 [2018-06-25 09:03:45,939 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:03:45,954 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 09:03:45,968 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-25 09:03:45,969 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 09:03:45,970 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2018-06-25 09:03:45,972 INFO ]: Start accepts. Automaton has 10 states and 18 transitions. Word has length 6 [2018-06-25 09:03:45,972 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:45,972 INFO ]: Abstraction has 10 states and 18 transitions. [2018-06-25 09:03:45,972 INFO ]: Interpolant automaton has 2 states. [2018-06-25 09:03:45,972 INFO ]: Start isEmpty. Operand 10 states and 18 transitions. [2018-06-25 09:03:45,972 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:03:45,972 INFO ]: Found error trace [2018-06-25 09:03:45,972 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:45,972 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:45,973 INFO ]: Analyzing trace with hash -821409716, now seen corresponding path program 1 times [2018-06-25 09:03:45,973 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:45,973 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:45,973 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:45,973 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:45,973 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:45,999 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:46,078 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:03:46,078 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:03:46,078 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:03:46,080 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:03:46,080 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:03:46,080 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:03:46,080 INFO ]: Start difference. First operand 10 states and 18 transitions. Second operand 3 states. [2018-06-25 09:03:46,105 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:46,105 INFO ]: Finished difference Result 11 states and 19 transitions. [2018-06-25 09:03:46,106 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:03:46,106 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 09:03:46,106 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:46,106 INFO ]: With dead ends: 11 [2018-06-25 09:03:46,106 INFO ]: Without dead ends: 11 [2018-06-25 09:03:46,107 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:03:46,107 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 09:03:46,108 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-25 09:03:46,108 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 09:03:46,108 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2018-06-25 09:03:46,108 INFO ]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 7 [2018-06-25 09:03:46,109 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:46,109 INFO ]: Abstraction has 11 states and 19 transitions. [2018-06-25 09:03:46,109 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:03:46,109 INFO ]: Start isEmpty. Operand 11 states and 19 transitions. [2018-06-25 09:03:46,109 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:03:46,109 INFO ]: Found error trace [2018-06-25 09:03:46,109 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:46,109 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:46,109 INFO ]: Analyzing trace with hash -826682723, now seen corresponding path program 1 times [2018-06-25 09:03:46,109 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:46,109 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:46,110 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:46,110 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:46,110 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:46,119 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:46,169 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:03:46,169 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:03:46,169 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:03:46,169 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:03:46,169 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:03:46,169 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:03:46,170 INFO ]: Start difference. First operand 11 states and 19 transitions. Second operand 3 states. [2018-06-25 09:03:46,220 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:46,220 INFO ]: Finished difference Result 16 states and 31 transitions. [2018-06-25 09:03:46,220 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:03:46,220 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 09:03:46,220 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:46,222 INFO ]: With dead ends: 16 [2018-06-25 09:03:46,222 INFO ]: Without dead ends: 16 [2018-06-25 09:03:46,222 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:03:46,222 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 09:03:46,225 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-06-25 09:03:46,225 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 09:03:46,226 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2018-06-25 09:03:46,226 INFO ]: Start accepts. Automaton has 12 states and 24 transitions. Word has length 7 [2018-06-25 09:03:46,226 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:46,226 INFO ]: Abstraction has 12 states and 24 transitions. [2018-06-25 09:03:46,226 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:03:46,226 INFO ]: Start isEmpty. Operand 12 states and 24 transitions. [2018-06-25 09:03:46,227 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:03:46,227 INFO ]: Found error trace [2018-06-25 09:03:46,227 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:46,227 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:46,227 INFO ]: Analyzing trace with hash -826235858, now seen corresponding path program 1 times [2018-06-25 09:03:46,227 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:46,227 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:46,228 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:46,228 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:46,228 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:46,237 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:46,290 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:03:46,290 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:03:46,290 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:03:46,291 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:03:46,291 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:03:46,291 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:03:46,291 INFO ]: Start difference. First operand 12 states and 24 transitions. Second operand 3 states. [2018-06-25 09:03:46,327 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:46,327 INFO ]: Finished difference Result 15 states and 26 transitions. [2018-06-25 09:03:46,328 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:03:46,328 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 09:03:46,328 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:46,328 INFO ]: With dead ends: 15 [2018-06-25 09:03:46,328 INFO ]: Without dead ends: 15 [2018-06-25 09:03:46,329 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:03:46,329 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 09:03:46,331 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 12. [2018-06-25 09:03:46,331 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 09:03:46,331 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 22 transitions. [2018-06-25 09:03:46,331 INFO ]: Start accepts. Automaton has 12 states and 22 transitions. Word has length 7 [2018-06-25 09:03:46,331 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:46,331 INFO ]: Abstraction has 12 states and 22 transitions. [2018-06-25 09:03:46,331 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:03:46,331 INFO ]: Start isEmpty. Operand 12 states and 22 transitions. [2018-06-25 09:03:46,332 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:03:46,332 INFO ]: Found error trace [2018-06-25 09:03:46,332 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:46,332 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:46,332 INFO ]: Analyzing trace with hash 304220162, now seen corresponding path program 1 times [2018-06-25 09:03:46,332 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:46,332 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:46,333 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:46,333 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:46,333 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:46,345 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:46,384 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:03:46,384 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:03:46,384 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:03:46,385 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:03:46,385 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:03:46,385 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:03:46,385 INFO ]: Start difference. First operand 12 states and 22 transitions. Second operand 4 states. [2018-06-25 09:03:46,431 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:46,431 INFO ]: Finished difference Result 15 states and 25 transitions. [2018-06-25 09:03:46,432 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:03:46,432 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-25 09:03:46,432 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:46,432 INFO ]: With dead ends: 15 [2018-06-25 09:03:46,432 INFO ]: Without dead ends: 13 [2018-06-25 09:03:46,432 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:03:46,433 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 09:03:46,434 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 11. [2018-06-25 09:03:46,434 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 09:03:46,435 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 20 transitions. [2018-06-25 09:03:46,435 INFO ]: Start accepts. Automaton has 11 states and 20 transitions. Word has length 8 [2018-06-25 09:03:46,435 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:46,435 INFO ]: Abstraction has 11 states and 20 transitions. [2018-06-25 09:03:46,435 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:03:46,435 INFO ]: Start isEmpty. Operand 11 states and 20 transitions. [2018-06-25 09:03:46,435 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:03:46,435 INFO ]: Found error trace [2018-06-25 09:03:46,435 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:46,435 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:46,435 INFO ]: Analyzing trace with hash 145374550, now seen corresponding path program 1 times [2018-06-25 09:03:46,436 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:46,436 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:46,436 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:46,436 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:46,436 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:46,457 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:46,716 WARN ]: Spent 208.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2018-06-25 09:03:46,792 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:03:46,792 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:03:46,792 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:03:46,793 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:03:46,793 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:03:46,793 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:03:46,793 INFO ]: Start difference. First operand 11 states and 20 transitions. Second operand 4 states. [2018-06-25 09:03:46,864 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:46,864 INFO ]: Finished difference Result 12 states and 20 transitions. [2018-06-25 09:03:46,865 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:03:46,865 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-25 09:03:46,865 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:46,865 INFO ]: With dead ends: 12 [2018-06-25 09:03:46,865 INFO ]: Without dead ends: 12 [2018-06-25 09:03:46,865 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:03:46,866 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-25 09:03:46,866 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-25 09:03:46,866 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 09:03:46,867 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 20 transitions. [2018-06-25 09:03:46,867 INFO ]: Start accepts. Automaton has 12 states and 20 transitions. Word has length 8 [2018-06-25 09:03:46,867 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:46,867 INFO ]: Abstraction has 12 states and 20 transitions. [2018-06-25 09:03:46,867 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:03:46,867 INFO ]: Start isEmpty. Operand 12 states and 20 transitions. [2018-06-25 09:03:46,867 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:03:46,867 INFO ]: Found error trace [2018-06-25 09:03:46,868 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:46,868 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:46,868 INFO ]: Analyzing trace with hash 149068634, now seen corresponding path program 1 times [2018-06-25 09:03:46,868 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:46,868 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:46,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:46,869 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:46,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:46,886 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:46,923 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:03:46,923 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:03:46,923 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:03:46,923 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:03:46,923 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:03:46,923 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:03:46,923 INFO ]: Start difference. First operand 12 states and 20 transitions. Second operand 4 states. [2018-06-25 09:03:47,019 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:47,019 INFO ]: Finished difference Result 13 states and 21 transitions. [2018-06-25 09:03:47,019 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:03:47,020 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-25 09:03:47,020 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:47,020 INFO ]: With dead ends: 13 [2018-06-25 09:03:47,020 INFO ]: Without dead ends: 12 [2018-06-25 09:03:47,020 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:03:47,020 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-25 09:03:47,022 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-25 09:03:47,022 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 09:03:47,022 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 18 transitions. [2018-06-25 09:03:47,022 INFO ]: Start accepts. Automaton has 12 states and 18 transitions. Word has length 8 [2018-06-25 09:03:47,022 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:47,022 INFO ]: Abstraction has 12 states and 18 transitions. [2018-06-25 09:03:47,022 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:03:47,022 INFO ]: Start isEmpty. Operand 12 states and 18 transitions. [2018-06-25 09:03:47,022 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:03:47,022 INFO ]: Found error trace [2018-06-25 09:03:47,023 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:47,023 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:47,023 INFO ]: Analyzing trace with hash 152107316, now seen corresponding path program 1 times [2018-06-25 09:03:47,023 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:47,023 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:47,024 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:47,024 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:47,024 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:47,032 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:47,173 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:03:47,173 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:03:47,173 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:03:47,181 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:47,213 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:47,219 INFO ]: Computing forward predicates... [2018-06-25 09:03:47,254 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:03:47,274 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:03:47,274 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-06-25 09:03:47,274 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:03:47,275 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:03:47,275 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:03:47,275 INFO ]: Start difference. First operand 12 states and 18 transitions. Second operand 5 states. [2018-06-25 09:03:47,284 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:47,284 INFO ]: Finished difference Result 12 states and 17 transitions. [2018-06-25 09:03:47,285 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:03:47,285 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-25 09:03:47,285 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:47,285 INFO ]: With dead ends: 12 [2018-06-25 09:03:47,285 INFO ]: Without dead ends: 12 [2018-06-25 09:03:47,286 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 8 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:03:47,286 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-25 09:03:47,287 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-25 09:03:47,287 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 09:03:47,287 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2018-06-25 09:03:47,287 INFO ]: Start accepts. Automaton has 12 states and 17 transitions. Word has length 8 [2018-06-25 09:03:47,287 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:47,287 INFO ]: Abstraction has 12 states and 17 transitions. [2018-06-25 09:03:47,287 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:03:47,287 INFO ]: Start isEmpty. Operand 12 states and 17 transitions. [2018-06-25 09:03:47,288 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:03:47,288 INFO ]: Found error trace [2018-06-25 09:03:47,288 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:47,288 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:47,288 INFO ]: Analyzing trace with hash 209761336, now seen corresponding path program 1 times [2018-06-25 09:03:47,288 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:47,288 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:47,290 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:47,290 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:47,290 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:47,298 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:47,386 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:03:47,386 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:03:47,386 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-25 09:03:47,386 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:03:47,386 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:03:47,386 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:03:47,387 INFO ]: Start difference. First operand 12 states and 17 transitions. Second operand 5 states. [2018-06-25 09:03:47,429 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:47,429 INFO ]: Finished difference Result 12 states and 16 transitions. [2018-06-25 09:03:47,429 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:03:47,429 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-25 09:03:47,429 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:47,429 INFO ]: With dead ends: 12 [2018-06-25 09:03:47,430 INFO ]: Without dead ends: 10 [2018-06-25 09:03:47,430 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:03:47,430 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 09:03:47,431 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-25 09:03:47,431 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 09:03:47,431 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-06-25 09:03:47,431 INFO ]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 9 [2018-06-25 09:03:47,431 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:47,431 INFO ]: Abstraction has 10 states and 12 transitions. [2018-06-25 09:03:47,431 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:03:47,431 INFO ]: Start isEmpty. Operand 10 states and 12 transitions. [2018-06-25 09:03:47,432 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:03:47,432 INFO ]: Found error trace [2018-06-25 09:03:47,432 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:03:47,432 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:03:47,432 INFO ]: Analyzing trace with hash 434206730, now seen corresponding path program 1 times [2018-06-25 09:03:47,432 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:03:47,432 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:03:47,432 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:47,432 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:47,432 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:03:47,440 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:47,574 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:03:47,574 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:03:47,574 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:03:47,580 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:03:47,597 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:03:47,599 INFO ]: Computing forward predicates... [2018-06-25 09:03:47,671 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:03:47,690 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:03:47,690 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2018-06-25 09:03:47,690 INFO ]: Interpolant automaton has 6 states [2018-06-25 09:03:47,690 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 09:03:47,690 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-25 09:03:47,691 INFO ]: Start difference. First operand 10 states and 12 transitions. Second operand 6 states. [2018-06-25 09:03:47,860 WARN ]: Spent 159.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-06-25 09:03:48,118 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:03:48,119 INFO ]: Finished difference Result 7 states and 8 transitions. [2018-06-25 09:03:48,119 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 09:03:48,119 INFO ]: Start accepts. Automaton has 6 states. Word has length 9 [2018-06-25 09:03:48,119 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:03:48,119 INFO ]: With dead ends: 7 [2018-06-25 09:03:48,119 INFO ]: Without dead ends: 0 [2018-06-25 09:03:48,119 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-06-25 09:03:48,119 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-25 09:03:48,120 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-25 09:03:48,120 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-25 09:03:48,120 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-25 09:03:48,120 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2018-06-25 09:03:48,120 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:03:48,120 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-25 09:03:48,120 INFO ]: Interpolant automaton has 6 states. [2018-06-25 09:03:48,120 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-25 09:03:48,120 INFO ]: Finished isEmpty. No accepting run. [2018-06-25 09:03:48,123 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:03:48 BoogieIcfgContainer [2018-06-25 09:03:48,123 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:03:48,124 INFO ]: Toolchain (without parser) took 2909.12 ms. Allocated memory was 303.6 MB in the beginning and 324.0 MB in the end (delta: 20.4 MB). Free memory was 258.1 MB in the beginning and 262.7 MB in the end (delta: -4.6 MB). Peak memory consumption was 15.9 MB. Max. memory is 3.6 GB. [2018-06-25 09:03:48,125 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 303.6 MB. Free memory is still 268.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:03:48,125 INFO ]: ChcToBoogie took 63.16 ms. Allocated memory is still 303.6 MB. Free memory was 258.1 MB in the beginning and 256.1 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:03:48,126 INFO ]: Boogie Preprocessor took 48.58 ms. Allocated memory is still 303.6 MB. Free memory was 256.1 MB in the beginning and 254.1 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:03:48,127 INFO ]: RCFGBuilder took 380.04 ms. Allocated memory is still 303.6 MB. Free memory was 254.1 MB in the beginning and 242.1 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:03:48,127 INFO ]: TraceAbstraction took 2407.67 ms. Allocated memory was 303.6 MB in the beginning and 324.0 MB in the end (delta: 20.4 MB). Free memory was 242.1 MB in the beginning and 262.7 MB in the end (delta: -20.6 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:03:48,130 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 303.6 MB. Free memory is still 268.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 63.16 ms. Allocated memory is still 303.6 MB. Free memory was 258.1 MB in the beginning and 256.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 48.58 ms. Allocated memory is still 303.6 MB. Free memory was 256.1 MB in the beginning and 254.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 380.04 ms. Allocated memory is still 303.6 MB. Free memory was 254.1 MB in the beginning and 242.1 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 2407.67 ms. Allocated memory was 303.6 MB in the beginning and 324.0 MB in the end (delta: 20.4 MB). Free memory was 242.1 MB in the beginning and 262.7 MB in the end (delta: -20.6 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, 2.3s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 130 SDtfs, 51 SDslu, 110 SDs, 0 SdLazy, 70 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.2s 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, 10 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 82 ConstructedInterpolants, 0 QuantifiedInterpolants, 1203 SizeOfPredicates, 5 NumberOfNonLiveVariables, 178 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 4/6 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/002-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_09-03-48-141.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/002-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_09-03-48-141.csv Received shutdown request...