java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i /storage/chc-comp/llreve-bench/smt2/arrays/libc__strncmp_2.array.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:45:44,143 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:45:44,145 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:45:44,158 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:45:44,158 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:45:44,161 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:45:44,162 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:45:44,164 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:45:44,165 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:45:44,167 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:45:44,167 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:45:44,168 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:45:44,168 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:45:44,171 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:45:44,172 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:45:44,172 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:45:44,176 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:45:44,178 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:45:44,179 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:45:44,188 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:45:44,190 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:45:44,191 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:45:44,192 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:45:44,192 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:45:44,193 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:45:44,193 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:45:44,195 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:45:44,196 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:45:44,197 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:45:44,197 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:45:44,198 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:45:44,198 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:45:44,198 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:45:44,202 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:45:44,203 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:45:44,203 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:45:44,224 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:45:44,225 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:45:44,225 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:45:44,225 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:45:44,226 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:45:44,226 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:45:44,227 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:45:44,227 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:45:44,227 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:45:44,227 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:45:44,227 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:45:44,228 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:45:44,228 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:45:44,228 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:45:44,228 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:45:44,228 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:45:44,228 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:45:44,229 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:45:44,231 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:45:44,233 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:45:44,233 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:45:44,283 INFO ]: Repository-Root is: /tmp [2018-06-22 11:45:44,297 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:45:44,301 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:45:44,303 INFO ]: Initializing SmtParser... [2018-06-22 11:45:44,303 INFO ]: SmtParser initialized [2018-06-22 11:45:44,304 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/arrays/libc__strncmp_2.array.smt2 [2018-06-22 11:45:44,305 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 11:45:44,382 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/arrays/libc__strncmp_2.array.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@17348998 [2018-06-22 11:45:44,614 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/arrays/libc__strncmp_2.array.smt2 [2018-06-22 11:45:44,619 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:45:44,626 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:45:44,626 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:45:44,626 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:45:44,626 INFO ]: ChcToBoogie initialized [2018-06-22 11:45:44,632 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:45:44" (1/1) ... [2018-06-22 11:45:44,690 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:45:44 Unit [2018-06-22 11:45:44,690 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:45:44,691 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:45:44,691 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:45:44,691 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:45:44,713 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:45:44" (1/1) ... [2018-06-22 11:45:44,713 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:45:44" (1/1) ... [2018-06-22 11:45:44,723 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:45:44" (1/1) ... [2018-06-22 11:45:44,723 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:45:44" (1/1) ... [2018-06-22 11:45:44,736 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:45:44" (1/1) ... [2018-06-22 11:45:44,743 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:45:44" (1/1) ... [2018-06-22 11:45:44,744 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:45:44" (1/1) ... [2018-06-22 11:45:44,746 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:45:44,746 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:45:44,746 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:45:44,746 INFO ]: RCFGBuilder initialized [2018-06-22 11:45:44,747 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:45:44" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 11:45:44,769 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:45:44,769 INFO ]: Found specification of procedure False [2018-06-22 11:45:44,769 INFO ]: Found implementation of procedure False [2018-06-22 11:45:44,769 INFO ]: Specification and implementation of procedure INV_MAIN_42 given in one single declaration [2018-06-22 11:45:44,769 INFO ]: Found specification of procedure INV_MAIN_42 [2018-06-22 11:45:44,769 INFO ]: Found implementation of procedure INV_MAIN_42 [2018-06-22 11:45:44,769 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:45:44,769 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:45:44,769 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:45:45,286 INFO ]: Using library mode [2018-06-22 11:45:45,287 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:45:45 BoogieIcfgContainer [2018-06-22 11:45:45,287 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:45:45,288 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:45:45,288 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:45:45,301 INFO ]: TraceAbstraction initialized [2018-06-22 11:45:45,301 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:45:44" (1/3) ... [2018-06-22 11:45:45,302 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5374d9e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:45:45, skipping insertion in model container [2018-06-22 11:45:45,302 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:45:44" (2/3) ... [2018-06-22 11:45:45,302 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5374d9e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:45:45, skipping insertion in model container [2018-06-22 11:45:45,302 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:45:45" (3/3) ... [2018-06-22 11:45:45,304 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:45:45,314 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:45:45,322 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:45:45,357 INFO ]: Using default assertion order modulation [2018-06-22 11:45:45,357 INFO ]: Interprodecural is true [2018-06-22 11:45:45,357 INFO ]: Hoare is false [2018-06-22 11:45:45,357 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:45:45,357 INFO ]: Backedges is TWOTRACK [2018-06-22 11:45:45,357 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:45:45,357 INFO ]: Difference is false [2018-06-22 11:45:45,358 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:45:45,358 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:45:45,369 INFO ]: Start isEmpty. Operand 23 states. [2018-06-22 11:45:45,382 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:45:45,382 INFO ]: Found error trace [2018-06-22 11:45:45,383 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:45,383 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:45,389 INFO ]: Analyzing trace with hash -296619737, now seen corresponding path program 1 times [2018-06-22 11:45:45,391 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:45,391 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:45,422 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:45,422 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:45,422 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:45,481 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:45,653 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:45:45,655 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:45,655 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:45:45,656 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:45:45,666 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:45:45,667 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:45:45,668 INFO ]: Start difference. First operand 23 states. Second operand 4 states. [2018-06-22 11:45:46,177 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:46,177 INFO ]: Finished difference Result 25 states and 56 transitions. [2018-06-22 11:45:46,177 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:45:46,179 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:45:46,179 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:46,188 INFO ]: With dead ends: 25 [2018-06-22 11:45:46,188 INFO ]: Without dead ends: 25 [2018-06-22 11:45:46,190 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-22 11:45:46,205 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 11:45:46,239 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-06-22 11:45:46,241 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:45:46,245 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 54 transitions. [2018-06-22 11:45:46,246 INFO ]: Start accepts. Automaton has 23 states and 54 transitions. Word has length 9 [2018-06-22 11:45:46,247 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:46,247 INFO ]: Abstraction has 23 states and 54 transitions. [2018-06-22 11:45:46,247 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:45:46,247 INFO ]: Start isEmpty. Operand 23 states and 54 transitions. [2018-06-22 11:45:46,253 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:45:46,253 INFO ]: Found error trace [2018-06-22 11:45:46,253 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:46,253 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:46,253 INFO ]: Analyzing trace with hash -1289818221, now seen corresponding path program 1 times [2018-06-22 11:45:46,254 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:46,254 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:46,254 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:46,254 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:46,254 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:46,262 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:46,367 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:45:46,367 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:46,367 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:45:46,369 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:45:46,369 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:45:46,369 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:45:46,369 INFO ]: Start difference. First operand 23 states and 54 transitions. Second operand 4 states. [2018-06-22 11:45:46,610 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:46,611 INFO ]: Finished difference Result 25 states and 54 transitions. [2018-06-22 11:45:46,611 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:45:46,611 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:45:46,611 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:46,612 INFO ]: With dead ends: 25 [2018-06-22 11:45:46,612 INFO ]: Without dead ends: 25 [2018-06-22 11:45:46,613 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-22 11:45:46,613 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 11:45:46,623 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-06-22 11:45:46,623 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:45:46,625 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 52 transitions. [2018-06-22 11:45:46,625 INFO ]: Start accepts. Automaton has 23 states and 52 transitions. Word has length 9 [2018-06-22 11:45:46,625 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:46,625 INFO ]: Abstraction has 23 states and 52 transitions. [2018-06-22 11:45:46,625 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:45:46,625 INFO ]: Start isEmpty. Operand 23 states and 52 transitions. [2018-06-22 11:45:46,627 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:45:46,627 INFO ]: Found error trace [2018-06-22 11:45:46,627 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:46,627 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:46,627 INFO ]: Analyzing trace with hash 1602564290, now seen corresponding path program 1 times [2018-06-22 11:45:46,627 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:46,627 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:46,628 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:46,628 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:46,628 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:46,638 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:46,727 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:45:46,727 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:46,727 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:45:46,727 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:45:46,727 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:45:46,727 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:45:46,727 INFO ]: Start difference. First operand 23 states and 52 transitions. Second operand 4 states. [2018-06-22 11:45:47,112 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:47,112 INFO ]: Finished difference Result 27 states and 65 transitions. [2018-06-22 11:45:47,112 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:45:47,112 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:45:47,112 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:47,113 INFO ]: With dead ends: 27 [2018-06-22 11:45:47,113 INFO ]: Without dead ends: 27 [2018-06-22 11:45:47,114 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-22 11:45:47,114 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 11:45:47,121 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-06-22 11:45:47,121 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:45:47,122 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 63 transitions. [2018-06-22 11:45:47,122 INFO ]: Start accepts. Automaton has 25 states and 63 transitions. Word has length 9 [2018-06-22 11:45:47,122 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:47,122 INFO ]: Abstraction has 25 states and 63 transitions. [2018-06-22 11:45:47,122 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:45:47,123 INFO ]: Start isEmpty. Operand 25 states and 63 transitions. [2018-06-22 11:45:47,124 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:45:47,124 INFO ]: Found error trace [2018-06-22 11:45:47,124 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:47,124 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:47,124 INFO ]: Analyzing trace with hash 609365806, now seen corresponding path program 1 times [2018-06-22 11:45:47,124 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:47,124 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:47,125 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:47,125 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:47,125 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:47,134 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:47,196 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:45:47,196 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:47,196 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:45:47,196 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:45:47,196 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:45:47,196 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:45:47,196 INFO ]: Start difference. First operand 25 states and 63 transitions. Second operand 4 states. [2018-06-22 11:45:47,253 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:47,253 INFO ]: Finished difference Result 27 states and 62 transitions. [2018-06-22 11:45:47,254 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:45:47,254 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:45:47,254 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:47,255 INFO ]: With dead ends: 27 [2018-06-22 11:45:47,255 INFO ]: Without dead ends: 27 [2018-06-22 11:45:47,255 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-22 11:45:47,256 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 11:45:47,262 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-06-22 11:45:47,262 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:45:47,263 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 60 transitions. [2018-06-22 11:45:47,263 INFO ]: Start accepts. Automaton has 25 states and 60 transitions. Word has length 9 [2018-06-22 11:45:47,263 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:47,263 INFO ]: Abstraction has 25 states and 60 transitions. [2018-06-22 11:45:47,263 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:45:47,263 INFO ]: Start isEmpty. Operand 25 states and 60 transitions. [2018-06-22 11:45:47,265 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:45:47,265 INFO ]: Found error trace [2018-06-22 11:45:47,265 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:47,265 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:47,266 INFO ]: Analyzing trace with hash 2099163532, now seen corresponding path program 1 times [2018-06-22 11:45:47,266 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:47,266 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:47,266 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:47,266 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:47,266 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:47,273 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:47,528 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:45:47,528 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:47,528 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:45:47,528 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:45:47,528 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:45:47,528 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:45:47,529 INFO ]: Start difference. First operand 25 states and 60 transitions. Second operand 4 states. [2018-06-22 11:45:47,733 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:47,733 INFO ]: Finished difference Result 27 states and 60 transitions. [2018-06-22 11:45:47,733 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:45:47,733 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:45:47,733 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:47,734 INFO ]: With dead ends: 27 [2018-06-22 11:45:47,734 INFO ]: Without dead ends: 27 [2018-06-22 11:45:47,734 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:45:47,734 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 11:45:47,740 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-06-22 11:45:47,740 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:45:47,741 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 58 transitions. [2018-06-22 11:45:47,741 INFO ]: Start accepts. Automaton has 25 states and 58 transitions. Word has length 9 [2018-06-22 11:45:47,741 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:47,741 INFO ]: Abstraction has 25 states and 58 transitions. [2018-06-22 11:45:47,741 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:45:47,741 INFO ]: Start isEmpty. Operand 25 states and 58 transitions. [2018-06-22 11:45:47,743 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:45:47,743 INFO ]: Found error trace [2018-06-22 11:45:47,743 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:47,743 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:47,743 INFO ]: Analyzing trace with hash -977070837, now seen corresponding path program 1 times [2018-06-22 11:45:47,743 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:47,743 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:47,744 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:47,744 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:47,744 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:47,755 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:47,866 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:45:47,867 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:47,867 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:45:47,867 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:45:47,867 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:45:47,867 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:45:47,867 INFO ]: Start difference. First operand 25 states and 58 transitions. Second operand 4 states. [2018-06-22 11:45:47,956 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:47,956 INFO ]: Finished difference Result 27 states and 59 transitions. [2018-06-22 11:45:47,957 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:45:47,957 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:45:47,957 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:47,958 INFO ]: With dead ends: 27 [2018-06-22 11:45:47,958 INFO ]: Without dead ends: 27 [2018-06-22 11:45:47,959 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-22 11:45:47,959 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 11:45:47,964 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-06-22 11:45:47,964 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:45:47,965 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 57 transitions. [2018-06-22 11:45:47,965 INFO ]: Start accepts. Automaton has 25 states and 57 transitions. Word has length 9 [2018-06-22 11:45:47,965 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:47,965 INFO ]: Abstraction has 25 states and 57 transitions. [2018-06-22 11:45:47,965 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:45:47,965 INFO ]: Start isEmpty. Operand 25 states and 57 transitions. [2018-06-22 11:45:47,966 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:47,966 INFO ]: Found error trace [2018-06-22 11:45:47,966 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:47,966 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:47,966 INFO ]: Analyzing trace with hash 699748316, now seen corresponding path program 1 times [2018-06-22 11:45:47,966 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:47,966 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:47,967 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:47,967 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:47,967 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:47,985 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:48,052 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:45:48,052 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:48,052 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:48,058 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:48,093 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:48,100 INFO ]: Computing forward predicates... [2018-06-22 11:45:48,215 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 8 [2018-06-22 11:45:48,216 INFO ]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-06-22 11:45:48,241 INFO ]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-22 11:45:48,241 INFO ]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2018-06-22 11:45:48,277 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:45:48,297 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:48,297 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-22 11:45:48,297 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:45:48,297 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:45:48,297 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:45:48,297 INFO ]: Start difference. First operand 25 states and 57 transitions. Second operand 9 states. [2018-06-22 11:45:48,598 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:48,598 INFO ]: Finished difference Result 35 states and 87 transitions. [2018-06-22 11:45:48,670 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:45:48,670 INFO ]: Start accepts. Automaton has 9 states. Word has length 13 [2018-06-22 11:45:48,670 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:48,671 INFO ]: With dead ends: 35 [2018-06-22 11:45:48,672 INFO ]: Without dead ends: 35 [2018-06-22 11:45:48,672 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:45:48,672 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 11:45:48,682 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 27. [2018-06-22 11:45:48,682 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:45:48,686 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 68 transitions. [2018-06-22 11:45:48,686 INFO ]: Start accepts. Automaton has 27 states and 68 transitions. Word has length 13 [2018-06-22 11:45:48,686 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:48,686 INFO ]: Abstraction has 27 states and 68 transitions. [2018-06-22 11:45:48,686 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:45:48,686 INFO ]: Start isEmpty. Operand 27 states and 68 transitions. [2018-06-22 11:45:48,687 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:48,687 INFO ]: Found error trace [2018-06-22 11:45:48,687 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:48,687 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:48,688 INFO ]: Analyzing trace with hash 1210456378, now seen corresponding path program 1 times [2018-06-22 11:45:48,688 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:48,688 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:48,688 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:48,688 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:48,688 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:48,705 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:48,775 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:45:48,775 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:48,775 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:45:48,775 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:45:48,775 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:45:48,775 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:45:48,775 INFO ]: Start difference. First operand 27 states and 68 transitions. Second operand 6 states. [2018-06-22 11:45:48,973 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:48,973 INFO ]: Finished difference Result 31 states and 80 transitions. [2018-06-22 11:45:48,975 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:45:48,975 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:45:48,975 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:48,976 INFO ]: With dead ends: 31 [2018-06-22 11:45:48,976 INFO ]: Without dead ends: 31 [2018-06-22 11:45:48,976 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-22 11:45:48,976 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:45:48,982 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-06-22 11:45:48,983 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:45:48,983 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 65 transitions. [2018-06-22 11:45:48,983 INFO ]: Start accepts. Automaton has 27 states and 65 transitions. Word has length 13 [2018-06-22 11:45:48,984 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:48,984 INFO ]: Abstraction has 27 states and 65 transitions. [2018-06-22 11:45:48,984 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:45:48,984 INFO ]: Start isEmpty. Operand 27 states and 65 transitions. [2018-06-22 11:45:48,985 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:48,985 INFO ]: Found error trace [2018-06-22 11:45:48,985 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:48,985 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:48,985 INFO ]: Analyzing trace with hash 955102347, now seen corresponding path program 1 times [2018-06-22 11:45:48,985 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:48,985 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:48,986 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:48,986 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:48,986 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:48,997 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:49,074 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:45:49,075 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:49,075 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-22 11:45:49,084 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:49,098 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:49,099 INFO ]: Computing forward predicates... [2018-06-22 11:45:49,137 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:45:49,168 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:49,168 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-22 11:45:49,168 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:45:49,168 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:45:49,168 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:45:49,169 INFO ]: Start difference. First operand 27 states and 65 transitions. Second operand 9 states. [2018-06-22 11:45:49,588 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:49,588 INFO ]: Finished difference Result 31 states and 78 transitions. [2018-06-22 11:45:49,589 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:45:49,589 INFO ]: Start accepts. Automaton has 9 states. Word has length 13 [2018-06-22 11:45:49,589 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:49,590 INFO ]: With dead ends: 31 [2018-06-22 11:45:49,590 INFO ]: Without dead ends: 31 [2018-06-22 11:45:49,590 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:45:49,590 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:45:49,596 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-06-22 11:45:49,596 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:45:49,597 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 63 transitions. [2018-06-22 11:45:49,597 INFO ]: Start accepts. Automaton has 27 states and 63 transitions. Word has length 13 [2018-06-22 11:45:49,597 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:49,597 INFO ]: Abstraction has 27 states and 63 transitions. [2018-06-22 11:45:49,597 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:45:49,597 INFO ]: Start isEmpty. Operand 27 states and 63 transitions. [2018-06-22 11:45:49,598 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:49,598 INFO ]: Found error trace [2018-06-22 11:45:49,598 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:49,598 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:49,598 INFO ]: Analyzing trace with hash 1788120633, now seen corresponding path program 1 times [2018-06-22 11:45:49,598 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:49,598 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:49,599 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:49,599 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:49,599 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:49,607 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:49,771 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:45:49,771 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:49,771 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:49,779 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:49,791 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:49,793 INFO ]: Computing forward predicates... [2018-06-22 11:45:49,837 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 8 [2018-06-22 11:45:49,837 INFO ]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-06-22 11:45:49,839 INFO ]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-22 11:45:49,839 INFO ]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2018-06-22 11:45:49,846 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:45:49,866 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:49,866 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-22 11:45:49,866 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:45:49,866 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:45:49,867 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:45:49,867 INFO ]: Start difference. First operand 27 states and 63 transitions. Second operand 9 states. [2018-06-22 11:45:50,099 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:50,099 INFO ]: Finished difference Result 31 states and 77 transitions. [2018-06-22 11:45:50,100 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:45:50,100 INFO ]: Start accepts. Automaton has 9 states. Word has length 13 [2018-06-22 11:45:50,100 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:50,101 INFO ]: With dead ends: 31 [2018-06-22 11:45:50,101 INFO ]: Without dead ends: 31 [2018-06-22 11:45:50,101 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:45:50,101 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:45:50,106 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-06-22 11:45:50,106 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:45:50,107 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 62 transitions. [2018-06-22 11:45:50,107 INFO ]: Start accepts. Automaton has 27 states and 62 transitions. Word has length 13 [2018-06-22 11:45:50,107 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:50,107 INFO ]: Abstraction has 27 states and 62 transitions. [2018-06-22 11:45:50,107 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:45:50,107 INFO ]: Start isEmpty. Operand 27 states and 62 transitions. [2018-06-22 11:45:50,108 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:50,108 INFO ]: Found error trace [2018-06-22 11:45:50,108 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:50,108 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:50,108 INFO ]: Analyzing trace with hash -1737973163, now seen corresponding path program 1 times [2018-06-22 11:45:50,108 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:50,108 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:50,109 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:50,109 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:50,109 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:50,131 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:50,222 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:45:50,222 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:50,222 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:50,233 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:50,247 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:50,248 INFO ]: Computing forward predicates... [2018-06-22 11:45:50,368 WARN ]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-06-22 11:45:50,377 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 8 [2018-06-22 11:45:50,378 INFO ]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-06-22 11:45:50,379 INFO ]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-22 11:45:50,380 INFO ]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2018-06-22 11:45:50,402 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:45:50,424 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:50,424 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 11:45:50,424 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:45:50,424 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:45:50,424 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:45:50,424 INFO ]: Start difference. First operand 27 states and 62 transitions. Second operand 8 states. [2018-06-22 11:45:50,662 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:50,662 INFO ]: Finished difference Result 33 states and 80 transitions. [2018-06-22 11:45:50,662 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:45:50,662 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:45:50,662 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:50,663 INFO ]: With dead ends: 33 [2018-06-22 11:45:50,663 INFO ]: Without dead ends: 33 [2018-06-22 11:45:50,663 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:45:50,663 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 11:45:50,668 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 27. [2018-06-22 11:45:50,669 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:45:50,669 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 61 transitions. [2018-06-22 11:45:50,669 INFO ]: Start accepts. Automaton has 27 states and 61 transitions. Word has length 13 [2018-06-22 11:45:50,669 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:50,669 INFO ]: Abstraction has 27 states and 61 transitions. [2018-06-22 11:45:50,669 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:45:50,669 INFO ]: Start isEmpty. Operand 27 states and 61 transitions. [2018-06-22 11:45:50,670 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:50,670 INFO ]: Found error trace [2018-06-22 11:45:50,670 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:50,670 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:50,670 INFO ]: Analyzing trace with hash 756815760, now seen corresponding path program 1 times [2018-06-22 11:45:50,671 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:50,671 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:50,671 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:50,671 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:50,671 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:50,696 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:50,798 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:45:50,798 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:50,798 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:45:50,798 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:45:50,798 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:45:50,798 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:45:50,799 INFO ]: Start difference. First operand 27 states and 61 transitions. Second operand 5 states. [2018-06-22 11:45:50,866 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:50,866 INFO ]: Finished difference Result 33 states and 88 transitions. [2018-06-22 11:45:50,867 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:45:50,867 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:45:50,867 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:50,868 INFO ]: With dead ends: 33 [2018-06-22 11:45:50,868 INFO ]: Without dead ends: 33 [2018-06-22 11:45:50,868 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:45:50,869 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 11:45:50,874 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 29. [2018-06-22 11:45:50,874 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 11:45:50,875 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 73 transitions. [2018-06-22 11:45:50,875 INFO ]: Start accepts. Automaton has 29 states and 73 transitions. Word has length 13 [2018-06-22 11:45:50,875 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:50,875 INFO ]: Abstraction has 29 states and 73 transitions. [2018-06-22 11:45:50,875 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:45:50,875 INFO ]: Start isEmpty. Operand 29 states and 73 transitions. [2018-06-22 11:45:50,876 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:50,876 INFO ]: Found error trace [2018-06-22 11:45:50,876 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:50,876 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:50,876 INFO ]: Analyzing trace with hash -1678094312, now seen corresponding path program 1 times [2018-06-22 11:45:50,876 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:50,876 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:50,877 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:50,877 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:50,877 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:50,884 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:50,945 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:45:50,945 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:50,945 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-22 11:45:50,954 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:50,974 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:50,975 INFO ]: Computing forward predicates... [2018-06-22 11:45:51,008 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:45:51,029 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:45:51,030 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2018-06-22 11:45:51,030 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:45:51,030 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:45:51,030 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:45:51,030 INFO ]: Start difference. First operand 29 states and 73 transitions. Second operand 6 states. [2018-06-22 11:45:51,206 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:51,206 INFO ]: Finished difference Result 33 states and 86 transitions. [2018-06-22 11:45:51,207 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:45:51,207 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:45:51,207 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:51,208 INFO ]: With dead ends: 33 [2018-06-22 11:45:51,208 INFO ]: Without dead ends: 33 [2018-06-22 11:45:51,208 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:45:51,208 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 11:45:51,214 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 29. [2018-06-22 11:45:51,214 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 11:45:51,215 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 71 transitions. [2018-06-22 11:45:51,215 INFO ]: Start accepts. Automaton has 29 states and 71 transitions. Word has length 13 [2018-06-22 11:45:51,215 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:51,215 INFO ]: Abstraction has 29 states and 71 transitions. [2018-06-22 11:45:51,215 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:45:51,215 INFO ]: Start isEmpty. Operand 29 states and 71 transitions. [2018-06-22 11:45:51,216 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:51,216 INFO ]: Found error trace [2018-06-22 11:45:51,216 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:51,216 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:51,217 INFO ]: Analyzing trace with hash -1422740281, now seen corresponding path program 1 times [2018-06-22 11:45:51,217 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:51,217 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:51,217 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:51,217 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:51,217 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:51,230 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:51,313 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:45:51,313 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:51,313 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:45:51,313 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:45:51,313 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:45:51,313 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:45:51,314 INFO ]: Start difference. First operand 29 states and 71 transitions. Second operand 6 states. [2018-06-22 11:45:51,401 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:51,401 INFO ]: Finished difference Result 31 states and 71 transitions. [2018-06-22 11:45:51,402 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:45:51,402 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:45:51,402 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:51,403 INFO ]: With dead ends: 31 [2018-06-22 11:45:51,403 INFO ]: Without dead ends: 30 [2018-06-22 11:45:51,403 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:45:51,403 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 11:45:51,408 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-06-22 11:45:51,408 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 11:45:51,409 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 67 transitions. [2018-06-22 11:45:51,409 INFO ]: Start accepts. Automaton has 28 states and 67 transitions. Word has length 13 [2018-06-22 11:45:51,410 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:51,410 INFO ]: Abstraction has 28 states and 67 transitions. [2018-06-22 11:45:51,410 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:45:51,410 INFO ]: Start isEmpty. Operand 28 states and 67 transitions. [2018-06-22 11:45:51,411 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:51,411 INFO ]: Found error trace [2018-06-22 11:45:51,411 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:51,411 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:51,411 INFO ]: Analyzing trace with hash -331556557, now seen corresponding path program 1 times [2018-06-22 11:45:51,411 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:51,412 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:51,412 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:51,412 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:51,412 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:51,438 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:51,618 WARN ]: Spent 100.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2018-06-22 11:45:51,648 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:45:51,648 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:51,648 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:45:51,649 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:45:51,649 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:45:51,649 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:45:51,649 INFO ]: Start difference. First operand 28 states and 67 transitions. Second operand 5 states. [2018-06-22 11:45:51,729 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:51,729 INFO ]: Finished difference Result 32 states and 78 transitions. [2018-06-22 11:45:51,729 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:45:51,729 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:45:51,730 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:51,730 INFO ]: With dead ends: 32 [2018-06-22 11:45:51,730 INFO ]: Without dead ends: 32 [2018-06-22 11:45:51,731 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:45:51,731 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 11:45:51,738 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 28. [2018-06-22 11:45:51,738 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 11:45:51,739 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 64 transitions. [2018-06-22 11:45:51,739 INFO ]: Start accepts. Automaton has 28 states and 64 transitions. Word has length 13 [2018-06-22 11:45:51,739 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:51,739 INFO ]: Abstraction has 28 states and 64 transitions. [2018-06-22 11:45:51,739 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:45:51,739 INFO ]: Start isEmpty. Operand 28 states and 64 transitions. [2018-06-22 11:45:51,740 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:51,740 INFO ]: Found error trace [2018-06-22 11:45:51,740 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:51,740 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:51,740 INFO ]: Analyzing trace with hash 179151505, now seen corresponding path program 1 times [2018-06-22 11:45:51,741 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:51,741 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:51,741 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:51,741 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:51,741 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:51,748 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:52,004 WARN ]: Spent 216.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-06-22 11:45:52,348 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:45:52,348 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:52,348 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:45:52,348 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:45:52,348 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:45:52,348 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:45:52,348 INFO ]: Start difference. First operand 28 states and 64 transitions. Second operand 6 states. [2018-06-22 11:45:52,582 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:52,582 INFO ]: Finished difference Result 28 states and 62 transitions. [2018-06-22 11:45:52,582 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:45:52,582 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:45:52,582 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:52,583 INFO ]: With dead ends: 28 [2018-06-22 11:45:52,583 INFO ]: Without dead ends: 27 [2018-06-22 11:45:52,583 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:45:52,583 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 11:45:52,586 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-06-22 11:45:52,586 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:45:52,586 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 49 transitions. [2018-06-22 11:45:52,586 INFO ]: Start accepts. Automaton has 25 states and 49 transitions. Word has length 13 [2018-06-22 11:45:52,586 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:52,586 INFO ]: Abstraction has 25 states and 49 transitions. [2018-06-22 11:45:52,586 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:45:52,586 INFO ]: Start isEmpty. Operand 25 states and 49 transitions. [2018-06-22 11:45:52,590 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:52,590 INFO ]: Found error trace [2018-06-22 11:45:52,590 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:52,590 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:52,590 INFO ]: Analyzing trace with hash 1525689260, now seen corresponding path program 1 times [2018-06-22 11:45:52,590 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:52,590 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:52,591 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:52,591 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:52,591 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:52,622 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:52,904 WARN ]: Spent 222.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2018-06-22 11:45:52,956 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:45:52,956 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:52,956 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) [2018-06-22 11:45:52,973 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:52,991 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:52,992 INFO ]: Computing forward predicates... [2018-06-22 11:45:53,066 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:45:53,085 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:45:53,085 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2018-06-22 11:45:53,085 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:45:53,085 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:45:53,085 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:45:53,085 INFO ]: Start difference. First operand 25 states and 49 transitions. Second operand 7 states. [2018-06-22 11:45:53,204 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:53,204 INFO ]: Finished difference Result 29 states and 61 transitions. [2018-06-22 11:45:53,204 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:45:53,205 INFO ]: Start accepts. Automaton has 7 states. Word has length 13 [2018-06-22 11:45:53,205 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:53,205 INFO ]: With dead ends: 29 [2018-06-22 11:45:53,205 INFO ]: Without dead ends: 29 [2018-06-22 11:45:53,206 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:45:53,206 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 11:45:53,211 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 25. [2018-06-22 11:45:53,211 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:45:53,212 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 48 transitions. [2018-06-22 11:45:53,212 INFO ]: Start accepts. Automaton has 25 states and 48 transitions. Word has length 13 [2018-06-22 11:45:53,212 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:53,212 INFO ]: Abstraction has 25 states and 48 transitions. [2018-06-22 11:45:53,212 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:45:53,212 INFO ]: Start isEmpty. Operand 25 states and 48 transitions. [2018-06-22 11:45:53,213 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:53,213 INFO ]: Found error trace [2018-06-22 11:45:53,213 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:53,213 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:53,213 INFO ]: Analyzing trace with hash -1530318155, now seen corresponding path program 1 times [2018-06-22 11:45:53,213 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:53,213 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:53,216 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:53,216 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:53,216 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:53,220 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:53,256 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:45:53,256 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:53,256 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-22 11:45:53,262 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:53,286 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:53,288 INFO ]: Computing forward predicates... [2018-06-22 11:45:53,334 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:45:53,353 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:53,353 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:45:53,353 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:45:53,353 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:45:53,353 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:45:53,353 INFO ]: Start difference. First operand 25 states and 48 transitions. Second operand 6 states. [2018-06-22 11:45:53,871 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:53,871 INFO ]: Finished difference Result 31 states and 69 transitions. [2018-06-22 11:45:53,871 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:45:53,871 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:45:53,871 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:53,872 INFO ]: With dead ends: 31 [2018-06-22 11:45:53,872 INFO ]: Without dead ends: 31 [2018-06-22 11:45:53,872 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-22 11:45:53,872 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:45:53,876 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-06-22 11:45:53,876 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:45:53,876 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 56 transitions. [2018-06-22 11:45:53,876 INFO ]: Start accepts. Automaton has 27 states and 56 transitions. Word has length 13 [2018-06-22 11:45:53,876 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:53,876 INFO ]: Abstraction has 27 states and 56 transitions. [2018-06-22 11:45:53,876 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:45:53,876 INFO ]: Start isEmpty. Operand 27 states and 56 transitions. [2018-06-22 11:45:53,877 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:53,877 INFO ]: Found error trace [2018-06-22 11:45:53,877 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:53,877 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:53,877 INFO ]: Analyzing trace with hash 1673465417, now seen corresponding path program 1 times [2018-06-22 11:45:53,877 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:53,877 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:53,878 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:53,878 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:53,878 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:53,887 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:53,937 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:45:53,937 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:53,937 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:45:53,938 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:45:53,938 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:45:53,938 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:45:53,938 INFO ]: Start difference. First operand 27 states and 56 transitions. Second operand 4 states. [2018-06-22 11:45:54,144 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:54,144 INFO ]: Finished difference Result 27 states and 58 transitions. [2018-06-22 11:45:54,144 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:45:54,144 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:45:54,144 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:54,145 INFO ]: With dead ends: 27 [2018-06-22 11:45:54,145 INFO ]: Without dead ends: 27 [2018-06-22 11:45:54,145 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-22 11:45:54,145 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 11:45:54,148 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-06-22 11:45:54,148 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:45:54,149 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 47 transitions. [2018-06-22 11:45:54,149 INFO ]: Start accepts. Automaton has 25 states and 47 transitions. Word has length 13 [2018-06-22 11:45:54,149 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:54,149 INFO ]: Abstraction has 25 states and 47 transitions. [2018-06-22 11:45:54,149 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:45:54,149 INFO ]: Start isEmpty. Operand 25 states and 47 transitions. [2018-06-22 11:45:54,150 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:54,150 INFO ]: Found error trace [2018-06-22 11:45:54,150 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:54,150 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:54,150 INFO ]: Analyzing trace with hash -1049313884, now seen corresponding path program 1 times [2018-06-22 11:45:54,150 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:54,150 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:54,150 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:54,150 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:54,150 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:54,158 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:54,301 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:45:54,301 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:54,301 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-22 11:45:54,307 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:54,321 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:54,322 INFO ]: Computing forward predicates... [2018-06-22 11:45:54,377 WARN ]: Array PQE input equivalent to false [2018-06-22 11:45:54,377 INFO ]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-06-22 11:45:54,378 INFO ]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-22 11:45:54,378 INFO ]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:1 [2018-06-22 11:45:54,379 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:45:54,398 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:45:54,398 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 10 [2018-06-22 11:45:54,398 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:45:54,398 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:45:54,398 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:45:54,398 INFO ]: Start difference. First operand 25 states and 47 transitions. Second operand 10 states. [2018-06-22 11:45:55,153 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:55,153 INFO ]: Finished difference Result 73 states and 143 transitions. [2018-06-22 11:45:55,155 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:45:55,155 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:45:55,155 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:55,155 INFO ]: With dead ends: 73 [2018-06-22 11:45:55,155 INFO ]: Without dead ends: 53 [2018-06-22 11:45:55,156 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:45:55,156 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-22 11:45:55,161 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 41. [2018-06-22 11:45:55,161 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 11:45:55,162 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 81 transitions. [2018-06-22 11:45:55,162 INFO ]: Start accepts. Automaton has 41 states and 81 transitions. Word has length 17 [2018-06-22 11:45:55,162 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:55,162 INFO ]: Abstraction has 41 states and 81 transitions. [2018-06-22 11:45:55,162 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:45:55,162 INFO ]: Start isEmpty. Operand 41 states and 81 transitions. [2018-06-22 11:45:55,163 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:55,163 INFO ]: Found error trace [2018-06-22 11:45:55,163 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:55,164 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:55,164 INFO ]: Analyzing trace with hash -320583581, now seen corresponding path program 1 times [2018-06-22 11:45:55,164 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:55,164 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:55,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:55,164 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:55,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:55,171 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:55,312 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:45:55,312 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:55,312 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-22 11:45:55,317 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:55,329 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:55,331 INFO ]: Computing forward predicates... [2018-06-22 11:45:55,370 WARN ]: Array PQE input equivalent to false [2018-06-22 11:45:55,370 INFO ]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-06-22 11:45:55,371 INFO ]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-22 11:45:55,371 INFO ]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:1 [2018-06-22 11:45:55,372 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:45:55,391 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:45:55,391 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2018-06-22 11:45:55,391 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:45:55,391 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:45:55,391 INFO ]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:45:55,391 INFO ]: Start difference. First operand 41 states and 81 transitions. Second operand 11 states. [2018-06-22 11:45:56,322 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:56,322 INFO ]: Finished difference Result 69 states and 126 transitions. [2018-06-22 11:45:56,322 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:45:56,322 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 11:45:56,322 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:56,323 INFO ]: With dead ends: 69 [2018-06-22 11:45:56,323 INFO ]: Without dead ends: 54 [2018-06-22 11:45:56,323 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:45:56,323 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-22 11:45:56,328 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 40. [2018-06-22 11:45:56,328 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 11:45:56,329 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 73 transitions. [2018-06-22 11:45:56,329 INFO ]: Start accepts. Automaton has 40 states and 73 transitions. Word has length 17 [2018-06-22 11:45:56,329 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:56,329 INFO ]: Abstraction has 40 states and 73 transitions. [2018-06-22 11:45:56,329 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:45:56,329 INFO ]: Start isEmpty. Operand 40 states and 73 transitions. [2018-06-22 11:45:56,330 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:56,330 INFO ]: Found error trace [2018-06-22 11:45:56,330 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:56,330 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:56,330 INFO ]: Analyzing trace with hash 1713741210, now seen corresponding path program 1 times [2018-06-22 11:45:56,330 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:56,330 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:56,331 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:56,331 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:56,331 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:56,356 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:56,635 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:56,635 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:56,635 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-22 11:45:56,641 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:56,656 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:56,658 INFO ]: Computing forward predicates... [2018-06-22 11:45:56,736 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:56,758 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:56,758 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-06-22 11:45:56,758 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:45:56,758 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:45:56,758 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:45:56,758 INFO ]: Start difference. First operand 40 states and 73 transitions. Second operand 10 states. [2018-06-22 11:45:57,100 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:57,100 INFO ]: Finished difference Result 58 states and 120 transitions. [2018-06-22 11:45:57,102 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:45:57,102 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:45:57,102 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:57,102 INFO ]: With dead ends: 58 [2018-06-22 11:45:57,103 INFO ]: Without dead ends: 58 [2018-06-22 11:45:57,103 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:45:57,103 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-22 11:45:57,108 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 42. [2018-06-22 11:45:57,108 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 11:45:57,108 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 81 transitions. [2018-06-22 11:45:57,108 INFO ]: Start accepts. Automaton has 42 states and 81 transitions. Word has length 17 [2018-06-22 11:45:57,109 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:57,109 INFO ]: Abstraction has 42 states and 81 transitions. [2018-06-22 11:45:57,109 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:45:57,109 INFO ]: Start isEmpty. Operand 42 states and 81 transitions. [2018-06-22 11:45:57,110 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:57,110 INFO ]: Found error trace [2018-06-22 11:45:57,110 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:57,110 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:57,110 INFO ]: Analyzing trace with hash -1656241456, now seen corresponding path program 1 times [2018-06-22 11:45:57,110 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:57,110 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:57,111 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:57,111 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:57,111 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:57,122 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:57,363 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:57,363 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:57,363 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:57,368 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:57,381 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:57,383 INFO ]: Computing forward predicates... [2018-06-22 11:45:57,426 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:57,448 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:57,448 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-22 11:45:57,448 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:45:57,448 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:45:57,448 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:45:57,448 INFO ]: Start difference. First operand 42 states and 81 transitions. Second operand 8 states. [2018-06-22 11:45:57,654 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:57,654 INFO ]: Finished difference Result 56 states and 110 transitions. [2018-06-22 11:45:57,654 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:45:57,654 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:45:57,655 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:57,655 INFO ]: With dead ends: 56 [2018-06-22 11:45:57,655 INFO ]: Without dead ends: 56 [2018-06-22 11:45:57,655 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:45:57,655 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 11:45:57,659 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 42. [2018-06-22 11:45:57,659 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 11:45:57,660 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 79 transitions. [2018-06-22 11:45:57,660 INFO ]: Start accepts. Automaton has 42 states and 79 transitions. Word has length 17 [2018-06-22 11:45:57,660 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:57,660 INFO ]: Abstraction has 42 states and 79 transitions. [2018-06-22 11:45:57,660 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:45:57,660 INFO ]: Start isEmpty. Operand 42 states and 79 transitions. [2018-06-22 11:45:57,661 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:57,661 INFO ]: Found error trace [2018-06-22 11:45:57,661 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:57,661 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:57,661 INFO ]: Analyzing trace with hash -731256826, now seen corresponding path program 1 times [2018-06-22 11:45:57,661 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:57,661 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:57,661 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:57,661 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:57,661 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:57,667 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:57,826 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:45:57,826 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:57,826 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) [2018-06-22 11:45:57,842 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:57,869 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:57,872 INFO ]: Computing forward predicates... [2018-06-22 11:45:57,903 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:57,922 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:57,923 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2018-06-22 11:45:57,923 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:45:57,923 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:45:57,923 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:45:57,923 INFO ]: Start difference. First operand 42 states and 79 transitions. Second operand 8 states. [2018-06-22 11:45:58,054 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:58,054 INFO ]: Finished difference Result 56 states and 108 transitions. [2018-06-22 11:45:58,054 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:45:58,054 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:45:58,055 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:58,055 INFO ]: With dead ends: 56 [2018-06-22 11:45:58,055 INFO ]: Without dead ends: 56 [2018-06-22 11:45:58,055 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:45:58,056 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 11:45:58,058 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 42. [2018-06-22 11:45:58,059 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 11:45:58,059 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 77 transitions. [2018-06-22 11:45:58,059 INFO ]: Start accepts. Automaton has 42 states and 77 transitions. Word has length 17 [2018-06-22 11:45:58,059 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:58,059 INFO ]: Abstraction has 42 states and 77 transitions. [2018-06-22 11:45:58,059 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:45:58,059 INFO ]: Start isEmpty. Operand 42 states and 77 transitions. [2018-06-22 11:45:58,060 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:58,060 INFO ]: Found error trace [2018-06-22 11:45:58,060 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:58,060 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:58,060 INFO ]: Analyzing trace with hash -268764511, now seen corresponding path program 1 times [2018-06-22 11:45:58,060 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:58,060 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:58,061 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:58,061 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:58,061 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:58,072 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:58,149 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:58,149 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:58,149 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-22 11:45:58,156 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:58,169 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:58,171 INFO ]: Computing forward predicates... [2018-06-22 11:45:58,330 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:58,349 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:58,349 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-22 11:45:58,349 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:45:58,349 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:45:58,349 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:45:58,349 INFO ]: Start difference. First operand 42 states and 77 transitions. Second operand 8 states. [2018-06-22 11:45:58,498 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:58,498 INFO ]: Finished difference Result 56 states and 107 transitions. [2018-06-22 11:45:58,498 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:45:58,498 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:45:58,498 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:58,499 INFO ]: With dead ends: 56 [2018-06-22 11:45:58,499 INFO ]: Without dead ends: 56 [2018-06-22 11:45:58,499 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:45:58,499 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 11:45:58,502 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 42. [2018-06-22 11:45:58,502 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 11:45:58,503 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 76 transitions. [2018-06-22 11:45:58,503 INFO ]: Start accepts. Automaton has 42 states and 76 transitions. Word has length 17 [2018-06-22 11:45:58,503 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:58,503 INFO ]: Abstraction has 42 states and 76 transitions. [2018-06-22 11:45:58,503 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:45:58,503 INFO ]: Start isEmpty. Operand 42 states and 76 transitions. [2018-06-22 11:45:58,503 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:58,503 INFO ]: Found error trace [2018-06-22 11:45:58,503 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:58,503 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:58,504 INFO ]: Analyzing trace with hash 1214796158, now seen corresponding path program 1 times [2018-06-22 11:45:58,504 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:58,504 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:58,504 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:58,504 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:58,504 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:58,516 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:58,631 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:58,631 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:58,631 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) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:58,636 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:58,650 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:58,651 INFO ]: Computing forward predicates... [2018-06-22 11:45:58,726 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:58,750 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:58,750 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-06-22 11:45:58,750 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:45:58,750 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:45:58,750 INFO ]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:45:58,750 INFO ]: Start difference. First operand 42 states and 76 transitions. Second operand 11 states. [2018-06-22 11:45:58,968 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:58,968 INFO ]: Finished difference Result 56 states and 106 transitions. [2018-06-22 11:45:59,025 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:45:59,025 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 11:45:59,025 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:59,026 INFO ]: With dead ends: 56 [2018-06-22 11:45:59,026 INFO ]: Without dead ends: 52 [2018-06-22 11:45:59,026 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:45:59,026 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-22 11:45:59,029 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 38. [2018-06-22 11:45:59,029 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 11:45:59,029 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 70 transitions. [2018-06-22 11:45:59,029 INFO ]: Start accepts. Automaton has 38 states and 70 transitions. Word has length 17 [2018-06-22 11:45:59,029 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:59,029 INFO ]: Abstraction has 38 states and 70 transitions. [2018-06-22 11:45:59,029 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:45:59,029 INFO ]: Start isEmpty. Operand 38 states and 70 transitions. [2018-06-22 11:45:59,030 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:59,030 INFO ]: Found error trace [2018-06-22 11:45:59,030 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:59,030 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:59,030 INFO ]: Analyzing trace with hash 1195371157, now seen corresponding path program 1 times [2018-06-22 11:45:59,030 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:59,030 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:59,031 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:59,031 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:59,031 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:59,042 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:59,271 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:59,271 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:59,271 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-22 11:45:59,276 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:59,289 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:59,290 INFO ]: Computing forward predicates... [2018-06-22 11:45:59,564 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:59,583 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:59,583 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-22 11:45:59,583 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:45:59,583 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:45:59,583 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:45:59,583 INFO ]: Start difference. First operand 38 states and 70 transitions. Second operand 8 states. [2018-06-22 11:45:59,880 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:59,880 INFO ]: Finished difference Result 60 states and 119 transitions. [2018-06-22 11:45:59,880 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:45:59,880 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:45:59,880 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:59,881 INFO ]: With dead ends: 60 [2018-06-22 11:45:59,881 INFO ]: Without dead ends: 60 [2018-06-22 11:45:59,881 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:45:59,881 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-22 11:45:59,889 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 42. [2018-06-22 11:45:59,889 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 11:45:59,890 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 80 transitions. [2018-06-22 11:45:59,890 INFO ]: Start accepts. Automaton has 42 states and 80 transitions. Word has length 17 [2018-06-22 11:45:59,890 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:59,890 INFO ]: Abstraction has 42 states and 80 transitions. [2018-06-22 11:45:59,890 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:45:59,890 INFO ]: Start isEmpty. Operand 42 states and 80 transitions. [2018-06-22 11:45:59,890 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:59,890 INFO ]: Found error trace [2018-06-22 11:45:59,891 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:59,891 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:59,891 INFO ]: Analyzing trace with hash 732878842, now seen corresponding path program 1 times [2018-06-22 11:45:59,891 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:59,891 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:59,891 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:59,891 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:59,891 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:59,904 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:00,159 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:46:00,159 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:00,159 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-22 11:46:00,165 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:00,177 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:00,179 INFO ]: Computing forward predicates... [2018-06-22 11:46:00,208 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:46:00,226 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:00,226 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 11:46:00,227 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:46:00,227 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:46:00,227 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:46:00,227 INFO ]: Start difference. First operand 42 states and 80 transitions. Second operand 7 states. [2018-06-22 11:46:00,352 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:00,352 INFO ]: Finished difference Result 60 states and 116 transitions. [2018-06-22 11:46:00,352 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:46:00,352 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:46:00,352 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:00,353 INFO ]: With dead ends: 60 [2018-06-22 11:46:00,353 INFO ]: Without dead ends: 60 [2018-06-22 11:46:00,353 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 6 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:46:00,353 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-22 11:46:00,357 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 44. [2018-06-22 11:46:00,357 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 11:46:00,357 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 81 transitions. [2018-06-22 11:46:00,358 INFO ]: Start accepts. Automaton has 44 states and 81 transitions. Word has length 17 [2018-06-22 11:46:00,358 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:00,358 INFO ]: Abstraction has 44 states and 81 transitions. [2018-06-22 11:46:00,358 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:46:00,358 INFO ]: Start isEmpty. Operand 44 states and 81 transitions. [2018-06-22 11:46:00,358 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:46:00,358 INFO ]: Found error trace [2018-06-22 11:46:00,358 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:00,358 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:00,359 INFO ]: Analyzing trace with hash 270386527, now seen corresponding path program 1 times [2018-06-22 11:46:00,359 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:00,359 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:00,359 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:00,359 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:00,359 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:00,369 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:00,543 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:46:00,543 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:00,543 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:46:00,548 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:00,560 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:00,562 INFO ]: Computing forward predicates... [2018-06-22 11:46:00,636 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:46:00,655 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:00,655 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2018-06-22 11:46:00,655 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:46:00,655 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:46:00,655 INFO ]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:46:00,655 INFO ]: Start difference. First operand 44 states and 81 transitions. Second operand 12 states. [2018-06-22 11:46:00,998 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:00,998 INFO ]: Finished difference Result 62 states and 116 transitions. [2018-06-22 11:46:00,998 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:46:00,998 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-22 11:46:00,998 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:00,999 INFO ]: With dead ends: 62 [2018-06-22 11:46:00,999 INFO ]: Without dead ends: 62 [2018-06-22 11:46:00,999 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:46:00,999 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-22 11:46:01,002 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 44. [2018-06-22 11:46:01,002 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 11:46:01,003 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 79 transitions. [2018-06-22 11:46:01,003 INFO ]: Start accepts. Automaton has 44 states and 79 transitions. Word has length 17 [2018-06-22 11:46:01,003 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:01,003 INFO ]: Abstraction has 44 states and 79 transitions. [2018-06-22 11:46:01,003 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:46:01,003 INFO ]: Start isEmpty. Operand 44 states and 79 transitions. [2018-06-22 11:46:01,003 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:46:01,003 INFO ]: Found error trace [2018-06-22 11:46:01,004 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:01,004 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:01,004 INFO ]: Analyzing trace with hash -1117090418, now seen corresponding path program 1 times [2018-06-22 11:46:01,004 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:01,004 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:01,004 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:01,004 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:01,004 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:01,022 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:01,272 WARN ]: Spent 210.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 5 [2018-06-22 11:46:01,361 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:46:01,361 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:01,361 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:46:01,367 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:01,379 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:01,381 INFO ]: Computing forward predicates... [2018-06-22 11:46:01,410 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:46:01,429 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:01,429 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2018-06-22 11:46:01,429 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:46:01,429 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:46:01,429 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:46:01,429 INFO ]: Start difference. First operand 44 states and 79 transitions. Second operand 10 states. [2018-06-22 11:46:01,741 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:01,741 INFO ]: Finished difference Result 67 states and 123 transitions. [2018-06-22 11:46:01,741 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:46:01,741 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:46:01,741 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:01,741 INFO ]: With dead ends: 67 [2018-06-22 11:46:01,741 INFO ]: Without dead ends: 65 [2018-06-22 11:46:01,742 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:46:01,742 INFO ]: Start minimizeSevpa. Operand 65 states. [2018-06-22 11:46:01,745 INFO ]: Finished minimizeSevpa. Reduced states from 65 to 51. [2018-06-22 11:46:01,745 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 11:46:01,746 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 91 transitions. [2018-06-22 11:46:01,746 INFO ]: Start accepts. Automaton has 51 states and 91 transitions. Word has length 17 [2018-06-22 11:46:01,746 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:01,746 INFO ]: Abstraction has 51 states and 91 transitions. [2018-06-22 11:46:01,746 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:46:01,746 INFO ]: Start isEmpty. Operand 51 states and 91 transitions. [2018-06-22 11:46:01,747 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:46:01,747 INFO ]: Found error trace [2018-06-22 11:46:01,747 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:01,747 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:01,747 INFO ]: Analyzing trace with hash 1526123880, now seen corresponding path program 1 times [2018-06-22 11:46:01,747 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:01,747 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:01,748 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:01,748 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:01,748 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:01,754 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:01,870 INFO ]: Checked inductivity of 18 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:46:01,870 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:01,870 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:46:01,876 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:01,893 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:01,894 INFO ]: Computing forward predicates... [2018-06-22 11:46:01,981 INFO ]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:46:01,999 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:01,999 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-06-22 11:46:01,999 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:46:02,000 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:46:02,000 INFO ]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:46:02,000 INFO ]: Start difference. First operand 51 states and 91 transitions. Second operand 15 states. [2018-06-22 11:46:02,427 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:02,427 INFO ]: Finished difference Result 87 states and 177 transitions. [2018-06-22 11:46:02,427 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:46:02,427 INFO ]: Start accepts. Automaton has 15 states. Word has length 21 [2018-06-22 11:46:02,427 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:02,428 INFO ]: With dead ends: 87 [2018-06-22 11:46:02,428 INFO ]: Without dead ends: 87 [2018-06-22 11:46:02,428 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:46:02,428 INFO ]: Start minimizeSevpa. Operand 87 states. [2018-06-22 11:46:02,433 INFO ]: Finished minimizeSevpa. Reduced states from 87 to 61. [2018-06-22 11:46:02,433 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-22 11:46:02,434 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 119 transitions. [2018-06-22 11:46:02,434 INFO ]: Start accepts. Automaton has 61 states and 119 transitions. Word has length 21 [2018-06-22 11:46:02,434 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:02,434 INFO ]: Abstraction has 61 states and 119 transitions. [2018-06-22 11:46:02,434 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:46:02,434 INFO ]: Start isEmpty. Operand 61 states and 119 transitions. [2018-06-22 11:46:02,435 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:46:02,435 INFO ]: Found error trace [2018-06-22 11:46:02,435 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:02,435 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:02,435 INFO ]: Analyzing trace with hash -721724164, now seen corresponding path program 1 times [2018-06-22 11:46:02,435 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:02,435 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:02,438 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:02,438 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:02,438 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:02,445 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:02,544 INFO ]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:46:02,544 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:02,544 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:46:02,544 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:46:02,544 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:46:02,544 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:46:02,544 INFO ]: Start difference. First operand 61 states and 119 transitions. Second operand 6 states. [2018-06-22 11:46:02,623 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:02,623 INFO ]: Finished difference Result 69 states and 138 transitions. [2018-06-22 11:46:02,623 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:46:02,623 INFO ]: Start accepts. Automaton has 6 states. Word has length 21 [2018-06-22 11:46:02,623 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:02,624 INFO ]: With dead ends: 69 [2018-06-22 11:46:02,624 INFO ]: Without dead ends: 69 [2018-06-22 11:46:02,624 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:46:02,624 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-22 11:46:02,628 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 61. [2018-06-22 11:46:02,629 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-22 11:46:02,629 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 118 transitions. [2018-06-22 11:46:02,629 INFO ]: Start accepts. Automaton has 61 states and 118 transitions. Word has length 21 [2018-06-22 11:46:02,629 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:02,629 INFO ]: Abstraction has 61 states and 118 transitions. [2018-06-22 11:46:02,629 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:46:02,630 INFO ]: Start isEmpty. Operand 61 states and 118 transitions. [2018-06-22 11:46:02,630 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:46:02,630 INFO ]: Found error trace [2018-06-22 11:46:02,630 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:02,630 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:02,631 INFO ]: Analyzing trace with hash 964161869, now seen corresponding path program 1 times [2018-06-22 11:46:02,631 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:02,631 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:02,631 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:02,631 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:02,631 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:02,641 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:03,005 WARN ]: Spent 328.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2018-06-22 11:46:03,141 INFO ]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:46:03,141 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:03,141 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:46:03,141 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:46:03,141 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:46:03,141 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:46:03,141 INFO ]: Start difference. First operand 61 states and 118 transitions. Second operand 4 states. [2018-06-22 11:46:03,232 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:03,232 INFO ]: Finished difference Result 65 states and 128 transitions. [2018-06-22 11:46:03,232 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:46:03,233 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 11:46:03,233 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:03,233 INFO ]: With dead ends: 65 [2018-06-22 11:46:03,233 INFO ]: Without dead ends: 61 [2018-06-22 11:46:03,233 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:46:03,233 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-22 11:46:03,238 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 53. [2018-06-22 11:46:03,238 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 11:46:03,239 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 100 transitions. [2018-06-22 11:46:03,239 INFO ]: Start accepts. Automaton has 53 states and 100 transitions. Word has length 21 [2018-06-22 11:46:03,239 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:03,239 INFO ]: Abstraction has 53 states and 100 transitions. [2018-06-22 11:46:03,239 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:46:03,239 INFO ]: Start isEmpty. Operand 53 states and 100 transitions. [2018-06-22 11:46:03,239 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:46:03,239 INFO ]: Found error trace [2018-06-22 11:46:03,239 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:03,240 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:03,240 INFO ]: Analyzing trace with hash -388682305, now seen corresponding path program 2 times [2018-06-22 11:46:03,240 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:03,240 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:03,240 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:03,240 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:03,240 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:03,247 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:03,331 INFO ]: Checked inductivity of 19 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:46:03,331 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:03,331 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:46:03,337 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:46:03,355 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:46:03,355 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:03,357 INFO ]: Computing forward predicates... [2018-06-22 11:46:03,478 INFO ]: Checked inductivity of 19 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:46:03,512 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:03,512 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9] total 11 [2018-06-22 11:46:03,513 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:46:03,513 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:46:03,513 INFO ]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:46:03,513 INFO ]: Start difference. First operand 53 states and 100 transitions. Second operand 11 states. [2018-06-22 11:46:03,828 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:03,828 INFO ]: Finished difference Result 42 states and 61 transitions. [2018-06-22 11:46:03,828 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:46:03,828 INFO ]: Start accepts. Automaton has 11 states. Word has length 21 [2018-06-22 11:46:03,829 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:03,829 INFO ]: With dead ends: 42 [2018-06-22 11:46:03,829 INFO ]: Without dead ends: 0 [2018-06-22 11:46:03,829 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:46:03,829 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 11:46:03,829 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 11:46:03,829 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 11:46:03,829 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 11:46:03,829 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-06-22 11:46:03,829 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:03,829 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 11:46:03,829 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:46:03,829 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 11:46:03,829 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 11:46:03,834 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:46:03 BoogieIcfgContainer [2018-06-22 11:46:03,834 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:46:03,835 INFO ]: Toolchain (without parser) took 19214.97 ms. Allocated memory was 309.3 MB in the beginning and 618.1 MB in the end (delta: 308.8 MB). Free memory was 261.7 MB in the beginning and 552.5 MB in the end (delta: -290.7 MB). Peak memory consumption was 18.1 MB. Max. memory is 3.6 GB. [2018-06-22 11:46:03,835 INFO ]: SmtParser took 0.43 ms. Allocated memory is still 309.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:46:03,835 INFO ]: ChcToBoogie took 64.09 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 259.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:46:03,836 INFO ]: Boogie Preprocessor took 55.29 ms. Allocated memory is still 309.3 MB. Free memory was 259.7 MB in the beginning and 257.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:46:03,836 INFO ]: RCFGBuilder took 540.99 ms. Allocated memory is still 309.3 MB. Free memory was 257.7 MB in the beginning and 245.8 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:46:03,836 INFO ]: TraceAbstraction took 18545.53 ms. Allocated memory was 309.3 MB in the beginning and 618.1 MB in the end (delta: 308.8 MB). Free memory was 245.8 MB in the beginning and 552.5 MB in the end (delta: -306.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. [2018-06-22 11:46:03,839 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.43 ms. Allocated memory is still 309.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 64.09 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 259.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 55.29 ms. Allocated memory is still 309.3 MB. Free memory was 259.7 MB in the beginning and 257.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 540.99 ms. Allocated memory is still 309.3 MB. Free memory was 257.7 MB in the beginning and 245.8 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 18545.53 ms. Allocated memory was 309.3 MB in the beginning and 618.1 MB in the end (delta: 308.8 MB). Free memory was 245.8 MB in the beginning and 552.5 MB in the end (delta: -306.7 MB). Peak memory consumption was 2.1 MB. 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, 23 locations, 1 error locations. SAFE Result, 18.4s OverallTime, 34 OverallIterations, 4 TraceHistogramMax, 9.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1250 SDtfs, 177 SDslu, 3316 SDs, 0 SdLazy, 5213 SolverSat, 319 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 608 GetRequests, 305 SyntacticMatches, 44 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=31, 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.2s AutomataMinimizationTime, 34 MinimizatonAttempts, 270 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 814 NumberOfCodeBlocks, 814 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 760 ConstructedInterpolants, 0 QuantifiedInterpolants, 66532 SizeOfPredicates, 121 NumberOfNonLiveVariables, 2333 ConjunctsInSsa, 601 ConjunctsInUnsatCore, 54 InterpolantComputations, 18 PerfectInterpolantSequences, 234/368 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__strncmp_2.array.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-46-03-848.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/libc__strncmp_2.array.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-46-03-848.csv Received shutdown request...