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/vmt-chc-benchmarks/ctigar/dillig32.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-55b8104 [2018-06-18 13:17:49,660 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-18 13:17:49,663 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-18 13:17:49,676 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-18 13:17:49,677 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-18 13:17:49,678 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-18 13:17:49,682 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-18 13:17:49,684 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-18 13:17:49,686 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-18 13:17:49,688 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-18 13:17:49,689 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-18 13:17:49,689 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-18 13:17:49,690 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-18 13:17:49,691 INFO L177 SettingsManager]: ChcToBoogie provides no preferences, ignoring... [2018-06-18 13:17:49,691 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-18 13:17:49,696 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-18 13:17:49,697 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-18 13:17:49,710 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-18 13:17:49,712 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-18 13:17:49,713 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-18 13:17:49,714 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-18 13:17:49,716 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-18 13:17:49,716 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-18 13:17:49,717 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-18 13:17:49,718 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-18 13:17:49,718 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-18 13:17:49,723 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-18 13:17:49,724 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-18 13:17:49,725 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-18 13:17:49,725 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-18 13:17:49,729 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-18 13:17:49,730 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-18 13:17:49,730 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-18 13:17:49,730 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-18 13:17:49,731 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-18 13:17:49,731 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chccomp2018/chcToBoogie_automizer.epf [2018-06-18 13:17:49,758 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-18 13:17:49,758 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-18 13:17:49,759 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-18 13:17:49,759 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-18 13:17:49,760 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-18 13:17:49,760 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-18 13:17:49,760 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-18 13:17:49,761 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-18 13:17:49,761 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-18 13:17:49,761 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-18 13:17:49,761 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-18 13:17:49,761 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-18 13:17:49,761 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-18 13:17:49,762 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-18 13:17:49,762 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-18 13:17:49,763 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-18 13:17:49,763 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-18 13:17:49,764 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-18 13:17:49,764 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-18 13:17:49,814 INFO ]: Repository-Root is: /tmp [2018-06-18 13:17:49,832 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-18 13:17:49,837 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-18 13:17:49,839 INFO ]: Initializing SmtParser... [2018-06-18 13:17:49,839 INFO ]: SmtParser initialized [2018-06-18 13:17:49,840 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/ctigar/dillig32.c.smt2 [2018-06-18 13:17:49,842 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 13:17:49,932 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/dillig32.c.smt2 unknown [2018-06-18 13:17:50,192 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/dillig32.c.smt2 [2018-06-18 13:17:50,197 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-18 13:17:50,202 INFO ]: Walking toolchain with 4 elements. [2018-06-18 13:17:50,202 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-18 13:17:50,202 INFO ]: Initializing ChcToBoogie... [2018-06-18 13:17:50,203 INFO ]: ChcToBoogie initialized [2018-06-18 13:17:50,210 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 18.06 01:17:50" (1/1) ... [2018-06-18 13:17:50,282 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:17:50 Unit [2018-06-18 13:17:50,283 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-18 13:17:50,284 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-18 13:17:50,284 INFO ]: Initializing Boogie Preprocessor... [2018-06-18 13:17:50,284 INFO ]: Boogie Preprocessor initialized [2018-06-18 13:17:50,305 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:17:50" (1/1) ... [2018-06-18 13:17:50,305 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:17:50" (1/1) ... [2018-06-18 13:17:50,316 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:17:50" (1/1) ... [2018-06-18 13:17:50,317 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:17:50" (1/1) ... [2018-06-18 13:17:50,332 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:17:50" (1/1) ... [2018-06-18 13:17:50,333 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:17:50" (1/1) ... [2018-06-18 13:17:50,335 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:17:50" (1/1) ... [2018-06-18 13:17:50,337 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-18 13:17:50,346 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-18 13:17:50,346 INFO ]: Initializing RCFGBuilder... [2018-06-18 13:17:50,346 INFO ]: RCFGBuilder initialized [2018-06-18 13:17:50,347 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:17:50" (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-18 13:17:50,387 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-18 13:17:50,387 INFO ]: Found specification of procedure False [2018-06-18 13:17:50,387 INFO ]: Found implementation of procedure False [2018-06-18 13:17:50,387 INFO ]: Specification and implementation of procedure state given in one single declaration [2018-06-18 13:17:50,387 INFO ]: Found specification of procedure state [2018-06-18 13:17:50,387 INFO ]: Found implementation of procedure state [2018-06-18 13:17:50,387 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-18 13:17:50,387 INFO ]: Found specification of procedure Ultimate.START [2018-06-18 13:17:50,387 INFO ]: Found implementation of procedure Ultimate.START [2018-06-18 13:17:50,648 INFO ]: Using library mode [2018-06-18 13:17:50,649 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.06 01:17:50 BoogieIcfgContainer [2018-06-18 13:17:50,649 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-18 13:17:50,650 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-18 13:17:50,650 INFO ]: Initializing TraceAbstraction... [2018-06-18 13:17:50,654 INFO ]: TraceAbstraction initialized [2018-06-18 13:17:50,654 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 18.06 01:17:50" (1/3) ... [2018-06-18 13:17:50,655 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cb89dee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 18.06 01:17:50, skipping insertion in model container [2018-06-18 13:17:50,655 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:17:50" (2/3) ... [2018-06-18 13:17:50,655 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cb89dee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.06 01:17:50, skipping insertion in model container [2018-06-18 13:17:50,655 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.06 01:17:50" (3/3) ... [2018-06-18 13:17:50,657 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-18 13:17:50,667 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-18 13:17:50,674 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-18 13:17:50,719 INFO ]: Using default assertion order modulation [2018-06-18 13:17:50,719 INFO ]: Interprodecural is true [2018-06-18 13:17:50,719 INFO ]: Hoare is false [2018-06-18 13:17:50,719 INFO ]: Compute interpolants for FPandBP [2018-06-18 13:17:50,719 INFO ]: Backedges is TWOTRACK [2018-06-18 13:17:50,719 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-18 13:17:50,719 INFO ]: Difference is false [2018-06-18 13:17:50,719 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-18 13:17:50,719 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-18 13:17:50,732 INFO ]: Start isEmpty. Operand 13 states. [2018-06-18 13:17:50,746 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-18 13:17:50,746 INFO ]: Found error trace [2018-06-18 13:17:50,747 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:17:50,747 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:17:50,751 INFO ]: Analyzing trace with hash -597537630, now seen corresponding path program 1 times [2018-06-18 13:17:50,752 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:17:50,752 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:17:50,785 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:17:50,785 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:17:50,785 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:17:50,810 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:17:50,817 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:17:50,968 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-18 13:17:50,971 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-18 13:17:50,971 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-18 13:17:50,972 INFO ]: Interpolant automaton has 4 states [2018-06-18 13:17:50,987 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-18 13:17:50,988 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 13:17:50,990 INFO ]: Start difference. First operand 13 states. Second operand 4 states. [2018-06-18 13:17:51,083 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:17:51,083 INFO ]: Finished difference Result 13 states and 14 transitions. [2018-06-18 13:17:51,085 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-18 13:17:51,086 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-18 13:17:51,086 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:17:51,100 INFO ]: With dead ends: 13 [2018-06-18 13:17:51,100 INFO ]: Without dead ends: 13 [2018-06-18 13:17:51,104 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 13:17:51,121 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-18 13:17:51,145 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-18 13:17:51,146 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-18 13:17:51,146 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-06-18 13:17:51,147 INFO ]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 9 [2018-06-18 13:17:51,147 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:17:51,147 INFO ]: Abstraction has 13 states and 14 transitions. [2018-06-18 13:17:51,147 INFO ]: Interpolant automaton has 4 states. [2018-06-18 13:17:51,147 INFO ]: Start isEmpty. Operand 13 states and 14 transitions. [2018-06-18 13:17:51,148 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-18 13:17:51,148 INFO ]: Found error trace [2018-06-18 13:17:51,148 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:17:51,149 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:17:51,149 INFO ]: Analyzing trace with hash 1530833734, now seen corresponding path program 1 times [2018-06-18 13:17:51,149 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:17:51,149 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:17:51,150 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:17:51,150 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:17:51,150 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:17:51,191 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:17:51,192 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:17:51,421 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 13:17:51,421 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:17:51,421 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 13:17:51,429 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:17:51,462 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:17:51,471 INFO ]: Computing forward predicates... [2018-06-18 13:17:51,935 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 13:17:51,968 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:17:51,968 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-18 13:17:51,969 INFO ]: Interpolant automaton has 9 states [2018-06-18 13:17:51,969 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-18 13:17:51,969 INFO ]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-18 13:17:51,969 INFO ]: Start difference. First operand 13 states and 14 transitions. Second operand 9 states. [2018-06-18 13:17:52,247 WARN ]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-18 13:17:52,402 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:17:52,402 INFO ]: Finished difference Result 15 states and 16 transitions. [2018-06-18 13:17:52,402 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-18 13:17:52,402 INFO ]: Start accepts. Automaton has 9 states. Word has length 13 [2018-06-18 13:17:52,402 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:17:52,403 INFO ]: With dead ends: 15 [2018-06-18 13:17:52,403 INFO ]: Without dead ends: 15 [2018-06-18 13:17:52,404 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-06-18 13:17:52,404 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-18 13:17:52,407 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-18 13:17:52,407 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-18 13:17:52,408 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-06-18 13:17:52,408 INFO ]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2018-06-18 13:17:52,408 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:17:52,408 INFO ]: Abstraction has 15 states and 16 transitions. [2018-06-18 13:17:52,408 INFO ]: Interpolant automaton has 9 states. [2018-06-18 13:17:52,408 INFO ]: Start isEmpty. Operand 15 states and 16 transitions. [2018-06-18 13:17:52,408 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-18 13:17:52,408 INFO ]: Found error trace [2018-06-18 13:17:52,409 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:17:52,409 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:17:52,409 INFO ]: Analyzing trace with hash -1486246934, now seen corresponding path program 2 times [2018-06-18 13:17:52,409 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:17:52,409 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:17:52,410 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:17:52,410 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:17:52,410 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:17:52,461 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:17:52,462 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:17:52,846 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-18 13:17:52,846 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:17:52,846 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 13:17:52,862 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-18 13:17:52,902 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-18 13:17:52,903 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:17:52,906 INFO ]: Computing forward predicates... [2018-06-18 13:17:53,463 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-18 13:17:53,488 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:17:53,488 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-06-18 13:17:53,488 INFO ]: Interpolant automaton has 11 states [2018-06-18 13:17:53,488 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-18 13:17:53,488 INFO ]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-06-18 13:17:53,489 INFO ]: Start difference. First operand 15 states and 16 transitions. Second operand 11 states. [2018-06-18 13:17:53,702 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:17:53,702 INFO ]: Finished difference Result 17 states and 18 transitions. [2018-06-18 13:17:53,702 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-18 13:17:53,702 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-18 13:17:53,702 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:17:53,703 INFO ]: With dead ends: 17 [2018-06-18 13:17:53,703 INFO ]: Without dead ends: 17 [2018-06-18 13:17:53,704 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-06-18 13:17:53,704 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-18 13:17:53,707 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-18 13:17:53,707 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-18 13:17:53,707 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-06-18 13:17:53,707 INFO ]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 17 [2018-06-18 13:17:53,708 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:17:53,708 INFO ]: Abstraction has 17 states and 18 transitions. [2018-06-18 13:17:53,708 INFO ]: Interpolant automaton has 11 states. [2018-06-18 13:17:53,708 INFO ]: Start isEmpty. Operand 17 states and 18 transitions. [2018-06-18 13:17:53,708 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-18 13:17:53,708 INFO ]: Found error trace [2018-06-18 13:17:53,708 INFO ]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:17:53,709 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:17:53,709 INFO ]: Analyzing trace with hash -2056434034, now seen corresponding path program 3 times [2018-06-18 13:17:53,709 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:17:53,709 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:17:53,710 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:17:53,710 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:17:53,710 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:17:53,745 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:17:53,746 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:17:54,018 INFO ]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-18 13:17:54,018 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:17:54,018 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 13:17:54,029 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-18 13:17:54,068 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-18 13:17:54,068 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:17:54,072 INFO ]: Computing forward predicates... [2018-06-18 13:17:54,256 INFO ]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-18 13:17:54,288 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:17:54,288 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2018-06-18 13:17:54,289 INFO ]: Interpolant automaton has 13 states [2018-06-18 13:17:54,289 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-18 13:17:54,289 INFO ]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-06-18 13:17:54,289 INFO ]: Start difference. First operand 17 states and 18 transitions. Second operand 13 states. [2018-06-18 13:17:54,537 WARN ]: Spent 226.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 23 [2018-06-18 13:17:54,893 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:17:54,893 INFO ]: Finished difference Result 19 states and 20 transitions. [2018-06-18 13:17:54,894 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-18 13:17:54,894 INFO ]: Start accepts. Automaton has 13 states. Word has length 21 [2018-06-18 13:17:54,895 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:17:54,895 INFO ]: With dead ends: 19 [2018-06-18 13:17:54,895 INFO ]: Without dead ends: 19 [2018-06-18 13:17:54,896 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-06-18 13:17:54,896 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-18 13:17:54,899 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-18 13:17:54,899 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-18 13:17:54,900 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-06-18 13:17:54,900 INFO ]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 21 [2018-06-18 13:17:54,900 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:17:54,900 INFO ]: Abstraction has 19 states and 20 transitions. [2018-06-18 13:17:54,900 INFO ]: Interpolant automaton has 13 states. [2018-06-18 13:17:54,900 INFO ]: Start isEmpty. Operand 19 states and 20 transitions. [2018-06-18 13:17:54,901 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-18 13:17:54,901 INFO ]: Found error trace [2018-06-18 13:17:54,901 INFO ]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:17:54,901 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:17:54,901 INFO ]: Analyzing trace with hash -434924750, now seen corresponding path program 4 times [2018-06-18 13:17:54,901 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:17:54,901 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:17:54,902 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:17:54,902 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:17:54,902 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:17:54,941 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:17:54,941 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:17:55,292 INFO ]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-18 13:17:55,292 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:17:55,292 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 13:17:55,298 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-18 13:17:55,358 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-18 13:17:55,358 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:17:55,363 INFO ]: Computing forward predicates... [2018-06-18 13:17:55,812 WARN ]: Spent 330.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 31 [2018-06-18 13:17:56,638 INFO ]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-18 13:17:56,659 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:17:56,659 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2018-06-18 13:17:56,659 INFO ]: Interpolant automaton has 20 states [2018-06-18 13:17:56,659 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-18 13:17:56,659 INFO ]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2018-06-18 13:17:56,660 INFO ]: Start difference. First operand 19 states and 20 transitions. Second operand 20 states. [2018-06-18 13:17:56,943 WARN ]: Spent 249.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2018-06-18 13:17:57,099 WARN ]: Spent 118.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 37 [2018-06-18 13:17:57,267 WARN ]: Spent 126.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2018-06-18 13:17:57,578 WARN ]: Spent 289.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2018-06-18 13:17:57,919 WARN ]: Spent 280.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2018-06-18 13:17:57,955 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:17:57,955 INFO ]: Finished difference Result 21 states and 22 transitions. [2018-06-18 13:17:57,958 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-18 13:17:57,958 INFO ]: Start accepts. Automaton has 20 states. Word has length 25 [2018-06-18 13:17:57,958 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:17:57,959 INFO ]: With dead ends: 21 [2018-06-18 13:17:57,959 INFO ]: Without dead ends: 21 [2018-06-18 13:17:57,959 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=129, Invalid=521, Unknown=0, NotChecked=0, Total=650 [2018-06-18 13:17:57,959 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-18 13:17:57,962 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-18 13:17:57,962 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-18 13:17:57,963 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-06-18 13:17:57,963 INFO ]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 25 [2018-06-18 13:17:57,963 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:17:57,963 INFO ]: Abstraction has 21 states and 22 transitions. [2018-06-18 13:17:57,963 INFO ]: Interpolant automaton has 20 states. [2018-06-18 13:17:57,964 INFO ]: Start isEmpty. Operand 21 states and 22 transitions. [2018-06-18 13:17:57,964 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-18 13:17:57,964 INFO ]: Found error trace [2018-06-18 13:17:57,964 INFO ]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:17:57,965 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:17:57,965 INFO ]: Analyzing trace with hash 1986427350, now seen corresponding path program 5 times [2018-06-18 13:17:57,965 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:17:57,965 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:17:57,965 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:17:57,965 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:17:57,965 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:17:58,051 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:17:58,051 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:17:58,415 INFO ]: Checked inductivity of 55 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-18 13:17:58,415 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:17:58,415 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 13:17:58,422 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-18 13:17:58,534 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-18 13:17:58,534 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:17:58,539 INFO ]: Computing forward predicates... [2018-06-18 13:17:59,167 INFO ]: Checked inductivity of 55 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-18 13:17:59,187 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:17:59,187 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 22 [2018-06-18 13:17:59,187 INFO ]: Interpolant automaton has 22 states [2018-06-18 13:17:59,188 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-18 13:17:59,188 INFO ]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2018-06-18 13:17:59,188 INFO ]: Start difference. First operand 21 states and 22 transitions. Second operand 22 states. [2018-06-18 13:17:59,588 WARN ]: Spent 370.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2018-06-18 13:17:59,735 WARN ]: Spent 109.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 33 [2018-06-18 13:17:59,887 WARN ]: Spent 128.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 32 [2018-06-18 13:18:00,249 WARN ]: Spent 317.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2018-06-18 13:18:00,659 WARN ]: Spent 379.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 31 [2018-06-18 13:18:00,885 WARN ]: Spent 197.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2018-06-18 13:18:01,050 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:18:01,050 INFO ]: Finished difference Result 23 states and 24 transitions. [2018-06-18 13:18:01,050 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-18 13:18:01,050 INFO ]: Start accepts. Automaton has 22 states. Word has length 29 [2018-06-18 13:18:01,051 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:18:01,051 INFO ]: With dead ends: 23 [2018-06-18 13:18:01,051 INFO ]: Without dead ends: 23 [2018-06-18 13:18:01,052 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=156, Invalid=656, Unknown=0, NotChecked=0, Total=812 [2018-06-18 13:18:01,052 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-18 13:18:01,055 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-18 13:18:01,055 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-18 13:18:01,056 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-06-18 13:18:01,056 INFO ]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 29 [2018-06-18 13:18:01,056 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:18:01,056 INFO ]: Abstraction has 23 states and 24 transitions. [2018-06-18 13:18:01,056 INFO ]: Interpolant automaton has 22 states. [2018-06-18 13:18:01,056 INFO ]: Start isEmpty. Operand 23 states and 24 transitions. [2018-06-18 13:18:01,057 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-18 13:18:01,057 INFO ]: Found error trace [2018-06-18 13:18:01,057 INFO ]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:18:01,057 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:18:01,057 INFO ]: Analyzing trace with hash 800064122, now seen corresponding path program 6 times [2018-06-18 13:18:01,057 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:18:01,057 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:18:01,058 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:18:01,058 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:18:01,058 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:18:01,124 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:18:01,124 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:18:01,718 INFO ]: Checked inductivity of 78 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-18 13:18:01,718 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:18:01,718 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 13:18:01,725 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-18 13:18:01,840 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-18 13:18:01,840 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:18:01,845 INFO ]: Computing forward predicates... [2018-06-18 13:18:02,095 WARN ]: Spent 105.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2018-06-18 13:18:02,377 WARN ]: Spent 201.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 35 [2018-06-18 13:18:03,674 WARN ]: Spent 588.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-06-18 13:18:04,530 INFO ]: Checked inductivity of 78 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-18 13:18:04,563 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:18:04,563 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2018-06-18 13:18:04,564 INFO ]: Interpolant automaton has 27 states [2018-06-18 13:18:04,564 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-18 13:18:04,564 INFO ]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2018-06-18 13:18:04,564 INFO ]: Start difference. First operand 23 states and 24 transitions. Second operand 27 states. [2018-06-18 13:18:05,361 WARN ]: Spent 769.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2018-06-18 13:18:05,639 WARN ]: Spent 211.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 34 [2018-06-18 13:18:05,953 WARN ]: Spent 291.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 40 [2018-06-18 13:18:06,328 WARN ]: Spent 346.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 44 [2018-06-18 13:18:06,605 WARN ]: Spent 250.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 49 [2018-06-18 13:18:06,920 WARN ]: Spent 282.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2018-06-18 13:18:07,415 WARN ]: Spent 407.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2018-06-18 13:18:07,446 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:18:07,446 INFO ]: Finished difference Result 25 states and 26 transitions. [2018-06-18 13:18:07,447 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-18 13:18:07,447 INFO ]: Start accepts. Automaton has 27 states. Word has length 33 [2018-06-18 13:18:07,447 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:18:07,448 INFO ]: With dead ends: 25 [2018-06-18 13:18:07,448 INFO ]: Without dead ends: 25 [2018-06-18 13:18:07,448 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=221, Invalid=901, Unknown=0, NotChecked=0, Total=1122 [2018-06-18 13:18:07,448 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-18 13:18:07,452 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-18 13:18:07,452 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-18 13:18:07,452 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-06-18 13:18:07,452 INFO ]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 33 [2018-06-18 13:18:07,453 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:18:07,453 INFO ]: Abstraction has 25 states and 26 transitions. [2018-06-18 13:18:07,455 INFO ]: Interpolant automaton has 27 states. [2018-06-18 13:18:07,455 INFO ]: Start isEmpty. Operand 25 states and 26 transitions. [2018-06-18 13:18:07,456 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-18 13:18:07,456 INFO ]: Found error trace [2018-06-18 13:18:07,456 INFO ]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:18:07,456 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:18:07,456 INFO ]: Analyzing trace with hash -411423458, now seen corresponding path program 7 times [2018-06-18 13:18:07,456 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:18:07,456 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:18:07,457 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:18:07,457 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:18:07,457 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:18:07,540 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:18:07,541 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:18:08,317 WARN ]: Spent 489.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-06-18 13:18:08,573 WARN ]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-06-18 13:18:08,863 INFO ]: Checked inductivity of 105 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-18 13:18:08,863 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:18:08,863 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 13:18:08,869 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:18:08,913 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:18:08,919 INFO ]: Computing forward predicates... [2018-06-18 13:18:09,078 WARN ]: Spent 108.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 15 [2018-06-18 13:18:10,574 INFO ]: Checked inductivity of 105 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-18 13:18:10,595 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:18:10,595 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 26 [2018-06-18 13:18:10,595 INFO ]: Interpolant automaton has 26 states [2018-06-18 13:18:10,595 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-18 13:18:10,595 INFO ]: CoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2018-06-18 13:18:10,595 INFO ]: Start difference. First operand 25 states and 26 transitions. Second operand 26 states. [2018-06-18 13:18:10,820 WARN ]: Spent 198.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2018-06-18 13:18:11,061 WARN ]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2018-06-18 13:18:11,278 WARN ]: Spent 185.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 40 [2018-06-18 13:18:11,454 WARN ]: Spent 154.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 33 [2018-06-18 13:18:11,650 WARN ]: Spent 166.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 33 [2018-06-18 13:18:11,826 WARN ]: Spent 153.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 33 [2018-06-18 13:18:12,052 WARN ]: Spent 201.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2018-06-18 13:18:12,079 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:18:12,079 INFO ]: Finished difference Result 27 states and 28 transitions. [2018-06-18 13:18:12,080 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-18 13:18:12,080 INFO ]: Start accepts. Automaton has 26 states. Word has length 37 [2018-06-18 13:18:12,080 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:18:12,080 INFO ]: With dead ends: 27 [2018-06-18 13:18:12,080 INFO ]: Without dead ends: 27 [2018-06-18 13:18:12,081 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=212, Invalid=910, Unknown=0, NotChecked=0, Total=1122 [2018-06-18 13:18:12,081 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-18 13:18:12,084 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-18 13:18:12,084 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-18 13:18:12,084 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-06-18 13:18:12,084 INFO ]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 37 [2018-06-18 13:18:12,085 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:18:12,085 INFO ]: Abstraction has 27 states and 28 transitions. [2018-06-18 13:18:12,085 INFO ]: Interpolant automaton has 26 states. [2018-06-18 13:18:12,085 INFO ]: Start isEmpty. Operand 27 states and 28 transitions. [2018-06-18 13:18:12,086 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-18 13:18:12,086 INFO ]: Found error trace [2018-06-18 13:18:12,086 INFO ]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:18:12,086 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:18:12,086 INFO ]: Analyzing trace with hash -544278078, now seen corresponding path program 8 times [2018-06-18 13:18:12,086 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:18:12,086 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:18:12,086 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:18:12,086 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:18:12,086 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:18:12,160 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:18:12,161 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:18:12,371 WARN ]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2018-06-18 13:18:12,848 INFO ]: Checked inductivity of 136 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-18 13:18:12,848 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:18:12,848 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 13:18:12,854 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-18 13:18:12,903 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-18 13:18:12,903 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:18:12,909 INFO ]: Computing forward predicates... [2018-06-18 13:18:13,168 WARN ]: Spent 147.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 27 [2018-06-18 13:18:13,377 WARN ]: Spent 145.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2018-06-18 13:18:13,954 INFO ]: Checked inductivity of 136 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-18 13:18:13,974 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:18:13,974 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 30 [2018-06-18 13:18:13,974 INFO ]: Interpolant automaton has 30 states [2018-06-18 13:18:13,975 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-18 13:18:13,975 INFO ]: CoverageRelationStatistics Valid=100, Invalid=770, Unknown=0, NotChecked=0, Total=870 [2018-06-18 13:18:13,975 INFO ]: Start difference. First operand 27 states and 28 transitions. Second operand 30 states. [2018-06-18 13:18:14,339 WARN ]: Spent 308.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2018-06-18 13:18:14,509 WARN ]: Spent 118.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 40 [2018-06-18 13:18:14,746 WARN ]: Spent 153.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 43 [2018-06-18 13:18:15,056 WARN ]: Spent 275.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2018-06-18 13:18:15,241 WARN ]: Spent 147.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 44 [2018-06-18 13:18:15,444 WARN ]: Spent 162.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2018-06-18 13:18:15,628 WARN ]: Spent 144.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 44 [2018-06-18 13:18:15,922 WARN ]: Spent 263.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 46 [2018-06-18 13:18:16,309 WARN ]: Spent 335.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2018-06-18 13:18:16,344 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:18:16,344 INFO ]: Finished difference Result 29 states and 30 transitions. [2018-06-18 13:18:16,344 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-18 13:18:16,344 INFO ]: Start accepts. Automaton has 30 states. Word has length 41 [2018-06-18 13:18:16,344 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:18:16,345 INFO ]: With dead ends: 29 [2018-06-18 13:18:16,345 INFO ]: Without dead ends: 29 [2018-06-18 13:18:16,345 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=260, Invalid=1222, Unknown=0, NotChecked=0, Total=1482 [2018-06-18 13:18:16,345 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-18 13:18:16,348 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-18 13:18:16,348 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-18 13:18:16,350 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-06-18 13:18:16,350 INFO ]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 41 [2018-06-18 13:18:16,350 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:18:16,350 INFO ]: Abstraction has 29 states and 30 transitions. [2018-06-18 13:18:16,350 INFO ]: Interpolant automaton has 30 states. [2018-06-18 13:18:16,350 INFO ]: Start isEmpty. Operand 29 states and 30 transitions. [2018-06-18 13:18:16,351 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-18 13:18:16,352 INFO ]: Found error trace [2018-06-18 13:18:16,352 INFO ]: trace histogram [10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:18:16,352 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:18:16,352 INFO ]: Analyzing trace with hash 1442343014, now seen corresponding path program 9 times [2018-06-18 13:18:16,352 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:18:16,352 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:18:16,352 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:18:16,352 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:18:16,352 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:18:16,464 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:18:16,465 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:18:17,306 INFO ]: Checked inductivity of 171 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-18 13:18:17,306 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:18:17,306 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 13:18:17,312 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-18 13:18:17,375 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-06-18 13:18:17,375 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:18:17,381 INFO ]: Computing forward predicates... [2018-06-18 13:18:17,617 WARN ]: Spent 173.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 27 [2018-06-18 13:18:17,844 WARN ]: Spent 187.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 31 [2018-06-18 13:18:18,060 WARN ]: Spent 144.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2018-06-18 13:18:18,480 WARN ]: Spent 175.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 35 [2018-06-18 13:18:19,536 INFO ]: Checked inductivity of 171 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-18 13:18:19,556 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:18:19,556 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 41 [2018-06-18 13:18:19,557 INFO ]: Interpolant automaton has 41 states [2018-06-18 13:18:19,557 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-18 13:18:19,558 INFO ]: CoverageRelationStatistics Valid=130, Invalid=1510, Unknown=0, NotChecked=0, Total=1640 [2018-06-18 13:18:19,558 INFO ]: Start difference. First operand 29 states and 30 transitions. Second operand 41 states. [2018-06-18 13:18:20,355 WARN ]: Spent 741.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 94 [2018-06-18 13:18:20,704 WARN ]: Spent 203.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 50 [2018-06-18 13:18:21,127 WARN ]: Spent 336.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 37 [2018-06-18 13:18:21,529 WARN ]: Spent 336.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 56 [2018-06-18 13:18:22,055 WARN ]: Spent 477.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 61 [2018-06-18 13:18:22,573 WARN ]: Spent 469.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 59 [2018-06-18 13:18:23,188 WARN ]: Spent 481.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 63 [2018-06-18 13:18:23,756 WARN ]: Spent 516.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 65 [2018-06-18 13:18:24,181 WARN ]: Spent 373.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 59 [2018-06-18 13:18:24,703 WARN ]: Spent 459.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 70 [2018-06-18 13:18:24,769 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:18:24,770 INFO ]: Finished difference Result 31 states and 32 transitions. [2018-06-18 13:18:24,770 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-18 13:18:24,770 INFO ]: Start accepts. Automaton has 41 states. Word has length 45 [2018-06-18 13:18:24,770 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:18:24,771 INFO ]: With dead ends: 31 [2018-06-18 13:18:24,771 INFO ]: Without dead ends: 31 [2018-06-18 13:18:24,771 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=371, Invalid=2179, Unknown=0, NotChecked=0, Total=2550 [2018-06-18 13:18:24,772 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-18 13:18:24,777 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-18 13:18:24,778 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-18 13:18:24,780 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-06-18 13:18:24,780 INFO ]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 45 [2018-06-18 13:18:24,780 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:18:24,780 INFO ]: Abstraction has 31 states and 32 transitions. [2018-06-18 13:18:24,780 INFO ]: Interpolant automaton has 41 states. [2018-06-18 13:18:24,780 INFO ]: Start isEmpty. Operand 31 states and 32 transitions. [2018-06-18 13:18:24,781 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-18 13:18:24,781 INFO ]: Found error trace [2018-06-18 13:18:24,781 INFO ]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:18:24,781 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:18:24,781 INFO ]: Analyzing trace with hash 352352522, now seen corresponding path program 10 times [2018-06-18 13:18:24,781 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:18:24,781 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:18:24,782 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:18:24,782 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:18:24,782 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:18:24,848 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:18:24,849 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:18:25,189 WARN ]: Spent 105.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-06-18 13:18:26,178 INFO ]: Checked inductivity of 210 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-18 13:18:26,178 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:18:26,178 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 13:18:26,183 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-18 13:18:26,244 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-18 13:18:26,244 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:18:26,253 INFO ]: Computing forward predicates... [2018-06-18 13:18:26,497 WARN ]: Spent 172.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 25 [2018-06-18 13:18:27,092 WARN ]: Spent 106.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2018-06-18 13:18:27,341 WARN ]: Spent 109.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2018-06-18 13:18:28,731 INFO ]: Checked inductivity of 210 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-18 13:18:28,751 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:18:28,751 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 43 [2018-06-18 13:18:28,752 INFO ]: Interpolant automaton has 43 states [2018-06-18 13:18:28,752 INFO ]: Constructing interpolant automaton starting with 43 interpolants. [2018-06-18 13:18:28,753 INFO ]: CoverageRelationStatistics Valid=126, Invalid=1680, Unknown=0, NotChecked=0, Total=1806 [2018-06-18 13:18:28,753 INFO ]: Start difference. First operand 31 states and 32 transitions. Second operand 43 states. [2018-06-18 13:18:30,721 WARN ]: Spent 1.91 s on a formula simplification. DAG size of input: 142 DAG size of output: 106 [2018-06-18 13:18:31,023 WARN ]: Spent 223.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 31 [2018-06-18 13:18:31,361 WARN ]: Spent 293.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 34 [2018-06-18 13:18:31,713 WARN ]: Spent 305.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 42 [2018-06-18 13:18:32,183 WARN ]: Spent 422.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 50 [2018-06-18 13:18:32,650 WARN ]: Spent 417.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 52 [2018-06-18 13:18:33,245 WARN ]: Spent 455.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 53 [2018-06-18 13:18:33,694 WARN ]: Spent 400.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 47 [2018-06-18 13:18:34,105 WARN ]: Spent 362.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 44 [2018-06-18 13:18:34,523 WARN ]: Spent 369.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 45 [2018-06-18 13:18:35,151 WARN ]: Spent 564.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 76 [2018-06-18 13:18:35,279 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:18:35,279 INFO ]: Finished difference Result 33 states and 34 transitions. [2018-06-18 13:18:35,279 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-18 13:18:35,279 INFO ]: Start accepts. Automaton has 43 states. Word has length 49 [2018-06-18 13:18:35,280 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:18:35,280 INFO ]: With dead ends: 33 [2018-06-18 13:18:35,280 INFO ]: Without dead ends: 33 [2018-06-18 13:18:35,281 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=398, Invalid=2464, Unknown=0, NotChecked=0, Total=2862 [2018-06-18 13:18:35,281 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-18 13:18:35,285 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-18 13:18:35,285 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-18 13:18:35,285 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-06-18 13:18:35,285 INFO ]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 49 [2018-06-18 13:18:35,286 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:18:35,286 INFO ]: Abstraction has 33 states and 34 transitions. [2018-06-18 13:18:35,286 INFO ]: Interpolant automaton has 43 states. [2018-06-18 13:18:35,286 INFO ]: Start isEmpty. Operand 33 states and 34 transitions. [2018-06-18 13:18:35,286 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-18 13:18:35,286 INFO ]: Found error trace [2018-06-18 13:18:35,286 INFO ]: trace histogram [12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:18:35,287 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:18:35,287 INFO ]: Analyzing trace with hash 53554094, now seen corresponding path program 11 times [2018-06-18 13:18:35,287 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:18:35,287 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:18:35,287 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:18:35,287 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:18:35,287 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:18:35,343 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:18:35,344 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:18:36,505 WARN ]: Spent 860.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2018-06-18 13:18:37,713 INFO ]: Checked inductivity of 253 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-18 13:18:37,713 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:18:37,713 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 13:18:37,719 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-18 13:18:37,832 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-06-18 13:18:37,832 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:18:37,847 INFO ]: Computing forward predicates... [2018-06-18 13:18:38,329 WARN ]: Spent 399.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 15 [2018-06-18 13:18:39,871 WARN ]: Spent 728.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-06-18 13:18:40,100 WARN ]: Spent 189.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2018-06-18 13:18:40,240 WARN ]: Spent 101.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2018-06-18 13:18:40,562 WARN ]: Spent 110.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2018-06-18 13:18:41,826 INFO ]: Checked inductivity of 253 backedges. 1 proven. 186 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-18 13:18:41,846 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:18:41,846 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 48 [2018-06-18 13:18:41,847 INFO ]: Interpolant automaton has 48 states [2018-06-18 13:18:41,847 INFO ]: Constructing interpolant automaton starting with 48 interpolants. [2018-06-18 13:18:41,847 INFO ]: CoverageRelationStatistics Valid=174, Invalid=2082, Unknown=0, NotChecked=0, Total=2256 [2018-06-18 13:18:41,848 INFO ]: Start difference. First operand 33 states and 34 transitions. Second operand 48 states. [2018-06-18 13:18:42,601 WARN ]: Spent 703.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 94 [2018-06-18 13:18:42,942 WARN ]: Spent 271.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 41 [2018-06-18 13:18:43,327 WARN ]: Spent 341.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 47 [2018-06-18 13:18:43,690 WARN ]: Spent 315.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 48 [2018-06-18 13:18:44,078 WARN ]: Spent 322.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 44 [2018-06-18 13:18:44,485 WARN ]: Spent 357.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 47 [2018-06-18 13:18:45,050 WARN ]: Spent 246.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 55 [2018-06-18 13:18:45,419 WARN ]: Spent 321.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 46 [2018-06-18 13:18:45,793 WARN ]: Spent 325.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 43 [2018-06-18 13:18:46,140 WARN ]: Spent 299.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 43 [2018-06-18 13:18:46,425 WARN ]: Spent 235.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 54 [2018-06-18 13:18:46,831 WARN ]: Spent 362.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 51 [2018-06-18 13:18:47,261 WARN ]: Spent 363.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 47 [2018-06-18 13:18:47,675 WARN ]: Spent 339.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 48 [2018-06-18 13:18:48,082 WARN ]: Spent 360.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 58 [2018-06-18 13:18:48,851 WARN ]: Spent 702.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 93 [2018-06-18 13:18:48,878 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:18:48,878 INFO ]: Finished difference Result 43 states and 45 transitions. [2018-06-18 13:18:48,878 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-18 13:18:48,878 INFO ]: Start accepts. Automaton has 48 states. Word has length 53 [2018-06-18 13:18:48,878 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:18:48,879 INFO ]: With dead ends: 43 [2018-06-18 13:18:48,879 INFO ]: Without dead ends: 43 [2018-06-18 13:18:48,880 INFO ]: 0 DeclaredPredicates, 94 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=639, Invalid=3393, Unknown=0, NotChecked=0, Total=4032 [2018-06-18 13:18:48,880 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-18 13:18:48,885 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-06-18 13:18:48,885 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-18 13:18:48,886 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-06-18 13:18:48,886 INFO ]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 53 [2018-06-18 13:18:48,886 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:18:48,886 INFO ]: Abstraction has 43 states and 45 transitions. [2018-06-18 13:18:48,886 INFO ]: Interpolant automaton has 48 states. [2018-06-18 13:18:48,886 INFO ]: Start isEmpty. Operand 43 states and 45 transitions. [2018-06-18 13:18:48,888 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-18 13:18:48,888 INFO ]: Found error trace [2018-06-18 13:18:48,888 INFO ]: trace histogram [13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:18:48,888 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:18:48,889 INFO ]: Analyzing trace with hash -1286307758, now seen corresponding path program 12 times [2018-06-18 13:18:48,889 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:18:48,889 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:18:48,889 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:18:48,889 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:18:48,889 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:18:48,981 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:18:48,982 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:18:49,230 WARN ]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2018-06-18 13:18:50,340 INFO ]: Checked inductivity of 300 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-06-18 13:18:50,341 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:18:50,341 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 13:18:50,346 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-18 13:18:50,430 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-06-18 13:18:50,430 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:18:50,437 INFO ]: Computing forward predicates... Received shutdown request... [2018-06-18 13:18:50,474 INFO ]: Timeout while computing interpolants [2018-06-18 13:18:50,674 WARN ]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 13:18:50,674 WARN ]: Verification canceled [2018-06-18 13:18:50,678 WARN ]: Timeout [2018-06-18 13:18:50,678 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.06 01:18:50 BoogieIcfgContainer [2018-06-18 13:18:50,679 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-18 13:18:50,679 INFO ]: Toolchain (without parser) took 60482.18 ms. Allocated memory was 308.8 MB in the beginning and 782.2 MB in the end (delta: 473.4 MB). Free memory was 261.2 MB in the beginning and 628.1 MB in the end (delta: -366.9 MB). Peak memory consumption was 106.5 MB. Max. memory is 3.6 GB. [2018-06-18 13:18:50,680 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-18 13:18:50,680 INFO ]: ChcToBoogie took 80.63 ms. Allocated memory is still 308.8 MB. Free memory was 261.2 MB in the beginning and 259.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-18 13:18:50,681 INFO ]: Boogie Preprocessor took 53.81 ms. Allocated memory is still 308.8 MB. Free memory was 259.2 MB in the beginning and 257.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-18 13:18:50,681 INFO ]: RCFGBuilder took 303.14 ms. Allocated memory is still 308.8 MB. Free memory was 257.2 MB in the beginning and 247.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-18 13:18:50,681 INFO ]: TraceAbstraction took 60028.21 ms. Allocated memory was 308.8 MB in the beginning and 782.2 MB in the end (delta: 473.4 MB). Free memory was 247.2 MB in the beginning and 628.1 MB in the end (delta: -380.9 MB). Peak memory consumption was 92.5 MB. Max. memory is 3.6 GB. [2018-06-18 13:18:50,684 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.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 80.63 ms. Allocated memory is still 308.8 MB. Free memory was 261.2 MB in the beginning and 259.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 53.81 ms. Allocated memory is still 308.8 MB. Free memory was 259.2 MB in the beginning and 257.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 303.14 ms. Allocated memory is still 308.8 MB. Free memory was 257.2 MB in the beginning and 247.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 60028.21 ms. Allocated memory was 308.8 MB in the beginning and 782.2 MB in the end (delta: 473.4 MB). Free memory was 247.2 MB in the beginning and 628.1 MB in the end (delta: -380.9 MB). Peak memory consumption was 92.5 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 13, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 28 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 13 locations, 1 error locations. TIMEOUT Result, 59.9s OverallTime, 13 OverallIterations, 13 TraceHistogramMax, 30.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 175 SDtfs, 994 SDslu, 1599 SDs, 0 SdLazy, 1428 SolverSat, 1143 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 617 GetRequests, 254 SyntacticMatches, 8 SemanticMatches, 355 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2212 ImplicationChecksByTransitivity, 46.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 26.0s InterpolantComputationTime, 735 NumberOfCodeBlocks, 735 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 712 ConstructedInterpolants, 0 QuantifiedInterpolants, 510012 SizeOfPredicates, 824 NumberOfNonLiveVariables, 2893 ConjunctsInSsa, 637 ConjunctsInUnsatCore, 23 InterpolantComputations, 1 PerfectInterpolantSequences, 573/2156 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dillig32.c.smt2_chcToBoogie_automizer.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-18_13-18-50-692.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dillig32.c.smt2_chcToBoogie_automizer.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-18_13-18-50-692.csv Completed graceful shutdown