java -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chccomp2018/chcToBoogie_automizer.epf -i /storage/chc-comp/llreve-bench/smt2/arrays/libc__memchr_1.array.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-55b8104 [2018-06-18 11:43:05,146 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-18 11:43:05,150 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-18 11:43:05,164 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-18 11:43:05,165 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-18 11:43:05,165 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-18 11:43:05,169 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-18 11:43:05,172 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-18 11:43:05,173 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-18 11:43:05,175 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-18 11:43:05,176 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-18 11:43:05,176 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-18 11:43:05,177 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-18 11:43:05,180 INFO L177 SettingsManager]: ChcToBoogie provides no preferences, ignoring... [2018-06-18 11:43:05,180 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-18 11:43:05,181 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-18 11:43:05,192 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-18 11:43:05,194 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-18 11:43:05,195 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-18 11:43:05,199 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-18 11:43:05,200 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-18 11:43:05,202 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-18 11:43:05,202 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-18 11:43:05,202 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-18 11:43:05,204 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-18 11:43:05,205 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-18 11:43:05,206 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-18 11:43:05,206 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-18 11:43:05,211 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-18 11:43:05,211 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-18 11:43:05,212 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-18 11:43:05,212 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-18 11:43:05,213 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-18 11:43:05,213 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-18 11:43:05,217 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-18 11:43:05,217 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chccomp2018/chcToBoogie_automizer.epf [2018-06-18 11:43:05,230 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-18 11:43:05,231 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-18 11:43:05,231 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-18 11:43:05,231 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-18 11:43:05,233 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-18 11:43:05,233 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-18 11:43:05,233 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-18 11:43:05,233 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-18 11:43:05,233 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-18 11:43:05,234 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-18 11:43:05,234 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-18 11:43:05,234 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-18 11:43:05,234 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-18 11:43:05,234 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-18 11:43:05,234 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-18 11:43:05,234 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-18 11:43:05,237 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-18 11:43:05,239 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-18 11:43:05,239 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-18 11:43:05,289 INFO ]: Repository-Root is: /tmp [2018-06-18 11:43:05,306 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-18 11:43:05,311 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-18 11:43:05,312 INFO ]: Initializing SmtParser... [2018-06-18 11:43:05,313 INFO ]: SmtParser initialized [2018-06-18 11:43:05,313 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/arrays/libc__memchr_1.array.smt2 [2018-06-18 11:43:05,315 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-18 11:43:05,411 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/arrays/libc__memchr_1.array.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@f3756a7 [2018-06-18 11:43:05,666 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/arrays/libc__memchr_1.array.smt2 [2018-06-18 11:43:05,678 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-18 11:43:05,684 INFO ]: Walking toolchain with 4 elements. [2018-06-18 11:43:05,684 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-18 11:43:05,684 INFO ]: Initializing ChcToBoogie... [2018-06-18 11:43:05,685 INFO ]: ChcToBoogie initialized [2018-06-18 11:43:05,695 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 18.06 11:43:05" (1/1) ... [2018-06-18 11:43:05,771 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:43:05 Unit [2018-06-18 11:43:05,771 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-18 11:43:05,772 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-18 11:43:05,772 INFO ]: Initializing Boogie Preprocessor... [2018-06-18 11:43:05,772 INFO ]: Boogie Preprocessor initialized [2018-06-18 11:43:05,795 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:43:05" (1/1) ... [2018-06-18 11:43:05,796 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:43:05" (1/1) ... [2018-06-18 11:43:05,809 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:43:05" (1/1) ... [2018-06-18 11:43:05,809 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:43:05" (1/1) ... [2018-06-18 11:43:05,824 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:43:05" (1/1) ... [2018-06-18 11:43:05,827 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:43:05" (1/1) ... [2018-06-18 11:43:05,828 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:43:05" (1/1) ... [2018-06-18 11:43:05,830 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-18 11:43:05,831 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-18 11:43:05,831 INFO ]: Initializing RCFGBuilder... [2018-06-18 11:43:05,831 INFO ]: RCFGBuilder initialized [2018-06-18 11:43:05,832 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:43:05" (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 11:43:05,844 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-18 11:43:05,844 INFO ]: Found specification of procedure False [2018-06-18 11:43:05,844 INFO ]: Found implementation of procedure False [2018-06-18 11:43:05,844 INFO ]: Specification and implementation of procedure INV_MAIN_42 given in one single declaration [2018-06-18 11:43:05,844 INFO ]: Found specification of procedure INV_MAIN_42 [2018-06-18 11:43:05,844 INFO ]: Found implementation of procedure INV_MAIN_42 [2018-06-18 11:43:05,844 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-18 11:43:05,844 INFO ]: Found specification of procedure Ultimate.START [2018-06-18 11:43:05,844 INFO ]: Found implementation of procedure Ultimate.START [2018-06-18 11:43:06,262 INFO ]: Using library mode [2018-06-18 11:43:06,263 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.06 11:43:06 BoogieIcfgContainer [2018-06-18 11:43:06,263 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-18 11:43:06,264 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-18 11:43:06,264 INFO ]: Initializing TraceAbstraction... [2018-06-18 11:43:06,268 INFO ]: TraceAbstraction initialized [2018-06-18 11:43:06,268 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 18.06 11:43:05" (1/3) ... [2018-06-18 11:43:06,269 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7619651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 18.06 11:43:06, skipping insertion in model container [2018-06-18 11:43:06,269 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:43:05" (2/3) ... [2018-06-18 11:43:06,269 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7619651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.06 11:43:06, skipping insertion in model container [2018-06-18 11:43:06,269 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.06 11:43:06" (3/3) ... [2018-06-18 11:43:06,271 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-18 11:43:06,281 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-18 11:43:06,291 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-18 11:43:06,341 INFO ]: Using default assertion order modulation [2018-06-18 11:43:06,341 INFO ]: Interprodecural is true [2018-06-18 11:43:06,341 INFO ]: Hoare is false [2018-06-18 11:43:06,341 INFO ]: Compute interpolants for FPandBP [2018-06-18 11:43:06,341 INFO ]: Backedges is TWOTRACK [2018-06-18 11:43:06,341 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-18 11:43:06,342 INFO ]: Difference is false [2018-06-18 11:43:06,342 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-18 11:43:06,342 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-18 11:43:06,364 INFO ]: Start isEmpty. Operand 18 states. [2018-06-18 11:43:06,383 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-18 11:43:06,384 INFO ]: Found error trace [2018-06-18 11:43:06,385 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-18 11:43:06,385 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:43:06,390 INFO ]: Analyzing trace with hash 97560132, now seen corresponding path program 1 times [2018-06-18 11:43:06,392 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:43:06,393 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:43:06,445 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:06,445 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:43:06,445 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:06,460 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:43:06,466 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:43:06,480 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-18 11:43:06,483 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-18 11:43:06,483 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-18 11:43:06,486 INFO ]: Interpolant automaton has 2 states [2018-06-18 11:43:06,502 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-18 11:43:06,503 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-18 11:43:06,506 INFO ]: Start difference. First operand 18 states. Second operand 2 states. [2018-06-18 11:43:06,534 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:43:06,535 INFO ]: Finished difference Result 16 states and 27 transitions. [2018-06-18 11:43:06,535 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-18 11:43:06,536 INFO ]: Start accepts. Automaton has 2 states. Word has length 5 [2018-06-18 11:43:06,536 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:43:06,549 INFO ]: With dead ends: 16 [2018-06-18 11:43:06,549 INFO ]: Without dead ends: 16 [2018-06-18 11:43:06,551 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-18 11:43:06,568 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-18 11:43:06,591 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-18 11:43:06,593 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-18 11:43:06,594 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 27 transitions. [2018-06-18 11:43:06,595 INFO ]: Start accepts. Automaton has 16 states and 27 transitions. Word has length 5 [2018-06-18 11:43:06,596 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:43:06,596 INFO ]: Abstraction has 16 states and 27 transitions. [2018-06-18 11:43:06,596 INFO ]: Interpolant automaton has 2 states. [2018-06-18 11:43:06,596 INFO ]: Start isEmpty. Operand 16 states and 27 transitions. [2018-06-18 11:43:06,599 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-18 11:43:06,599 INFO ]: Found error trace [2018-06-18 11:43:06,599 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:43:06,599 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:43:06,599 INFO ]: Analyzing trace with hash -262207901, now seen corresponding path program 1 times [2018-06-18 11:43:06,599 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:43:06,599 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:43:06,600 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:06,600 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:43:06,600 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:06,639 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:43:06,640 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:43:06,872 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-18 11:43:06,872 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-18 11:43:06,872 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-18 11:43:06,874 INFO ]: Interpolant automaton has 4 states [2018-06-18 11:43:06,874 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-18 11:43:06,874 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 11:43:06,874 INFO ]: Start difference. First operand 16 states and 27 transitions. Second operand 4 states. [2018-06-18 11:43:07,204 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:43:07,204 INFO ]: Finished difference Result 20 states and 36 transitions. [2018-06-18 11:43:07,205 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-18 11:43:07,205 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-18 11:43:07,205 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:43:07,206 INFO ]: With dead ends: 20 [2018-06-18 11:43:07,206 INFO ]: Without dead ends: 20 [2018-06-18 11:43:07,207 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 11:43:07,207 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-18 11:43:07,218 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 18. [2018-06-18 11:43:07,218 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-18 11:43:07,220 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 34 transitions. [2018-06-18 11:43:07,220 INFO ]: Start accepts. Automaton has 18 states and 34 transitions. Word has length 9 [2018-06-18 11:43:07,220 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:43:07,220 INFO ]: Abstraction has 18 states and 34 transitions. [2018-06-18 11:43:07,220 INFO ]: Interpolant automaton has 4 states. [2018-06-18 11:43:07,220 INFO ]: Start isEmpty. Operand 18 states and 34 transitions. [2018-06-18 11:43:07,222 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-18 11:43:07,222 INFO ]: Found error trace [2018-06-18 11:43:07,222 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:43:07,222 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:43:07,222 INFO ]: Analyzing trace with hash 1853084593, now seen corresponding path program 1 times [2018-06-18 11:43:07,222 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:43:07,222 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:43:07,225 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:07,225 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:43:07,225 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:07,235 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:43:07,236 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:43:07,423 WARN ]: Spent 136.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-06-18 11:43:07,562 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-18 11:43:07,563 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-18 11:43:07,563 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-18 11:43:07,563 INFO ]: Interpolant automaton has 4 states [2018-06-18 11:43:07,563 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-18 11:43:07,563 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 11:43:07,563 INFO ]: Start difference. First operand 18 states and 34 transitions. Second operand 4 states. [2018-06-18 11:43:07,751 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:43:07,751 INFO ]: Finished difference Result 20 states and 35 transitions. [2018-06-18 11:43:07,755 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-18 11:43:07,755 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-18 11:43:07,756 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:43:07,756 INFO ]: With dead ends: 20 [2018-06-18 11:43:07,757 INFO ]: Without dead ends: 20 [2018-06-18 11:43:07,757 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 11:43:07,757 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-18 11:43:07,769 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 18. [2018-06-18 11:43:07,769 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-18 11:43:07,770 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-06-18 11:43:07,771 INFO ]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 9 [2018-06-18 11:43:07,771 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:43:07,771 INFO ]: Abstraction has 18 states and 33 transitions. [2018-06-18 11:43:07,771 INFO ]: Interpolant automaton has 4 states. [2018-06-18 11:43:07,771 INFO ]: Start isEmpty. Operand 18 states and 33 transitions. [2018-06-18 11:43:07,772 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-18 11:43:07,772 INFO ]: Found error trace [2018-06-18 11:43:07,772 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:43:07,772 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:43:07,772 INFO ]: Analyzing trace with hash 266517040, now seen corresponding path program 1 times [2018-06-18 11:43:07,772 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:43:07,772 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:43:07,773 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:07,773 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:43:07,773 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:07,786 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:43:07,787 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:43:07,882 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-18 11:43:07,882 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-18 11:43:07,882 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-18 11:43:07,882 INFO ]: Interpolant automaton has 4 states [2018-06-18 11:43:07,882 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-18 11:43:07,882 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 11:43:07,882 INFO ]: Start difference. First operand 18 states and 33 transitions. Second operand 4 states. [2018-06-18 11:43:08,208 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:43:08,208 INFO ]: Finished difference Result 18 states and 31 transitions. [2018-06-18 11:43:08,208 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-18 11:43:08,208 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-18 11:43:08,209 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:43:08,209 INFO ]: With dead ends: 18 [2018-06-18 11:43:08,209 INFO ]: Without dead ends: 17 [2018-06-18 11:43:08,210 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 11:43:08,210 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-18 11:43:08,215 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-18 11:43:08,215 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-18 11:43:08,216 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 29 transitions. [2018-06-18 11:43:08,216 INFO ]: Start accepts. Automaton has 17 states and 29 transitions. Word has length 9 [2018-06-18 11:43:08,216 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:43:08,216 INFO ]: Abstraction has 17 states and 29 transitions. [2018-06-18 11:43:08,216 INFO ]: Interpolant automaton has 4 states. [2018-06-18 11:43:08,216 INFO ]: Start isEmpty. Operand 17 states and 29 transitions. [2018-06-18 11:43:08,217 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-18 11:43:08,217 INFO ]: Found error trace [2018-06-18 11:43:08,217 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:43:08,217 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:43:08,217 INFO ]: Analyzing trace with hash 2133575368, now seen corresponding path program 1 times [2018-06-18 11:43:08,217 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:43:08,217 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:43:08,218 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:08,218 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:43:08,218 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:08,225 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:43:08,226 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:43:08,299 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-18 11:43:08,299 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-18 11:43:08,299 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-18 11:43:08,299 INFO ]: Interpolant automaton has 4 states [2018-06-18 11:43:08,299 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-18 11:43:08,299 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 11:43:08,299 INFO ]: Start difference. First operand 17 states and 29 transitions. Second operand 4 states. [2018-06-18 11:43:08,439 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:43:08,439 INFO ]: Finished difference Result 19 states and 30 transitions. [2018-06-18 11:43:08,439 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-18 11:43:08,439 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-18 11:43:08,439 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:43:08,440 INFO ]: With dead ends: 19 [2018-06-18 11:43:08,440 INFO ]: Without dead ends: 19 [2018-06-18 11:43:08,441 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 11:43:08,441 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-18 11:43:08,444 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-06-18 11:43:08,444 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-18 11:43:08,445 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 28 transitions. [2018-06-18 11:43:08,445 INFO ]: Start accepts. Automaton has 17 states and 28 transitions. Word has length 9 [2018-06-18 11:43:08,445 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:43:08,445 INFO ]: Abstraction has 17 states and 28 transitions. [2018-06-18 11:43:08,445 INFO ]: Interpolant automaton has 4 states. [2018-06-18 11:43:08,446 INFO ]: Start isEmpty. Operand 17 states and 28 transitions. [2018-06-18 11:43:08,446 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-18 11:43:08,447 INFO ]: Found error trace [2018-06-18 11:43:08,447 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:43:08,447 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:43:08,447 INFO ]: Analyzing trace with hash -585166218, now seen corresponding path program 1 times [2018-06-18 11:43:08,447 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:43:08,447 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:43:08,448 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:08,448 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:43:08,448 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:08,457 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:43:08,458 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:43:08,598 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 11:43:08,598 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:43:08,598 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 11:43:08,613 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:43:08,644 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:43:08,652 INFO ]: Computing forward predicates... [2018-06-18 11:43:08,924 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 11:43:08,958 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:43:08,958 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-18 11:43:08,958 INFO ]: Interpolant automaton has 6 states [2018-06-18 11:43:08,958 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-18 11:43:08,958 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-18 11:43:08,959 INFO ]: Start difference. First operand 17 states and 28 transitions. Second operand 6 states. [2018-06-18 11:43:09,147 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:43:09,149 INFO ]: Finished difference Result 23 states and 43 transitions. [2018-06-18 11:43:09,149 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-18 11:43:09,149 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-18 11:43:09,149 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:43:09,150 INFO ]: With dead ends: 23 [2018-06-18 11:43:09,150 INFO ]: Without dead ends: 23 [2018-06-18 11:43:09,151 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-18 11:43:09,151 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-18 11:43:09,157 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 19. [2018-06-18 11:43:09,157 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-18 11:43:09,158 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 34 transitions. [2018-06-18 11:43:09,158 INFO ]: Start accepts. Automaton has 19 states and 34 transitions. Word has length 13 [2018-06-18 11:43:09,158 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:43:09,158 INFO ]: Abstraction has 19 states and 34 transitions. [2018-06-18 11:43:09,158 INFO ]: Interpolant automaton has 6 states. [2018-06-18 11:43:09,158 INFO ]: Start isEmpty. Operand 19 states and 34 transitions. [2018-06-18 11:43:09,159 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-18 11:43:09,159 INFO ]: Found error trace [2018-06-18 11:43:09,159 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:43:09,159 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:43:09,160 INFO ]: Analyzing trace with hash -1670727128, now seen corresponding path program 1 times [2018-06-18 11:43:09,160 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:43:09,160 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:43:09,161 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:09,161 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:43:09,161 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:09,178 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:43:09,179 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:43:09,467 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 11:43:09,467 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:43:09,467 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 11:43:09,477 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:43:09,496 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:43:09,499 INFO ]: Computing forward predicates... [2018-06-18 11:43:09,546 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 11:43:09,570 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:43:09,570 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-18 11:43:09,570 INFO ]: Interpolant automaton has 6 states [2018-06-18 11:43:09,570 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-18 11:43:09,570 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-18 11:43:09,570 INFO ]: Start difference. First operand 19 states and 34 transitions. Second operand 6 states. [2018-06-18 11:43:09,992 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:43:09,992 INFO ]: Finished difference Result 23 states and 41 transitions. [2018-06-18 11:43:09,993 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-18 11:43:09,993 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-18 11:43:09,993 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:43:09,994 INFO ]: With dead ends: 23 [2018-06-18 11:43:09,994 INFO ]: Without dead ends: 23 [2018-06-18 11:43:09,995 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-18 11:43:09,995 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-18 11:43:09,999 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 17. [2018-06-18 11:43:10,000 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-18 11:43:10,002 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 28 transitions. [2018-06-18 11:43:10,002 INFO ]: Start accepts. Automaton has 17 states and 28 transitions. Word has length 13 [2018-06-18 11:43:10,002 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:43:10,002 INFO ]: Abstraction has 17 states and 28 transitions. [2018-06-18 11:43:10,002 INFO ]: Interpolant automaton has 6 states. [2018-06-18 11:43:10,002 INFO ]: Start isEmpty. Operand 17 states and 28 transitions. [2018-06-18 11:43:10,003 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-18 11:43:10,003 INFO ]: Found error trace [2018-06-18 11:43:10,003 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:43:10,003 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:43:10,004 INFO ]: Analyzing trace with hash -437390061, now seen corresponding path program 1 times [2018-06-18 11:43:10,004 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:43:10,004 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:43:10,005 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:10,005 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:43:10,005 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:10,022 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:43:10,023 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:43:10,146 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-18 11:43:10,146 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-18 11:43:10,146 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-18 11:43:10,146 INFO ]: Interpolant automaton has 5 states [2018-06-18 11:43:10,146 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-18 11:43:10,146 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-18 11:43:10,147 INFO ]: Start difference. First operand 17 states and 28 transitions. Second operand 5 states. [2018-06-18 11:43:10,309 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:43:10,309 INFO ]: Finished difference Result 25 states and 47 transitions. [2018-06-18 11:43:10,310 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-18 11:43:10,310 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-18 11:43:10,310 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:43:10,311 INFO ]: With dead ends: 25 [2018-06-18 11:43:10,311 INFO ]: Without dead ends: 25 [2018-06-18 11:43:10,311 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-18 11:43:10,311 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-18 11:43:10,317 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 21. [2018-06-18 11:43:10,317 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-18 11:43:10,318 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 38 transitions. [2018-06-18 11:43:10,318 INFO ]: Start accepts. Automaton has 21 states and 38 transitions. Word has length 13 [2018-06-18 11:43:10,318 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:43:10,318 INFO ]: Abstraction has 21 states and 38 transitions. [2018-06-18 11:43:10,318 INFO ]: Interpolant automaton has 5 states. [2018-06-18 11:43:10,318 INFO ]: Start isEmpty. Operand 21 states and 38 transitions. [2018-06-18 11:43:10,319 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-18 11:43:10,319 INFO ]: Found error trace [2018-06-18 11:43:10,319 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:43:10,319 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:43:10,319 INFO ]: Analyzing trace with hash -1522950971, now seen corresponding path program 1 times [2018-06-18 11:43:10,319 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:43:10,319 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:43:10,320 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:10,320 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:43:10,320 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:10,334 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:43:10,334 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:43:10,559 WARN ]: Spent 180.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2018-06-18 11:43:10,686 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-18 11:43:10,686 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-18 11:43:10,686 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-18 11:43:10,686 INFO ]: Interpolant automaton has 5 states [2018-06-18 11:43:10,686 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-18 11:43:10,686 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-18 11:43:10,686 INFO ]: Start difference. First operand 21 states and 38 transitions. Second operand 5 states. [2018-06-18 11:43:10,934 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:43:10,934 INFO ]: Finished difference Result 25 states and 46 transitions. [2018-06-18 11:43:10,935 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-18 11:43:10,935 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-18 11:43:10,935 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:43:10,936 INFO ]: With dead ends: 25 [2018-06-18 11:43:10,936 INFO ]: Without dead ends: 25 [2018-06-18 11:43:10,936 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-18 11:43:10,936 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-18 11:43:10,941 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 21. [2018-06-18 11:43:10,941 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-18 11:43:10,942 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 37 transitions. [2018-06-18 11:43:10,942 INFO ]: Start accepts. Automaton has 21 states and 37 transitions. Word has length 13 [2018-06-18 11:43:10,942 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:43:10,942 INFO ]: Abstraction has 21 states and 37 transitions. [2018-06-18 11:43:10,942 INFO ]: Interpolant automaton has 5 states. [2018-06-18 11:43:10,942 INFO ]: Start isEmpty. Operand 21 states and 37 transitions. [2018-06-18 11:43:10,943 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-18 11:43:10,943 INFO ]: Found error trace [2018-06-18 11:43:10,943 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:43:10,943 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:43:10,943 INFO ]: Analyzing trace with hash 1425478570, now seen corresponding path program 1 times [2018-06-18 11:43:10,943 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:43:10,943 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:43:10,944 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:10,944 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:43:10,944 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:10,952 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:43:10,952 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:43:11,158 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 11:43:11,158 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:43:11,158 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 11:43:11,172 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:43:11,194 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:43:11,196 INFO ]: Computing forward predicates... [2018-06-18 11:43:11,240 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-18 11:43:11,260 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-18 11:43:11,260 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2018-06-18 11:43:11,260 INFO ]: Interpolant automaton has 7 states [2018-06-18 11:43:11,260 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-18 11:43:11,260 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-18 11:43:11,260 INFO ]: Start difference. First operand 21 states and 37 transitions. Second operand 7 states. [2018-06-18 11:43:11,434 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:43:11,434 INFO ]: Finished difference Result 25 states and 45 transitions. [2018-06-18 11:43:11,434 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-18 11:43:11,434 INFO ]: Start accepts. Automaton has 7 states. Word has length 13 [2018-06-18 11:43:11,435 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:43:11,435 INFO ]: With dead ends: 25 [2018-06-18 11:43:11,435 INFO ]: Without dead ends: 25 [2018-06-18 11:43:11,436 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-18 11:43:11,436 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-18 11:43:11,441 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 21. [2018-06-18 11:43:11,441 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-18 11:43:11,442 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 36 transitions. [2018-06-18 11:43:11,442 INFO ]: Start accepts. Automaton has 21 states and 36 transitions. Word has length 13 [2018-06-18 11:43:11,442 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:43:11,442 INFO ]: Abstraction has 21 states and 36 transitions. [2018-06-18 11:43:11,442 INFO ]: Interpolant automaton has 7 states. [2018-06-18 11:43:11,442 INFO ]: Start isEmpty. Operand 21 states and 36 transitions. [2018-06-18 11:43:11,443 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-18 11:43:11,443 INFO ]: Found error trace [2018-06-18 11:43:11,443 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:43:11,443 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:43:11,444 INFO ]: Analyzing trace with hash -339915365, now seen corresponding path program 1 times [2018-06-18 11:43:11,444 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:43:11,444 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:43:11,444 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:11,444 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:43:11,444 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:11,454 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:43:11,454 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:43:11,514 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 11:43:11,515 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:43:11,515 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 11:43:11,523 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:43:11,549 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:43:11,551 INFO ]: Computing forward predicates... [2018-06-18 11:43:11,812 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 11:43:11,848 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:43:11,848 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-18 11:43:11,848 INFO ]: Interpolant automaton has 10 states [2018-06-18 11:43:11,848 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-18 11:43:11,849 INFO ]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-06-18 11:43:11,849 INFO ]: Start difference. First operand 21 states and 36 transitions. Second operand 10 states. [2018-06-18 11:43:12,068 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:43:12,068 INFO ]: Finished difference Result 31 states and 63 transitions. [2018-06-18 11:43:12,068 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-18 11:43:12,068 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-18 11:43:12,069 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:43:12,070 INFO ]: With dead ends: 31 [2018-06-18 11:43:12,070 INFO ]: Without dead ends: 31 [2018-06-18 11:43:12,070 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-06-18 11:43:12,070 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-18 11:43:12,076 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 23. [2018-06-18 11:43:12,077 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-18 11:43:12,077 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 42 transitions. [2018-06-18 11:43:12,077 INFO ]: Start accepts. Automaton has 23 states and 42 transitions. Word has length 13 [2018-06-18 11:43:12,077 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:43:12,077 INFO ]: Abstraction has 23 states and 42 transitions. [2018-06-18 11:43:12,077 INFO ]: Interpolant automaton has 10 states. [2018-06-18 11:43:12,077 INFO ]: Start isEmpty. Operand 23 states and 42 transitions. [2018-06-18 11:43:12,082 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-18 11:43:12,082 INFO ]: Found error trace [2018-06-18 11:43:12,082 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:43:12,082 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:43:12,083 INFO ]: Analyzing trace with hash -1425476275, now seen corresponding path program 1 times [2018-06-18 11:43:12,083 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:43:12,083 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:43:12,083 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:12,083 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:43:12,083 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:12,106 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:43:12,106 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:43:12,172 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 11:43:12,172 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:43:12,172 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 11:43:12,181 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:43:12,190 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:43:12,192 INFO ]: Computing forward predicates... [2018-06-18 11:43:12,217 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 11:43:12,246 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:43:12,247 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-18 11:43:12,247 INFO ]: Interpolant automaton has 6 states [2018-06-18 11:43:12,247 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-18 11:43:12,247 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-18 11:43:12,247 INFO ]: Start difference. First operand 23 states and 42 transitions. Second operand 6 states. [2018-06-18 11:43:12,384 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:43:12,384 INFO ]: Finished difference Result 31 states and 62 transitions. [2018-06-18 11:43:12,385 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-18 11:43:12,385 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-18 11:43:12,385 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:43:12,386 INFO ]: With dead ends: 31 [2018-06-18 11:43:12,386 INFO ]: Without dead ends: 31 [2018-06-18 11:43:12,386 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-18 11:43:12,386 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-18 11:43:12,392 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 25. [2018-06-18 11:43:12,392 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-18 11:43:12,393 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 47 transitions. [2018-06-18 11:43:12,393 INFO ]: Start accepts. Automaton has 25 states and 47 transitions. Word has length 13 [2018-06-18 11:43:12,393 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:43:12,393 INFO ]: Abstraction has 25 states and 47 transitions. [2018-06-18 11:43:12,393 INFO ]: Interpolant automaton has 6 states. [2018-06-18 11:43:12,393 INFO ]: Start isEmpty. Operand 25 states and 47 transitions. [2018-06-18 11:43:12,394 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-18 11:43:12,394 INFO ]: Found error trace [2018-06-18 11:43:12,394 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:43:12,394 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:43:12,394 INFO ]: Analyzing trace with hash 1522953266, now seen corresponding path program 1 times [2018-06-18 11:43:12,395 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:43:12,395 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:43:12,395 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:12,395 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:43:12,395 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:12,403 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:43:12,403 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:43:12,452 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 11:43:12,452 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-18 11:43:12,453 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-18 11:43:12,453 INFO ]: Interpolant automaton has 6 states [2018-06-18 11:43:12,453 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-18 11:43:12,453 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-18 11:43:12,453 INFO ]: Start difference. First operand 25 states and 47 transitions. Second operand 6 states. [2018-06-18 11:43:12,794 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:43:12,794 INFO ]: Finished difference Result 31 states and 61 transitions. [2018-06-18 11:43:12,794 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-18 11:43:12,794 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-18 11:43:12,795 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:43:12,795 INFO ]: With dead ends: 31 [2018-06-18 11:43:12,795 INFO ]: Without dead ends: 31 [2018-06-18 11:43:12,796 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-18 11:43:12,796 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-18 11:43:12,803 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 25. [2018-06-18 11:43:12,803 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-18 11:43:12,806 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 46 transitions. [2018-06-18 11:43:12,806 INFO ]: Start accepts. Automaton has 25 states and 46 transitions. Word has length 13 [2018-06-18 11:43:12,806 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:43:12,807 INFO ]: Abstraction has 25 states and 46 transitions. [2018-06-18 11:43:12,807 INFO ]: Interpolant automaton has 6 states. [2018-06-18 11:43:12,807 INFO ]: Start isEmpty. Operand 25 states and 46 transitions. [2018-06-18 11:43:12,807 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-18 11:43:12,807 INFO ]: Found error trace [2018-06-18 11:43:12,807 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:43:12,807 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:43:12,807 INFO ]: Analyzing trace with hash -1250565934, now seen corresponding path program 1 times [2018-06-18 11:43:12,807 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:43:12,807 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:43:12,808 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:12,808 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:43:12,808 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:12,829 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:43:12,830 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:43:12,923 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-18 11:43:12,923 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-18 11:43:12,923 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-18 11:43:12,923 INFO ]: Interpolant automaton has 4 states [2018-06-18 11:43:12,923 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-18 11:43:12,923 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 11:43:12,923 INFO ]: Start difference. First operand 25 states and 46 transitions. Second operand 4 states. [2018-06-18 11:43:13,038 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:43:13,039 INFO ]: Finished difference Result 40 states and 79 transitions. [2018-06-18 11:43:13,040 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-18 11:43:13,040 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-18 11:43:13,040 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:43:13,041 INFO ]: With dead ends: 40 [2018-06-18 11:43:13,041 INFO ]: Without dead ends: 40 [2018-06-18 11:43:13,041 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-18 11:43:13,041 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-18 11:43:13,050 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 36. [2018-06-18 11:43:13,050 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-18 11:43:13,051 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 69 transitions. [2018-06-18 11:43:13,051 INFO ]: Start accepts. Automaton has 36 states and 69 transitions. Word has length 17 [2018-06-18 11:43:13,051 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:43:13,052 INFO ]: Abstraction has 36 states and 69 transitions. [2018-06-18 11:43:13,052 INFO ]: Interpolant automaton has 4 states. [2018-06-18 11:43:13,052 INFO ]: Start isEmpty. Operand 36 states and 69 transitions. [2018-06-18 11:43:13,053 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-18 11:43:13,053 INFO ]: Found error trace [2018-06-18 11:43:13,053 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:43:13,053 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:43:13,053 INFO ]: Analyzing trace with hash -942010984, now seen corresponding path program 1 times [2018-06-18 11:43:13,053 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:43:13,053 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:43:13,054 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:13,054 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:43:13,054 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:13,061 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:43:13,062 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:43:13,463 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-18 11:43:13,463 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-18 11:43:13,463 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-18 11:43:13,463 INFO ]: Interpolant automaton has 6 states [2018-06-18 11:43:13,464 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-18 11:43:13,464 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-18 11:43:13,464 INFO ]: Start difference. First operand 36 states and 69 transitions. Second operand 6 states. [2018-06-18 11:43:13,692 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:43:13,692 INFO ]: Finished difference Result 50 states and 98 transitions. [2018-06-18 11:43:13,692 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-18 11:43:13,692 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-18 11:43:13,692 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:43:13,693 INFO ]: With dead ends: 50 [2018-06-18 11:43:13,693 INFO ]: Without dead ends: 50 [2018-06-18 11:43:13,693 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-06-18 11:43:13,693 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-18 11:43:13,701 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 38. [2018-06-18 11:43:13,701 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-18 11:43:13,702 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 76 transitions. [2018-06-18 11:43:13,702 INFO ]: Start accepts. Automaton has 38 states and 76 transitions. Word has length 17 [2018-06-18 11:43:13,702 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:43:13,702 INFO ]: Abstraction has 38 states and 76 transitions. [2018-06-18 11:43:13,702 INFO ]: Interpolant automaton has 6 states. [2018-06-18 11:43:13,702 INFO ]: Start isEmpty. Operand 38 states and 76 transitions. [2018-06-18 11:43:13,703 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-18 11:43:13,703 INFO ]: Found error trace [2018-06-18 11:43:13,703 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:43:13,703 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:43:13,703 INFO ]: Analyzing trace with hash -2059163062, now seen corresponding path program 1 times [2018-06-18 11:43:13,703 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:43:13,703 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:43:13,704 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:13,704 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:43:13,704 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:13,712 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:43:13,713 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:43:13,847 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-18 11:43:13,847 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-18 11:43:13,847 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-18 11:43:13,847 INFO ]: Interpolant automaton has 4 states [2018-06-18 11:43:13,847 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-18 11:43:13,847 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 11:43:13,847 INFO ]: Start difference. First operand 38 states and 76 transitions. Second operand 4 states. [2018-06-18 11:43:13,921 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:43:13,921 INFO ]: Finished difference Result 40 states and 73 transitions. [2018-06-18 11:43:13,921 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-18 11:43:13,921 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-18 11:43:13,921 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:43:13,922 INFO ]: With dead ends: 40 [2018-06-18 11:43:13,922 INFO ]: Without dead ends: 36 [2018-06-18 11:43:13,922 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-18 11:43:13,922 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-18 11:43:13,927 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 32. [2018-06-18 11:43:13,928 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-18 11:43:13,928 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 58 transitions. [2018-06-18 11:43:13,928 INFO ]: Start accepts. Automaton has 32 states and 58 transitions. Word has length 17 [2018-06-18 11:43:13,928 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:43:13,928 INFO ]: Abstraction has 32 states and 58 transitions. [2018-06-18 11:43:13,928 INFO ]: Interpolant automaton has 4 states. [2018-06-18 11:43:13,928 INFO ]: Start isEmpty. Operand 32 states and 58 transitions. [2018-06-18 11:43:13,929 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-18 11:43:13,929 INFO ]: Found error trace [2018-06-18 11:43:13,929 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:43:13,929 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:43:13,929 INFO ]: Analyzing trace with hash -971599825, now seen corresponding path program 1 times [2018-06-18 11:43:13,929 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:43:13,929 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:43:13,930 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:13,930 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:43:13,930 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:13,940 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:43:13,941 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:43:14,140 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-18 11:43:14,140 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:43:14,140 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 11:43:14,145 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:43:14,158 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:43:14,160 INFO ]: Computing forward predicates... [2018-06-18 11:43:14,234 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-18 11:43:14,264 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:43:14,264 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-18 11:43:14,265 INFO ]: Interpolant automaton has 7 states [2018-06-18 11:43:14,265 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-18 11:43:14,265 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-18 11:43:14,265 INFO ]: Start difference. First operand 32 states and 58 transitions. Second operand 7 states. [2018-06-18 11:43:14,469 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:43:14,469 INFO ]: Finished difference Result 44 states and 81 transitions. [2018-06-18 11:43:14,470 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-18 11:43:14,470 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-18 11:43:14,470 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:43:14,470 INFO ]: With dead ends: 44 [2018-06-18 11:43:14,470 INFO ]: Without dead ends: 44 [2018-06-18 11:43:14,471 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-18 11:43:14,471 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-18 11:43:14,478 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 34. [2018-06-18 11:43:14,478 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-18 11:43:14,479 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 65 transitions. [2018-06-18 11:43:14,479 INFO ]: Start accepts. Automaton has 34 states and 65 transitions. Word has length 17 [2018-06-18 11:43:14,479 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:43:14,479 INFO ]: Abstraction has 34 states and 65 transitions. [2018-06-18 11:43:14,479 INFO ]: Interpolant automaton has 7 states. [2018-06-18 11:43:14,479 INFO ]: Start isEmpty. Operand 34 states and 65 transitions. [2018-06-18 11:43:14,479 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-18 11:43:14,479 INFO ]: Found error trace [2018-06-18 11:43:14,479 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:43:14,479 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:43:14,480 INFO ]: Analyzing trace with hash 145552253, now seen corresponding path program 1 times [2018-06-18 11:43:14,480 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:43:14,480 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:43:14,480 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:14,480 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:43:14,480 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:14,488 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:43:14,489 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:43:14,552 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-18 11:43:14,552 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:43:14,552 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 11:43:14,558 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:43:14,584 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:43:14,587 INFO ]: Computing forward predicates... [2018-06-18 11:43:14,807 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-18 11:43:14,827 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:43:14,828 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-18 11:43:14,828 INFO ]: Interpolant automaton has 12 states [2018-06-18 11:43:14,828 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-18 11:43:14,828 INFO ]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-06-18 11:43:14,828 INFO ]: Start difference. First operand 34 states and 65 transitions. Second operand 12 states. [2018-06-18 11:43:15,139 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:43:15,140 INFO ]: Finished difference Result 46 states and 82 transitions. [2018-06-18 11:43:15,140 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-18 11:43:15,140 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-18 11:43:15,140 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:43:15,140 INFO ]: With dead ends: 46 [2018-06-18 11:43:15,140 INFO ]: Without dead ends: 46 [2018-06-18 11:43:15,141 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-06-18 11:43:15,141 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-18 11:43:15,146 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 34. [2018-06-18 11:43:15,146 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-18 11:43:15,147 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 63 transitions. [2018-06-18 11:43:15,147 INFO ]: Start accepts. Automaton has 34 states and 63 transitions. Word has length 17 [2018-06-18 11:43:15,147 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:43:15,147 INFO ]: Abstraction has 34 states and 63 transitions. [2018-06-18 11:43:15,147 INFO ]: Interpolant automaton has 12 states. [2018-06-18 11:43:15,147 INFO ]: Start isEmpty. Operand 34 states and 63 transitions. [2018-06-18 11:43:15,148 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-18 11:43:15,148 INFO ]: Found error trace [2018-06-18 11:43:15,148 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:43:15,148 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:43:15,148 INFO ]: Analyzing trace with hash -1434092140, now seen corresponding path program 1 times [2018-06-18 11:43:15,148 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:43:15,148 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:43:15,149 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:15,149 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:43:15,149 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:15,156 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:43:15,157 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:43:15,448 WARN ]: Spent 151.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 6 [2018-06-18 11:43:15,954 WARN ]: Spent 432.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2018-06-18 11:43:15,989 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-18 11:43:15,989 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:43:15,989 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 11:43:15,996 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:43:16,014 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:43:16,015 INFO ]: Computing forward predicates... [2018-06-18 11:43:16,123 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-18 11:43:16,143 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:43:16,143 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-06-18 11:43:16,143 INFO ]: Interpolant automaton has 11 states [2018-06-18 11:43:16,143 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-18 11:43:16,144 INFO ]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-06-18 11:43:16,144 INFO ]: Start difference. First operand 34 states and 63 transitions. Second operand 11 states. [2018-06-18 11:43:16,309 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:43:16,309 INFO ]: Finished difference Result 42 states and 75 transitions. [2018-06-18 11:43:16,310 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-18 11:43:16,310 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-18 11:43:16,310 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:43:16,311 INFO ]: With dead ends: 42 [2018-06-18 11:43:16,311 INFO ]: Without dead ends: 42 [2018-06-18 11:43:16,311 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-06-18 11:43:16,311 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-18 11:43:16,315 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 30. [2018-06-18 11:43:16,315 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-18 11:43:16,315 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 52 transitions. [2018-06-18 11:43:16,315 INFO ]: Start accepts. Automaton has 30 states and 52 transitions. Word has length 17 [2018-06-18 11:43:16,316 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:43:16,316 INFO ]: Abstraction has 30 states and 52 transitions. [2018-06-18 11:43:16,316 INFO ]: Interpolant automaton has 11 states. [2018-06-18 11:43:16,316 INFO ]: Start isEmpty. Operand 30 states and 52 transitions. [2018-06-18 11:43:16,316 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-18 11:43:16,316 INFO ]: Found error trace [2018-06-18 11:43:16,316 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:43:16,316 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:43:16,317 INFO ]: Analyzing trace with hash 1698672687, now seen corresponding path program 2 times [2018-06-18 11:43:16,317 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:43:16,317 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:43:16,317 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:16,317 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:43:16,317 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:16,330 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:43:16,331 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:43:16,631 WARN ]: Spent 164.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-06-18 11:43:16,642 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-18 11:43:16,642 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:43:16,642 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 11:43:16,648 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-18 11:43:16,664 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-18 11:43:16,664 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:43:16,665 INFO ]: Computing forward predicates... [2018-06-18 11:43:16,703 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-06-18 11:43:16,703 INFO ]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-06-18 11:43:16,720 INFO ]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-18 11:43:16,720 INFO ]: Needed 2 recursive calls to eliminate 2 variables, input treesize:7, output treesize:1 [2018-06-18 11:43:16,750 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-18 11:43:16,771 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-18 11:43:16,771 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-06-18 11:43:16,771 INFO ]: Interpolant automaton has 8 states [2018-06-18 11:43:16,771 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-18 11:43:16,771 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-18 11:43:16,772 INFO ]: Start difference. First operand 30 states and 52 transitions. Second operand 8 states. [2018-06-18 11:43:17,167 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:43:17,167 INFO ]: Finished difference Result 45 states and 70 transitions. [2018-06-18 11:43:17,167 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-18 11:43:17,167 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-18 11:43:17,167 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:43:17,168 INFO ]: With dead ends: 45 [2018-06-18 11:43:17,168 INFO ]: Without dead ends: 40 [2018-06-18 11:43:17,168 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-06-18 11:43:17,168 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-18 11:43:17,172 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 30. [2018-06-18 11:43:17,172 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-18 11:43:17,172 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 46 transitions. [2018-06-18 11:43:17,172 INFO ]: Start accepts. Automaton has 30 states and 46 transitions. Word has length 17 [2018-06-18 11:43:17,172 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:43:17,172 INFO ]: Abstraction has 30 states and 46 transitions. [2018-06-18 11:43:17,173 INFO ]: Interpolant automaton has 8 states. [2018-06-18 11:43:17,173 INFO ]: Start isEmpty. Operand 30 states and 46 transitions. [2018-06-18 11:43:17,173 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-18 11:43:17,173 INFO ]: Found error trace [2018-06-18 11:43:17,173 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:43:17,173 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:43:17,174 INFO ]: Analyzing trace with hash 1383178712, now seen corresponding path program 2 times [2018-06-18 11:43:17,174 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:43:17,174 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:43:17,174 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:17,174 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 11:43:17,174 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:17,180 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:43:17,181 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:43:17,417 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-18 11:43:17,417 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:43:17,417 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 11:43:17,423 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-18 11:43:17,450 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-18 11:43:17,450 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:43:17,452 INFO ]: Computing forward predicates... [2018-06-18 11:43:17,485 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-18 11:43:17,504 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:43:17,504 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-18 11:43:17,504 INFO ]: Interpolant automaton has 8 states [2018-06-18 11:43:17,504 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-18 11:43:17,504 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-18 11:43:17,505 INFO ]: Start difference. First operand 30 states and 46 transitions. Second operand 8 states. [2018-06-18 11:43:17,693 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:43:17,693 INFO ]: Finished difference Result 36 states and 55 transitions. [2018-06-18 11:43:17,694 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-18 11:43:17,694 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-18 11:43:17,694 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:43:17,694 INFO ]: With dead ends: 36 [2018-06-18 11:43:17,694 INFO ]: Without dead ends: 35 [2018-06-18 11:43:17,694 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-18 11:43:17,695 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-18 11:43:17,697 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 25. [2018-06-18 11:43:17,697 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-18 11:43:17,697 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2018-06-18 11:43:17,697 INFO ]: Start accepts. Automaton has 25 states and 37 transitions. Word has length 17 [2018-06-18 11:43:17,697 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:43:17,697 INFO ]: Abstraction has 25 states and 37 transitions. [2018-06-18 11:43:17,697 INFO ]: Interpolant automaton has 8 states. [2018-06-18 11:43:17,697 INFO ]: Start isEmpty. Operand 25 states and 37 transitions. [2018-06-18 11:43:17,702 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-18 11:43:17,702 INFO ]: Found error trace [2018-06-18 11:43:17,702 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:43:17,702 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:43:17,702 INFO ]: Analyzing trace with hash 266026634, now seen corresponding path program 2 times [2018-06-18 11:43:17,702 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:43:17,702 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:43:17,703 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:17,703 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 11:43:17,703 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:17,711 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:43:17,711 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:43:17,781 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-18 11:43:17,781 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:43:17,781 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) [2018-06-18 11:43:17,798 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 11:43:17,822 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-18 11:43:17,822 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:43:17,824 INFO ]: Computing forward predicates... [2018-06-18 11:43:17,827 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-06-18 11:43:17,827 INFO ]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-06-18 11:43:17,828 INFO ]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-18 11:43:17,828 INFO ]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:5 [2018-06-18 11:43:17,887 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-18 11:43:17,908 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:43:17,908 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-06-18 11:43:17,908 INFO ]: Interpolant automaton has 10 states [2018-06-18 11:43:17,908 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-18 11:43:17,908 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-18 11:43:17,909 INFO ]: Start difference. First operand 25 states and 37 transitions. Second operand 10 states. [2018-06-18 11:43:18,059 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:43:18,059 INFO ]: Finished difference Result 37 states and 53 transitions. [2018-06-18 11:43:18,061 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-18 11:43:18,061 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-18 11:43:18,061 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:43:18,061 INFO ]: With dead ends: 37 [2018-06-18 11:43:18,061 INFO ]: Without dead ends: 30 [2018-06-18 11:43:18,062 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-06-18 11:43:18,062 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-18 11:43:18,064 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-06-18 11:43:18,064 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-18 11:43:18,064 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-06-18 11:43:18,064 INFO ]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 17 [2018-06-18 11:43:18,065 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:43:18,065 INFO ]: Abstraction has 24 states and 34 transitions. [2018-06-18 11:43:18,065 INFO ]: Interpolant automaton has 10 states. [2018-06-18 11:43:18,065 INFO ]: Start isEmpty. Operand 24 states and 34 transitions. [2018-06-18 11:43:18,066 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-18 11:43:18,066 INFO ]: Found error trace [2018-06-18 11:43:18,066 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:43:18,066 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:43:18,066 INFO ]: Analyzing trace with hash -550071022, now seen corresponding path program 2 times [2018-06-18 11:43:18,066 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:43:18,066 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:43:18,067 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:18,067 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 11:43:18,067 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:18,072 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:43:18,073 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:43:18,158 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-18 11:43:18,158 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:43:18,158 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 11:43:18,163 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-18 11:43:18,175 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-18 11:43:18,175 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:43:18,177 INFO ]: Computing forward predicates... [2018-06-18 11:43:18,529 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-18 11:43:18,561 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:43:18,561 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-18 11:43:18,561 INFO ]: Interpolant automaton has 7 states [2018-06-18 11:43:18,562 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-18 11:43:18,562 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-18 11:43:18,562 INFO ]: Start difference. First operand 24 states and 34 transitions. Second operand 7 states. [2018-06-18 11:43:18,699 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:43:18,699 INFO ]: Finished difference Result 40 states and 57 transitions. [2018-06-18 11:43:18,699 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-18 11:43:18,699 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-18 11:43:18,699 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:43:18,700 INFO ]: With dead ends: 40 [2018-06-18 11:43:18,700 INFO ]: Without dead ends: 40 [2018-06-18 11:43:18,700 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-18 11:43:18,700 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-18 11:43:18,703 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 30. [2018-06-18 11:43:18,703 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-18 11:43:18,704 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2018-06-18 11:43:18,704 INFO ]: Start accepts. Automaton has 30 states and 42 transitions. Word has length 17 [2018-06-18 11:43:18,704 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:43:18,704 INFO ]: Abstraction has 30 states and 42 transitions. [2018-06-18 11:43:18,704 INFO ]: Interpolant automaton has 7 states. [2018-06-18 11:43:18,704 INFO ]: Start isEmpty. Operand 30 states and 42 transitions. [2018-06-18 11:43:18,705 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-18 11:43:18,705 INFO ]: Found error trace [2018-06-18 11:43:18,705 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:43:18,705 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:43:18,705 INFO ]: Analyzing trace with hash -1012563337, now seen corresponding path program 1 times [2018-06-18 11:43:18,705 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:43:18,705 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:43:18,706 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:18,706 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 11:43:18,706 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:18,710 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:43:18,711 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:43:18,960 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-18 11:43:18,960 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:43:18,960 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 11:43:18,967 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:43:18,988 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:43:18,991 INFO ]: Computing forward predicates... [2018-06-18 11:43:19,214 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-18 11:43:19,233 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:43:19,233 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-06-18 11:43:19,234 INFO ]: Interpolant automaton has 12 states [2018-06-18 11:43:19,234 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-18 11:43:19,234 INFO ]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-06-18 11:43:19,234 INFO ]: Start difference. First operand 30 states and 42 transitions. Second operand 12 states. [2018-06-18 11:43:19,670 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:43:19,670 INFO ]: Finished difference Result 37 states and 50 transitions. [2018-06-18 11:43:19,671 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-18 11:43:19,671 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-18 11:43:19,671 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:43:19,671 INFO ]: With dead ends: 37 [2018-06-18 11:43:19,671 INFO ]: Without dead ends: 37 [2018-06-18 11:43:19,671 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-06-18 11:43:19,672 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-18 11:43:19,674 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 29. [2018-06-18 11:43:19,674 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-18 11:43:19,674 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2018-06-18 11:43:19,674 INFO ]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 17 [2018-06-18 11:43:19,674 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:43:19,674 INFO ]: Abstraction has 29 states and 39 transitions. [2018-06-18 11:43:19,674 INFO ]: Interpolant automaton has 12 states. [2018-06-18 11:43:19,674 INFO ]: Start isEmpty. Operand 29 states and 39 transitions. [2018-06-18 11:43:19,674 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-18 11:43:19,674 INFO ]: Found error trace [2018-06-18 11:43:19,674 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:43:19,675 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:43:19,675 INFO ]: Analyzing trace with hash -1576550924, now seen corresponding path program 1 times [2018-06-18 11:43:19,675 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:43:19,675 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:43:19,675 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:19,675 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:43:19,675 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:19,682 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:43:19,683 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:43:19,838 WARN ]: Spent 112.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2018-06-18 11:43:19,885 INFO ]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-18 11:43:19,886 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:43:19,886 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-18 11:43:19,906 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 11:43:19,920 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:43:19,923 INFO ]: Computing forward predicates... [2018-06-18 11:43:20,136 INFO ]: Checked inductivity of 18 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-18 11:43:20,156 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:43:20,156 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-06-18 11:43:20,157 INFO ]: Interpolant automaton has 13 states [2018-06-18 11:43:20,157 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-18 11:43:20,157 INFO ]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-06-18 11:43:20,157 INFO ]: Start difference. First operand 29 states and 39 transitions. Second operand 13 states. [2018-06-18 11:43:20,491 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:43:20,491 INFO ]: Finished difference Result 41 states and 54 transitions. [2018-06-18 11:43:20,491 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-18 11:43:20,491 INFO ]: Start accepts. Automaton has 13 states. Word has length 21 [2018-06-18 11:43:20,491 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:43:20,492 INFO ]: With dead ends: 41 [2018-06-18 11:43:20,492 INFO ]: Without dead ends: 39 [2018-06-18 11:43:20,492 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-06-18 11:43:20,492 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-18 11:43:20,495 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 29. [2018-06-18 11:43:20,495 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-18 11:43:20,495 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2018-06-18 11:43:20,495 INFO ]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 21 [2018-06-18 11:43:20,495 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:43:20,495 INFO ]: Abstraction has 29 states and 39 transitions. [2018-06-18 11:43:20,495 INFO ]: Interpolant automaton has 13 states. [2018-06-18 11:43:20,496 INFO ]: Start isEmpty. Operand 29 states and 39 transitions. [2018-06-18 11:43:20,496 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-18 11:43:20,496 INFO ]: Found error trace [2018-06-18 11:43:20,496 INFO ]: trace histogram [5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:43:20,496 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:43:20,496 INFO ]: Analyzing trace with hash -459500954, now seen corresponding path program 3 times [2018-06-18 11:43:20,496 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:43:20,496 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:43:20,497 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:20,497 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:43:20,497 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:20,507 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:43:20,507 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:43:20,716 INFO ]: Checked inductivity of 33 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-18 11:43:20,716 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:43:20,716 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 11:43:20,722 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-18 11:43:20,746 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-18 11:43:20,746 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:43:20,749 INFO ]: Computing forward predicates... [2018-06-18 11:43:20,854 INFO ]: Checked inductivity of 33 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-18 11:43:20,874 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-18 11:43:20,874 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-06-18 11:43:20,874 INFO ]: Interpolant automaton has 10 states [2018-06-18 11:43:20,874 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-18 11:43:20,875 INFO ]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-18 11:43:20,875 INFO ]: Start difference. First operand 29 states and 39 transitions. Second operand 10 states. [2018-06-18 11:43:21,052 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:43:21,052 INFO ]: Finished difference Result 37 states and 50 transitions. [2018-06-18 11:43:21,052 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-18 11:43:21,052 INFO ]: Start accepts. Automaton has 10 states. Word has length 25 [2018-06-18 11:43:21,053 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:43:21,053 INFO ]: With dead ends: 37 [2018-06-18 11:43:21,053 INFO ]: Without dead ends: 35 [2018-06-18 11:43:21,053 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-06-18 11:43:21,053 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-18 11:43:21,055 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 27. [2018-06-18 11:43:21,055 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-18 11:43:21,056 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2018-06-18 11:43:21,056 INFO ]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 25 [2018-06-18 11:43:21,056 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:43:21,056 INFO ]: Abstraction has 27 states and 36 transitions. [2018-06-18 11:43:21,056 INFO ]: Interpolant automaton has 10 states. [2018-06-18 11:43:21,056 INFO ]: Start isEmpty. Operand 27 states and 36 transitions. [2018-06-18 11:43:21,056 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-18 11:43:21,056 INFO ]: Found error trace [2018-06-18 11:43:21,056 INFO ]: trace histogram [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:43:21,057 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:43:21,057 INFO ]: Analyzing trace with hash 2002763742, now seen corresponding path program 2 times [2018-06-18 11:43:21,057 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:43:21,057 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:43:21,057 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:21,057 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 11:43:21,057 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:43:21,068 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:43:21,068 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:43:21,126 INFO ]: Checked inductivity of 31 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-18 11:43:21,126 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:43:21,126 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 11:43:21,134 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-18 11:43:21,153 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-18 11:43:21,153 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:43:21,155 INFO ]: Computing forward predicates... [2018-06-18 11:43:21,244 INFO ]: Checked inductivity of 31 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-18 11:43:21,265 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:43:21,265 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 11] total 13 [2018-06-18 11:43:21,265 INFO ]: Interpolant automaton has 13 states [2018-06-18 11:43:21,265 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-18 11:43:21,265 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-18 11:43:21,266 INFO ]: Start difference. First operand 27 states and 36 transitions. Second operand 13 states. [2018-06-18 11:43:22,435 WARN ]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-06-18 11:43:22,728 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:43:22,728 INFO ]: Finished difference Result 59 states and 91 transitions. [2018-06-18 11:43:22,728 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-18 11:43:22,728 INFO ]: Start accepts. Automaton has 13 states. Word has length 25 [2018-06-18 11:43:22,729 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:43:22,729 INFO ]: With dead ends: 59 [2018-06-18 11:43:22,729 INFO ]: Without dead ends: 0 [2018-06-18 11:43:22,729 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=252, Invalid=1388, Unknown=0, NotChecked=0, Total=1640 [2018-06-18 11:43:22,729 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-18 11:43:22,729 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-18 11:43:22,729 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-18 11:43:22,729 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-18 11:43:22,729 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-06-18 11:43:22,729 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:43:22,729 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-18 11:43:22,729 INFO ]: Interpolant automaton has 13 states. [2018-06-18 11:43:22,729 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-18 11:43:22,729 INFO ]: Finished isEmpty. No accepting run. [2018-06-18 11:43:22,816 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.06 11:43:22 BoogieIcfgContainer [2018-06-18 11:43:22,816 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-18 11:43:22,817 INFO ]: Toolchain (without parser) took 17138.74 ms. Allocated memory was 303.0 MB in the beginning and 532.2 MB in the end (delta: 229.1 MB). Free memory was 256.4 MB in the beginning and 515.1 MB in the end (delta: -258.7 MB). Peak memory consumption was 16.4 MB. Max. memory is 3.6 GB. [2018-06-18 11:43:22,818 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 303.0 MB. Free memory is still 268.5 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-18 11:43:22,818 INFO ]: ChcToBoogie took 87.32 ms. Allocated memory is still 303.0 MB. Free memory was 256.4 MB in the beginning and 254.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-18 11:43:22,821 INFO ]: Boogie Preprocessor took 58.36 ms. Allocated memory is still 303.0 MB. Free memory was 254.4 MB in the beginning and 252.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-18 11:43:22,821 INFO ]: RCFGBuilder took 431.61 ms. Allocated memory is still 303.0 MB. Free memory was 252.4 MB in the beginning and 241.5 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 3.6 GB. [2018-06-18 11:43:22,822 INFO ]: TraceAbstraction took 16551.54 ms. Allocated memory was 303.0 MB in the beginning and 532.2 MB in the end (delta: 229.1 MB). Free memory was 240.5 MB in the beginning and 515.1 MB in the end (delta: -274.7 MB). Peak memory consumption was 443.5 kB. Max. memory is 3.6 GB. [2018-06-18 11:43:22,824 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 303.0 MB. Free memory is still 268.5 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 87.32 ms. Allocated memory is still 303.0 MB. Free memory was 256.4 MB in the beginning and 254.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 58.36 ms. Allocated memory is still 303.0 MB. Free memory was 254.4 MB in the beginning and 252.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 431.61 ms. Allocated memory is still 303.0 MB. Free memory was 252.4 MB in the beginning and 241.5 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 16551.54 ms. Allocated memory was 303.0 MB in the beginning and 532.2 MB in the end (delta: 229.1 MB). Free memory was 240.5 MB in the beginning and 515.1 MB in the end (delta: -274.7 MB). Peak memory consumption was 443.5 kB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 18 locations, 1 error locations. SAFE Result, 16.4s OverallTime, 27 OverallIterations, 5 TraceHistogramMax, 7.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 631 SDtfs, 130 SDslu, 1567 SDs, 0 SdLazy, 2555 SolverSat, 178 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 499 GetRequests, 263 SyntacticMatches, 24 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 8.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=15, 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.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 164 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 675 NumberOfCodeBlocks, 665 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 632 ConstructedInterpolants, 0 QuantifiedInterpolants, 59072 SizeOfPredicates, 129 NumberOfNonLiveVariables, 1554 ConjunctsInSsa, 529 ConjunctsInUnsatCore, 43 InterpolantComputations, 14 PerfectInterpolantSequences, 256/374 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/libc__memchr_1.array.smt2_chcToBoogie_automizer.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-18_11-43-22-833.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/libc__memchr_1.array.smt2_chcToBoogie_automizer.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-18_11-43-22-833.csv Received shutdown request...