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/rec__limit1unrolled.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 12:17:10,858 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 12:17:10,860 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 12:17:10,874 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 12:17:10,874 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 12:17:10,875 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 12:17:10,879 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 12:17:10,881 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 12:17:10,883 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 12:17:10,885 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 12:17:10,886 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 12:17:10,886 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 12:17:10,887 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 12:17:10,888 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 12:17:10,892 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 12:17:10,893 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 12:17:10,895 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 12:17:10,907 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 12:17:10,909 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 12:17:10,910 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 12:17:10,911 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 12:17:10,913 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 12:17:10,913 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 12:17:10,913 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 12:17:10,914 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 12:17:10,915 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 12:17:10,915 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 12:17:10,916 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 12:17:10,917 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 12:17:10,917 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 12:17:10,918 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 12:17:10,918 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 12:17:10,918 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 12:17:10,919 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 12:17:10,920 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 12:17:10,920 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 12:17:10,943 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 12:17:10,943 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 12:17:10,943 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 12:17:10,943 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 12:17:10,944 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 12:17:10,944 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 12:17:10,945 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 12:17:10,945 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 12:17:10,945 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 12:17:10,945 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 12:17:10,945 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 12:17:10,946 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 12:17:10,946 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 12:17:10,946 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 12:17:10,946 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 12:17:10,946 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 12:17:10,947 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 12:17:10,947 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 12:17:10,947 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 12:17:10,948 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 12:17:10,948 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 12:17:10,998 INFO ]: Repository-Root is: /tmp [2018-06-22 12:17:11,013 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 12:17:11,019 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 12:17:11,020 INFO ]: Initializing SmtParser... [2018-06-22 12:17:11,021 INFO ]: SmtParser initialized [2018-06-22 12:17:11,021 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/rec__limit1unrolled.smt2 [2018-06-22 12:17:11,022 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 12:17:11,114 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/rec__limit1unrolled.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@7258e90c [2018-06-22 12:17:11,381 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/rec__limit1unrolled.smt2 [2018-06-22 12:17:11,386 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 12:17:11,391 INFO ]: Walking toolchain with 4 elements. [2018-06-22 12:17:11,392 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 12:17:11,392 INFO ]: Initializing ChcToBoogie... [2018-06-22 12:17:11,392 INFO ]: ChcToBoogie initialized [2018-06-22 12:17:11,396 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 12:17:11" (1/1) ... [2018-06-22 12:17:11,445 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:17:11 Unit [2018-06-22 12:17:11,445 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 12:17:11,446 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 12:17:11,446 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 12:17:11,446 INFO ]: Boogie Preprocessor initialized [2018-06-22 12:17:11,469 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:17:11" (1/1) ... [2018-06-22 12:17:11,469 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:17:11" (1/1) ... [2018-06-22 12:17:11,477 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:17:11" (1/1) ... [2018-06-22 12:17:11,477 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:17:11" (1/1) ... [2018-06-22 12:17:11,484 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:17:11" (1/1) ... [2018-06-22 12:17:11,493 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:17:11" (1/1) ... [2018-06-22 12:17:11,494 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:17:11" (1/1) ... [2018-06-22 12:17:11,499 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 12:17:11,500 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 12:17:11,500 INFO ]: Initializing RCFGBuilder... [2018-06-22 12:17:11,500 INFO ]: RCFGBuilder initialized [2018-06-22 12:17:11,501 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:17:11" (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 12:17:11,528 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 12:17:11,528 INFO ]: Found specification of procedure False [2018-06-22 12:17:11,528 INFO ]: Found implementation of procedure False [2018-06-22 12:17:11,528 INFO ]: Specification and implementation of procedure INV_REC_f^f given in one single declaration [2018-06-22 12:17:11,528 INFO ]: Found specification of procedure INV_REC_f^f [2018-06-22 12:17:11,529 INFO ]: Found implementation of procedure INV_REC_f^f [2018-06-22 12:17:11,529 INFO ]: Specification and implementation of procedure INV_REC_f^f_PRE given in one single declaration [2018-06-22 12:17:11,529 INFO ]: Found specification of procedure INV_REC_f^f_PRE [2018-06-22 12:17:11,529 INFO ]: Found implementation of procedure INV_REC_f^f_PRE [2018-06-22 12:17:11,529 INFO ]: Specification and implementation of procedure INV_REC_f__2 given in one single declaration [2018-06-22 12:17:11,529 INFO ]: Found specification of procedure INV_REC_f__2 [2018-06-22 12:17:11,529 INFO ]: Found implementation of procedure INV_REC_f__2 [2018-06-22 12:17:11,529 INFO ]: Specification and implementation of procedure INV_REC_f__2_PRE given in one single declaration [2018-06-22 12:17:11,529 INFO ]: Found specification of procedure INV_REC_f__2_PRE [2018-06-22 12:17:11,529 INFO ]: Found implementation of procedure INV_REC_f__2_PRE [2018-06-22 12:17:11,529 INFO ]: Specification and implementation of procedure INV_REC_f__1 given in one single declaration [2018-06-22 12:17:11,529 INFO ]: Found specification of procedure INV_REC_f__1 [2018-06-22 12:17:11,529 INFO ]: Found implementation of procedure INV_REC_f__1 [2018-06-22 12:17:11,529 INFO ]: Specification and implementation of procedure INV_REC_f__1_PRE given in one single declaration [2018-06-22 12:17:11,529 INFO ]: Found specification of procedure INV_REC_f__1_PRE [2018-06-22 12:17:11,529 INFO ]: Found implementation of procedure INV_REC_f__1_PRE [2018-06-22 12:17:11,529 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 12:17:11,529 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 12:17:11,529 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 12:17:12,103 INFO ]: Using library mode [2018-06-22 12:17:12,103 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:17:12 BoogieIcfgContainer [2018-06-22 12:17:12,103 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 12:17:12,104 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 12:17:12,104 INFO ]: Initializing TraceAbstraction... [2018-06-22 12:17:12,107 INFO ]: TraceAbstraction initialized [2018-06-22 12:17:12,108 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 12:17:11" (1/3) ... [2018-06-22 12:17:12,109 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78055245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 12:17:12, skipping insertion in model container [2018-06-22 12:17:12,109 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:17:11" (2/3) ... [2018-06-22 12:17:12,109 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78055245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 12:17:12, skipping insertion in model container [2018-06-22 12:17:12,109 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:17:12" (3/3) ... [2018-06-22 12:17:12,111 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 12:17:12,120 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 12:17:12,131 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 12:17:12,176 INFO ]: Using default assertion order modulation [2018-06-22 12:17:12,176 INFO ]: Interprodecural is true [2018-06-22 12:17:12,176 INFO ]: Hoare is false [2018-06-22 12:17:12,176 INFO ]: Compute interpolants for FPandBP [2018-06-22 12:17:12,176 INFO ]: Backedges is TWOTRACK [2018-06-22 12:17:12,176 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 12:17:12,176 INFO ]: Difference is false [2018-06-22 12:17:12,176 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 12:17:12,176 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 12:17:12,196 INFO ]: Start isEmpty. Operand 53 states. [2018-06-22 12:17:12,219 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-22 12:17:12,219 INFO ]: Found error trace [2018-06-22 12:17:12,220 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-22 12:17:12,220 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:17:12,224 INFO ]: Analyzing trace with hash 163746446, now seen corresponding path program 1 times [2018-06-22 12:17:12,226 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:17:12,226 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:17:12,261 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:12,261 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:17:12,261 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:12,277 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:12,311 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 12:17:12,312 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:17:12,313 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 12:17:12,314 INFO ]: Interpolant automaton has 2 states [2018-06-22 12:17:12,325 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 12:17:12,325 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 12:17:12,327 INFO ]: Start difference. First operand 53 states. Second operand 2 states. [2018-06-22 12:17:12,355 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:17:12,356 INFO ]: Finished difference Result 49 states and 81 transitions. [2018-06-22 12:17:12,356 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 12:17:12,357 INFO ]: Start accepts. Automaton has 2 states. Word has length 5 [2018-06-22 12:17:12,357 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:17:12,368 INFO ]: With dead ends: 49 [2018-06-22 12:17:12,368 INFO ]: Without dead ends: 49 [2018-06-22 12:17:12,370 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 12:17:12,383 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 12:17:12,417 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-06-22 12:17:12,418 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 12:17:12,420 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 81 transitions. [2018-06-22 12:17:12,421 INFO ]: Start accepts. Automaton has 49 states and 81 transitions. Word has length 5 [2018-06-22 12:17:12,421 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:17:12,421 INFO ]: Abstraction has 49 states and 81 transitions. [2018-06-22 12:17:12,421 INFO ]: Interpolant automaton has 2 states. [2018-06-22 12:17:12,422 INFO ]: Start isEmpty. Operand 49 states and 81 transitions. [2018-06-22 12:17:12,424 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 12:17:12,424 INFO ]: Found error trace [2018-06-22 12:17:12,424 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:17:12,424 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:17:12,425 INFO ]: Analyzing trace with hash 1936622194, now seen corresponding path program 1 times [2018-06-22 12:17:12,425 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:17:12,425 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:17:12,425 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:12,425 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:17:12,425 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:12,451 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:12,509 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 12:17:12,509 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:17:12,510 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 12:17:12,511 INFO ]: Interpolant automaton has 4 states [2018-06-22 12:17:12,511 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 12:17:12,511 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 12:17:12,511 INFO ]: Start difference. First operand 49 states and 81 transitions. Second operand 4 states. [2018-06-22 12:17:12,603 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:17:12,603 INFO ]: Finished difference Result 52 states and 85 transitions. [2018-06-22 12:17:12,603 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 12:17:12,603 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 12:17:12,603 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:17:12,604 INFO ]: With dead ends: 52 [2018-06-22 12:17:12,604 INFO ]: Without dead ends: 34 [2018-06-22 12:17:12,605 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 12:17:12,605 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 12:17:12,614 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-22 12:17:12,614 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 12:17:12,615 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 54 transitions. [2018-06-22 12:17:12,615 INFO ]: Start accepts. Automaton has 34 states and 54 transitions. Word has length 13 [2018-06-22 12:17:12,616 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:17:12,616 INFO ]: Abstraction has 34 states and 54 transitions. [2018-06-22 12:17:12,616 INFO ]: Interpolant automaton has 4 states. [2018-06-22 12:17:12,616 INFO ]: Start isEmpty. Operand 34 states and 54 transitions. [2018-06-22 12:17:12,618 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 12:17:12,618 INFO ]: Found error trace [2018-06-22 12:17:12,618 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:17:12,618 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:17:12,618 INFO ]: Analyzing trace with hash 1986923655, now seen corresponding path program 1 times [2018-06-22 12:17:12,618 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:17:12,618 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:17:12,619 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:12,619 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:17:12,619 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:12,628 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:12,854 WARN ]: Spent 164.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-06-22 12:17:12,897 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 12:17:12,897 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:17:12,897 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 12:17:12,898 INFO ]: Interpolant automaton has 4 states [2018-06-22 12:17:12,898 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 12:17:12,898 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 12:17:12,898 INFO ]: Start difference. First operand 34 states and 54 transitions. Second operand 4 states. [2018-06-22 12:17:13,022 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:17:13,022 INFO ]: Finished difference Result 38 states and 58 transitions. [2018-06-22 12:17:13,024 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 12:17:13,024 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 12:17:13,024 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:17:13,025 INFO ]: With dead ends: 38 [2018-06-22 12:17:13,025 INFO ]: Without dead ends: 38 [2018-06-22 12:17:13,026 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 12:17:13,026 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 12:17:13,039 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-06-22 12:17:13,039 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 12:17:13,041 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 56 transitions. [2018-06-22 12:17:13,044 INFO ]: Start accepts. Automaton has 36 states and 56 transitions. Word has length 13 [2018-06-22 12:17:13,044 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:17:13,044 INFO ]: Abstraction has 36 states and 56 transitions. [2018-06-22 12:17:13,044 INFO ]: Interpolant automaton has 4 states. [2018-06-22 12:17:13,044 INFO ]: Start isEmpty. Operand 36 states and 56 transitions. [2018-06-22 12:17:13,046 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 12:17:13,046 INFO ]: Found error trace [2018-06-22 12:17:13,046 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:17:13,046 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:17:13,046 INFO ]: Analyzing trace with hash 158747323, now seen corresponding path program 1 times [2018-06-22 12:17:13,046 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:17:13,046 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:17:13,047 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:13,047 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:17:13,047 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:13,055 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:13,153 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 12:17:13,153 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:17:13,153 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 12:17:13,153 INFO ]: Interpolant automaton has 4 states [2018-06-22 12:17:13,153 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 12:17:13,153 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 12:17:13,153 INFO ]: Start difference. First operand 36 states and 56 transitions. Second operand 4 states. [2018-06-22 12:17:13,196 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:17:13,196 INFO ]: Finished difference Result 40 states and 62 transitions. [2018-06-22 12:17:13,197 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 12:17:13,197 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 12:17:13,197 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:17:13,198 INFO ]: With dead ends: 40 [2018-06-22 12:17:13,198 INFO ]: Without dead ends: 40 [2018-06-22 12:17:13,198 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 12:17:13,199 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 12:17:13,205 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-06-22 12:17:13,205 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 12:17:13,206 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 60 transitions. [2018-06-22 12:17:13,207 INFO ]: Start accepts. Automaton has 38 states and 60 transitions. Word has length 13 [2018-06-22 12:17:13,207 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:17:13,207 INFO ]: Abstraction has 38 states and 60 transitions. [2018-06-22 12:17:13,207 INFO ]: Interpolant automaton has 4 states. [2018-06-22 12:17:13,207 INFO ]: Start isEmpty. Operand 38 states and 60 transitions. [2018-06-22 12:17:13,208 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 12:17:13,208 INFO ]: Found error trace [2018-06-22 12:17:13,208 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:17:13,208 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:17:13,208 INFO ]: Analyzing trace with hash -2049102544, now seen corresponding path program 1 times [2018-06-22 12:17:13,208 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:17:13,208 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:17:13,209 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:13,209 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:17:13,209 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:13,223 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:13,272 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 12:17:13,272 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:17:13,273 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 12:17:13,273 INFO ]: Interpolant automaton has 4 states [2018-06-22 12:17:13,273 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 12:17:13,273 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 12:17:13,273 INFO ]: Start difference. First operand 38 states and 60 transitions. Second operand 4 states. [2018-06-22 12:17:13,317 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:17:13,317 INFO ]: Finished difference Result 41 states and 64 transitions. [2018-06-22 12:17:13,318 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 12:17:13,318 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 12:17:13,318 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:17:13,319 INFO ]: With dead ends: 41 [2018-06-22 12:17:13,319 INFO ]: Without dead ends: 36 [2018-06-22 12:17:13,321 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 12:17:13,321 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 12:17:13,326 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-22 12:17:13,326 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 12:17:13,327 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 54 transitions. [2018-06-22 12:17:13,327 INFO ]: Start accepts. Automaton has 36 states and 54 transitions. Word has length 21 [2018-06-22 12:17:13,327 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:17:13,327 INFO ]: Abstraction has 36 states and 54 transitions. [2018-06-22 12:17:13,327 INFO ]: Interpolant automaton has 4 states. [2018-06-22 12:17:13,327 INFO ]: Start isEmpty. Operand 36 states and 54 transitions. [2018-06-22 12:17:13,329 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 12:17:13,329 INFO ]: Found error trace [2018-06-22 12:17:13,329 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:17:13,329 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:17:13,329 INFO ]: Analyzing trace with hash 1065044167, now seen corresponding path program 1 times [2018-06-22 12:17:13,329 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:17:13,329 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:17:13,330 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:13,330 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:17:13,330 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:13,342 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:13,629 WARN ]: Spent 246.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-06-22 12:17:13,913 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 12:17:13,913 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:17:13,913 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 12:17:13,913 INFO ]: Interpolant automaton has 6 states [2018-06-22 12:17:13,913 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 12:17:13,913 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 12:17:13,914 INFO ]: Start difference. First operand 36 states and 54 transitions. Second operand 6 states. [2018-06-22 12:17:14,191 WARN ]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-06-22 12:17:14,397 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:17:14,397 INFO ]: Finished difference Result 42 states and 61 transitions. [2018-06-22 12:17:14,400 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 12:17:14,400 INFO ]: Start accepts. Automaton has 6 states. Word has length 21 [2018-06-22 12:17:14,400 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:17:14,401 INFO ]: With dead ends: 42 [2018-06-22 12:17:14,401 INFO ]: Without dead ends: 42 [2018-06-22 12:17:14,401 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 12:17:14,401 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 12:17:14,411 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 36. [2018-06-22 12:17:14,411 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 12:17:14,412 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 54 transitions. [2018-06-22 12:17:14,412 INFO ]: Start accepts. Automaton has 36 states and 54 transitions. Word has length 21 [2018-06-22 12:17:14,412 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:17:14,412 INFO ]: Abstraction has 36 states and 54 transitions. [2018-06-22 12:17:14,412 INFO ]: Interpolant automaton has 6 states. [2018-06-22 12:17:14,412 INFO ]: Start isEmpty. Operand 36 states and 54 transitions. [2018-06-22 12:17:14,413 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 12:17:14,413 INFO ]: Found error trace [2018-06-22 12:17:14,413 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:17:14,413 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:17:14,413 INFO ]: Analyzing trace with hash -2081574200, now seen corresponding path program 1 times [2018-06-22 12:17:14,413 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:17:14,413 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:17:14,414 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:14,414 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:17:14,414 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:14,441 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:14,770 WARN ]: Spent 267.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-06-22 12:17:15,124 INFO ]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 12:17:15,124 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:17:15,124 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 12:17:15,144 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:17:15,191 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:15,199 INFO ]: Computing forward predicates... [2018-06-22 12:17:15,592 INFO ]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 12:17:15,627 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:17:15,627 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 12:17:15,627 INFO ]: Interpolant automaton has 10 states [2018-06-22 12:17:15,627 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 12:17:15,627 INFO ]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-22 12:17:15,628 INFO ]: Start difference. First operand 36 states and 54 transitions. Second operand 10 states. [2018-06-22 12:17:15,825 WARN ]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-06-22 12:17:16,114 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:17:16,114 INFO ]: Finished difference Result 45 states and 65 transitions. [2018-06-22 12:17:16,115 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 12:17:16,115 INFO ]: Start accepts. Automaton has 10 states. Word has length 21 [2018-06-22 12:17:16,116 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:17:16,117 INFO ]: With dead ends: 45 [2018-06-22 12:17:16,117 INFO ]: Without dead ends: 45 [2018-06-22 12:17:16,117 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-06-22 12:17:16,117 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-22 12:17:16,127 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 39. [2018-06-22 12:17:16,127 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 12:17:16,128 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 58 transitions. [2018-06-22 12:17:16,128 INFO ]: Start accepts. Automaton has 39 states and 58 transitions. Word has length 21 [2018-06-22 12:17:16,129 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:17:16,129 INFO ]: Abstraction has 39 states and 58 transitions. [2018-06-22 12:17:16,129 INFO ]: Interpolant automaton has 10 states. [2018-06-22 12:17:16,129 INFO ]: Start isEmpty. Operand 39 states and 58 transitions. [2018-06-22 12:17:16,138 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 12:17:16,138 INFO ]: Found error trace [2018-06-22 12:17:16,138 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:17:16,138 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:17:16,138 INFO ]: Analyzing trace with hash 375838498, now seen corresponding path program 1 times [2018-06-22 12:17:16,138 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:17:16,138 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:17:16,139 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:16,139 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:17:16,139 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:16,144 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:16,267 INFO ]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 12:17:16,269 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:17:16,269 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 12:17:16,269 INFO ]: Interpolant automaton has 4 states [2018-06-22 12:17:16,269 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 12:17:16,269 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 12:17:16,269 INFO ]: Start difference. First operand 39 states and 58 transitions. Second operand 4 states. [2018-06-22 12:17:16,299 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:17:16,299 INFO ]: Finished difference Result 39 states and 57 transitions. [2018-06-22 12:17:16,300 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 12:17:16,300 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 12:17:16,300 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:17:16,301 INFO ]: With dead ends: 39 [2018-06-22 12:17:16,301 INFO ]: Without dead ends: 38 [2018-06-22 12:17:16,302 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 12:17:16,302 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 12:17:16,306 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-22 12:17:16,306 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 12:17:16,307 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 55 transitions. [2018-06-22 12:17:16,307 INFO ]: Start accepts. Automaton has 38 states and 55 transitions. Word has length 21 [2018-06-22 12:17:16,307 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:17:16,307 INFO ]: Abstraction has 38 states and 55 transitions. [2018-06-22 12:17:16,307 INFO ]: Interpolant automaton has 4 states. [2018-06-22 12:17:16,307 INFO ]: Start isEmpty. Operand 38 states and 55 transitions. [2018-06-22 12:17:16,308 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 12:17:16,308 INFO ]: Found error trace [2018-06-22 12:17:16,308 INFO ]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:17:16,308 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:17:16,309 INFO ]: Analyzing trace with hash 1813614921, now seen corresponding path program 2 times [2018-06-22 12:17:16,309 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:17:16,309 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:17:16,309 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:16,309 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:17:16,309 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:16,325 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:16,538 WARN ]: Spent 149.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-06-22 12:17:16,582 INFO ]: Checked inductivity of 20 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 12:17:16,582 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:17:16,582 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 12:17:16,596 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 12:17:16,617 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 12:17:16,617 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:16,620 INFO ]: Computing forward predicates... [2018-06-22 12:17:16,782 INFO ]: Checked inductivity of 20 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 12:17:16,801 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:17:16,801 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-22 12:17:16,801 INFO ]: Interpolant automaton has 12 states [2018-06-22 12:17:16,802 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 12:17:16,802 INFO ]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-06-22 12:17:16,802 INFO ]: Start difference. First operand 38 states and 55 transitions. Second operand 12 states. [2018-06-22 12:17:17,219 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:17:17,219 INFO ]: Finished difference Result 45 states and 64 transitions. [2018-06-22 12:17:17,220 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 12:17:17,220 INFO ]: Start accepts. Automaton has 12 states. Word has length 29 [2018-06-22 12:17:17,220 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:17:17,221 INFO ]: With dead ends: 45 [2018-06-22 12:17:17,221 INFO ]: Without dead ends: 45 [2018-06-22 12:17:17,221 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-06-22 12:17:17,221 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-22 12:17:17,227 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 41. [2018-06-22 12:17:17,227 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 12:17:17,228 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 59 transitions. [2018-06-22 12:17:17,228 INFO ]: Start accepts. Automaton has 41 states and 59 transitions. Word has length 29 [2018-06-22 12:17:17,228 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:17:17,228 INFO ]: Abstraction has 41 states and 59 transitions. [2018-06-22 12:17:17,228 INFO ]: Interpolant automaton has 12 states. [2018-06-22 12:17:17,228 INFO ]: Start isEmpty. Operand 41 states and 59 transitions. [2018-06-22 12:17:17,230 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 12:17:17,230 INFO ]: Found error trace [2018-06-22 12:17:17,230 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:17:17,230 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:17:17,231 INFO ]: Analyzing trace with hash 1001942024, now seen corresponding path program 1 times [2018-06-22 12:17:17,231 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:17:17,231 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:17:17,231 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:17,231 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 12:17:17,231 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:17,249 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:17,411 INFO ]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 12:17:17,411 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:17:17,411 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 12:17:17,418 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:17:17,434 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:17,437 INFO ]: Computing forward predicates... [2018-06-22 12:17:17,734 INFO ]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 12:17:17,766 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:17:17,766 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-22 12:17:17,766 INFO ]: Interpolant automaton has 13 states [2018-06-22 12:17:17,766 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 12:17:17,766 INFO ]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-06-22 12:17:17,766 INFO ]: Start difference. First operand 41 states and 59 transitions. Second operand 13 states. [2018-06-22 12:17:18,307 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:17:18,307 INFO ]: Finished difference Result 48 states and 68 transitions. [2018-06-22 12:17:18,311 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 12:17:18,311 INFO ]: Start accepts. Automaton has 13 states. Word has length 29 [2018-06-22 12:17:18,311 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:17:18,312 INFO ]: With dead ends: 48 [2018-06-22 12:17:18,312 INFO ]: Without dead ends: 48 [2018-06-22 12:17:18,313 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-06-22 12:17:18,313 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 12:17:18,319 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 41. [2018-06-22 12:17:18,320 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 12:17:18,321 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 59 transitions. [2018-06-22 12:17:18,321 INFO ]: Start accepts. Automaton has 41 states and 59 transitions. Word has length 29 [2018-06-22 12:17:18,321 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:17:18,321 INFO ]: Abstraction has 41 states and 59 transitions. [2018-06-22 12:17:18,321 INFO ]: Interpolant automaton has 13 states. [2018-06-22 12:17:18,321 INFO ]: Start isEmpty. Operand 41 states and 59 transitions. [2018-06-22 12:17:18,322 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 12:17:18,322 INFO ]: Found error trace [2018-06-22 12:17:18,322 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:17:18,322 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:17:18,322 INFO ]: Analyzing trace with hash -1107683986, now seen corresponding path program 1 times [2018-06-22 12:17:18,322 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:17:18,322 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:17:18,323 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:18,323 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:17:18,323 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:18,331 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:18,407 INFO ]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 12:17:18,407 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:17:18,407 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 12:17:18,408 INFO ]: Interpolant automaton has 6 states [2018-06-22 12:17:18,408 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 12:17:18,408 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 12:17:18,408 INFO ]: Start difference. First operand 41 states and 59 transitions. Second operand 6 states. [2018-06-22 12:17:18,498 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:17:18,498 INFO ]: Finished difference Result 48 states and 67 transitions. [2018-06-22 12:17:18,500 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 12:17:18,500 INFO ]: Start accepts. Automaton has 6 states. Word has length 29 [2018-06-22 12:17:18,500 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:17:18,500 INFO ]: With dead ends: 48 [2018-06-22 12:17:18,500 INFO ]: Without dead ends: 39 [2018-06-22 12:17:18,501 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 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 12:17:18,501 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 12:17:18,504 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-06-22 12:17:18,504 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 12:17:18,508 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2018-06-22 12:17:18,508 INFO ]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 29 [2018-06-22 12:17:18,509 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:17:18,509 INFO ]: Abstraction has 37 states and 51 transitions. [2018-06-22 12:17:18,509 INFO ]: Interpolant automaton has 6 states. [2018-06-22 12:17:18,509 INFO ]: Start isEmpty. Operand 37 states and 51 transitions. [2018-06-22 12:17:18,509 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 12:17:18,509 INFO ]: Found error trace [2018-06-22 12:17:18,509 INFO ]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:17:18,510 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:17:18,510 INFO ]: Analyzing trace with hash 410613770, now seen corresponding path program 3 times [2018-06-22 12:17:18,510 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:17:18,510 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:17:18,510 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:18,510 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:17:18,510 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:18,526 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:18,668 INFO ]: Checked inductivity of 42 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-22 12:17:18,668 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:17:18,668 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 12:17:18,682 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 12:17:18,703 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 12:17:18,703 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:18,707 INFO ]: Computing forward predicates... [2018-06-22 12:17:19,291 INFO ]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 12:17:19,312 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:17:19,312 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2018-06-22 12:17:19,312 INFO ]: Interpolant automaton has 16 states [2018-06-22 12:17:19,312 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 12:17:19,312 INFO ]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-06-22 12:17:19,312 INFO ]: Start difference. First operand 37 states and 51 transitions. Second operand 16 states. [2018-06-22 12:17:20,781 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:17:20,781 INFO ]: Finished difference Result 68 states and 101 transitions. [2018-06-22 12:17:20,782 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 12:17:20,782 INFO ]: Start accepts. Automaton has 16 states. Word has length 37 [2018-06-22 12:17:20,782 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:17:20,782 INFO ]: With dead ends: 68 [2018-06-22 12:17:20,783 INFO ]: Without dead ends: 47 [2018-06-22 12:17:20,783 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2018-06-22 12:17:20,783 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 12:17:20,795 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-06-22 12:17:20,795 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 12:17:20,796 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 66 transitions. [2018-06-22 12:17:20,796 INFO ]: Start accepts. Automaton has 45 states and 66 transitions. Word has length 37 [2018-06-22 12:17:20,796 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:17:20,796 INFO ]: Abstraction has 45 states and 66 transitions. [2018-06-22 12:17:20,796 INFO ]: Interpolant automaton has 16 states. [2018-06-22 12:17:20,796 INFO ]: Start isEmpty. Operand 45 states and 66 transitions. [2018-06-22 12:17:20,797 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 12:17:20,797 INFO ]: Found error trace [2018-06-22 12:17:20,797 INFO ]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:17:20,797 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:17:20,797 INFO ]: Analyzing trace with hash -1076689015, now seen corresponding path program 2 times [2018-06-22 12:17:20,797 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:17:20,797 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:17:20,798 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:20,798 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 12:17:20,798 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:20,817 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:20,966 INFO ]: Checked inductivity of 20 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 12:17:20,966 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:17:20,966 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 12:17:20,974 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 12:17:20,990 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 12:17:20,990 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:20,993 INFO ]: Computing forward predicates... [2018-06-22 12:17:21,205 INFO ]: Checked inductivity of 20 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 12:17:21,237 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:17:21,237 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-06-22 12:17:21,237 INFO ]: Interpolant automaton has 15 states [2018-06-22 12:17:21,237 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 12:17:21,237 INFO ]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-06-22 12:17:21,237 INFO ]: Start difference. First operand 45 states and 66 transitions. Second operand 15 states. [2018-06-22 12:17:21,878 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:17:21,878 INFO ]: Finished difference Result 50 states and 73 transitions. [2018-06-22 12:17:21,878 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 12:17:21,878 INFO ]: Start accepts. Automaton has 15 states. Word has length 37 [2018-06-22 12:17:21,878 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:17:21,879 INFO ]: With dead ends: 50 [2018-06-22 12:17:21,879 INFO ]: Without dead ends: 50 [2018-06-22 12:17:21,879 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-06-22 12:17:21,879 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-22 12:17:21,886 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-06-22 12:17:21,886 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 12:17:21,887 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2018-06-22 12:17:21,887 INFO ]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 37 [2018-06-22 12:17:21,887 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:17:21,887 INFO ]: Abstraction has 48 states and 71 transitions. [2018-06-22 12:17:21,887 INFO ]: Interpolant automaton has 15 states. [2018-06-22 12:17:21,887 INFO ]: Start isEmpty. Operand 48 states and 71 transitions. [2018-06-22 12:17:21,888 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 12:17:21,888 INFO ]: Found error trace [2018-06-22 12:17:21,888 INFO ]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:17:21,888 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:17:21,888 INFO ]: Analyzing trace with hash 677571402, now seen corresponding path program 3 times [2018-06-22 12:17:21,889 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:17:21,889 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:17:21,889 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:21,889 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 12:17:21,889 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:21,901 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:22,261 INFO ]: Checked inductivity of 42 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-22 12:17:22,261 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:17:22,261 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 12:17:22,267 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 12:17:22,308 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 12:17:22,308 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:22,312 INFO ]: Computing forward predicates... [2018-06-22 12:17:22,604 INFO ]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 12:17:22,623 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:17:22,623 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 19 [2018-06-22 12:17:22,624 INFO ]: Interpolant automaton has 19 states [2018-06-22 12:17:22,624 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 12:17:22,624 INFO ]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2018-06-22 12:17:22,624 INFO ]: Start difference. First operand 48 states and 71 transitions. Second operand 19 states. [2018-06-22 12:17:23,375 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:17:23,375 INFO ]: Finished difference Result 77 states and 115 transitions. [2018-06-22 12:17:23,375 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 12:17:23,375 INFO ]: Start accepts. Automaton has 19 states. Word has length 45 [2018-06-22 12:17:23,375 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:17:23,376 INFO ]: With dead ends: 77 [2018-06-22 12:17:23,376 INFO ]: Without dead ends: 53 [2018-06-22 12:17:23,377 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2018-06-22 12:17:23,377 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-22 12:17:23,382 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 42. [2018-06-22 12:17:23,382 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 12:17:23,383 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2018-06-22 12:17:23,383 INFO ]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 45 [2018-06-22 12:17:23,383 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:17:23,383 INFO ]: Abstraction has 42 states and 60 transitions. [2018-06-22 12:17:23,383 INFO ]: Interpolant automaton has 19 states. [2018-06-22 12:17:23,383 INFO ]: Start isEmpty. Operand 42 states and 60 transitions. [2018-06-22 12:17:23,384 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 12:17:23,384 INFO ]: Found error trace [2018-06-22 12:17:23,384 INFO ]: trace histogram [9, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:17:23,384 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:17:23,384 INFO ]: Analyzing trace with hash 1975331731, now seen corresponding path program 1 times [2018-06-22 12:17:23,384 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:17:23,384 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:17:23,385 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:23,385 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 12:17:23,385 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:23,401 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:23,564 WARN ]: Spent 101.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-06-22 12:17:23,631 INFO ]: Checked inductivity of 156 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-06-22 12:17:23,631 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:17:23,631 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) [2018-06-22 12:17:23,646 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 12:17:23,694 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:23,699 INFO ]: Computing forward predicates... [2018-06-22 12:17:23,829 INFO ]: Checked inductivity of 156 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-06-22 12:17:23,848 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:17:23,848 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-22 12:17:23,848 INFO ]: Interpolant automaton has 16 states [2018-06-22 12:17:23,848 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 12:17:23,849 INFO ]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-06-22 12:17:23,849 INFO ]: Start difference. First operand 42 states and 60 transitions. Second operand 16 states. [2018-06-22 12:17:23,995 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:17:23,995 INFO ]: Finished difference Result 56 states and 79 transitions. [2018-06-22 12:17:23,996 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 12:17:23,996 INFO ]: Start accepts. Automaton has 16 states. Word has length 61 [2018-06-22 12:17:23,996 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:17:23,996 INFO ]: With dead ends: 56 [2018-06-22 12:17:23,996 INFO ]: Without dead ends: 56 [2018-06-22 12:17:23,996 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2018-06-22 12:17:23,997 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 12:17:24,001 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 54. [2018-06-22 12:17:24,001 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-22 12:17:24,002 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 77 transitions. [2018-06-22 12:17:24,002 INFO ]: Start accepts. Automaton has 54 states and 77 transitions. Word has length 61 [2018-06-22 12:17:24,002 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:17:24,002 INFO ]: Abstraction has 54 states and 77 transitions. [2018-06-22 12:17:24,002 INFO ]: Interpolant automaton has 16 states. [2018-06-22 12:17:24,002 INFO ]: Start isEmpty. Operand 54 states and 77 transitions. [2018-06-22 12:17:24,004 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 12:17:24,004 INFO ]: Found error trace [2018-06-22 12:17:24,004 INFO ]: trace histogram [10, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:17:24,005 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:17:24,005 INFO ]: Analyzing trace with hash 375875284, now seen corresponding path program 2 times [2018-06-22 12:17:24,005 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:17:24,005 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:17:24,005 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:24,005 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:17:24,005 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:24,021 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:24,315 INFO ]: Checked inductivity of 206 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2018-06-22 12:17:24,315 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:17:24,315 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 12:17:24,322 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 12:17:24,384 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 12:17:24,384 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:24,390 INFO ]: Computing forward predicates... [2018-06-22 12:17:24,580 INFO ]: Checked inductivity of 206 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2018-06-22 12:17:24,599 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:17:24,599 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-06-22 12:17:24,599 INFO ]: Interpolant automaton has 18 states [2018-06-22 12:17:24,600 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 12:17:24,600 INFO ]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-06-22 12:17:24,600 INFO ]: Start difference. First operand 54 states and 77 transitions. Second operand 18 states. [2018-06-22 12:17:24,863 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:17:24,863 INFO ]: Finished difference Result 59 states and 84 transitions. [2018-06-22 12:17:24,863 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 12:17:24,863 INFO ]: Start accepts. Automaton has 18 states. Word has length 69 [2018-06-22 12:17:24,864 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:17:24,864 INFO ]: With dead ends: 59 [2018-06-22 12:17:24,864 INFO ]: Without dead ends: 59 [2018-06-22 12:17:24,865 INFO ]: 0 DeclaredPredicates, 87 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2018-06-22 12:17:24,865 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-22 12:17:24,870 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-06-22 12:17:24,870 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 12:17:24,871 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 82 transitions. [2018-06-22 12:17:24,871 INFO ]: Start accepts. Automaton has 57 states and 82 transitions. Word has length 69 [2018-06-22 12:17:24,871 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:17:24,871 INFO ]: Abstraction has 57 states and 82 transitions. [2018-06-22 12:17:24,871 INFO ]: Interpolant automaton has 18 states. [2018-06-22 12:17:24,871 INFO ]: Start isEmpty. Operand 57 states and 82 transitions. [2018-06-22 12:17:24,872 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 12:17:24,872 INFO ]: Found error trace [2018-06-22 12:17:24,872 INFO ]: trace histogram [9, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:17:24,873 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:17:24,873 INFO ]: Analyzing trace with hash 555250259, now seen corresponding path program 1 times [2018-06-22 12:17:24,873 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:17:24,873 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:17:24,873 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:24,873 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 12:17:24,873 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:24,895 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:25,236 WARN ]: Spent 268.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-06-22 12:17:25,310 INFO ]: Checked inductivity of 156 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-06-22 12:17:25,311 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:17:25,311 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 12:17:25,321 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:17:25,364 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:25,369 INFO ]: Computing forward predicates... [2018-06-22 12:17:25,726 INFO ]: Checked inductivity of 156 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-06-22 12:17:25,749 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:17:25,749 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-06-22 12:17:25,749 INFO ]: Interpolant automaton has 19 states [2018-06-22 12:17:25,750 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 12:17:25,750 INFO ]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2018-06-22 12:17:25,750 INFO ]: Start difference. First operand 57 states and 82 transitions. Second operand 19 states. [2018-06-22 12:17:26,564 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:17:26,564 INFO ]: Finished difference Result 62 states and 89 transitions. [2018-06-22 12:17:26,564 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 12:17:26,564 INFO ]: Start accepts. Automaton has 19 states. Word has length 69 [2018-06-22 12:17:26,564 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:17:26,565 INFO ]: With dead ends: 62 [2018-06-22 12:17:26,565 INFO ]: Without dead ends: 62 [2018-06-22 12:17:26,566 INFO ]: 0 DeclaredPredicates, 88 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2018-06-22 12:17:26,566 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-22 12:17:26,570 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 57. [2018-06-22 12:17:26,570 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 12:17:26,571 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 82 transitions. [2018-06-22 12:17:26,571 INFO ]: Start accepts. Automaton has 57 states and 82 transitions. Word has length 69 [2018-06-22 12:17:26,572 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:17:26,572 INFO ]: Abstraction has 57 states and 82 transitions. [2018-06-22 12:17:26,572 INFO ]: Interpolant automaton has 19 states. [2018-06-22 12:17:26,572 INFO ]: Start isEmpty. Operand 57 states and 82 transitions. [2018-06-22 12:17:26,573 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-22 12:17:26,573 INFO ]: Found error trace [2018-06-22 12:17:26,573 INFO ]: trace histogram [11, 7, 7, 6, 6, 6, 6, 6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:17:26,573 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:17:26,573 INFO ]: Analyzing trace with hash -1513350571, now seen corresponding path program 3 times [2018-06-22 12:17:26,573 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:17:26,573 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:17:26,573 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:26,573 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:17:26,573 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:26,590 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:27,181 WARN ]: Spent 506.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-06-22 12:17:27,539 INFO ]: Checked inductivity of 264 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-06-22 12:17:27,539 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:17:27,539 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 12:17:27,545 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 12:17:27,618 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-22 12:17:27,618 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:27,624 INFO ]: Computing forward predicates... [2018-06-22 12:17:45,606 INFO ]: Checked inductivity of 264 backedges. 26 proven. 92 refuted. 3 times theorem prover too weak. 143 trivial. 0 not checked. [2018-06-22 12:17:45,625 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:17:45,625 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 25 [2018-06-22 12:17:45,626 INFO ]: Interpolant automaton has 25 states [2018-06-22 12:17:45,626 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 12:17:45,626 INFO ]: CoverageRelationStatistics Valid=65, Invalid=516, Unknown=19, NotChecked=0, Total=600 [2018-06-22 12:17:45,626 INFO ]: Start difference. First operand 57 states and 82 transitions. Second operand 25 states. [2018-06-22 12:18:24,304 WARN ]: Spent 188.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 33 Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown