java -Xss1g -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_No_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/Consistency/ch-triangle-location-nr.3.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 10:29:38,030 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 10:29:38,032 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 10:29:38,045 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 10:29:38,045 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 10:29:38,046 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 10:29:38,047 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 10:29:38,049 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 10:29:38,051 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 10:29:38,052 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 10:29:38,053 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 10:29:38,053 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 10:29:38,054 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 10:29:38,061 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 10:29:38,062 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 10:29:38,063 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 10:29:38,065 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 10:29:38,067 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 10:29:38,072 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 10:29:38,073 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 10:29:38,074 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 10:29:38,080 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 10:29:38,080 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 10:29:38,080 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 10:29:38,081 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 10:29:38,085 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 10:29:38,086 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 10:29:38,087 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 10:29:38,087 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 10:29:38,088 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 10:29:38,088 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 10:29:38,093 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 10:29:38,094 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 10:29:38,095 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 10:29:38,095 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 10:29:38,095 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 10:29:38,119 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 10:29:38,120 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 10:29:38,120 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 10:29:38,120 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 10:29:38,122 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 10:29:38,122 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 10:29:38,122 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 10:29:38,122 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 10:29:38,123 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 10:29:38,123 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 10:29:38,123 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:29:38,123 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 10:29:38,123 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 10:29:38,123 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 10:29:38,124 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 10:29:38,124 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 10:29:38,124 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 10:29:38,124 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 10:29:38,124 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 10:29:38,126 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 10:29:38,127 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 10:29:38,175 INFO ]: Repository-Root is: /tmp [2018-06-22 10:29:38,191 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 10:29:38,198 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 10:29:38,199 INFO ]: Initializing SmtParser... [2018-06-22 10:29:38,199 INFO ]: SmtParser initialized [2018-06-22 10:29:38,200 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/Consistency/ch-triangle-location-nr.3.smt2 [2018-06-22 10:29:38,201 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-22 10:29:38,296 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/ch-triangle-location-nr.3.smt2 unknown [2018-06-22 10:29:38,673 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/ch-triangle-location-nr.3.smt2 [2018-06-22 10:29:38,677 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 10:29:38,684 INFO ]: Walking toolchain with 4 elements. [2018-06-22 10:29:38,685 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 10:29:38,685 INFO ]: Initializing ChcToBoogie... [2018-06-22 10:29:38,685 INFO ]: ChcToBoogie initialized [2018-06-22 10:29:38,688 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:29:38" (1/1) ... [2018-06-22 10:29:38,784 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:29:38 Unit [2018-06-22 10:29:38,784 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 10:29:38,785 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 10:29:38,785 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 10:29:38,785 INFO ]: Boogie Preprocessor initialized [2018-06-22 10:29:38,807 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:29:38" (1/1) ... [2018-06-22 10:29:38,808 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:29:38" (1/1) ... [2018-06-22 10:29:38,829 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:29:38" (1/1) ... [2018-06-22 10:29:38,829 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:29:38" (1/1) ... [2018-06-22 10:29:38,846 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:29:38" (1/1) ... [2018-06-22 10:29:38,851 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:29:38" (1/1) ... [2018-06-22 10:29:38,855 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:29:38" (1/1) ... [2018-06-22 10:29:38,858 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 10:29:38,858 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 10:29:38,859 INFO ]: Initializing RCFGBuilder... [2018-06-22 10:29:38,859 INFO ]: RCFGBuilder initialized [2018-06-22 10:29:38,859 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:29:38" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:29:38,874 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 10:29:38,874 INFO ]: Found specification of procedure False [2018-06-22 10:29:38,874 INFO ]: Found implementation of procedure False [2018-06-22 10:29:38,874 INFO ]: Specification and implementation of procedure combined_lturn__bar given in one single declaration [2018-06-22 10:29:38,874 INFO ]: Found specification of procedure combined_lturn__bar [2018-06-22 10:29:38,874 INFO ]: Found implementation of procedure combined_lturn__bar [2018-06-22 10:29:38,874 INFO ]: Specification and implementation of procedure lturn__bar given in one single declaration [2018-06-22 10:29:38,874 INFO ]: Found specification of procedure lturn__bar [2018-06-22 10:29:38,874 INFO ]: Found implementation of procedure lturn__bar [2018-06-22 10:29:38,874 INFO ]: Specification and implementation of procedure step_lturn__bar given in one single declaration [2018-06-22 10:29:38,874 INFO ]: Found specification of procedure step_lturn__bar [2018-06-22 10:29:38,874 INFO ]: Found implementation of procedure step_lturn__bar [2018-06-22 10:29:38,874 INFO ]: Specification and implementation of procedure step_lturn given in one single declaration [2018-06-22 10:29:38,874 INFO ]: Found specification of procedure step_lturn [2018-06-22 10:29:38,874 INFO ]: Found implementation of procedure step_lturn [2018-06-22 10:29:38,875 INFO ]: Specification and implementation of procedure combined_lturn given in one single declaration [2018-06-22 10:29:38,875 INFO ]: Found specification of procedure combined_lturn [2018-06-22 10:29:38,875 INFO ]: Found implementation of procedure combined_lturn [2018-06-22 10:29:38,875 INFO ]: Specification and implementation of procedure lturn given in one single declaration [2018-06-22 10:29:38,875 INFO ]: Found specification of procedure lturn [2018-06-22 10:29:38,875 INFO ]: Found implementation of procedure lturn [2018-06-22 10:29:38,875 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 10:29:38,875 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 10:29:38,875 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 10:29:40,029 INFO ]: Using library mode [2018-06-22 10:29:40,030 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:29:40 BoogieIcfgContainer [2018-06-22 10:29:40,030 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 10:29:40,035 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 10:29:40,035 INFO ]: Initializing TraceAbstraction... [2018-06-22 10:29:40,038 INFO ]: TraceAbstraction initialized [2018-06-22 10:29:40,038 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:29:38" (1/3) ... [2018-06-22 10:29:40,039 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@658e3c45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 10:29:40, skipping insertion in model container [2018-06-22 10:29:40,039 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:29:38" (2/3) ... [2018-06-22 10:29:40,039 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@658e3c45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:29:40, skipping insertion in model container [2018-06-22 10:29:40,039 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:29:40" (3/3) ... [2018-06-22 10:29:40,041 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 10:29:40,052 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 10:29:40,065 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 10:29:40,104 INFO ]: Using default assertion order modulation [2018-06-22 10:29:40,105 INFO ]: Interprodecural is true [2018-06-22 10:29:40,105 INFO ]: Hoare is false [2018-06-22 10:29:40,105 INFO ]: Compute interpolants for FPandBP [2018-06-22 10:29:40,105 INFO ]: Backedges is TWOTRACK [2018-06-22 10:29:40,105 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 10:29:40,105 INFO ]: Difference is false [2018-06-22 10:29:40,105 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 10:29:40,105 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 10:29:40,127 INFO ]: Start isEmpty. Operand 162 states. [2018-06-22 10:29:40,159 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 10:29:40,159 INFO ]: Found error trace [2018-06-22 10:29:40,160 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:29:40,161 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:29:40,165 INFO ]: Analyzing trace with hash 1684880435, now seen corresponding path program 1 times [2018-06-22 10:29:40,167 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:29:40,167 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:29:40,217 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:29:40,217 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:29:40,217 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:29:40,254 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:29:40,322 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:29:40,327 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:29:40,328 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 10:29:40,330 INFO ]: Interpolant automaton has 2 states [2018-06-22 10:29:40,365 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 10:29:40,365 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 10:29:40,372 INFO ]: Start difference. First operand 162 states. Second operand 2 states. [2018-06-22 10:29:40,473 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:29:40,473 INFO ]: Finished difference Result 152 states and 314 transitions. [2018-06-22 10:29:40,473 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 10:29:40,474 INFO ]: Start accepts. Automaton has 2 states. Word has length 17 [2018-06-22 10:29:40,477 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:29:40,502 INFO ]: With dead ends: 152 [2018-06-22 10:29:40,503 INFO ]: Without dead ends: 143 [2018-06-22 10:29:40,504 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-22 10:29:40,518 INFO ]: Start minimizeSevpa. Operand 143 states. [2018-06-22 10:29:40,612 INFO ]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-06-22 10:29:40,616 INFO ]: Start removeUnreachable. Operand 143 states. [2018-06-22 10:29:40,625 INFO ]: Finished removeUnreachable. Reduced from 143 states to 143 states and 302 transitions. [2018-06-22 10:29:40,632 INFO ]: Start accepts. Automaton has 143 states and 302 transitions. Word has length 17 [2018-06-22 10:29:40,633 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:29:40,633 INFO ]: Abstraction has 143 states and 302 transitions. [2018-06-22 10:29:40,633 INFO ]: Interpolant automaton has 2 states. [2018-06-22 10:29:40,633 INFO ]: Start isEmpty. Operand 143 states and 302 transitions. [2018-06-22 10:29:40,647 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 10:29:40,647 INFO ]: Found error trace [2018-06-22 10:29:40,647 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:29:40,647 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:29:40,648 INFO ]: Analyzing trace with hash -205348778, now seen corresponding path program 1 times [2018-06-22 10:29:40,648 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:29:40,648 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:29:40,652 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:29:40,652 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:29:40,652 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:29:40,695 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:29:40,835 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:29:40,835 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:29:40,835 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 10:29:40,836 INFO ]: Interpolant automaton has 6 states [2018-06-22 10:29:40,837 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 10:29:40,837 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:29:40,837 INFO ]: Start difference. First operand 143 states and 302 transitions. Second operand 6 states. [2018-06-22 10:29:44,281 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:29:44,282 INFO ]: Finished difference Result 206 states and 593 transitions. [2018-06-22 10:29:44,283 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 10:29:44,283 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 10:29:44,283 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:29:44,293 INFO ]: With dead ends: 206 [2018-06-22 10:29:44,293 INFO ]: Without dead ends: 206 [2018-06-22 10:29:44,294 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:29:44,295 INFO ]: Start minimizeSevpa. Operand 206 states. [2018-06-22 10:29:44,399 INFO ]: Finished minimizeSevpa. Reduced states from 206 to 197. [2018-06-22 10:29:44,399 INFO ]: Start removeUnreachable. Operand 197 states. [2018-06-22 10:29:44,404 INFO ]: Finished removeUnreachable. Reduced from 197 states to 197 states and 570 transitions. [2018-06-22 10:29:44,404 INFO ]: Start accepts. Automaton has 197 states and 570 transitions. Word has length 17 [2018-06-22 10:29:44,404 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:29:44,404 INFO ]: Abstraction has 197 states and 570 transitions. [2018-06-22 10:29:44,404 INFO ]: Interpolant automaton has 6 states. [2018-06-22 10:29:44,404 INFO ]: Start isEmpty. Operand 197 states and 570 transitions. [2018-06-22 10:29:44,408 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 10:29:44,409 INFO ]: Found error trace [2018-06-22 10:29:44,409 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:29:44,409 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:29:44,409 INFO ]: Analyzing trace with hash -1126208145, now seen corresponding path program 1 times [2018-06-22 10:29:44,409 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:29:44,409 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:29:44,410 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:29:44,410 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:29:44,410 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:29:44,433 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:29:44,518 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:29:44,518 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:29:44,518 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 10:29:44,518 INFO ]: Interpolant automaton has 6 states [2018-06-22 10:29:44,518 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 10:29:44,518 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:29:44,518 INFO ]: Start difference. First operand 197 states and 570 transitions. Second operand 6 states. [2018-06-22 10:29:45,784 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:29:45,784 INFO ]: Finished difference Result 256 states and 881 transitions. [2018-06-22 10:29:45,784 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 10:29:45,784 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 10:29:45,784 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:29:45,797 INFO ]: With dead ends: 256 [2018-06-22 10:29:45,797 INFO ]: Without dead ends: 256 [2018-06-22 10:29:45,797 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:29:45,798 INFO ]: Start minimizeSevpa. Operand 256 states. [2018-06-22 10:29:45,916 INFO ]: Finished minimizeSevpa. Reduced states from 256 to 245. [2018-06-22 10:29:45,916 INFO ]: Start removeUnreachable. Operand 245 states. [2018-06-22 10:29:45,922 INFO ]: Finished removeUnreachable. Reduced from 245 states to 245 states and 848 transitions. [2018-06-22 10:29:45,922 INFO ]: Start accepts. Automaton has 245 states and 848 transitions. Word has length 17 [2018-06-22 10:29:45,922 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:29:45,922 INFO ]: Abstraction has 245 states and 848 transitions. [2018-06-22 10:29:45,922 INFO ]: Interpolant automaton has 6 states. [2018-06-22 10:29:45,922 INFO ]: Start isEmpty. Operand 245 states and 848 transitions. [2018-06-22 10:29:45,932 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 10:29:45,932 INFO ]: Found error trace [2018-06-22 10:29:45,932 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:29:45,933 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:29:45,933 INFO ]: Analyzing trace with hash -164021531, now seen corresponding path program 1 times [2018-06-22 10:29:45,933 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:29:45,933 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:29:45,934 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:29:45,934 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:29:45,934 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:29:45,954 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:29:46,073 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:29:46,073 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:29:46,073 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 10:29:46,073 INFO ]: Interpolant automaton has 6 states [2018-06-22 10:29:46,073 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 10:29:46,073 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:29:46,074 INFO ]: Start difference. First operand 245 states and 848 transitions. Second operand 6 states. [2018-06-22 10:29:47,904 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:29:47,904 INFO ]: Finished difference Result 435 states and 1870 transitions. [2018-06-22 10:29:47,904 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 10:29:47,904 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 10:29:47,904 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:29:47,921 INFO ]: With dead ends: 435 [2018-06-22 10:29:47,921 INFO ]: Without dead ends: 435 [2018-06-22 10:29:47,922 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:29:47,922 INFO ]: Start minimizeSevpa. Operand 435 states. [2018-06-22 10:29:48,123 INFO ]: Finished minimizeSevpa. Reduced states from 435 to 428. [2018-06-22 10:29:48,124 INFO ]: Start removeUnreachable. Operand 428 states. [2018-06-22 10:29:48,134 INFO ]: Finished removeUnreachable. Reduced from 428 states to 428 states and 1843 transitions. [2018-06-22 10:29:48,134 INFO ]: Start accepts. Automaton has 428 states and 1843 transitions. Word has length 17 [2018-06-22 10:29:48,135 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:29:48,135 INFO ]: Abstraction has 428 states and 1843 transitions. [2018-06-22 10:29:48,135 INFO ]: Interpolant automaton has 6 states. [2018-06-22 10:29:48,135 INFO ]: Start isEmpty. Operand 428 states and 1843 transitions. [2018-06-22 10:29:48,142 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 10:29:48,143 INFO ]: Found error trace [2018-06-22 10:29:48,143 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:29:48,144 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:29:48,144 INFO ]: Analyzing trace with hash 1604155067, now seen corresponding path program 1 times [2018-06-22 10:29:48,144 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:29:48,144 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:29:48,144 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:29:48,144 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:29:48,144 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:29:48,162 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:29:48,247 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 10:29:48,247 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:29:48,247 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-22 10:29:48,256 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:29:48,295 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:29:48,303 INFO ]: Computing forward predicates... [2018-06-22 10:29:48,460 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 10:29:48,493 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:29:48,493 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-22 10:29:48,493 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:29:48,494 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:29:48,494 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:29:48,494 INFO ]: Start difference. First operand 428 states and 1843 transitions. Second operand 12 states. [2018-06-22 10:29:55,669 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:29:55,669 INFO ]: Finished difference Result 1048 states and 8191 transitions. [2018-06-22 10:29:55,670 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 10:29:55,671 INFO ]: Start accepts. Automaton has 12 states. Word has length 21 [2018-06-22 10:29:55,671 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:29:55,753 INFO ]: With dead ends: 1048 [2018-06-22 10:29:55,753 INFO ]: Without dead ends: 1048 [2018-06-22 10:29:55,754 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-06-22 10:29:55,755 INFO ]: Start minimizeSevpa. Operand 1048 states. [2018-06-22 10:29:57,165 INFO ]: Finished minimizeSevpa. Reduced states from 1048 to 1010. [2018-06-22 10:29:57,165 INFO ]: Start removeUnreachable. Operand 1010 states. [2018-06-22 10:29:57,207 INFO ]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 7893 transitions. [2018-06-22 10:29:57,207 INFO ]: Start accepts. Automaton has 1010 states and 7893 transitions. Word has length 21 [2018-06-22 10:29:57,207 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:29:57,207 INFO ]: Abstraction has 1010 states and 7893 transitions. [2018-06-22 10:29:57,207 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:29:57,207 INFO ]: Start isEmpty. Operand 1010 states and 7893 transitions. [2018-06-22 10:29:57,219 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 10:29:57,219 INFO ]: Found error trace [2018-06-22 10:29:57,219 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:29:57,220 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:29:57,220 INFO ]: Analyzing trace with hash -1281473244, now seen corresponding path program 2 times [2018-06-22 10:29:57,220 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:29:57,220 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:29:57,221 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:29:57,221 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:29:57,221 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:29:57,257 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:29:57,981 INFO ]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 10:29:57,981 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:29:57,981 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) [2018-06-22 10:29:58,004 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:29:58,058 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:29:58,058 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:29:58,061 INFO ]: Computing forward predicates... [2018-06-22 10:29:58,378 INFO ]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 10:29:58,405 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:29:58,406 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-22 10:29:58,406 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:29:58,406 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:29:58,406 INFO ]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:29:58,406 INFO ]: Start difference. First operand 1010 states and 7893 transitions. Second operand 14 states. [2018-06-22 10:30:06,437 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:30:06,437 INFO ]: Finished difference Result 1679 states and 28708 transitions. [2018-06-22 10:30:06,437 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 10:30:06,437 INFO ]: Start accepts. Automaton has 14 states. Word has length 25 [2018-06-22 10:30:06,438 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:30:06,673 INFO ]: With dead ends: 1679 [2018-06-22 10:30:06,673 INFO ]: Without dead ends: 1679 [2018-06-22 10:30:06,674 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2018-06-22 10:30:06,675 INFO ]: Start minimizeSevpa. Operand 1679 states. [2018-06-22 10:30:09,386 INFO ]: Finished minimizeSevpa. Reduced states from 1679 to 1613. [2018-06-22 10:30:09,387 INFO ]: Start removeUnreachable. Operand 1613 states. [2018-06-22 10:30:09,543 INFO ]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 27788 transitions. [2018-06-22 10:30:09,543 INFO ]: Start accepts. Automaton has 1613 states and 27788 transitions. Word has length 25 [2018-06-22 10:30:09,543 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:30:09,543 INFO ]: Abstraction has 1613 states and 27788 transitions. [2018-06-22 10:30:09,543 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:30:09,543 INFO ]: Start isEmpty. Operand 1613 states and 27788 transitions. [2018-06-22 10:30:09,556 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 10:30:09,556 INFO ]: Found error trace [2018-06-22 10:30:09,556 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:30:09,556 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:30:09,556 INFO ]: Analyzing trace with hash 1936396410, now seen corresponding path program 1 times [2018-06-22 10:30:09,556 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:30:09,556 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:30:09,557 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:30:09,557 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:30:09,557 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:30:09,582 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:30:09,737 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 10:30:09,738 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:30:09,738 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-22 10:30:09,765 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:30:09,798 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:30:09,801 INFO ]: Computing forward predicates... [2018-06-22 10:30:10,036 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 10:30:10,056 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:30:10,057 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-22 10:30:10,057 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:30:10,057 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:30:10,057 INFO ]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:30:10,057 INFO ]: Start difference. First operand 1613 states and 27788 transitions. Second operand 12 states. [2018-06-22 10:30:13,201 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:30:13,201 INFO ]: Finished difference Result 1858 states and 34939 transitions. [2018-06-22 10:30:13,202 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 10:30:13,202 INFO ]: Start accepts. Automaton has 12 states. Word has length 21 [2018-06-22 10:30:13,202 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:30:13,341 INFO ]: With dead ends: 1858 [2018-06-22 10:30:13,341 INFO ]: Without dead ends: 1858 [2018-06-22 10:30:13,342 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:30:13,343 INFO ]: Start minimizeSevpa. Operand 1858 states. [2018-06-22 10:30:16,938 INFO ]: Finished minimizeSevpa. Reduced states from 1858 to 1823. [2018-06-22 10:30:16,939 INFO ]: Start removeUnreachable. Operand 1823 states. [2018-06-22 10:30:17,114 INFO ]: Finished removeUnreachable. Reduced from 1823 states to 1823 states and 33714 transitions. [2018-06-22 10:30:17,114 INFO ]: Start accepts. Automaton has 1823 states and 33714 transitions. Word has length 21 [2018-06-22 10:30:17,114 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:30:17,114 INFO ]: Abstraction has 1823 states and 33714 transitions. [2018-06-22 10:30:17,114 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:30:17,114 INFO ]: Start isEmpty. Operand 1823 states and 33714 transitions. [2018-06-22 10:30:17,126 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 10:30:17,126 INFO ]: Found error trace [2018-06-22 10:30:17,126 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:30:17,126 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:30:17,127 INFO ]: Analyzing trace with hash 280916933, now seen corresponding path program 1 times [2018-06-22 10:30:17,127 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:30:17,127 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:30:17,128 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:30:17,128 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:30:17,128 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:30:17,146 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:30:17,265 INFO ]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 10:30:17,265 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:30:17,265 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-22 10:30:17,271 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:30:17,306 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:30:17,310 INFO ]: Computing forward predicates... [2018-06-22 10:30:17,755 INFO ]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 10:30:17,774 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:30:17,774 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-22 10:30:17,775 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:30:17,775 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:30:17,775 INFO ]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:30:17,775 INFO ]: Start difference. First operand 1823 states and 33714 transitions. Second operand 14 states. [2018-06-22 10:30:20,132 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:30:20,132 INFO ]: Finished difference Result 2002 states and 47022 transitions. [2018-06-22 10:30:20,132 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 10:30:20,132 INFO ]: Start accepts. Automaton has 14 states. Word has length 25 [2018-06-22 10:30:20,133 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:30:20,367 INFO ]: With dead ends: 2002 [2018-06-22 10:30:20,367 INFO ]: Without dead ends: 2002 [2018-06-22 10:30:20,367 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:30:20,369 INFO ]: Start minimizeSevpa. Operand 2002 states. [2018-06-22 10:30:25,692 INFO ]: Finished minimizeSevpa. Reduced states from 2002 to 1919. [2018-06-22 10:30:25,692 INFO ]: Start removeUnreachable. Operand 1919 states. [2018-06-22 10:30:25,872 INFO ]: Finished removeUnreachable. Reduced from 1919 states to 1919 states and 45226 transitions. [2018-06-22 10:30:25,872 INFO ]: Start accepts. Automaton has 1919 states and 45226 transitions. Word has length 25 [2018-06-22 10:30:25,872 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:30:25,872 INFO ]: Abstraction has 1919 states and 45226 transitions. [2018-06-22 10:30:25,872 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:30:25,872 INFO ]: Start isEmpty. Operand 1919 states and 45226 transitions. [2018-06-22 10:30:25,883 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 10:30:25,883 INFO ]: Found error trace [2018-06-22 10:30:25,883 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:30:25,883 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:30:25,884 INFO ]: Analyzing trace with hash 1993746423, now seen corresponding path program 1 times [2018-06-22 10:30:25,884 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:30:25,884 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:30:25,885 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:30:25,885 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:30:25,885 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:30:25,902 INFO ]: Conjunction of SSA is sat [2018-06-22 10:30:25,904 INFO ]: Counterexample might be feasible [2018-06-22 10:30:25,930 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:30:25 BoogieIcfgContainer [2018-06-22 10:30:25,930 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 10:30:25,931 INFO ]: Toolchain (without parser) took 47252.92 ms. Allocated memory was 308.8 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 253.4 MB in the beginning and 405.4 MB in the end (delta: -152.0 MB). Peak memory consumption was 1.0 GB. Max. memory is 3.6 GB. [2018-06-22 10:30:25,933 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 273.4 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 10:30:25,933 INFO ]: ChcToBoogie took 99.69 ms. Allocated memory is still 308.8 MB. Free memory was 253.4 MB in the beginning and 249.4 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:30:25,933 INFO ]: Boogie Preprocessor took 73.22 ms. Allocated memory is still 308.8 MB. Free memory was 249.4 MB in the beginning and 247.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:30:25,934 INFO ]: RCFGBuilder took 1171.66 ms. Allocated memory is still 308.8 MB. Free memory was 247.4 MB in the beginning and 203.5 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 3.6 GB. [2018-06-22 10:30:25,934 INFO ]: TraceAbstraction took 45895.42 ms. Allocated memory was 308.8 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 203.5 MB in the beginning and 405.4 MB in the end (delta: -201.9 MB). Peak memory consumption was 980.4 MB. Max. memory is 3.6 GB. [2018-06-22 10:30:25,941 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 308.8 MB. Free memory is still 273.4 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 99.69 ms. Allocated memory is still 308.8 MB. Free memory was 253.4 MB in the beginning and 249.4 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 73.22 ms. Allocated memory is still 308.8 MB. Free memory was 249.4 MB in the beginning and 247.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1171.66 ms. Allocated memory is still 308.8 MB. Free memory was 247.4 MB in the beginning and 203.5 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 3.6 GB. * TraceAbstraction took 45895.42 ms. Allocated memory was 308.8 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 203.5 MB in the beginning and 405.4 MB in the end (delta: -201.9 MB). Peak memory consumption was 980.4 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call False(); [L0] assume true; [L0] CALL call combined_lturn(hbv_False_1_Int, hbv_False_2_Int, hbv_False_3_Int, hbv_False_4_Int, hbv_False_5_Int, hbv_False_6_Int, hbv_False_7_Int, hbv_False_8_Int, hbv_False_9_Int, hbv_False_10_Int, hbv_False_11_Int, hbv_False_12_Int); [L0] assume true; [L0] CALL call lturn(hhv_combined_lturn_0_Int, hhv_combined_lturn_1_Int, hhv_combined_lturn_2_Int, hhv_combined_lturn_3_Int, hhv_combined_lturn_4_Int, hhv_combined_lturn_5_Int, hhv_combined_lturn_6_Int, hhv_combined_lturn_7_Int, hhv_combined_lturn_8_Int, hhv_combined_lturn_9_Int, hhv_combined_lturn_10_Int, hhv_combined_lturn_11_Int); [L0] assume ((((((((((((((((0 + -1 * hhv_lturn_0_Int + 1 * hhv_lturn_1_Int + -1 >= 0 && 0 + 1 * hhv_lturn_7_Int + -1 * hhv_lturn_0_Int + -2 >= 0) && 0 + -1 * hhv_lturn_4_Int + 1 * hhv_lturn_5_Int + 0 >= 0) && 0 + 1 * hhv_lturn_7_Int + -1 * hhv_lturn_2_Int + 0 >= 0) && 0 + 1 * hhv_lturn_7_Int + -1 * hhv_lturn_1_Int + -1 >= 0) && 0 + -1 * hhv_lturn_6_Int + 1 * hhv_lturn_0_Int + -1 >= 0) && 0 + 1 * hhv_lturn_3_Int + -1 * hhv_lturn_8_Int + 0 >= 0) && 0 + -1 * hhv_lturn_3_Int + 1 * hhv_lturn_8_Int + 0 >= 0) && 0 + -1 * hhv_lturn_6_Int + 1 * hhv_lturn_9_Int + -2 >= 0) && 0 + -1 * hhv_lturn_10_Int + 1 * hhv_lturn_9_Int + -1 >= 0) && 0 + -1 * hhv_lturn_1_Int + 1 * hhv_lturn_2_Int + -1 >= 0) && 0 + -1 * hhv_lturn_6_Int + 1 * hhv_lturn_2_Int + -3 >= 0) && 0 + 1 * hhv_lturn_7_Int + -1 * hhv_lturn_9_Int + 0 >= 0) && 0 + -1 * hhv_lturn_6_Int + 1 * hhv_lturn_10_Int + -1 >= 0) && 0 + -1 * hhv_lturn_6_Int + 1 * hhv_lturn_1_Int + -2 >= 0) && 0 + -1 * hhv_lturn_6_Int + 1 * hhv_lturn_7_Int + -3 >= 0) && 0 + 1 * hhv_lturn_7_Int + -1 * hhv_lturn_10_Int + -1 >= 0) && 0 + -1 * hhv_lturn_0_Int + 1 * hhv_lturn_2_Int + -2 >= 0; [L0] RET call lturn(hhv_combined_lturn_0_Int, hhv_combined_lturn_1_Int, hhv_combined_lturn_2_Int, hhv_combined_lturn_3_Int, hhv_combined_lturn_4_Int, hhv_combined_lturn_5_Int, hhv_combined_lturn_6_Int, hhv_combined_lturn_7_Int, hhv_combined_lturn_8_Int, hhv_combined_lturn_9_Int, hhv_combined_lturn_10_Int, hhv_combined_lturn_11_Int); [L0] RET call combined_lturn(hbv_False_1_Int, hbv_False_2_Int, hbv_False_3_Int, hbv_False_4_Int, hbv_False_5_Int, hbv_False_6_Int, hbv_False_7_Int, hbv_False_8_Int, hbv_False_9_Int, hbv_False_10_Int, hbv_False_11_Int, hbv_False_12_Int); [L0] CALL call step_lturn(hbv_False_1_Int, hbv_False_2_Int, hbv_False_3_Int, hbv_False_4_Int, hbv_False_5_Int, hbv_False_6_Int, hbv_False_7_Int, hbv_False_8_Int, hbv_False_9_Int, hbv_False_11_Int, hbv_False_10_Int, hbv_False_12_Int); [L0] assume true; [L0] CALL call step_lturn(hhv_step_lturn_0_Int, hhv_step_lturn_1_Int, hhv_step_lturn_2_Int, hhv_step_lturn_3_Int, hhv_step_lturn_4_Int, hhv_step_lturn_5_Int, hhv_step_lturn_6_Int, hhv_step_lturn_7_Int, hhv_step_lturn_9_Int, hhv_step_lturn_10_Int, hhv_step_lturn_8_Int, hhv_step_lturn_11_Int); [L0] assume true; [L0] CALL call step_lturn(hhv_step_lturn_0_Int, hhv_step_lturn_1_Int, hhv_step_lturn_2_Int, hhv_step_lturn_3_Int, hhv_step_lturn_4_Int, hhv_step_lturn_5_Int, hhv_step_lturn_6_Int, hhv_step_lturn_7_Int, hhv_step_lturn_9_Int, hhv_step_lturn_10_Int, hhv_step_lturn_8_Int, hhv_step_lturn_11_Int); [L0] assume ((((((((((((((((((((((((0 + -1 * hhv_step_lturn_10_Int + 1 * hhv_step_lturn_9_Int + -1 >= 0 && 0 + -1 * hhv_step_lturn_6_Int + 1 * hhv_step_lturn_7_Int + -2 >= 0) && 0 + -1 * hhv_step_lturn_6_Int + 1 * hhv_step_lturn_9_Int + -2 >= 0) && 0 + -1 * hhv_step_lturn_6_Int + 1 * hhv_step_lturn_10_Int + -1 >= 0) && 0 + -1 * hhv_step_lturn_0_Int + 1 * hhv_step_lturn_2_Int + -2 >= 0) && 0 + -1 * hhv_step_lturn_0_Int + 1 * hhv_step_lturn_10_Int + -1 >= 0) && 0 + 1 * hhv_step_lturn_2_Int + -1 * hhv_step_lturn_10_Int + -1 >= 0) && 0 + -1 * hhv_step_lturn_0_Int + 1 * hhv_step_lturn_9_Int + -2 >= 0) && 0 + -1 * hhv_step_lturn_6_Int + 1 * hhv_step_lturn_2_Int + -2 >= 0) && 0 + -1 * hhv_step_lturn_4_Int + 1 * hhv_step_lturn_5_Int + 0 >= 0) && 0 + -1 * hhv_step_lturn_0_Int + 1 * hhv_step_lturn_1_Int + -1 >= 0) && 0 + -1 * hhv_step_lturn_2_Int + 1 * hhv_step_lturn_9_Int + 0 >= 0) && 0 + 1 * hhv_step_lturn_2_Int + -1 * hhv_step_lturn_9_Int + 0 >= 0) && 0 + 1 * hhv_step_lturn_7_Int + -1 * hhv_step_lturn_2_Int + 0 >= 0) && 0 + 1 * hhv_step_lturn_3_Int + -1 * hhv_step_lturn_8_Int + 0 >= 0) && 0 + 1 * hhv_step_lturn_1_Int + -1 * hhv_step_lturn_10_Int + 0 >= 0) && 0 + 1 * hhv_step_lturn_7_Int + -1 * hhv_step_lturn_0_Int + -2 >= 0) && 0 + -1 * hhv_step_lturn_1_Int + 1 * hhv_step_lturn_10_Int + 0 >= 0) && 0 + -1 * hhv_step_lturn_3_Int + 1 * hhv_step_lturn_8_Int + 0 >= 0) && 0 + -1 * hhv_step_lturn_1_Int + 1 * hhv_step_lturn_9_Int + -1 >= 0) && 0 + -1 * hhv_step_lturn_1_Int + 1 * hhv_step_lturn_2_Int + -1 >= 0) && 0 + -1 * hhv_step_lturn_6_Int + 1 * hhv_step_lturn_0_Int + 0 >= 0) && 0 + 1 * hhv_step_lturn_7_Int + -1 * hhv_step_lturn_9_Int + 0 >= 0) && 0 + -1 * hhv_step_lturn_6_Int + 1 * hhv_step_lturn_1_Int + -1 >= 0) && 0 + 1 * hhv_step_lturn_7_Int + -1 * hhv_step_lturn_10_Int + -1 >= 0) && 0 + 1 * hhv_step_lturn_7_Int + -1 * hhv_step_lturn_1_Int + -1 >= 0; [L0] RET call step_lturn(hhv_step_lturn_0_Int, hhv_step_lturn_1_Int, hhv_step_lturn_2_Int, hhv_step_lturn_3_Int, hhv_step_lturn_4_Int, hhv_step_lturn_5_Int, hhv_step_lturn_6_Int, hhv_step_lturn_7_Int, hhv_step_lturn_9_Int, hhv_step_lturn_10_Int, hhv_step_lturn_8_Int, hhv_step_lturn_11_Int); [L0] RET call step_lturn(hhv_step_lturn_0_Int, hhv_step_lturn_1_Int, hhv_step_lturn_2_Int, hhv_step_lturn_3_Int, hhv_step_lturn_4_Int, hhv_step_lturn_5_Int, hhv_step_lturn_6_Int, hhv_step_lturn_7_Int, hhv_step_lturn_9_Int, hhv_step_lturn_10_Int, hhv_step_lturn_8_Int, hhv_step_lturn_11_Int); [L0] RET call step_lturn(hbv_False_1_Int, hbv_False_2_Int, hbv_False_3_Int, hbv_False_4_Int, hbv_False_5_Int, hbv_False_6_Int, hbv_False_7_Int, hbv_False_8_Int, hbv_False_9_Int, hbv_False_11_Int, hbv_False_10_Int, hbv_False_12_Int); [L0] RET call False(); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 162 locations, 1 error locations. UNSAFE Result, 45.8s OverallTime, 9 OverallIterations, 3 TraceHistogramMax, 28.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2479 SDtfs, 134 SDslu, 13757 SDs, 0 SdLazy, 22189 SolverSat, 1097 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 155 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1919occurred in iteration=8, 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: 14.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 249 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 277 NumberOfCodeBlocks, 277 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 240 ConstructedInterpolants, 0 QuantifiedInterpolants, 15916 SizeOfPredicates, 14 NumberOfNonLiveVariables, 753 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 20/52 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ch-triangle-location-nr.3.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_10-30-25-956.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ch-triangle-location-nr.3.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_10-30-25-956.csv Received shutdown request...