java -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/chccomp2018/chcToBoogie_automizer.epf -i /storage/chc-comp/llreve-bench/unsolved/arrayOffByOne.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-55b8104 [2018-06-18 11:52:43,771 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-18 11:52:43,773 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-18 11:52:43,788 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-18 11:52:43,789 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-18 11:52:43,790 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-18 11:52:43,791 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-18 11:52:43,793 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-18 11:52:43,795 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-18 11:52:43,796 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-18 11:52:43,797 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-18 11:52:43,797 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-18 11:52:43,798 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-18 11:52:43,799 INFO L177 SettingsManager]: ChcToBoogie provides no preferences, ignoring... [2018-06-18 11:52:43,799 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-18 11:52:43,800 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-18 11:52:43,802 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-18 11:52:43,804 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-18 11:52:43,805 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-18 11:52:43,806 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-18 11:52:43,808 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-18 11:52:43,811 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-18 11:52:43,811 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-18 11:52:43,811 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-18 11:52:43,812 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-18 11:52:43,813 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-18 11:52:43,814 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-18 11:52:43,814 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-18 11:52:43,815 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-18 11:52:43,816 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-18 11:52:43,816 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-18 11:52:43,817 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-18 11:52:43,817 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-18 11:52:43,818 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-18 11:52:43,819 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-18 11:52:43,819 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chccomp2018/chcToBoogie_automizer.epf [2018-06-18 11:52:43,832 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-18 11:52:43,833 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-18 11:52:43,833 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-18 11:52:43,833 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-18 11:52:43,835 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-18 11:52:43,835 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-18 11:52:43,835 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-18 11:52:43,835 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-18 11:52:43,836 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-18 11:52:43,836 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-18 11:52:43,836 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-18 11:52:43,836 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-18 11:52:43,837 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-18 11:52:43,837 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-18 11:52:43,837 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-18 11:52:43,837 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-18 11:52:43,837 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-18 11:52:43,839 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-18 11:52:43,839 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-18 11:52:43,876 INFO ]: Repository-Root is: /tmp [2018-06-18 11:52:43,888 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-18 11:52:43,893 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-18 11:52:43,895 INFO ]: Initializing SmtParser... [2018-06-18 11:52:43,895 INFO ]: SmtParser initialized [2018-06-18 11:52:43,896 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/unsolved/arrayOffByOne.smt2 [2018-06-18 11:52:43,897 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-18 11:52:43,989 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/unsolved/arrayOffByOne.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@537e658c [2018-06-18 11:52:44,191 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/unsolved/arrayOffByOne.smt2 [2018-06-18 11:52:44,198 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-18 11:52:44,206 INFO ]: Walking toolchain with 4 elements. [2018-06-18 11:52:44,207 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-18 11:52:44,207 INFO ]: Initializing ChcToBoogie... [2018-06-18 11:52:44,207 INFO ]: ChcToBoogie initialized [2018-06-18 11:52:44,214 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 18.06 11:52:44" (1/1) ... [2018-06-18 11:52:44,258 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:52:44 Unit [2018-06-18 11:52:44,258 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-18 11:52:44,259 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-18 11:52:44,259 INFO ]: Initializing Boogie Preprocessor... [2018-06-18 11:52:44,259 INFO ]: Boogie Preprocessor initialized [2018-06-18 11:52:44,283 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:52:44" (1/1) ... [2018-06-18 11:52:44,283 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:52:44" (1/1) ... [2018-06-18 11:52:44,293 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:52:44" (1/1) ... [2018-06-18 11:52:44,293 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:52:44" (1/1) ... [2018-06-18 11:52:44,297 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:52:44" (1/1) ... [2018-06-18 11:52:44,298 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:52:44" (1/1) ... [2018-06-18 11:52:44,299 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:52:44" (1/1) ... [2018-06-18 11:52:44,302 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-18 11:52:44,303 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-18 11:52:44,303 INFO ]: Initializing RCFGBuilder... [2018-06-18 11:52:44,303 INFO ]: RCFGBuilder initialized [2018-06-18 11:52:44,303 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:52:44" (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-18 11:52:44,315 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-18 11:52:44,315 INFO ]: Found specification of procedure False [2018-06-18 11:52:44,315 INFO ]: Found implementation of procedure False [2018-06-18 11:52:44,315 INFO ]: Specification and implementation of procedure INV_MAIN_1 given in one single declaration [2018-06-18 11:52:44,315 INFO ]: Found specification of procedure INV_MAIN_1 [2018-06-18 11:52:44,315 INFO ]: Found implementation of procedure INV_MAIN_1 [2018-06-18 11:52:44,315 INFO ]: Specification and implementation of procedure INV_MAIN_2 given in one single declaration [2018-06-18 11:52:44,315 INFO ]: Found specification of procedure INV_MAIN_2 [2018-06-18 11:52:44,315 INFO ]: Found implementation of procedure INV_MAIN_2 [2018-06-18 11:52:44,315 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-18 11:52:44,315 INFO ]: Found specification of procedure Ultimate.START [2018-06-18 11:52:44,315 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-18 11:52:44,614 INFO ]: Using library mode [2018-06-18 11:52:44,615 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.06 11:52:44 BoogieIcfgContainer [2018-06-18 11:52:44,615 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-18 11:52:44,620 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-18 11:52:44,620 INFO ]: Initializing TraceAbstraction... [2018-06-18 11:52:44,624 INFO ]: TraceAbstraction initialized [2018-06-18 11:52:44,624 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 18.06 11:52:44" (1/3) ... [2018-06-18 11:52:44,625 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a6dedb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 18.06 11:52:44, skipping insertion in model container [2018-06-18 11:52:44,625 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:52:44" (2/3) ... [2018-06-18 11:52:44,625 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a6dedb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.06 11:52:44, skipping insertion in model container [2018-06-18 11:52:44,625 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.06 11:52:44" (3/3) ... [2018-06-18 11:52:44,627 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-18 11:52:44,637 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-18 11:52:44,645 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-18 11:52:44,678 INFO ]: Using default assertion order modulation [2018-06-18 11:52:44,678 INFO ]: Interprodecural is true [2018-06-18 11:52:44,678 INFO ]: Hoare is false [2018-06-18 11:52:44,678 INFO ]: Compute interpolants for FPandBP [2018-06-18 11:52:44,678 INFO ]: Backedges is TWOTRACK [2018-06-18 11:52:44,678 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-18 11:52:44,678 INFO ]: Difference is false [2018-06-18 11:52:44,678 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-18 11:52:44,678 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-18 11:52:44,691 INFO ]: Start isEmpty. Operand 20 states. [2018-06-18 11:52:44,704 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-18 11:52:44,704 INFO ]: Found error trace [2018-06-18 11:52:44,705 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:52:44,705 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:52:44,709 INFO ]: Analyzing trace with hash 1966295479, now seen corresponding path program 1 times [2018-06-18 11:52:44,711 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:52:44,711 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:52:44,745 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:44,745 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:52:44,746 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:44,783 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:52:44,790 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:52:44,902 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-18 11:52:44,905 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-18 11:52:44,905 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-18 11:52:44,906 INFO ]: Interpolant automaton has 4 states [2018-06-18 11:52:44,917 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-18 11:52:44,917 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 11:52:44,919 INFO ]: Start difference. First operand 20 states. Second operand 4 states. [2018-06-18 11:52:45,030 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:52:45,030 INFO ]: Finished difference Result 20 states and 28 transitions. [2018-06-18 11:52:45,031 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-18 11:52:45,032 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-18 11:52:45,032 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:52:45,045 INFO ]: With dead ends: 20 [2018-06-18 11:52:45,045 INFO ]: Without dead ends: 20 [2018-06-18 11:52:45,049 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 11:52:45,066 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-18 11:52:45,089 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-18 11:52:45,090 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-18 11:52:45,091 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-06-18 11:52:45,092 INFO ]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 9 [2018-06-18 11:52:45,092 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:52:45,092 INFO ]: Abstraction has 20 states and 28 transitions. [2018-06-18 11:52:45,092 INFO ]: Interpolant automaton has 4 states. [2018-06-18 11:52:45,093 INFO ]: Start isEmpty. Operand 20 states and 28 transitions. [2018-06-18 11:52:45,094 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-18 11:52:45,094 INFO ]: Found error trace [2018-06-18 11:52:45,094 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:52:45,094 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:52:45,094 INFO ]: Analyzing trace with hash 966690814, now seen corresponding path program 1 times [2018-06-18 11:52:45,095 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:52:45,095 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:52:45,095 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:45,095 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:52:45,095 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:45,104 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:52:45,105 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:52:45,170 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-18 11:52:45,170 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-18 11:52:45,170 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-18 11:52:45,171 INFO ]: Interpolant automaton has 4 states [2018-06-18 11:52:45,171 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-18 11:52:45,172 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 11:52:45,172 INFO ]: Start difference. First operand 20 states and 28 transitions. Second operand 4 states. [2018-06-18 11:52:45,235 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:52:45,235 INFO ]: Finished difference Result 22 states and 31 transitions. [2018-06-18 11:52:45,236 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-18 11:52:45,236 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-18 11:52:45,236 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:52:45,237 INFO ]: With dead ends: 22 [2018-06-18 11:52:45,237 INFO ]: Without dead ends: 22 [2018-06-18 11:52:45,238 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 11:52:45,238 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-18 11:52:45,243 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-06-18 11:52:45,243 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-18 11:52:45,244 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2018-06-18 11:52:45,244 INFO ]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 13 [2018-06-18 11:52:45,244 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:52:45,244 INFO ]: Abstraction has 20 states and 27 transitions. [2018-06-18 11:52:45,244 INFO ]: Interpolant automaton has 4 states. [2018-06-18 11:52:45,244 INFO ]: Start isEmpty. Operand 20 states and 27 transitions. [2018-06-18 11:52:45,245 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-18 11:52:45,245 INFO ]: Found error trace [2018-06-18 11:52:45,245 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:52:45,245 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:52:45,245 INFO ]: Analyzing trace with hash 1878852379, now seen corresponding path program 1 times [2018-06-18 11:52:45,246 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:52:45,246 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:52:45,246 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:45,247 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:52:45,247 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:45,264 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:52:45,265 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:52:45,459 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-18 11:52:45,460 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-18 11:52:45,460 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-18 11:52:45,460 INFO ]: Interpolant automaton has 5 states [2018-06-18 11:52:45,460 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-18 11:52:45,460 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-18 11:52:45,460 INFO ]: Start difference. First operand 20 states and 27 transitions. Second operand 5 states. [2018-06-18 11:52:45,696 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:52:45,696 INFO ]: Finished difference Result 22 states and 28 transitions. [2018-06-18 11:52:45,697 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-18 11:52:45,697 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-18 11:52:45,697 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:52:45,699 INFO ]: With dead ends: 22 [2018-06-18 11:52:45,699 INFO ]: Without dead ends: 21 [2018-06-18 11:52:45,699 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-18 11:52:45,699 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-18 11:52:45,703 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-06-18 11:52:45,703 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-18 11:52:45,704 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-06-18 11:52:45,704 INFO ]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 13 [2018-06-18 11:52:45,704 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:52:45,704 INFO ]: Abstraction has 19 states and 24 transitions. [2018-06-18 11:52:45,704 INFO ]: Interpolant automaton has 5 states. [2018-06-18 11:52:45,704 INFO ]: Start isEmpty. Operand 19 states and 24 transitions. [2018-06-18 11:52:45,705 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-18 11:52:45,705 INFO ]: Found error trace [2018-06-18 11:52:45,705 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:52:45,705 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:52:45,705 INFO ]: Analyzing trace with hash 1555410658, now seen corresponding path program 1 times [2018-06-18 11:52:45,705 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:52:45,705 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:52:45,706 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:45,706 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:52:45,707 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:45,721 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:52:45,722 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:52:45,934 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 11:52:45,934 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:52:45,934 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-18 11:52:45,944 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:52:45,970 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:52:45,980 INFO ]: Computing forward predicates... [2018-06-18 11:52:46,462 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-18 11:52:46,486 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-18 11:52:46,486 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-06-18 11:52:46,487 INFO ]: Interpolant automaton has 10 states [2018-06-18 11:52:46,487 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-18 11:52:46,487 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-18 11:52:46,487 INFO ]: Start difference. First operand 19 states and 24 transitions. Second operand 10 states. [2018-06-18 11:52:46,989 WARN ]: Spent 105.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-06-18 11:52:47,215 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:52:47,215 INFO ]: Finished difference Result 23 states and 29 transitions. [2018-06-18 11:52:47,215 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-18 11:52:47,215 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-18 11:52:47,216 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:52:47,216 INFO ]: With dead ends: 23 [2018-06-18 11:52:47,216 INFO ]: Without dead ends: 23 [2018-06-18 11:52:47,216 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-06-18 11:52:47,217 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-18 11:52:47,223 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-06-18 11:52:47,223 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-18 11:52:47,223 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2018-06-18 11:52:47,223 INFO ]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 17 [2018-06-18 11:52:47,224 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:52:47,224 INFO ]: Abstraction has 21 states and 27 transitions. [2018-06-18 11:52:47,224 INFO ]: Interpolant automaton has 10 states. [2018-06-18 11:52:47,224 INFO ]: Start isEmpty. Operand 21 states and 27 transitions. [2018-06-18 11:52:47,224 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-18 11:52:47,224 INFO ]: Found error trace [2018-06-18 11:52:47,225 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:52:47,225 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:52:47,227 INFO ]: Analyzing trace with hash -793503654, now seen corresponding path program 1 times [2018-06-18 11:52:47,227 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:52:47,227 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:52:47,228 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:47,228 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:52:47,228 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:47,246 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:52:47,247 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:52:47,335 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-18 11:52:47,335 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-18 11:52:47,335 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-18 11:52:47,336 INFO ]: Interpolant automaton has 4 states [2018-06-18 11:52:47,336 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-18 11:52:47,336 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 11:52:47,336 INFO ]: Start difference. First operand 21 states and 27 transitions. Second operand 4 states. [2018-06-18 11:52:47,351 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:52:47,351 INFO ]: Finished difference Result 23 states and 28 transitions. [2018-06-18 11:52:47,352 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-18 11:52:47,352 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-18 11:52:47,352 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:52:47,352 INFO ]: With dead ends: 23 [2018-06-18 11:52:47,352 INFO ]: Without dead ends: 23 [2018-06-18 11:52:47,353 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 11:52:47,353 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-18 11:52:47,356 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-06-18 11:52:47,356 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-18 11:52:47,357 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2018-06-18 11:52:47,357 INFO ]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 17 [2018-06-18 11:52:47,357 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:52:47,357 INFO ]: Abstraction has 21 states and 26 transitions. [2018-06-18 11:52:47,357 INFO ]: Interpolant automaton has 4 states. [2018-06-18 11:52:47,357 INFO ]: Start isEmpty. Operand 21 states and 26 transitions. [2018-06-18 11:52:47,358 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-18 11:52:47,358 INFO ]: Found error trace [2018-06-18 11:52:47,358 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:52:47,358 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:52:47,359 INFO ]: Analyzing trace with hash 1609383847, now seen corresponding path program 1 times [2018-06-18 11:52:47,359 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:52:47,359 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:52:47,359 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:47,360 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:52:47,360 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:47,376 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:52:47,377 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:52:47,575 INFO ]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-18 11:52:47,575 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:52:47,575 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-18 11:52:47,584 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:52:47,599 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:52:47,602 INFO ]: Computing forward predicates... [2018-06-18 11:52:47,816 INFO ]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-18 11:52:47,847 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:52:47,847 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 14 [2018-06-18 11:52:47,847 INFO ]: Interpolant automaton has 14 states [2018-06-18 11:52:47,848 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-18 11:52:47,848 INFO ]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-06-18 11:52:47,848 INFO ]: Start difference. First operand 21 states and 26 transitions. Second operand 14 states. [2018-06-18 11:52:48,226 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:52:48,226 INFO ]: Finished difference Result 33 states and 42 transitions. [2018-06-18 11:52:48,227 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-18 11:52:48,227 INFO ]: Start accepts. Automaton has 14 states. Word has length 21 [2018-06-18 11:52:48,227 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:52:48,228 INFO ]: With dead ends: 33 [2018-06-18 11:52:48,228 INFO ]: Without dead ends: 33 [2018-06-18 11:52:48,228 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2018-06-18 11:52:48,229 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-18 11:52:48,234 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 29. [2018-06-18 11:52:48,234 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-18 11:52:48,235 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2018-06-18 11:52:48,235 INFO ]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 21 [2018-06-18 11:52:48,235 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:52:48,235 INFO ]: Abstraction has 29 states and 37 transitions. [2018-06-18 11:52:48,235 INFO ]: Interpolant automaton has 14 states. [2018-06-18 11:52:48,235 INFO ]: Start isEmpty. Operand 29 states and 37 transitions. [2018-06-18 11:52:48,236 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-18 11:52:48,236 INFO ]: Found error trace [2018-06-18 11:52:48,236 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:52:48,236 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:52:48,236 INFO ]: Analyzing trace with hash -744010977, now seen corresponding path program 1 times [2018-06-18 11:52:48,236 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:52:48,236 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:52:48,237 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:48,237 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:52:48,237 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:48,284 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:52:48,285 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:52:48,706 INFO ]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-18 11:52:48,706 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:52:48,706 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 11:52:48,719 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:52:48,742 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:52:48,746 INFO ]: Computing forward predicates... [2018-06-18 11:52:49,004 INFO ]: detected not equals via solver [2018-06-18 11:52:49,006 INFO ]: detected not equals via solver [2018-06-18 11:52:49,035 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 63 [2018-06-18 11:52:49,039 INFO ]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2018-06-18 11:52:49,067 INFO ]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-06-18 11:52:49,067 INFO ]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:41 [2018-06-18 11:52:49,352 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 11 [2018-06-18 11:52:49,352 INFO ]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-06-18 11:52:49,364 WARN ]: Array PQE input equivalent to false [2018-06-18 11:52:49,364 INFO ]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-06-18 11:52:49,368 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-06-18 11:52:49,368 INFO ]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-06-18 11:52:49,369 INFO ]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-18 11:52:49,369 INFO ]: Needed 4 recursive calls to eliminate 4 variables, input treesize:60, output treesize:3 [2018-06-18 11:52:49,372 INFO ]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-18 11:52:49,398 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:52:49,398 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-06-18 11:52:49,398 INFO ]: Interpolant automaton has 16 states [2018-06-18 11:52:49,398 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-18 11:52:49,398 INFO ]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-06-18 11:52:49,399 INFO ]: Start difference. First operand 29 states and 37 transitions. Second operand 16 states. [2018-06-18 11:52:49,961 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:52:49,961 INFO ]: Finished difference Result 33 states and 41 transitions. [2018-06-18 11:52:49,962 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-18 11:52:49,962 INFO ]: Start accepts. Automaton has 16 states. Word has length 21 [2018-06-18 11:52:49,962 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:52:49,963 INFO ]: With dead ends: 33 [2018-06-18 11:52:49,963 INFO ]: Without dead ends: 33 [2018-06-18 11:52:49,963 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2018-06-18 11:52:49,963 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-18 11:52:49,969 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-06-18 11:52:49,969 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-18 11:52:49,970 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2018-06-18 11:52:49,970 INFO ]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 21 [2018-06-18 11:52:49,970 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:52:49,970 INFO ]: Abstraction has 31 states and 39 transitions. [2018-06-18 11:52:49,970 INFO ]: Interpolant automaton has 16 states. [2018-06-18 11:52:49,970 INFO ]: Start isEmpty. Operand 31 states and 39 transitions. [2018-06-18 11:52:49,971 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-18 11:52:49,971 INFO ]: Found error trace [2018-06-18 11:52:49,971 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:52:49,971 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:52:49,971 INFO ]: Analyzing trace with hash -114701437, now seen corresponding path program 2 times [2018-06-18 11:52:49,971 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:52:49,971 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:52:49,972 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:49,972 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:52:49,972 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:49,986 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:52:49,987 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:52:50,105 INFO ]: Checked inductivity of 13 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-18 11:52:50,105 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:52:50,105 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 11:52:50,111 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-18 11:52:50,129 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-18 11:52:50,130 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:52:50,132 INFO ]: Computing forward predicates... [2018-06-18 11:52:50,341 INFO ]: Checked inductivity of 13 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-18 11:52:50,361 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:52:50,362 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2018-06-18 11:52:50,362 INFO ]: Interpolant automaton has 14 states [2018-06-18 11:52:50,362 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-18 11:52:50,362 INFO ]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-06-18 11:52:50,362 INFO ]: Start difference. First operand 31 states and 39 transitions. Second operand 14 states. [2018-06-18 11:52:50,730 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:52:50,730 INFO ]: Finished difference Result 33 states and 40 transitions. [2018-06-18 11:52:50,730 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-18 11:52:50,730 INFO ]: Start accepts. Automaton has 14 states. Word has length 25 [2018-06-18 11:52:50,730 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:52:50,731 INFO ]: With dead ends: 33 [2018-06-18 11:52:50,731 INFO ]: Without dead ends: 33 [2018-06-18 11:52:50,731 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2018-06-18 11:52:50,732 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-18 11:52:50,737 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-06-18 11:52:50,737 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-18 11:52:50,738 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2018-06-18 11:52:50,738 INFO ]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 25 [2018-06-18 11:52:50,738 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:52:50,738 INFO ]: Abstraction has 31 states and 38 transitions. [2018-06-18 11:52:50,738 INFO ]: Interpolant automaton has 14 states. [2018-06-18 11:52:50,738 INFO ]: Start isEmpty. Operand 31 states and 38 transitions. [2018-06-18 11:52:50,741 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-18 11:52:50,741 INFO ]: Found error trace [2018-06-18 11:52:50,741 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:52:50,741 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:52:50,741 INFO ]: Analyzing trace with hash 263702564, now seen corresponding path program 3 times [2018-06-18 11:52:50,741 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:52:50,741 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:52:50,742 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:50,742 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 11:52:50,742 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:50,766 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:52:50,767 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:52:50,876 INFO ]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-18 11:52:50,876 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:52:50,876 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 11:52:50,888 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-18 11:52:50,948 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-18 11:52:50,948 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:52:50,950 INFO ]: Computing forward predicates... [2018-06-18 11:52:51,016 INFO ]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-18 11:52:51,037 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:52:51,037 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2018-06-18 11:52:51,037 INFO ]: Interpolant automaton has 13 states [2018-06-18 11:52:51,038 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-18 11:52:51,038 INFO ]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-06-18 11:52:51,038 INFO ]: Start difference. First operand 31 states and 38 transitions. Second operand 13 states. [2018-06-18 11:52:51,203 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:52:51,203 INFO ]: Finished difference Result 29 states and 34 transitions. [2018-06-18 11:52:51,204 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-18 11:52:51,204 INFO ]: Start accepts. Automaton has 13 states. Word has length 25 [2018-06-18 11:52:51,204 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:52:51,205 INFO ]: With dead ends: 29 [2018-06-18 11:52:51,205 INFO ]: Without dead ends: 25 [2018-06-18 11:52:51,205 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-06-18 11:52:51,205 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-18 11:52:51,208 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-18 11:52:51,208 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-18 11:52:51,209 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2018-06-18 11:52:51,209 INFO ]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 25 [2018-06-18 11:52:51,209 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:52:51,209 INFO ]: Abstraction has 25 states and 30 transitions. [2018-06-18 11:52:51,209 INFO ]: Interpolant automaton has 13 states. [2018-06-18 11:52:51,209 INFO ]: Start isEmpty. Operand 25 states and 30 transitions. [2018-06-18 11:52:51,211 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-18 11:52:51,211 INFO ]: Found error trace [2018-06-18 11:52:51,211 INFO ]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:52:51,211 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:52:51,211 INFO ]: Analyzing trace with hash -1691576432, now seen corresponding path program 2 times [2018-06-18 11:52:51,211 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:52:51,211 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:52:51,212 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:51,212 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 11:52:51,212 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:51,228 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:52:51,229 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:52:51,394 INFO ]: Checked inductivity of 20 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-18 11:52:51,394 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:52:51,394 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 11:52:51,410 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-18 11:52:51,456 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-18 11:52:51,456 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:52:51,459 INFO ]: Computing forward predicates... [2018-06-18 11:52:51,605 INFO ]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-18 11:52:51,627 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:52:51,627 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 17 [2018-06-18 11:52:51,628 INFO ]: Interpolant automaton has 17 states [2018-06-18 11:52:51,628 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-18 11:52:51,628 INFO ]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-06-18 11:52:51,628 INFO ]: Start difference. First operand 25 states and 30 transitions. Second operand 17 states. [2018-06-18 11:52:51,971 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:52:51,971 INFO ]: Finished difference Result 39 states and 48 transitions. [2018-06-18 11:52:51,971 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-18 11:52:51,971 INFO ]: Start accepts. Automaton has 17 states. Word has length 29 [2018-06-18 11:52:51,972 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:52:51,972 INFO ]: With dead ends: 39 [2018-06-18 11:52:51,972 INFO ]: Without dead ends: 39 [2018-06-18 11:52:51,973 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2018-06-18 11:52:51,973 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-18 11:52:51,981 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 35. [2018-06-18 11:52:51,981 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-18 11:52:51,982 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2018-06-18 11:52:51,983 INFO ]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 29 [2018-06-18 11:52:51,983 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:52:51,983 INFO ]: Abstraction has 35 states and 43 transitions. [2018-06-18 11:52:51,983 INFO ]: Interpolant automaton has 17 states. [2018-06-18 11:52:51,983 INFO ]: Start isEmpty. Operand 35 states and 43 transitions. [2018-06-18 11:52:51,984 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-18 11:52:51,984 INFO ]: Found error trace [2018-06-18 11:52:51,984 INFO ]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:52:51,984 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:52:51,984 INFO ]: Analyzing trace with hash 117106440, now seen corresponding path program 4 times [2018-06-18 11:52:51,984 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:52:51,984 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:52:51,985 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:51,985 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 11:52:51,985 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:52,030 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:52:52,031 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:52:52,597 INFO ]: Checked inductivity of 20 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-18 11:52:52,597 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:52:52,597 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 11:52:52,607 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-18 11:52:52,643 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-18 11:52:52,643 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:52:52,648 INFO ]: Computing forward predicates... [2018-06-18 11:52:53,542 INFO ]: detected not equals via solver [2018-06-18 11:52:53,563 INFO ]: detected not equals via solver [2018-06-18 11:52:53,612 INFO ]: Index analysis took 236 ms [2018-06-18 11:52:53,801 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 68 [2018-06-18 11:52:53,803 INFO ]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2018-06-18 11:52:53,939 INFO ]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-06-18 11:52:53,939 INFO ]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:49 [2018-06-18 11:52:54,136 INFO ]: detected not equals via solver [2018-06-18 11:52:54,145 INFO ]: detected not equals via solver [2018-06-18 11:52:54,147 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 51 [2018-06-18 11:52:54,147 INFO ]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-06-18 11:52:54,309 INFO ]: detected not equals via solver [2018-06-18 11:52:54,310 INFO ]: Index analysis took 110 ms [2018-06-18 11:52:54,326 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 85 [2018-06-18 11:52:54,328 INFO ]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-06-18 11:52:54,404 INFO ]: detected not equals via solver [2018-06-18 11:52:54,406 INFO ]: detected not equals via solver [2018-06-18 11:52:54,407 INFO ]: detected not equals via solver [2018-06-18 11:52:54,407 INFO ]: detected not equals via solver [2018-06-18 11:52:54,408 INFO ]: detected not equals via solver [2018-06-18 11:52:54,411 INFO ]: detected not equals via solver [2018-06-18 11:52:54,411 INFO ]: detected not equals via solver [2018-06-18 11:52:54,416 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 107 [2018-06-18 11:52:54,417 INFO ]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-06-18 11:52:54,419 INFO ]: detected not equals via solver [2018-06-18 11:52:54,420 INFO ]: detected not equals via solver [2018-06-18 11:52:54,434 INFO ]: detected not equals via solver [2018-06-18 11:52:54,434 INFO ]: detected not equals via solver [2018-06-18 11:52:54,435 INFO ]: detected equality via solver [2018-06-18 11:52:54,439 INFO ]: detected not equals via solver [2018-06-18 11:52:54,440 INFO ]: detected not equals via solver [2018-06-18 11:52:54,443 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 113 [2018-06-18 11:52:54,444 INFO ]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-06-18 11:52:54,522 INFO ]: detected not equals via solver [2018-06-18 11:52:54,524 INFO ]: detected not equals via solver [2018-06-18 11:52:54,526 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 37 [2018-06-18 11:52:54,526 INFO ]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-06-18 11:52:54,643 INFO ]: Start of recursive call 1: 1 dim-0 vars, 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-06-18 11:52:54,643 INFO ]: Needed 6 recursive calls to eliminate 5 variables, input treesize:101, output treesize:98 [2018-06-18 11:52:55,008 WARN ]: Array PQE input equivalent to false [2018-06-18 11:52:55,008 INFO ]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-06-18 11:52:55,128 INFO ]: detected not equals via solver [2018-06-18 11:52:55,149 INFO ]: detected not equals via solver [2018-06-18 11:52:55,156 INFO ]: detected not equals via solver [2018-06-18 11:52:55,158 INFO ]: detected not equals via solver [2018-06-18 11:52:55,159 INFO ]: detected not equals via solver [2018-06-18 11:52:55,159 INFO ]: detected not equals via solver [2018-06-18 11:52:55,164 INFO ]: detected not equals via solver [2018-06-18 11:52:55,169 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 113 [2018-06-18 11:52:55,171 INFO ]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-06-18 11:52:55,228 INFO ]: detected not equals via solver [2018-06-18 11:52:55,229 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2018-06-18 11:52:55,230 INFO ]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-06-18 11:52:55,233 INFO ]: detected not equals via solver [2018-06-18 11:52:55,235 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2018-06-18 11:52:55,236 INFO ]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-06-18 11:52:55,277 INFO ]: detected not equals via solver [2018-06-18 11:52:55,278 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2018-06-18 11:52:55,279 INFO ]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-06-18 11:52:55,310 INFO ]: detected not equals via solver [2018-06-18 11:52:55,312 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-06-18 11:52:55,312 INFO ]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-06-18 11:52:55,341 INFO ]: Start of recursive call 1: 4 dim-0 vars, 6 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-06-18 11:52:55,341 INFO ]: Needed 7 recursive calls to eliminate 10 variables, input treesize:185, output treesize:39 [2018-06-18 11:52:55,468 INFO ]: Checked inductivity of 20 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-18 11:52:55,489 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:52:55,489 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2018-06-18 11:52:55,489 INFO ]: Interpolant automaton has 26 states [2018-06-18 11:52:55,489 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-18 11:52:55,489 INFO ]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2018-06-18 11:52:55,491 INFO ]: Start difference. First operand 35 states and 43 transitions. Second operand 26 states. [2018-06-18 11:52:55,880 WARN ]: Spent 129.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2018-06-18 11:52:56,146 WARN ]: Spent 145.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2018-06-18 11:52:56,548 WARN ]: Spent 159.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2018-06-18 11:52:56,743 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:52:56,743 INFO ]: Finished difference Result 38 states and 46 transitions. [2018-06-18 11:52:56,743 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-18 11:52:56,744 INFO ]: Start accepts. Automaton has 26 states. Word has length 29 [2018-06-18 11:52:56,744 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:52:56,744 INFO ]: With dead ends: 38 [2018-06-18 11:52:56,744 INFO ]: Without dead ends: 0 [2018-06-18 11:52:56,744 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=122, Invalid=934, Unknown=0, NotChecked=0, Total=1056 [2018-06-18 11:52:56,745 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-18 11:52:56,745 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-18 11:52:56,745 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-18 11:52:56,745 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-18 11:52:56,745 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-06-18 11:52:56,745 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:52:56,745 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-18 11:52:56,745 INFO ]: Interpolant automaton has 26 states. [2018-06-18 11:52:56,745 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-18 11:52:56,745 INFO ]: Finished isEmpty. No accepting run. [2018-06-18 11:52:56,750 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.06 11:52:56 BoogieIcfgContainer [2018-06-18 11:52:56,750 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-18 11:52:56,751 INFO ]: Toolchain (without parser) took 12552.08 ms. Allocated memory was 306.2 MB in the beginning and 424.1 MB in the end (delta: 118.0 MB). Free memory was 262.6 MB in the beginning and 369.4 MB in the end (delta: -106.9 MB). Peak memory consumption was 11.1 MB. Max. memory is 3.6 GB. [2018-06-18 11:52:56,752 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 306.2 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-18 11:52:56,752 INFO ]: ChcToBoogie took 51.97 ms. Allocated memory is still 306.2 MB. Free memory was 261.6 MB in the beginning and 259.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-18 11:52:56,753 INFO ]: Boogie Preprocessor took 42.96 ms. Allocated memory is still 306.2 MB. Free memory was 259.6 MB in the beginning and 258.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-18 11:52:56,753 INFO ]: RCFGBuilder took 312.64 ms. Allocated memory is still 306.2 MB. Free memory was 258.6 MB in the beginning and 249.6 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-18 11:52:56,754 INFO ]: TraceAbstraction took 12129.71 ms. Allocated memory was 306.2 MB in the beginning and 424.1 MB in the end (delta: 118.0 MB). Free memory was 249.6 MB in the beginning and 369.6 MB in the end (delta: -120.0 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-18 11:52:56,756 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 306.2 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 51.97 ms. Allocated memory is still 306.2 MB. Free memory was 261.6 MB in the beginning and 259.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 42.96 ms. Allocated memory is still 306.2 MB. Free memory was 259.6 MB in the beginning and 258.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 312.64 ms. Allocated memory is still 306.2 MB. Free memory was 258.6 MB in the beginning and 249.6 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 12129.71 ms. Allocated memory was 306.2 MB in the beginning and 424.1 MB in the end (delta: 118.0 MB). Free memory was 249.6 MB in the beginning and 369.6 MB in the end (delta: -120.0 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 4 procedures, 20 locations, 1 error locations. SAFE Result, 12.0s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 4.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 230 SDtfs, 89 SDslu, 1179 SDs, 0 SdLazy, 928 SolverSat, 89 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 298 GetRequests, 147 SyntacticMatches, 4 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=10, 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, 11 MinimizatonAttempts, 20 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 386 NumberOfCodeBlocks, 386 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 368 ConstructedInterpolants, 12 QuantifiedInterpolants, 85116 SizeOfPredicates, 64 NumberOfNonLiveVariables, 852 ConjunctsInSsa, 220 ConjunctsInUnsatCore, 18 InterpolantComputations, 5 PerfectInterpolantSequences, 95/168 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/arrayOffByOne.smt2_chcToBoogie_automizer.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-18_11-52-56-766.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/arrayOffByOne.smt2_chcToBoogie_automizer.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-18_11-52-56-766.csv Received shutdown request...