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/nest-if.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-55b8104 [2018-06-18 13:34:03,999 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-18 13:34:04,002 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-18 13:34:04,017 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-18 13:34:04,017 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-18 13:34:04,018 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-18 13:34:04,019 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-18 13:34:04,021 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-18 13:34:04,023 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-18 13:34:04,023 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-18 13:34:04,025 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-18 13:34:04,025 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-18 13:34:04,026 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-18 13:34:04,027 INFO L177 SettingsManager]: ChcToBoogie provides no preferences, ignoring... [2018-06-18 13:34:04,027 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-18 13:34:04,030 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-18 13:34:04,032 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-18 13:34:04,042 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-18 13:34:04,044 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-18 13:34:04,045 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-18 13:34:04,046 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-18 13:34:04,048 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-18 13:34:04,052 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-18 13:34:04,052 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-18 13:34:04,053 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-18 13:34:04,054 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-18 13:34:04,055 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-18 13:34:04,055 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-18 13:34:04,058 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-18 13:34:04,058 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-18 13:34:04,059 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-18 13:34:04,059 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-18 13:34:04,059 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-18 13:34:04,060 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-18 13:34:04,066 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-18 13:34:04,066 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chccomp2018/chcToBoogie_automizer.epf [2018-06-18 13:34:04,089 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-18 13:34:04,089 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-18 13:34:04,090 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-18 13:34:04,091 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-18 13:34:04,092 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-18 13:34:04,092 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-18 13:34:04,092 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-18 13:34:04,093 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-18 13:34:04,093 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-18 13:34:04,093 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-18 13:34:04,093 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-18 13:34:04,093 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-18 13:34:04,093 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-18 13:34:04,094 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-18 13:34:04,096 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-18 13:34:04,096 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-18 13:34:04,096 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-18 13:34:04,098 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-18 13:34:04,098 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-18 13:34:04,140 INFO ]: Repository-Root is: /tmp [2018-06-18 13:34:04,155 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-18 13:34:04,160 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-18 13:34:04,162 INFO ]: Initializing SmtParser... [2018-06-18 13:34:04,162 INFO ]: SmtParser initialized [2018-06-18 13:34:04,163 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/ctigar/nest-if.c.smt2 [2018-06-18 13:34:04,164 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:34:04,242 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/nest-if.c.smt2 unknown [2018-06-18 13:34:04,520 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/nest-if.c.smt2 [2018-06-18 13:34:04,527 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-18 13:34:04,533 INFO ]: Walking toolchain with 4 elements. [2018-06-18 13:34:04,534 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-18 13:34:04,534 INFO ]: Initializing ChcToBoogie... [2018-06-18 13:34:04,534 INFO ]: ChcToBoogie initialized [2018-06-18 13:34:04,541 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 18.06 01:34:04" (1/1) ... [2018-06-18 13:34:04,617 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:34:04 Unit [2018-06-18 13:34:04,617 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-18 13:34:04,618 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-18 13:34:04,618 INFO ]: Initializing Boogie Preprocessor... [2018-06-18 13:34:04,618 INFO ]: Boogie Preprocessor initialized [2018-06-18 13:34:04,642 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:34:04" (1/1) ... [2018-06-18 13:34:04,642 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:34:04" (1/1) ... [2018-06-18 13:34:04,653 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:34:04" (1/1) ... [2018-06-18 13:34:04,653 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:34:04" (1/1) ... [2018-06-18 13:34:04,669 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:34:04" (1/1) ... [2018-06-18 13:34:04,670 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:34:04" (1/1) ... [2018-06-18 13:34:04,671 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:34:04" (1/1) ... [2018-06-18 13:34:04,673 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-18 13:34:04,674 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-18 13:34:04,674 INFO ]: Initializing RCFGBuilder... [2018-06-18 13:34:04,674 INFO ]: RCFGBuilder initialized [2018-06-18 13:34:04,675 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:34:04" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-18 13:34:04,705 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-18 13:34:04,705 INFO ]: Found specification of procedure False [2018-06-18 13:34:04,705 INFO ]: Found implementation of procedure False [2018-06-18 13:34:04,705 INFO ]: Specification and implementation of procedure state given in one single declaration [2018-06-18 13:34:04,705 INFO ]: Found specification of procedure state [2018-06-18 13:34:04,705 INFO ]: Found implementation of procedure state [2018-06-18 13:34:04,705 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-18 13:34:04,705 INFO ]: Found specification of procedure Ultimate.START [2018-06-18 13:34:04,705 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-18 13:34:05,009 INFO ]: Using library mode [2018-06-18 13:34:05,010 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.06 01:34:05 BoogieIcfgContainer [2018-06-18 13:34:05,010 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-18 13:34:05,011 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-18 13:34:05,012 INFO ]: Initializing TraceAbstraction... [2018-06-18 13:34:05,015 INFO ]: TraceAbstraction initialized [2018-06-18 13:34:05,015 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 18.06 01:34:04" (1/3) ... [2018-06-18 13:34:05,016 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4acdafc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 18.06 01:34:05, skipping insertion in model container [2018-06-18 13:34:05,016 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:34:04" (2/3) ... [2018-06-18 13:34:05,016 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4acdafc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.06 01:34:05, skipping insertion in model container [2018-06-18 13:34:05,016 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.06 01:34:05" (3/3) ... [2018-06-18 13:34:05,018 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-18 13:34:05,028 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-18 13:34:05,041 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-18 13:34:05,087 INFO ]: Using default assertion order modulation [2018-06-18 13:34:05,088 INFO ]: Interprodecural is true [2018-06-18 13:34:05,088 INFO ]: Hoare is false [2018-06-18 13:34:05,088 INFO ]: Compute interpolants for FPandBP [2018-06-18 13:34:05,088 INFO ]: Backedges is TWOTRACK [2018-06-18 13:34:05,088 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-18 13:34:05,088 INFO ]: Difference is false [2018-06-18 13:34:05,088 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-18 13:34:05,088 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-18 13:34:05,107 INFO ]: Start isEmpty. Operand 13 states. [2018-06-18 13:34:05,127 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-18 13:34:05,127 INFO ]: Found error trace [2018-06-18 13:34:05,128 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:34:05,128 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:34:05,135 INFO ]: Analyzing trace with hash -597537630, now seen corresponding path program 1 times [2018-06-18 13:34:05,137 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:34:05,138 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:34:05,192 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:34:05,192 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:34:05,192 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:34:05,227 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:34:05,237 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:34:05,398 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:34:05,400 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-18 13:34:05,401 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-18 13:34:05,403 INFO ]: Interpolant automaton has 4 states [2018-06-18 13:34:05,428 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-18 13:34:05,429 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 13:34:05,431 INFO ]: Start difference. First operand 13 states. Second operand 4 states. [2018-06-18 13:34:05,521 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:34:05,521 INFO ]: Finished difference Result 13 states and 14 transitions. [2018-06-18 13:34:05,522 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-18 13:34:05,523 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-18 13:34:05,523 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:34:05,535 INFO ]: With dead ends: 13 [2018-06-18 13:34:05,535 INFO ]: Without dead ends: 13 [2018-06-18 13:34:05,537 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:34:05,556 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-18 13:34:05,582 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-18 13:34:05,583 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-18 13:34:05,584 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-06-18 13:34:05,587 INFO ]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 9 [2018-06-18 13:34:05,587 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:34:05,587 INFO ]: Abstraction has 13 states and 14 transitions. [2018-06-18 13:34:05,587 INFO ]: Interpolant automaton has 4 states. [2018-06-18 13:34:05,587 INFO ]: Start isEmpty. Operand 13 states and 14 transitions. [2018-06-18 13:34:05,589 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-18 13:34:05,589 INFO ]: Found error trace [2018-06-18 13:34:05,589 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:34:05,589 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:34:05,589 INFO ]: Analyzing trace with hash 1530833734, now seen corresponding path program 1 times [2018-06-18 13:34:05,589 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:34:05,589 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:34:05,590 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:34:05,590 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:34:05,590 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:34:05,632 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:34:05,633 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:34:05,813 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:34:05,814 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:34:05,814 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:34:05,824 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:34:05,874 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:34:05,883 INFO ]: Computing forward predicates... [2018-06-18 13:34:06,021 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:34:06,055 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:34:06,055 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-18 13:34:06,056 INFO ]: Interpolant automaton has 6 states [2018-06-18 13:34:06,056 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-18 13:34:06,056 INFO ]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-18 13:34:06,056 INFO ]: Start difference. First operand 13 states and 14 transitions. Second operand 6 states. [2018-06-18 13:34:06,175 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:34:06,176 INFO ]: Finished difference Result 15 states and 16 transitions. [2018-06-18 13:34:06,176 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-18 13:34:06,176 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-18 13:34:06,176 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:34:06,177 INFO ]: With dead ends: 15 [2018-06-18 13:34:06,177 INFO ]: Without dead ends: 15 [2018-06-18 13:34:06,178 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-18 13:34:06,178 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-18 13:34:06,180 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-18 13:34:06,181 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-18 13:34:06,181 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-06-18 13:34:06,181 INFO ]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2018-06-18 13:34:06,181 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:34:06,181 INFO ]: Abstraction has 15 states and 16 transitions. [2018-06-18 13:34:06,182 INFO ]: Interpolant automaton has 6 states. [2018-06-18 13:34:06,182 INFO ]: Start isEmpty. Operand 15 states and 16 transitions. [2018-06-18 13:34:06,182 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-18 13:34:06,182 INFO ]: Found error trace [2018-06-18 13:34:06,182 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:34:06,182 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:34:06,183 INFO ]: Analyzing trace with hash -1486246934, now seen corresponding path program 2 times [2018-06-18 13:34:06,183 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:34:06,183 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:34:06,183 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:34:06,183 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:34:06,184 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:34:06,226 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:34:06,227 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:34:06,703 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:34:06,703 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:34:06,703 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-18 13:34:06,728 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-18 13:34:06,781 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-18 13:34:06,781 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:34:06,785 INFO ]: Computing forward predicates... [2018-06-18 13:34:07,159 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:34:07,189 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:34:07,189 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-18 13:34:07,189 INFO ]: Interpolant automaton has 8 states [2018-06-18 13:34:07,189 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-18 13:34:07,189 INFO ]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-18 13:34:07,189 INFO ]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2018-06-18 13:34:07,793 WARN ]: Spent 277.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 18 [2018-06-18 13:34:07,812 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:34:07,812 INFO ]: Finished difference Result 17 states and 18 transitions. [2018-06-18 13:34:07,812 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-18 13:34:07,812 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-18 13:34:07,813 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:34:07,813 INFO ]: With dead ends: 17 [2018-06-18 13:34:07,813 INFO ]: Without dead ends: 17 [2018-06-18 13:34:07,813 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-06-18 13:34:07,813 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-18 13:34:07,816 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-18 13:34:07,816 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-18 13:34:07,817 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-06-18 13:34:07,817 INFO ]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 17 [2018-06-18 13:34:07,817 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:34:07,817 INFO ]: Abstraction has 17 states and 18 transitions. [2018-06-18 13:34:07,817 INFO ]: Interpolant automaton has 8 states. [2018-06-18 13:34:07,817 INFO ]: Start isEmpty. Operand 17 states and 18 transitions. [2018-06-18 13:34:07,818 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-18 13:34:07,818 INFO ]: Found error trace [2018-06-18 13:34:07,818 INFO ]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:34:07,818 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:34:07,818 INFO ]: Analyzing trace with hash -2056434034, now seen corresponding path program 3 times [2018-06-18 13:34:07,818 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:34:07,818 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:34:07,819 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:34:07,819 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:34:07,819 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:34:07,858 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:34:07,859 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:34:08,343 WARN ]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-06-18 13:34:08,454 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:34:08,454 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:34:08,454 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:34:08,468 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-18 13:34:08,531 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-18 13:34:08,532 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:34:08,535 INFO ]: Computing forward predicates... [2018-06-18 13:34:08,730 WARN ]: Spent 149.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 14 [2018-06-18 13:34:08,847 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:34:08,868 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:34:08,868 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2018-06-18 13:34:08,869 INFO ]: Interpolant automaton has 13 states [2018-06-18 13:34:08,869 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-18 13:34:08,869 INFO ]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-06-18 13:34:08,869 INFO ]: Start difference. First operand 17 states and 18 transitions. Second operand 13 states. [2018-06-18 13:34:09,080 WARN ]: Spent 157.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2018-06-18 13:34:09,229 WARN ]: Spent 100.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 17 [2018-06-18 13:34:09,435 WARN ]: Spent 126.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 25 [2018-06-18 13:34:09,466 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:34:09,466 INFO ]: Finished difference Result 19 states and 20 transitions. [2018-06-18 13:34:09,467 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-18 13:34:09,467 INFO ]: Start accepts. Automaton has 13 states. Word has length 21 [2018-06-18 13:34:09,467 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:34:09,468 INFO ]: With dead ends: 19 [2018-06-18 13:34:09,468 INFO ]: Without dead ends: 19 [2018-06-18 13:34:09,468 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2018-06-18 13:34:09,468 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-18 13:34:09,471 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-18 13:34:09,471 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-18 13:34:09,472 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-06-18 13:34:09,472 INFO ]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 21 [2018-06-18 13:34:09,472 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:34:09,472 INFO ]: Abstraction has 19 states and 20 transitions. [2018-06-18 13:34:09,472 INFO ]: Interpolant automaton has 13 states. [2018-06-18 13:34:09,472 INFO ]: Start isEmpty. Operand 19 states and 20 transitions. [2018-06-18 13:34:09,473 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-18 13:34:09,473 INFO ]: Found error trace [2018-06-18 13:34:09,474 INFO ]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:34:09,474 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:34:09,474 INFO ]: Analyzing trace with hash -434924750, now seen corresponding path program 4 times [2018-06-18 13:34:09,474 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:34:09,474 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:34:09,475 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:34:09,475 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:34:09,475 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:34:09,513 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:34:09,514 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:34:09,819 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:34:09,819 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:34:09,819 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:34:09,828 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-18 13:34:09,878 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-18 13:34:09,878 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:34:09,882 INFO ]: Computing forward predicates... [2018-06-18 13:34:10,236 WARN ]: Spent 128.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2018-06-18 13:34:10,546 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:34:10,573 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:34:10,573 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 15 [2018-06-18 13:34:10,574 INFO ]: Interpolant automaton has 15 states [2018-06-18 13:34:10,574 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-18 13:34:10,574 INFO ]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-06-18 13:34:10,574 INFO ]: Start difference. First operand 19 states and 20 transitions. Second operand 15 states. [2018-06-18 13:34:10,758 WARN ]: Spent 145.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2018-06-18 13:34:10,985 WARN ]: Spent 101.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 26 [2018-06-18 13:34:11,114 WARN ]: Spent 113.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 25 [2018-06-18 13:34:11,337 WARN ]: Spent 182.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 31 [2018-06-18 13:34:11,355 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:34:11,355 INFO ]: Finished difference Result 21 states and 22 transitions. [2018-06-18 13:34:11,357 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-18 13:34:11,357 INFO ]: Start accepts. Automaton has 15 states. Word has length 25 [2018-06-18 13:34:11,357 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:34:11,358 INFO ]: With dead ends: 21 [2018-06-18 13:34:11,358 INFO ]: Without dead ends: 21 [2018-06-18 13:34:11,358 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2018-06-18 13:34:11,358 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-18 13:34:11,361 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-18 13:34:11,361 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-18 13:34:11,362 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-06-18 13:34:11,362 INFO ]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 25 [2018-06-18 13:34:11,362 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:34:11,362 INFO ]: Abstraction has 21 states and 22 transitions. [2018-06-18 13:34:11,362 INFO ]: Interpolant automaton has 15 states. [2018-06-18 13:34:11,363 INFO ]: Start isEmpty. Operand 21 states and 22 transitions. [2018-06-18 13:34:11,363 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-18 13:34:11,363 INFO ]: Found error trace [2018-06-18 13:34:11,363 INFO ]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:34:11,364 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:34:11,364 INFO ]: Analyzing trace with hash 1986427350, now seen corresponding path program 5 times [2018-06-18 13:34:11,364 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:34:11,364 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:34:11,365 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:34:11,365 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:34:11,365 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:34:11,430 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:34:11,431 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:34:11,915 WARN ]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-06-18 13:34:12,319 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:34:12,319 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:34:12,319 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:34:12,326 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-18 13:34:12,369 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-18 13:34:12,369 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:34:12,373 INFO ]: Computing forward predicates... [2018-06-18 13:34:12,567 WARN ]: Spent 105.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-06-18 13:34:14,804 WARN ]: Spent 419.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-18 13:34:14,991 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:34:15,011 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:34:15,011 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2018-06-18 13:34:15,011 INFO ]: Interpolant automaton has 25 states [2018-06-18 13:34:15,012 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-18 13:34:15,012 INFO ]: CoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2018-06-18 13:34:15,012 INFO ]: Start difference. First operand 21 states and 22 transitions. Second operand 25 states. [2018-06-18 13:34:15,606 WARN ]: Spent 467.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2018-06-18 13:34:16,077 WARN ]: Spent 250.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 33 [2018-06-18 13:34:16,516 WARN ]: Spent 413.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 43 [2018-06-18 13:34:16,715 WARN ]: Spent 177.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2018-06-18 13:34:16,934 WARN ]: Spent 179.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2018-06-18 13:34:16,994 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:34:16,994 INFO ]: Finished difference Result 23 states and 24 transitions. [2018-06-18 13:34:16,997 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-18 13:34:16,997 INFO ]: Start accepts. Automaton has 25 states. Word has length 29 [2018-06-18 13:34:16,997 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:34:16,998 INFO ]: With dead ends: 23 [2018-06-18 13:34:16,998 INFO ]: Without dead ends: 23 [2018-06-18 13:34:16,999 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=193, Invalid=737, Unknown=0, NotChecked=0, Total=930 [2018-06-18 13:34:16,999 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-18 13:34:17,002 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-18 13:34:17,002 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-18 13:34:17,003 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-06-18 13:34:17,003 INFO ]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 29 [2018-06-18 13:34:17,003 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:34:17,003 INFO ]: Abstraction has 23 states and 24 transitions. [2018-06-18 13:34:17,003 INFO ]: Interpolant automaton has 25 states. [2018-06-18 13:34:17,003 INFO ]: Start isEmpty. Operand 23 states and 24 transitions. [2018-06-18 13:34:17,004 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-18 13:34:17,004 INFO ]: Found error trace [2018-06-18 13:34:17,004 INFO ]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:34:17,004 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:34:17,004 INFO ]: Analyzing trace with hash 800064122, now seen corresponding path program 6 times [2018-06-18 13:34:17,004 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:34:17,004 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:34:17,005 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:34:17,005 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:34:17,005 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:34:17,046 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:34:17,047 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:34:17,364 WARN ]: Spent 110.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 20 [2018-06-18 13:34:17,731 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:34:17,731 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:34:17,731 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:34:17,737 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-18 13:34:17,787 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-18 13:34:17,787 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:34:17,792 INFO ]: Computing forward predicates... [2018-06-18 13:34:18,151 WARN ]: Spent 218.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2018-06-18 13:34:18,304 WARN ]: Spent 118.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-06-18 13:34:19,528 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:34:19,558 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:34:19,558 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2018-06-18 13:34:19,558 INFO ]: Interpolant automaton has 29 states [2018-06-18 13:34:19,559 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-18 13:34:19,559 INFO ]: CoverageRelationStatistics Valid=106, Invalid=706, Unknown=0, NotChecked=0, Total=812 [2018-06-18 13:34:19,559 INFO ]: Start difference. First operand 23 states and 24 transitions. Second operand 29 states. [2018-06-18 13:34:20,491 WARN ]: Spent 763.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 76 [2018-06-18 13:34:20,669 WARN ]: Spent 108.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 26 [2018-06-18 13:34:20,871 WARN ]: Spent 173.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 36 [2018-06-18 13:34:21,127 WARN ]: Spent 227.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 45 [2018-06-18 13:34:21,455 WARN ]: Spent 283.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 41 [2018-06-18 13:34:21,740 WARN ]: Spent 256.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 41 [2018-06-18 13:34:22,079 WARN ]: Spent 258.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 56 [2018-06-18 13:34:22,118 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:34:22,118 INFO ]: Finished difference Result 25 states and 26 transitions. [2018-06-18 13:34:22,119 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-18 13:34:22,119 INFO ]: Start accepts. Automaton has 29 states. Word has length 33 [2018-06-18 13:34:22,119 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:34:22,120 INFO ]: With dead ends: 25 [2018-06-18 13:34:22,120 INFO ]: Without dead ends: 25 [2018-06-18 13:34:22,120 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=237, Invalid=1023, Unknown=0, NotChecked=0, Total=1260 [2018-06-18 13:34:22,120 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-18 13:34:22,125 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-18 13:34:22,125 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-18 13:34:22,126 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-06-18 13:34:22,126 INFO ]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 33 [2018-06-18 13:34:22,126 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:34:22,126 INFO ]: Abstraction has 25 states and 26 transitions. [2018-06-18 13:34:22,126 INFO ]: Interpolant automaton has 29 states. [2018-06-18 13:34:22,126 INFO ]: Start isEmpty. Operand 25 states and 26 transitions. [2018-06-18 13:34:22,128 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-18 13:34:22,128 INFO ]: Found error trace [2018-06-18 13:34:22,128 INFO ]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:34:22,129 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:34:22,129 INFO ]: Analyzing trace with hash -411423458, now seen corresponding path program 7 times [2018-06-18 13:34:22,129 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:34:22,129 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:34:22,130 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:34:22,130 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:34:22,130 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:34:22,227 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:34:22,227 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:34:23,311 WARN ]: Spent 782.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-06-18 13:34:23,496 WARN ]: Spent 111.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2018-06-18 13:34:24,156 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:34:24,157 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:34:24,157 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:34:24,163 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:34:24,206 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:34:24,212 INFO ]: Computing forward predicates... [2018-06-18 13:34:24,583 WARN ]: Spent 267.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 24 [2018-06-18 13:34:25,064 WARN ]: Spent 435.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2018-06-18 13:34:25,587 WARN ]: Spent 462.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2018-06-18 13:34:25,815 WARN ]: Spent 175.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 33 [2018-06-18 13:34:28,917 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:34:28,937 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:34:28,937 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2018-06-18 13:34:28,937 INFO ]: Interpolant automaton has 33 states [2018-06-18 13:34:28,937 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-18 13:34:28,938 INFO ]: CoverageRelationStatistics Valid=105, Invalid=951, Unknown=0, NotChecked=0, Total=1056 [2018-06-18 13:34:28,938 INFO ]: Start difference. First operand 25 states and 26 transitions. Second operand 33 states. [2018-06-18 13:34:30,038 WARN ]: Spent 1.04 s on a formula simplification. DAG size of input: 145 DAG size of output: 120 [2018-06-18 13:34:30,423 WARN ]: Spent 279.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 27 [2018-06-18 13:34:30,990 WARN ]: Spent 490.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 40 [2018-06-18 13:34:31,745 WARN ]: Spent 702.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 52 [2018-06-18 13:34:32,501 WARN ]: Spent 697.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 72 [2018-06-18 13:34:33,146 WARN ]: Spent 589.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 56 [2018-06-18 13:34:33,729 WARN ]: Spent 539.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 53 [2018-06-18 13:34:34,700 WARN ]: Spent 830.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 86 [2018-06-18 13:34:34,811 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:34:34,811 INFO ]: Finished difference Result 27 states and 28 transitions. [2018-06-18 13:34:34,811 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-18 13:34:34,811 INFO ]: Start accepts. Automaton has 33 states. Word has length 37 [2018-06-18 13:34:34,811 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:34:34,812 INFO ]: With dead ends: 27 [2018-06-18 13:34:34,812 INFO ]: Without dead ends: 27 [2018-06-18 13:34:34,813 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=266, Invalid=1374, Unknown=0, NotChecked=0, Total=1640 [2018-06-18 13:34:34,813 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-18 13:34:34,816 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-18 13:34:34,816 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-18 13:34:34,817 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-06-18 13:34:34,817 INFO ]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 37 [2018-06-18 13:34:34,817 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:34:34,817 INFO ]: Abstraction has 27 states and 28 transitions. [2018-06-18 13:34:34,817 INFO ]: Interpolant automaton has 33 states. [2018-06-18 13:34:34,817 INFO ]: Start isEmpty. Operand 27 states and 28 transitions. [2018-06-18 13:34:34,818 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-18 13:34:34,818 INFO ]: Found error trace [2018-06-18 13:34:34,818 INFO ]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:34:34,818 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:34:34,818 INFO ]: Analyzing trace with hash -544278078, now seen corresponding path program 8 times [2018-06-18 13:34:34,818 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:34:34,818 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:34:34,819 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:34:34,819 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:34:34,819 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:34:34,896 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:34:34,897 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:34:35,717 WARN ]: Spent 535.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2018-06-18 13:34:36,422 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:34:36,422 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:34:36,422 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:34:36,433 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-18 13:34:36,509 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-18 13:34:36,509 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:34:36,514 INFO ]: Computing forward predicates... [2018-06-18 13:34:37,424 WARN ]: Spent 176.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 33 [2018-06-18 13:34:39,251 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:34:39,271 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:34:39,272 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 37 [2018-06-18 13:34:39,272 INFO ]: Interpolant automaton has 37 states [2018-06-18 13:34:39,272 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-18 13:34:39,272 INFO ]: CoverageRelationStatistics Valid=141, Invalid=1191, Unknown=0, NotChecked=0, Total=1332 [2018-06-18 13:34:39,273 INFO ]: Start difference. First operand 27 states and 28 transitions. Second operand 37 states. [2018-06-18 13:34:39,996 WARN ]: Spent 673.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2018-06-18 13:34:40,222 WARN ]: Spent 104.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 30 [2018-06-18 13:34:40,504 WARN ]: Spent 246.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 44 [2018-06-18 13:34:40,981 WARN ]: Spent 417.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 50 [2018-06-18 13:34:41,485 WARN ]: Spent 397.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 59 [2018-06-18 13:34:41,818 WARN ]: Spent 295.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 43 [2018-06-18 13:34:42,179 WARN ]: Spent 327.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 47 [2018-06-18 13:34:42,510 WARN ]: Spent 293.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 46 [2018-06-18 13:34:43,076 WARN ]: Spent 521.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2018-06-18 13:34:43,150 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:34:43,150 INFO ]: Finished difference Result 29 states and 30 transitions. [2018-06-18 13:34:43,150 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-18 13:34:43,150 INFO ]: Start accepts. Automaton has 37 states. Word has length 41 [2018-06-18 13:34:43,150 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:34:43,151 INFO ]: With dead ends: 29 [2018-06-18 13:34:43,151 INFO ]: Without dead ends: 29 [2018-06-18 13:34:43,152 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=348, Invalid=1722, Unknown=0, NotChecked=0, Total=2070 [2018-06-18 13:34:43,152 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-18 13:34:43,157 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-18 13:34:43,157 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-18 13:34:43,157 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-06-18 13:34:43,157 INFO ]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 41 [2018-06-18 13:34:43,158 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:34:43,158 INFO ]: Abstraction has 29 states and 30 transitions. [2018-06-18 13:34:43,158 INFO ]: Interpolant automaton has 37 states. [2018-06-18 13:34:43,158 INFO ]: Start isEmpty. Operand 29 states and 30 transitions. [2018-06-18 13:34:43,159 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-18 13:34:43,159 INFO ]: Found error trace [2018-06-18 13:34:43,159 INFO ]: trace histogram [10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:34:43,159 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:34:43,159 INFO ]: Analyzing trace with hash 1442343014, now seen corresponding path program 9 times [2018-06-18 13:34:43,159 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:34:43,159 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:34:43,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:34:43,159 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:34:43,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:34:43,226 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:34:43,226 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:34:43,765 WARN ]: Spent 209.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2018-06-18 13:34:43,957 WARN ]: Spent 184.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2018-06-18 13:34:44,293 WARN ]: Spent 122.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 27 [2018-06-18 13:34:44,873 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:34:44,873 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:34:44,873 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:34:44,879 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-18 13:34:44,944 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-06-18 13:34:44,944 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:34:44,951 INFO ]: Computing forward predicates... [2018-06-18 13:34:46,681 WARN ]: Spent 1.44 s on a formula simplification. DAG size of input: 289 DAG size of output: 52 [2018-06-18 13:34:46,958 WARN ]: Spent 220.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 28 [2018-06-18 13:34:47,149 WARN ]: Spent 152.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 31 [2018-06-18 13:34:47,354 WARN ]: Spent 144.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2018-06-18 13:34:47,577 WARN ]: Spent 179.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2018-06-18 13:34:47,970 WARN ]: Spent 172.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 29 [2018-06-18 13:34:49,348 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:34:49,368 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:34:49,369 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 41 [2018-06-18 13:34:49,369 INFO ]: Interpolant automaton has 41 states [2018-06-18 13:34:49,369 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-18 13:34:49,370 INFO ]: CoverageRelationStatistics Valid=138, Invalid=1502, Unknown=0, NotChecked=0, Total=1640 [2018-06-18 13:34:49,370 INFO ]: Start difference. First operand 29 states and 30 transitions. Second operand 41 states. [2018-06-18 13:34:50,869 WARN ]: Spent 1.43 s on a formula simplification. DAG size of input: 194 DAG size of output: 118 [2018-06-18 13:34:51,350 WARN ]: Spent 387.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 34 [2018-06-18 13:34:51,896 WARN ]: Spent 441.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 42 [2018-06-18 13:34:52,557 WARN ]: Spent 585.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 48 [2018-06-18 13:34:53,217 WARN ]: Spent 602.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 55 [2018-06-18 13:34:53,946 WARN ]: Spent 667.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 52 [2018-06-18 13:34:54,526 WARN ]: Spent 521.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 50 [2018-06-18 13:34:55,233 WARN ]: Spent 631.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 55 [2018-06-18 13:34:56,261 WARN ]: Spent 968.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 60 [2018-06-18 13:34:57,661 WARN ]: Spent 1.32 s on a formula simplification. DAG size of input: 196 DAG size of output: 104 [2018-06-18 13:34:57,721 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:34:57,721 INFO ]: Finished difference Result 31 states and 32 transitions. [2018-06-18 13:34:57,722 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-18 13:34:57,722 INFO ]: Start accepts. Automaton has 41 states. Word has length 45 [2018-06-18 13:34:57,722 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:34:57,723 INFO ]: With dead ends: 31 [2018-06-18 13:34:57,723 INFO ]: Without dead ends: 31 [2018-06-18 13:34:57,724 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=385, Invalid=2165, Unknown=0, NotChecked=0, Total=2550 [2018-06-18 13:34:57,724 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-18 13:34:57,727 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-18 13:34:57,727 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-18 13:34:57,728 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-06-18 13:34:57,728 INFO ]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 45 [2018-06-18 13:34:57,728 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:34:57,728 INFO ]: Abstraction has 31 states and 32 transitions. [2018-06-18 13:34:57,728 INFO ]: Interpolant automaton has 41 states. [2018-06-18 13:34:57,728 INFO ]: Start isEmpty. Operand 31 states and 32 transitions. [2018-06-18 13:34:57,729 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-18 13:34:57,729 INFO ]: Found error trace [2018-06-18 13:34:57,729 INFO ]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:34:57,729 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:34:57,729 INFO ]: Analyzing trace with hash 352352522, now seen corresponding path program 10 times [2018-06-18 13:34:57,729 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:34:57,729 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:34:57,730 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:34:57,730 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:34:57,730 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:34:57,777 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:34:57,778 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:34:58,725 WARN ]: Spent 112.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 34 [2018-06-18 13:34:59,264 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:34:59,265 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:34:59,265 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:34:59,270 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-18 13:34:59,334 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-18 13:34:59,334 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:34:59,340 INFO ]: Computing forward predicates... [2018-06-18 13:34:59,606 WARN ]: Spent 196.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 29 [2018-06-18 13:34:59,794 WARN ]: Spent 149.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 25 [2018-06-18 13:35:00,052 WARN ]: Spent 105.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2018-06-18 13:35:00,184 WARN ]: Spent 100.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2018-06-18 13:35:00,336 WARN ]: Spent 107.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2018-06-18 13:35:00,477 WARN ]: Spent 105.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-06-18 13:35:01,544 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:35:01,564 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:35:01,564 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 45 [2018-06-18 13:35:01,565 INFO ]: Interpolant automaton has 45 states [2018-06-18 13:35:01,565 INFO ]: Constructing interpolant automaton starting with 45 interpolants. [2018-06-18 13:35:01,565 INFO ]: CoverageRelationStatistics Valid=163, Invalid=1817, Unknown=0, NotChecked=0, Total=1980 [2018-06-18 13:35:01,565 INFO ]: Start difference. First operand 31 states and 32 transitions. Second operand 45 states. [2018-06-18 13:35:02,579 WARN ]: Spent 957.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 84 [2018-06-18 13:35:02,855 WARN ]: Spent 179.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 27 [2018-06-18 13:35:03,363 WARN ]: Spent 384.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 43 [2018-06-18 13:35:03,880 WARN ]: Spent 473.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 46 [2018-06-18 13:35:04,420 WARN ]: Spent 497.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 47 [2018-06-18 13:35:04,833 WARN ]: Spent 367.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 42 [2018-06-18 13:35:05,339 WARN ]: Spent 458.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 41 Received shutdown request... [2018-06-18 13:35:05,448 WARN ]: Removed 6 from assertion stack [2018-06-18 13:35:05,448 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-18 13:35:05,448 WARN ]: Verification canceled [2018-06-18 13:35:05,453 WARN ]: Timeout [2018-06-18 13:35:05,453 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.06 01:35:05 BoogieIcfgContainer [2018-06-18 13:35:05,453 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-18 13:35:05,454 INFO ]: Toolchain (without parser) took 60926.05 ms. Allocated memory was 308.8 MB in the beginning and 761.3 MB in the end (delta: 452.5 MB). Free memory was 262.2 MB in the beginning and 382.0 MB in the end (delta: -119.8 MB). Peak memory consumption was 332.6 MB. Max. memory is 3.6 GB. [2018-06-18 13:35:05,455 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-18 13:35:05,455 INFO ]: ChcToBoogie took 84.28 ms. Allocated memory is still 308.8 MB. Free memory was 262.2 MB in the beginning and 259.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-18 13:35:05,455 INFO ]: Boogie Preprocessor took 54.96 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:35:05,456 INFO ]: RCFGBuilder took 336.68 ms. Allocated memory is still 308.8 MB. Free memory was 257.2 MB in the beginning and 248.2 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-18 13:35:05,456 INFO ]: TraceAbstraction took 60441.60 ms. Allocated memory was 308.8 MB in the beginning and 761.3 MB in the end (delta: 452.5 MB). Free memory was 248.2 MB in the beginning and 382.0 MB in the end (delta: -133.8 MB). Peak memory consumption was 318.7 MB. Max. memory is 3.6 GB. [2018-06-18 13:35:05,458 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 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 84.28 ms. Allocated memory is still 308.8 MB. Free memory was 262.2 MB in the beginning and 259.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 54.96 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 336.68 ms. Allocated memory is still 308.8 MB. Free memory was 257.2 MB in the beginning and 248.2 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 60441.60 ms. Allocated memory was 308.8 MB in the beginning and 761.3 MB in the end (delta: 452.5 MB). Free memory was 248.2 MB in the beginning and 382.0 MB in the end (delta: -133.8 MB). Peak memory consumption was 318.7 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 constructing difference of abstraction (31states) and interpolant automaton (currently 11 states, 45 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 115. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 13 locations, 1 error locations. TIMEOUT Result, 60.3s OverallTime, 11 OverallIterations, 11 TraceHistogramMax, 28.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 148 SDtfs, 673 SDslu, 1154 SDs, 0 SdLazy, 1064 SolverSat, 806 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 513 GetRequests, 217 SyntacticMatches, 3 SemanticMatches, 292 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1736 ImplicationChecksByTransitivity, 46.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 29.7s InterpolantComputationTime, 629 NumberOfCodeBlocks, 629 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 608 ConstructedInterpolants, 0 QuantifiedInterpolants, 925336 SizeOfPredicates, 599 NumberOfNonLiveVariables, 2475 ConjunctsInSsa, 545 ConjunctsInUnsatCore, 21 InterpolantComputations, 1 PerfectInterpolantSequences, 440/1650 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/nest-if.c.smt2_chcToBoogie_automizer.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-18_13-35-05-473.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/nest-if.c.smt2_chcToBoogie_automizer.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-18_13-35-05-473.csv Completed graceful shutdown