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/eldarica-misc/LIA/HOLA/18.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 10:50:25,390 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 10:50:25,394 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 10:50:25,409 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 10:50:25,409 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 10:50:25,410 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 10:50:25,413 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 10:50:25,415 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 10:50:25,417 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 10:50:25,419 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 10:50:25,420 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 10:50:25,420 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 10:50:25,421 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 10:50:25,422 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 10:50:25,423 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 10:50:25,427 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 10:50:25,428 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 10:50:25,441 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 10:50:25,442 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 10:50:25,443 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 10:50:25,444 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 10:50:25,446 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 10:50:25,447 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 10:50:25,447 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 10:50:25,448 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 10:50:25,448 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 10:50:25,453 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 10:50:25,453 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 10:50:25,454 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 10:50:25,455 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 10:50:25,455 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 10:50:25,462 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 10:50:25,462 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 10:50:25,463 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 10:50:25,464 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 10:50:25,464 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 10:50:25,481 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 10:50:25,481 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 10:50:25,482 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 10:50:25,482 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 10:50:25,483 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 10:50:25,483 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 10:50:25,484 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 10:50:25,484 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 10:50:25,484 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 10:50:25,484 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 10:50:25,484 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:50:25,485 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 10:50:25,485 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 10:50:25,485 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 10:50:25,485 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 10:50:25,485 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 10:50:25,485 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 10:50:25,486 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 10:50:25,486 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 10:50:25,488 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 10:50:25,488 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 10:50:25,533 INFO ]: Repository-Root is: /tmp [2018-06-22 10:50:25,548 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 10:50:25,554 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 10:50:25,555 INFO ]: Initializing SmtParser... [2018-06-22 10:50:25,555 INFO ]: SmtParser initialized [2018-06-22 10:50:25,556 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/18.c.smt2 [2018-06-22 10:50:25,557 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 10:50:25,642 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/18.c.smt2 unknown [2018-06-22 10:50:26,133 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/18.c.smt2 [2018-06-22 10:50:26,138 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 10:50:26,149 INFO ]: Walking toolchain with 4 elements. [2018-06-22 10:50:26,150 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 10:50:26,150 INFO ]: Initializing ChcToBoogie... [2018-06-22 10:50:26,150 INFO ]: ChcToBoogie initialized [2018-06-22 10:50:26,156 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:50:26" (1/1) ... [2018-06-22 10:50:26,214 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:50:26 Unit [2018-06-22 10:50:26,214 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 10:50:26,215 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 10:50:26,215 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 10:50:26,215 INFO ]: Boogie Preprocessor initialized [2018-06-22 10:50:26,239 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:50:26" (1/1) ... [2018-06-22 10:50:26,240 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:50:26" (1/1) ... [2018-06-22 10:50:26,252 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:50:26" (1/1) ... [2018-06-22 10:50:26,252 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:50:26" (1/1) ... [2018-06-22 10:50:26,258 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:50:26" (1/1) ... [2018-06-22 10:50:26,268 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:50:26" (1/1) ... [2018-06-22 10:50:26,270 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:50:26" (1/1) ... [2018-06-22 10:50:26,274 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 10:50:26,274 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 10:50:26,274 INFO ]: Initializing RCFGBuilder... [2018-06-22 10:50:26,275 INFO ]: RCFGBuilder initialized [2018-06-22 10:50:26,276 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:50:26" (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 10:50:26,299 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 10:50:26,299 INFO ]: Found specification of procedure False [2018-06-22 10:50:26,299 INFO ]: Found implementation of procedure False [2018-06-22 10:50:26,299 INFO ]: Specification and implementation of procedure h24 given in one single declaration [2018-06-22 10:50:26,299 INFO ]: Found specification of procedure h24 [2018-06-22 10:50:26,299 INFO ]: Found implementation of procedure h24 [2018-06-22 10:50:26,299 INFO ]: Specification and implementation of procedure h19 given in one single declaration [2018-06-22 10:50:26,299 INFO ]: Found specification of procedure h19 [2018-06-22 10:50:26,299 INFO ]: Found implementation of procedure h19 [2018-06-22 10:50:26,299 INFO ]: Specification and implementation of procedure h18 given in one single declaration [2018-06-22 10:50:26,299 INFO ]: Found specification of procedure h18 [2018-06-22 10:50:26,299 INFO ]: Found implementation of procedure h18 [2018-06-22 10:50:26,299 INFO ]: Specification and implementation of procedure h17 given in one single declaration [2018-06-22 10:50:26,299 INFO ]: Found specification of procedure h17 [2018-06-22 10:50:26,299 INFO ]: Found implementation of procedure h17 [2018-06-22 10:50:26,299 INFO ]: Specification and implementation of procedure h11 given in one single declaration [2018-06-22 10:50:26,299 INFO ]: Found specification of procedure h11 [2018-06-22 10:50:26,299 INFO ]: Found implementation of procedure h11 [2018-06-22 10:50:26,300 INFO ]: Specification and implementation of procedure h10 given in one single declaration [2018-06-22 10:50:26,300 INFO ]: Found specification of procedure h10 [2018-06-22 10:50:26,300 INFO ]: Found implementation of procedure h10 [2018-06-22 10:50:26,300 INFO ]: Specification and implementation of procedure h9 given in one single declaration [2018-06-22 10:50:26,300 INFO ]: Found specification of procedure h9 [2018-06-22 10:50:26,300 INFO ]: Found implementation of procedure h9 [2018-06-22 10:50:26,300 INFO ]: Specification and implementation of procedure h6 given in one single declaration [2018-06-22 10:50:26,300 INFO ]: Found specification of procedure h6 [2018-06-22 10:50:26,300 INFO ]: Found implementation of procedure h6 [2018-06-22 10:50:26,300 INFO ]: Specification and implementation of procedure h5 given in one single declaration [2018-06-22 10:50:26,300 INFO ]: Found specification of procedure h5 [2018-06-22 10:50:26,300 INFO ]: Found implementation of procedure h5 [2018-06-22 10:50:26,300 INFO ]: Specification and implementation of procedure h16 given in one single declaration [2018-06-22 10:50:26,300 INFO ]: Found specification of procedure h16 [2018-06-22 10:50:26,300 INFO ]: Found implementation of procedure h16 [2018-06-22 10:50:26,300 INFO ]: Specification and implementation of procedure h15 given in one single declaration [2018-06-22 10:50:26,300 INFO ]: Found specification of procedure h15 [2018-06-22 10:50:26,300 INFO ]: Found implementation of procedure h15 [2018-06-22 10:50:26,300 INFO ]: Specification and implementation of procedure h8 given in one single declaration [2018-06-22 10:50:26,300 INFO ]: Found specification of procedure h8 [2018-06-22 10:50:26,300 INFO ]: Found implementation of procedure h8 [2018-06-22 10:50:26,300 INFO ]: Specification and implementation of procedure h7 given in one single declaration [2018-06-22 10:50:26,300 INFO ]: Found specification of procedure h7 [2018-06-22 10:50:26,300 INFO ]: Found implementation of procedure h7 [2018-06-22 10:50:26,300 INFO ]: Specification and implementation of procedure h13 given in one single declaration [2018-06-22 10:50:26,300 INFO ]: Found specification of procedure h13 [2018-06-22 10:50:26,300 INFO ]: Found implementation of procedure h13 [2018-06-22 10:50:26,301 INFO ]: Specification and implementation of procedure h12 given in one single declaration [2018-06-22 10:50:26,301 INFO ]: Found specification of procedure h12 [2018-06-22 10:50:26,301 INFO ]: Found implementation of procedure h12 [2018-06-22 10:50:26,301 INFO ]: Specification and implementation of procedure h14 given in one single declaration [2018-06-22 10:50:26,301 INFO ]: Found specification of procedure h14 [2018-06-22 10:50:26,301 INFO ]: Found implementation of procedure h14 [2018-06-22 10:50:26,301 INFO ]: Specification and implementation of procedure h4 given in one single declaration [2018-06-22 10:50:26,301 INFO ]: Found specification of procedure h4 [2018-06-22 10:50:26,301 INFO ]: Found implementation of procedure h4 [2018-06-22 10:50:26,301 INFO ]: Specification and implementation of procedure h3 given in one single declaration [2018-06-22 10:50:26,301 INFO ]: Found specification of procedure h3 [2018-06-22 10:50:26,301 INFO ]: Found implementation of procedure h3 [2018-06-22 10:50:26,301 INFO ]: Specification and implementation of procedure h2 given in one single declaration [2018-06-22 10:50:26,301 INFO ]: Found specification of procedure h2 [2018-06-22 10:50:26,301 INFO ]: Found implementation of procedure h2 [2018-06-22 10:50:26,301 INFO ]: Specification and implementation of procedure h1 given in one single declaration [2018-06-22 10:50:26,301 INFO ]: Found specification of procedure h1 [2018-06-22 10:50:26,301 INFO ]: Found implementation of procedure h1 [2018-06-22 10:50:26,301 INFO ]: Specification and implementation of procedure h20 given in one single declaration [2018-06-22 10:50:26,301 INFO ]: Found specification of procedure h20 [2018-06-22 10:50:26,301 INFO ]: Found implementation of procedure h20 [2018-06-22 10:50:26,301 INFO ]: Specification and implementation of procedure h23 given in one single declaration [2018-06-22 10:50:26,301 INFO ]: Found specification of procedure h23 [2018-06-22 10:50:26,301 INFO ]: Found implementation of procedure h23 [2018-06-22 10:50:26,301 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 10:50:26,301 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 10:50:26,301 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 10:50:26,817 INFO ]: Using library mode [2018-06-22 10:50:26,817 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:50:26 BoogieIcfgContainer [2018-06-22 10:50:26,818 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 10:50:26,819 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 10:50:26,819 INFO ]: Initializing TraceAbstraction... [2018-06-22 10:50:26,823 INFO ]: TraceAbstraction initialized [2018-06-22 10:50:26,823 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:50:26" (1/3) ... [2018-06-22 10:50:26,824 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d39edc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 10:50:26, skipping insertion in model container [2018-06-22 10:50:26,824 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:50:26" (2/3) ... [2018-06-22 10:50:26,824 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d39edc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:50:26, skipping insertion in model container [2018-06-22 10:50:26,824 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:50:26" (3/3) ... [2018-06-22 10:50:26,826 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 10:50:26,835 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 10:50:26,850 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 10:50:26,895 INFO ]: Using default assertion order modulation [2018-06-22 10:50:26,895 INFO ]: Interprodecural is true [2018-06-22 10:50:26,895 INFO ]: Hoare is false [2018-06-22 10:50:26,895 INFO ]: Compute interpolants for FPandBP [2018-06-22 10:50:26,895 INFO ]: Backedges is TWOTRACK [2018-06-22 10:50:26,895 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 10:50:26,895 INFO ]: Difference is false [2018-06-22 10:50:26,895 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 10:50:26,895 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 10:50:26,914 INFO ]: Start isEmpty. Operand 101 states. [2018-06-22 10:50:26,930 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 10:50:26,930 INFO ]: Found error trace [2018-06-22 10:50:26,931 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:26,931 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:50:26,936 INFO ]: Analyzing trace with hash -93041416, now seen corresponding path program 1 times [2018-06-22 10:50:26,937 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:50:26,938 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:50:26,974 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:26,974 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:50:26,974 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:27,047 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:27,397 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:50:27,400 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:50:27,400 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 10:50:27,402 INFO ]: Interpolant automaton has 8 states [2018-06-22 10:50:27,417 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 10:50:27,418 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 10:50:27,421 INFO ]: Start difference. First operand 101 states. Second operand 8 states. [2018-06-22 10:50:27,647 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:50:27,647 INFO ]: Finished difference Result 103 states and 112 transitions. [2018-06-22 10:50:27,651 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 10:50:27,652 INFO ]: Start accepts. Automaton has 8 states. Word has length 57 [2018-06-22 10:50:27,653 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:50:27,667 INFO ]: With dead ends: 103 [2018-06-22 10:50:27,667 INFO ]: Without dead ends: 103 [2018-06-22 10:50:27,669 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 10:50:27,698 INFO ]: Start minimizeSevpa. Operand 103 states. [2018-06-22 10:50:27,731 INFO ]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-06-22 10:50:27,732 INFO ]: Start removeUnreachable. Operand 103 states. [2018-06-22 10:50:27,734 INFO ]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2018-06-22 10:50:27,735 INFO ]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 57 [2018-06-22 10:50:27,736 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:50:27,736 INFO ]: Abstraction has 103 states and 112 transitions. [2018-06-22 10:50:27,736 INFO ]: Interpolant automaton has 8 states. [2018-06-22 10:50:27,736 INFO ]: Start isEmpty. Operand 103 states and 112 transitions. [2018-06-22 10:50:27,742 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-22 10:50:27,742 INFO ]: Found error trace [2018-06-22 10:50:27,742 INFO ]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:27,742 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:50:27,742 INFO ]: Analyzing trace with hash 1640986595, now seen corresponding path program 1 times [2018-06-22 10:50:27,743 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:50:27,743 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:50:27,743 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:27,744 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:50:27,744 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:27,786 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:28,030 WARN ]: Spent 158.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-06-22 10:50:28,512 INFO ]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:50:28,512 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:50:28,512 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 10:50:28,515 INFO ]: Interpolant automaton has 11 states [2018-06-22 10:50:28,515 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 10:50:28,515 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 10:50:28,515 INFO ]: Start difference. First operand 103 states and 112 transitions. Second operand 11 states. [2018-06-22 10:50:28,969 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:50:28,969 INFO ]: Finished difference Result 117 states and 127 transitions. [2018-06-22 10:50:28,971 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 10:50:28,971 INFO ]: Start accepts. Automaton has 11 states. Word has length 81 [2018-06-22 10:50:28,972 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:50:28,974 INFO ]: With dead ends: 117 [2018-06-22 10:50:28,974 INFO ]: Without dead ends: 117 [2018-06-22 10:50:28,977 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 10:50:28,977 INFO ]: Start minimizeSevpa. Operand 117 states. [2018-06-22 10:50:29,000 INFO ]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-06-22 10:50:29,001 INFO ]: Start removeUnreachable. Operand 117 states. [2018-06-22 10:50:29,003 INFO ]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2018-06-22 10:50:29,003 INFO ]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 81 [2018-06-22 10:50:29,003 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:50:29,003 INFO ]: Abstraction has 117 states and 127 transitions. [2018-06-22 10:50:29,003 INFO ]: Interpolant automaton has 11 states. [2018-06-22 10:50:29,003 INFO ]: Start isEmpty. Operand 117 states and 127 transitions. [2018-06-22 10:50:29,008 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-22 10:50:29,008 INFO ]: Found error trace [2018-06-22 10:50:29,008 INFO ]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:29,008 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:50:29,008 INFO ]: Analyzing trace with hash -1627151808, now seen corresponding path program 1 times [2018-06-22 10:50:29,008 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:50:29,008 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:50:29,011 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:29,011 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:50:29,011 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:29,047 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:29,390 INFO ]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:50:29,390 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:50:29,390 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 10:50:29,391 INFO ]: Interpolant automaton has 11 states [2018-06-22 10:50:29,391 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 10:50:29,391 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 10:50:29,391 INFO ]: Start difference. First operand 117 states and 127 transitions. Second operand 11 states. [2018-06-22 10:50:29,569 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:50:29,569 INFO ]: Finished difference Result 117 states and 126 transitions. [2018-06-22 10:50:29,569 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 10:50:29,569 INFO ]: Start accepts. Automaton has 11 states. Word has length 81 [2018-06-22 10:50:29,570 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:50:29,571 INFO ]: With dead ends: 117 [2018-06-22 10:50:29,572 INFO ]: Without dead ends: 109 [2018-06-22 10:50:29,572 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 10:50:29,572 INFO ]: Start minimizeSevpa. Operand 109 states. [2018-06-22 10:50:29,584 INFO ]: Finished minimizeSevpa. Reduced states from 109 to 105. [2018-06-22 10:50:29,584 INFO ]: Start removeUnreachable. Operand 105 states. [2018-06-22 10:50:29,585 INFO ]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2018-06-22 10:50:29,585 INFO ]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 81 [2018-06-22 10:50:29,586 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:50:29,586 INFO ]: Abstraction has 105 states and 114 transitions. [2018-06-22 10:50:29,586 INFO ]: Interpolant automaton has 11 states. [2018-06-22 10:50:29,586 INFO ]: Start isEmpty. Operand 105 states and 114 transitions. [2018-06-22 10:50:29,589 INFO ]: Finished isEmpty. Found accepting run of length 86 [2018-06-22 10:50:29,589 INFO ]: Found error trace [2018-06-22 10:50:29,589 INFO ]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:29,589 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:50:29,589 INFO ]: Analyzing trace with hash -1036054264, now seen corresponding path program 1 times [2018-06-22 10:50:29,589 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:50:29,590 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:50:29,590 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:29,590 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:50:29,590 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:29,618 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:30,331 INFO ]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:50:30,331 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:50:30,331 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 10:50:30,342 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:50:30,426 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:30,440 INFO ]: Computing forward predicates... [2018-06-22 10:50:31,256 INFO ]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:50:31,289 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:50:31,289 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16] total 36 [2018-06-22 10:50:31,289 INFO ]: Interpolant automaton has 36 states [2018-06-22 10:50:31,290 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-22 10:50:31,290 INFO ]: CoverageRelationStatistics Valid=73, Invalid=1187, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 10:50:31,290 INFO ]: Start difference. First operand 105 states and 114 transitions. Second operand 36 states. [2018-06-22 10:50:32,308 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:50:32,309 INFO ]: Finished difference Result 123 states and 134 transitions. [2018-06-22 10:50:32,309 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 10:50:32,309 INFO ]: Start accepts. Automaton has 36 states. Word has length 85 [2018-06-22 10:50:32,310 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:50:32,312 INFO ]: With dead ends: 123 [2018-06-22 10:50:32,312 INFO ]: Without dead ends: 123 [2018-06-22 10:50:32,313 INFO ]: 0 DeclaredPredicates, 118 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=129, Invalid=2127, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 10:50:32,314 INFO ]: Start minimizeSevpa. Operand 123 states. [2018-06-22 10:50:32,324 INFO ]: Finished minimizeSevpa. Reduced states from 123 to 117. [2018-06-22 10:50:32,324 INFO ]: Start removeUnreachable. Operand 117 states. [2018-06-22 10:50:32,325 INFO ]: Finished removeUnreachable. Reduced from 117 states to 117 states and 128 transitions. [2018-06-22 10:50:32,326 INFO ]: Start accepts. Automaton has 117 states and 128 transitions. Word has length 85 [2018-06-22 10:50:32,326 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:50:32,326 INFO ]: Abstraction has 117 states and 128 transitions. [2018-06-22 10:50:32,326 INFO ]: Interpolant automaton has 36 states. [2018-06-22 10:50:32,326 INFO ]: Start isEmpty. Operand 117 states and 128 transitions. [2018-06-22 10:50:32,327 INFO ]: Finished isEmpty. Found accepting run of length 86 [2018-06-22 10:50:32,327 INFO ]: Found error trace [2018-06-22 10:50:32,328 INFO ]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:32,328 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:50:32,328 INFO ]: Analyzing trace with hash -1284495326, now seen corresponding path program 1 times [2018-06-22 10:50:32,328 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:50:32,328 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:50:32,328 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:32,328 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:50:32,328 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:32,349 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:32,898 INFO ]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:50:32,898 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:50:32,898 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 10:50:32,905 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:50:32,968 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:32,974 INFO ]: Computing forward predicates... [2018-06-22 10:50:33,299 INFO ]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:50:33,318 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:50:33,318 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16] total 36 [2018-06-22 10:50:33,319 INFO ]: Interpolant automaton has 36 states [2018-06-22 10:50:33,319 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-22 10:50:33,319 INFO ]: CoverageRelationStatistics Valid=73, Invalid=1187, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 10:50:33,319 INFO ]: Start difference. First operand 117 states and 128 transitions. Second operand 36 states. [2018-06-22 10:50:34,304 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:50:34,304 INFO ]: Finished difference Result 127 states and 138 transitions. [2018-06-22 10:50:34,304 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 10:50:34,304 INFO ]: Start accepts. Automaton has 36 states. Word has length 85 [2018-06-22 10:50:34,305 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:50:34,307 INFO ]: With dead ends: 127 [2018-06-22 10:50:34,307 INFO ]: Without dead ends: 127 [2018-06-22 10:50:34,308 INFO ]: 0 DeclaredPredicates, 118 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=129, Invalid=2127, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 10:50:34,308 INFO ]: Start minimizeSevpa. Operand 127 states. [2018-06-22 10:50:34,320 INFO ]: Finished minimizeSevpa. Reduced states from 127 to 119. [2018-06-22 10:50:34,320 INFO ]: Start removeUnreachable. Operand 119 states. [2018-06-22 10:50:34,322 INFO ]: Finished removeUnreachable. Reduced from 119 states to 119 states and 130 transitions. [2018-06-22 10:50:34,322 INFO ]: Start accepts. Automaton has 119 states and 130 transitions. Word has length 85 [2018-06-22 10:50:34,322 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:50:34,322 INFO ]: Abstraction has 119 states and 130 transitions. [2018-06-22 10:50:34,322 INFO ]: Interpolant automaton has 36 states. [2018-06-22 10:50:34,322 INFO ]: Start isEmpty. Operand 119 states and 130 transitions. [2018-06-22 10:50:34,323 INFO ]: Finished isEmpty. Found accepting run of length 110 [2018-06-22 10:50:34,323 INFO ]: Found error trace [2018-06-22 10:50:34,323 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:34,323 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:50:34,323 INFO ]: Analyzing trace with hash 30233360, now seen corresponding path program 1 times [2018-06-22 10:50:34,324 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:50:34,324 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:50:34,324 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:34,324 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:50:34,324 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:34,344 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:34,619 INFO ]: Checked inductivity of 33 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 10:50:34,619 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:50:34,635 INFO ]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-06-22 10:50:34,635 INFO ]: Interpolant automaton has 9 states [2018-06-22 10:50:34,635 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 10:50:34,635 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-22 10:50:34,635 INFO ]: Start difference. First operand 119 states and 130 transitions. Second operand 9 states. [2018-06-22 10:50:34,725 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:50:34,725 INFO ]: Finished difference Result 156 states and 176 transitions. [2018-06-22 10:50:34,726 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 10:50:34,726 INFO ]: Start accepts. Automaton has 9 states. Word has length 109 [2018-06-22 10:50:34,727 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:50:34,728 INFO ]: With dead ends: 156 [2018-06-22 10:50:34,728 INFO ]: Without dead ends: 156 [2018-06-22 10:50:34,729 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 11 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-22 10:50:34,729 INFO ]: Start minimizeSevpa. Operand 156 states. [2018-06-22 10:50:34,742 INFO ]: Finished minimizeSevpa. Reduced states from 156 to 154. [2018-06-22 10:50:34,742 INFO ]: Start removeUnreachable. Operand 154 states. [2018-06-22 10:50:34,743 INFO ]: Finished removeUnreachable. Reduced from 154 states to 154 states and 173 transitions. [2018-06-22 10:50:34,743 INFO ]: Start accepts. Automaton has 154 states and 173 transitions. Word has length 109 [2018-06-22 10:50:34,744 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:50:34,744 INFO ]: Abstraction has 154 states and 173 transitions. [2018-06-22 10:50:34,744 INFO ]: Interpolant automaton has 9 states. [2018-06-22 10:50:34,744 INFO ]: Start isEmpty. Operand 154 states and 173 transitions. [2018-06-22 10:50:34,746 INFO ]: Finished isEmpty. Found accepting run of length 110 [2018-06-22 10:50:34,746 INFO ]: Found error trace [2018-06-22 10:50:34,746 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:34,746 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:50:34,746 INFO ]: Analyzing trace with hash 1164973814, now seen corresponding path program 1 times [2018-06-22 10:50:34,746 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:50:34,746 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:50:34,747 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:34,747 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:50:34,747 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:34,770 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:35,507 INFO ]: Checked inductivity of 33 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 10:50:35,508 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:50:35,508 INFO ]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-06-22 10:50:35,508 INFO ]: Interpolant automaton has 9 states [2018-06-22 10:50:35,508 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 10:50:35,508 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-22 10:50:35,508 INFO ]: Start difference. First operand 154 states and 173 transitions. Second operand 9 states. [2018-06-22 10:50:35,613 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:50:35,613 INFO ]: Finished difference Result 156 states and 175 transitions. [2018-06-22 10:50:35,614 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 10:50:35,614 INFO ]: Start accepts. Automaton has 9 states. Word has length 109 [2018-06-22 10:50:35,614 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:50:35,615 INFO ]: With dead ends: 156 [2018-06-22 10:50:35,615 INFO ]: Without dead ends: 114 [2018-06-22 10:50:35,615 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 11 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-22 10:50:35,615 INFO ]: Start minimizeSevpa. Operand 114 states. [2018-06-22 10:50:35,622 INFO ]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-06-22 10:50:35,622 INFO ]: Start removeUnreachable. Operand 114 states. [2018-06-22 10:50:35,623 INFO ]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2018-06-22 10:50:35,623 INFO ]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 109 [2018-06-22 10:50:35,624 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:50:35,624 INFO ]: Abstraction has 114 states and 122 transitions. [2018-06-22 10:50:35,624 INFO ]: Interpolant automaton has 9 states. [2018-06-22 10:50:35,624 INFO ]: Start isEmpty. Operand 114 states and 122 transitions. [2018-06-22 10:50:35,625 INFO ]: Finished isEmpty. Found accepting run of length 114 [2018-06-22 10:50:35,625 INFO ]: Found error trace [2018-06-22 10:50:35,625 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 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 10:50:35,625 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:50:35,626 INFO ]: Analyzing trace with hash -315548241, now seen corresponding path program 2 times [2018-06-22 10:50:35,626 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:50:35,626 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:50:35,626 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:35,626 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:50:35,626 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:35,652 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:36,036 INFO ]: Checked inductivity of 42 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-22 10:50:36,036 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:50:36,036 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 10:50:36,042 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:50:36,153 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:50:36,153 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:36,162 INFO ]: Computing forward predicates... [2018-06-22 10:50:36,229 INFO ]: Checked inductivity of 42 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-22 10:50:36,249 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:50:36,249 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-06-22 10:50:36,250 INFO ]: Interpolant automaton has 29 states [2018-06-22 10:50:36,250 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 10:50:36,250 INFO ]: CoverageRelationStatistics Valid=66, Invalid=746, Unknown=0, NotChecked=0, Total=812 [2018-06-22 10:50:36,250 INFO ]: Start difference. First operand 114 states and 122 transitions. Second operand 29 states. [2018-06-22 10:50:36,714 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:50:36,714 INFO ]: Finished difference Result 148 states and 159 transitions. [2018-06-22 10:50:36,715 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 10:50:36,715 INFO ]: Start accepts. Automaton has 29 states. Word has length 113 [2018-06-22 10:50:36,715 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:50:36,716 INFO ]: With dead ends: 148 [2018-06-22 10:50:36,716 INFO ]: Without dead ends: 148 [2018-06-22 10:50:36,717 INFO ]: 0 DeclaredPredicates, 144 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=854, Unknown=0, NotChecked=0, Total=930 [2018-06-22 10:50:36,717 INFO ]: Start minimizeSevpa. Operand 148 states. [2018-06-22 10:50:36,725 INFO ]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-06-22 10:50:36,725 INFO ]: Start removeUnreachable. Operand 148 states. [2018-06-22 10:50:36,726 INFO ]: Finished removeUnreachable. Reduced from 148 states to 148 states and 159 transitions. [2018-06-22 10:50:36,726 INFO ]: Start accepts. Automaton has 148 states and 159 transitions. Word has length 113 [2018-06-22 10:50:36,727 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:50:36,727 INFO ]: Abstraction has 148 states and 159 transitions. [2018-06-22 10:50:36,727 INFO ]: Interpolant automaton has 29 states. [2018-06-22 10:50:36,727 INFO ]: Start isEmpty. Operand 148 states and 159 transitions. [2018-06-22 10:50:36,728 INFO ]: Finished isEmpty. Found accepting run of length 114 [2018-06-22 10:50:36,728 INFO ]: Found error trace [2018-06-22 10:50:36,729 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 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 10:50:36,729 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:50:36,729 INFO ]: Analyzing trace with hash 1336783000, now seen corresponding path program 2 times [2018-06-22 10:50:36,729 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:50:36,729 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:50:36,730 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:36,730 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:50:36,730 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:36,747 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:37,121 INFO ]: Checked inductivity of 42 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-22 10:50:37,121 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:50:37,121 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 10:50:37,134 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:50:37,217 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:50:37,217 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:37,225 INFO ]: Computing forward predicates... [2018-06-22 10:50:37,289 INFO ]: Checked inductivity of 42 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-22 10:50:37,310 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:50:37,310 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-06-22 10:50:37,310 INFO ]: Interpolant automaton has 29 states [2018-06-22 10:50:37,311 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 10:50:37,311 INFO ]: CoverageRelationStatistics Valid=66, Invalid=746, Unknown=0, NotChecked=0, Total=812 [2018-06-22 10:50:37,311 INFO ]: Start difference. First operand 148 states and 159 transitions. Second operand 29 states. [2018-06-22 10:50:38,266 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:50:38,266 INFO ]: Finished difference Result 174 states and 188 transitions. [2018-06-22 10:50:38,266 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 10:50:38,266 INFO ]: Start accepts. Automaton has 29 states. Word has length 113 [2018-06-22 10:50:38,266 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:50:38,267 INFO ]: With dead ends: 174 [2018-06-22 10:50:38,267 INFO ]: Without dead ends: 174 [2018-06-22 10:50:38,268 INFO ]: 0 DeclaredPredicates, 144 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=854, Unknown=0, NotChecked=0, Total=930 [2018-06-22 10:50:38,268 INFO ]: Start minimizeSevpa. Operand 174 states. [2018-06-22 10:50:38,278 INFO ]: Finished minimizeSevpa. Reduced states from 174 to 172. [2018-06-22 10:50:38,278 INFO ]: Start removeUnreachable. Operand 172 states. [2018-06-22 10:50:38,280 INFO ]: Finished removeUnreachable. Reduced from 172 states to 172 states and 186 transitions. [2018-06-22 10:50:38,280 INFO ]: Start accepts. Automaton has 172 states and 186 transitions. Word has length 113 [2018-06-22 10:50:38,280 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:50:38,280 INFO ]: Abstraction has 172 states and 186 transitions. [2018-06-22 10:50:38,280 INFO ]: Interpolant automaton has 29 states. [2018-06-22 10:50:38,280 INFO ]: Start isEmpty. Operand 172 states and 186 transitions. [2018-06-22 10:50:38,282 INFO ]: Finished isEmpty. Found accepting run of length 114 [2018-06-22 10:50:38,282 INFO ]: Found error trace [2018-06-22 10:50:38,282 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 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 10:50:38,282 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:50:38,282 INFO ]: Analyzing trace with hash -1438490603, now seen corresponding path program 1 times [2018-06-22 10:50:38,282 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:50:38,282 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:50:38,283 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:38,283 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:50:38,283 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:38,299 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:38,640 INFO ]: Checked inductivity of 42 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-22 10:50:38,640 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:50:38,640 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 10:50:38,646 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:50:38,711 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:38,715 INFO ]: Computing forward predicates... [2018-06-22 10:50:38,768 INFO ]: Checked inductivity of 42 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-22 10:50:38,791 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:50:38,791 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-06-22 10:50:38,791 INFO ]: Interpolant automaton has 23 states [2018-06-22 10:50:38,791 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 10:50:38,792 INFO ]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2018-06-22 10:50:38,792 INFO ]: Start difference. First operand 172 states and 186 transitions. Second operand 23 states. [2018-06-22 10:50:39,132 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:50:39,132 INFO ]: Finished difference Result 162 states and 174 transitions. [2018-06-22 10:50:39,132 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 10:50:39,132 INFO ]: Start accepts. Automaton has 23 states. Word has length 113 [2018-06-22 10:50:39,132 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:50:39,133 INFO ]: With dead ends: 162 [2018-06-22 10:50:39,133 INFO ]: Without dead ends: 162 [2018-06-22 10:50:39,133 INFO ]: 0 DeclaredPredicates, 138 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2018-06-22 10:50:39,134 INFO ]: Start minimizeSevpa. Operand 162 states. [2018-06-22 10:50:39,143 INFO ]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-06-22 10:50:39,143 INFO ]: Start removeUnreachable. Operand 162 states. [2018-06-22 10:50:39,144 INFO ]: Finished removeUnreachable. Reduced from 162 states to 162 states and 174 transitions. [2018-06-22 10:50:39,144 INFO ]: Start accepts. Automaton has 162 states and 174 transitions. Word has length 113 [2018-06-22 10:50:39,145 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:50:39,145 INFO ]: Abstraction has 162 states and 174 transitions. [2018-06-22 10:50:39,145 INFO ]: Interpolant automaton has 23 states. [2018-06-22 10:50:39,145 INFO ]: Start isEmpty. Operand 162 states and 174 transitions. [2018-06-22 10:50:39,146 INFO ]: Finished isEmpty. Found accepting run of length 114 [2018-06-22 10:50:39,146 INFO ]: Found error trace [2018-06-22 10:50:39,147 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:39,147 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:50:39,147 INFO ]: Analyzing trace with hash -1179076139, now seen corresponding path program 1 times [2018-06-22 10:50:39,147 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:50:39,147 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:50:39,147 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:39,147 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:50:39,147 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:39,157 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:39,395 INFO ]: Checked inductivity of 37 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 10:50:39,395 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:50:39,395 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:50:39,396 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:50:39,396 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:50:39,396 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:50:39,396 INFO ]: Start difference. First operand 162 states and 174 transitions. Second operand 12 states. [2018-06-22 10:50:39,522 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:50:39,522 INFO ]: Finished difference Result 178 states and 190 transitions. [2018-06-22 10:50:39,523 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:50:39,523 INFO ]: Start accepts. Automaton has 12 states. Word has length 113 [2018-06-22 10:50:39,523 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:50:39,524 INFO ]: With dead ends: 178 [2018-06-22 10:50:39,524 INFO ]: Without dead ends: 178 [2018-06-22 10:50:39,524 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:50:39,525 INFO ]: Start minimizeSevpa. Operand 178 states. [2018-06-22 10:50:39,535 INFO ]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-06-22 10:50:39,536 INFO ]: Start removeUnreachable. Operand 178 states. [2018-06-22 10:50:39,537 INFO ]: Finished removeUnreachable. Reduced from 178 states to 178 states and 190 transitions. [2018-06-22 10:50:39,537 INFO ]: Start accepts. Automaton has 178 states and 190 transitions. Word has length 113 [2018-06-22 10:50:39,538 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:50:39,538 INFO ]: Abstraction has 178 states and 190 transitions. [2018-06-22 10:50:39,538 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:50:39,538 INFO ]: Start isEmpty. Operand 178 states and 190 transitions. [2018-06-22 10:50:39,539 INFO ]: Finished isEmpty. Found accepting run of length 114 [2018-06-22 10:50:39,539 INFO ]: Found error trace [2018-06-22 10:50:39,539 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:39,539 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:50:39,540 INFO ]: Analyzing trace with hash 217065522, now seen corresponding path program 1 times [2018-06-22 10:50:39,540 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:50:39,540 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:50:39,540 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:39,540 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:50:39,540 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:39,554 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:39,720 INFO ]: Checked inductivity of 37 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 10:50:39,720 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:50:39,720 INFO ]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-06-22 10:50:39,720 INFO ]: Interpolant automaton has 15 states [2018-06-22 10:50:39,720 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 10:50:39,720 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-22 10:50:39,721 INFO ]: Start difference. First operand 178 states and 190 transitions. Second operand 15 states. [2018-06-22 10:50:39,941 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:50:39,941 INFO ]: Finished difference Result 224 states and 252 transitions. [2018-06-22 10:50:39,941 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 10:50:39,941 INFO ]: Start accepts. Automaton has 15 states. Word has length 113 [2018-06-22 10:50:39,942 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:50:39,943 INFO ]: With dead ends: 224 [2018-06-22 10:50:39,943 INFO ]: Without dead ends: 204 [2018-06-22 10:50:39,944 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-22 10:50:39,944 INFO ]: Start minimizeSevpa. Operand 204 states. [2018-06-22 10:50:39,956 INFO ]: Finished minimizeSevpa. Reduced states from 204 to 203. [2018-06-22 10:50:39,956 INFO ]: Start removeUnreachable. Operand 203 states. [2018-06-22 10:50:39,957 INFO ]: Finished removeUnreachable. Reduced from 203 states to 203 states and 216 transitions. [2018-06-22 10:50:39,957 INFO ]: Start accepts. Automaton has 203 states and 216 transitions. Word has length 113 [2018-06-22 10:50:39,958 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:50:39,958 INFO ]: Abstraction has 203 states and 216 transitions. [2018-06-22 10:50:39,958 INFO ]: Interpolant automaton has 15 states. [2018-06-22 10:50:39,958 INFO ]: Start isEmpty. Operand 203 states and 216 transitions. [2018-06-22 10:50:39,959 INFO ]: Finished isEmpty. Found accepting run of length 114 [2018-06-22 10:50:39,959 INFO ]: Found error trace [2018-06-22 10:50:39,959 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 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 10:50:39,960 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:50:39,960 INFO ]: Analyzing trace with hash 1204145452, now seen corresponding path program 1 times [2018-06-22 10:50:39,960 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:50:39,960 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:50:39,960 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:39,960 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:50:39,960 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:39,975 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:40,267 INFO ]: Checked inductivity of 42 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-22 10:50:40,267 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:50:40,267 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 10:50:40,273 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:50:40,339 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:40,345 INFO ]: Computing forward predicates... [2018-06-22 10:50:40,381 INFO ]: Checked inductivity of 42 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-22 10:50:40,407 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:50:40,407 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-06-22 10:50:40,407 INFO ]: Interpolant automaton has 23 states [2018-06-22 10:50:40,407 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 10:50:40,407 INFO ]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2018-06-22 10:50:40,408 INFO ]: Start difference. First operand 203 states and 216 transitions. Second operand 23 states. [2018-06-22 10:50:40,615 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:50:40,615 INFO ]: Finished difference Result 191 states and 203 transitions. [2018-06-22 10:50:40,616 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 10:50:40,616 INFO ]: Start accepts. Automaton has 23 states. Word has length 113 [2018-06-22 10:50:40,616 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:50:40,617 INFO ]: With dead ends: 191 [2018-06-22 10:50:40,617 INFO ]: Without dead ends: 191 [2018-06-22 10:50:40,617 INFO ]: 0 DeclaredPredicates, 138 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2018-06-22 10:50:40,617 INFO ]: Start minimizeSevpa. Operand 191 states. [2018-06-22 10:50:40,626 INFO ]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-06-22 10:50:40,626 INFO ]: Start removeUnreachable. Operand 191 states. [2018-06-22 10:50:40,627 INFO ]: Finished removeUnreachable. Reduced from 191 states to 191 states and 203 transitions. [2018-06-22 10:50:40,628 INFO ]: Start accepts. Automaton has 191 states and 203 transitions. Word has length 113 [2018-06-22 10:50:40,628 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:50:40,628 INFO ]: Abstraction has 191 states and 203 transitions. [2018-06-22 10:50:40,628 INFO ]: Interpolant automaton has 23 states. [2018-06-22 10:50:40,628 INFO ]: Start isEmpty. Operand 191 states and 203 transitions. [2018-06-22 10:50:40,630 INFO ]: Finished isEmpty. Found accepting run of length 142 [2018-06-22 10:50:40,630 INFO ]: Found error trace [2018-06-22 10:50:40,630 INFO ]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:40,630 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:50:40,630 INFO ]: Analyzing trace with hash 310154492, now seen corresponding path program 3 times [2018-06-22 10:50:40,630 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:50:40,630 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:50:40,631 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:40,631 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:50:40,631 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:40,652 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:41,101 INFO ]: Checked inductivity of 105 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-22 10:50:41,101 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:50:41,101 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 10:50:41,107 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 10:50:41,244 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 10:50:41,244 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:41,254 INFO ]: Computing forward predicates... [2018-06-22 10:50:43,491 INFO ]: Checked inductivity of 105 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-22 10:50:43,510 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:50:43,511 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 36] total 64 [2018-06-22 10:50:43,511 INFO ]: Interpolant automaton has 64 states [2018-06-22 10:50:43,511 INFO ]: Constructing interpolant automaton starting with 64 interpolants. [2018-06-22 10:50:43,512 INFO ]: CoverageRelationStatistics Valid=179, Invalid=3853, Unknown=0, NotChecked=0, Total=4032 [2018-06-22 10:50:43,512 INFO ]: Start difference. First operand 191 states and 203 transitions. Second operand 64 states. [2018-06-22 10:50:44,460 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:50:44,460 INFO ]: Finished difference Result 205 states and 217 transitions. [2018-06-22 10:50:44,460 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 10:50:44,460 INFO ]: Start accepts. Automaton has 64 states. Word has length 141 [2018-06-22 10:50:44,460 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:50:44,461 INFO ]: With dead ends: 205 [2018-06-22 10:50:44,461 INFO ]: Without dead ends: 205 [2018-06-22 10:50:44,463 INFO ]: 0 DeclaredPredicates, 198 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1183 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=370, Invalid=7640, Unknown=0, NotChecked=0, Total=8010 [2018-06-22 10:50:44,463 INFO ]: Start minimizeSevpa. Operand 205 states. [2018-06-22 10:50:44,474 INFO ]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-06-22 10:50:44,478 INFO ]: Start removeUnreachable. Operand 205 states. [2018-06-22 10:50:44,480 INFO ]: Finished removeUnreachable. Reduced from 205 states to 205 states and 217 transitions. [2018-06-22 10:50:44,480 INFO ]: Start accepts. Automaton has 205 states and 217 transitions. Word has length 141 [2018-06-22 10:50:44,480 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:50:44,480 INFO ]: Abstraction has 205 states and 217 transitions. [2018-06-22 10:50:44,480 INFO ]: Interpolant automaton has 64 states. [2018-06-22 10:50:44,480 INFO ]: Start isEmpty. Operand 205 states and 217 transitions. [2018-06-22 10:50:44,481 INFO ]: Finished isEmpty. Found accepting run of length 142 [2018-06-22 10:50:44,481 INFO ]: Found error trace [2018-06-22 10:50:44,481 INFO ]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:44,481 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:50:44,486 INFO ]: Analyzing trace with hash -685519960, now seen corresponding path program 3 times [2018-06-22 10:50:44,486 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:50:44,486 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:50:44,487 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:44,487 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:50:44,487 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:44,508 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:45,003 INFO ]: Checked inductivity of 105 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-22 10:50:45,004 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:50:45,006 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 10:50:45,017 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 10:50:45,105 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 10:50:45,105 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:45,110 INFO ]: Computing forward predicates... [2018-06-22 10:50:46,254 INFO ]: Checked inductivity of 105 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-22 10:50:46,273 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:50:46,273 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 36] total 64 [2018-06-22 10:50:46,274 INFO ]: Interpolant automaton has 64 states [2018-06-22 10:50:46,274 INFO ]: Constructing interpolant automaton starting with 64 interpolants. [2018-06-22 10:50:46,274 INFO ]: CoverageRelationStatistics Valid=179, Invalid=3853, Unknown=0, NotChecked=0, Total=4032 [2018-06-22 10:50:46,275 INFO ]: Start difference. First operand 205 states and 217 transitions. Second operand 64 states. [2018-06-22 10:50:48,328 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:50:48,329 INFO ]: Finished difference Result 219 states and 235 transitions. [2018-06-22 10:50:48,331 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 10:50:48,331 INFO ]: Start accepts. Automaton has 64 states. Word has length 141 [2018-06-22 10:50:48,331 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:50:48,332 INFO ]: With dead ends: 219 [2018-06-22 10:50:48,332 INFO ]: Without dead ends: 219 [2018-06-22 10:50:48,334 INFO ]: 0 DeclaredPredicates, 198 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1183 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=370, Invalid=7640, Unknown=0, NotChecked=0, Total=8010 [2018-06-22 10:50:48,335 INFO ]: Start minimizeSevpa. Operand 219 states. [2018-06-22 10:50:48,346 INFO ]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-06-22 10:50:48,346 INFO ]: Start removeUnreachable. Operand 219 states. [2018-06-22 10:50:48,349 INFO ]: Finished removeUnreachable. Reduced from 219 states to 219 states and 231 transitions. [2018-06-22 10:50:48,349 INFO ]: Start accepts. Automaton has 219 states and 231 transitions. Word has length 141 [2018-06-22 10:50:48,349 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:50:48,349 INFO ]: Abstraction has 219 states and 231 transitions. [2018-06-22 10:50:48,349 INFO ]: Interpolant automaton has 64 states. [2018-06-22 10:50:48,349 INFO ]: Start isEmpty. Operand 219 states and 231 transitions. [2018-06-22 10:50:48,350 INFO ]: Finished isEmpty. Found accepting run of length 170 [2018-06-22 10:50:48,350 INFO ]: Found error trace [2018-06-22 10:50:48,351 INFO ]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:48,351 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:50:48,351 INFO ]: Analyzing trace with hash -1173552584, now seen corresponding path program 4 times [2018-06-22 10:50:48,351 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:50:48,351 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:50:48,351 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:48,351 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:50:48,351 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:48,374 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:49,057 INFO ]: Checked inductivity of 196 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-06-22 10:50:49,057 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:50:49,057 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 10:50:49,065 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 10:50:49,165 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 10:50:49,165 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:49,173 INFO ]: Computing forward predicates... [2018-06-22 10:50:49,238 INFO ]: Checked inductivity of 196 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-06-22 10:50:49,263 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:50:49,263 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-06-22 10:50:49,264 INFO ]: Interpolant automaton has 43 states [2018-06-22 10:50:49,264 INFO ]: Constructing interpolant automaton starting with 43 interpolants. [2018-06-22 10:50:49,264 INFO ]: CoverageRelationStatistics Valid=133, Invalid=1673, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 10:50:49,264 INFO ]: Start difference. First operand 219 states and 231 transitions. Second operand 43 states. [2018-06-22 10:50:49,763 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:50:49,763 INFO ]: Finished difference Result 245 states and 262 transitions. [2018-06-22 10:50:49,763 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-06-22 10:50:49,763 INFO ]: Start accepts. Automaton has 43 states. Word has length 169 [2018-06-22 10:50:49,764 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:50:49,764 INFO ]: With dead ends: 245 [2018-06-22 10:50:49,764 INFO ]: Without dead ends: 245 [2018-06-22 10:50:49,765 INFO ]: 0 DeclaredPredicates, 218 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=161, Invalid=2001, Unknown=0, NotChecked=0, Total=2162 [2018-06-22 10:50:49,765 INFO ]: Start minimizeSevpa. Operand 245 states. [2018-06-22 10:50:49,776 INFO ]: Finished minimizeSevpa. Reduced states from 245 to 245. [2018-06-22 10:50:49,776 INFO ]: Start removeUnreachable. Operand 245 states. [2018-06-22 10:50:49,778 INFO ]: Finished removeUnreachable. Reduced from 245 states to 245 states and 262 transitions. [2018-06-22 10:50:49,778 INFO ]: Start accepts. Automaton has 245 states and 262 transitions. Word has length 169 [2018-06-22 10:50:49,779 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:50:49,779 INFO ]: Abstraction has 245 states and 262 transitions. [2018-06-22 10:50:49,779 INFO ]: Interpolant automaton has 43 states. [2018-06-22 10:50:49,779 INFO ]: Start isEmpty. Operand 245 states and 262 transitions. [2018-06-22 10:50:49,780 INFO ]: Finished isEmpty. Found accepting run of length 170 [2018-06-22 10:50:49,780 INFO ]: Found error trace [2018-06-22 10:50:49,780 INFO ]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:49,780 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:50:49,780 INFO ]: Analyzing trace with hash -684933623, now seen corresponding path program 4 times [2018-06-22 10:50:49,781 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:50:49,781 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:50:49,781 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:49,781 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:50:49,781 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:49,812 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:50,876 INFO ]: Checked inductivity of 196 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-06-22 10:50:50,876 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:50:50,876 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 10:50:50,882 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 10:50:51,001 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 10:50:51,001 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:51,011 INFO ]: Computing forward predicates... [2018-06-22 10:50:51,076 INFO ]: Checked inductivity of 196 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-06-22 10:50:51,097 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:50:51,097 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-06-22 10:50:51,098 INFO ]: Interpolant automaton has 43 states [2018-06-22 10:50:51,098 INFO ]: Constructing interpolant automaton starting with 43 interpolants. [2018-06-22 10:50:51,098 INFO ]: CoverageRelationStatistics Valid=133, Invalid=1673, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 10:50:51,098 INFO ]: Start difference. First operand 245 states and 262 transitions. Second operand 43 states. [2018-06-22 10:50:51,943 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:50:51,943 INFO ]: Finished difference Result 271 states and 289 transitions. [2018-06-22 10:50:51,943 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-06-22 10:50:51,943 INFO ]: Start accepts. Automaton has 43 states. Word has length 169 [2018-06-22 10:50:51,943 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:50:51,945 INFO ]: With dead ends: 271 [2018-06-22 10:50:51,945 INFO ]: Without dead ends: 271 [2018-06-22 10:50:51,946 INFO ]: 0 DeclaredPredicates, 218 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=161, Invalid=2001, Unknown=0, NotChecked=0, Total=2162 [2018-06-22 10:50:51,946 INFO ]: Start minimizeSevpa. Operand 271 states. [2018-06-22 10:50:51,957 INFO ]: Finished minimizeSevpa. Reduced states from 271 to 269. [2018-06-22 10:50:51,957 INFO ]: Start removeUnreachable. Operand 269 states. [2018-06-22 10:50:51,959 INFO ]: Finished removeUnreachable. Reduced from 269 states to 269 states and 287 transitions. [2018-06-22 10:50:51,959 INFO ]: Start accepts. Automaton has 269 states and 287 transitions. Word has length 169 [2018-06-22 10:50:51,959 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:50:51,960 INFO ]: Abstraction has 269 states and 287 transitions. [2018-06-22 10:50:51,960 INFO ]: Interpolant automaton has 43 states. [2018-06-22 10:50:51,960 INFO ]: Start isEmpty. Operand 269 states and 287 transitions. [2018-06-22 10:50:51,961 INFO ]: Finished isEmpty. Found accepting run of length 170 [2018-06-22 10:50:51,961 INFO ]: Found error trace [2018-06-22 10:50:51,961 INFO ]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:51,961 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:50:51,964 INFO ]: Analyzing trace with hash -2098559098, now seen corresponding path program 2 times [2018-06-22 10:50:51,964 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:50:51,964 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:50:51,964 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:51,964 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:50:51,964 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:51,987 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:52,912 INFO ]: Checked inductivity of 196 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-06-22 10:50:52,912 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:50:52,912 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 10:50:52,917 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:50:53,021 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:50:53,022 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:53,029 INFO ]: Computing forward predicates... [2018-06-22 10:50:53,087 INFO ]: Checked inductivity of 196 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-06-22 10:50:53,123 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:50:53,123 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-06-22 10:50:53,123 INFO ]: Interpolant automaton has 37 states [2018-06-22 10:50:53,124 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-22 10:50:53,124 INFO ]: CoverageRelationStatistics Valid=121, Invalid=1211, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 10:50:53,124 INFO ]: Start difference. First operand 269 states and 287 transitions. Second operand 37 states. [2018-06-22 10:50:53,447 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:50:53,447 INFO ]: Finished difference Result 259 states and 276 transitions. [2018-06-22 10:50:53,450 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-22 10:50:53,450 INFO ]: Start accepts. Automaton has 37 states. Word has length 169 [2018-06-22 10:50:53,451 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:50:53,452 INFO ]: With dead ends: 259 [2018-06-22 10:50:53,452 INFO ]: Without dead ends: 259 [2018-06-22 10:50:53,453 INFO ]: 0 DeclaredPredicates, 212 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=149, Invalid=1491, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 10:50:53,453 INFO ]: Start minimizeSevpa. Operand 259 states. [2018-06-22 10:50:53,467 INFO ]: Finished minimizeSevpa. Reduced states from 259 to 259. [2018-06-22 10:50:53,467 INFO ]: Start removeUnreachable. Operand 259 states. [2018-06-22 10:50:53,469 INFO ]: Finished removeUnreachable. Reduced from 259 states to 259 states and 276 transitions. [2018-06-22 10:50:53,469 INFO ]: Start accepts. Automaton has 259 states and 276 transitions. Word has length 169 [2018-06-22 10:50:53,470 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:50:53,470 INFO ]: Abstraction has 259 states and 276 transitions. [2018-06-22 10:50:53,470 INFO ]: Interpolant automaton has 37 states. [2018-06-22 10:50:53,470 INFO ]: Start isEmpty. Operand 259 states and 276 transitions. [2018-06-22 10:50:53,472 INFO ]: Finished isEmpty. Found accepting run of length 170 [2018-06-22 10:50:53,472 INFO ]: Found error trace [2018-06-22 10:50:53,472 INFO ]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:53,472 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:50:53,472 INFO ]: Analyzing trace with hash 1707789237, now seen corresponding path program 2 times [2018-06-22 10:50:53,472 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:50:53,472 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:50:53,473 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:53,473 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:50:53,473 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:53,495 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:54,752 INFO ]: Checked inductivity of 196 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-06-22 10:50:54,752 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:50:54,752 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:50:54,757 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:50:54,889 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:50:54,889 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:54,898 INFO ]: Computing forward predicates... [2018-06-22 10:50:54,956 INFO ]: Checked inductivity of 196 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-06-22 10:50:54,988 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:50:54,988 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-06-22 10:50:54,989 INFO ]: Interpolant automaton has 37 states [2018-06-22 10:50:54,989 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-22 10:50:54,989 INFO ]: CoverageRelationStatistics Valid=121, Invalid=1211, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 10:50:54,989 INFO ]: Start difference. First operand 259 states and 276 transitions. Second operand 37 states. [2018-06-22 10:50:55,447 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:50:55,447 INFO ]: Finished difference Result 247 states and 263 transitions. [2018-06-22 10:50:55,448 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-22 10:50:55,448 INFO ]: Start accepts. Automaton has 37 states. Word has length 169 [2018-06-22 10:50:55,448 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:50:55,449 INFO ]: With dead ends: 247 [2018-06-22 10:50:55,449 INFO ]: Without dead ends: 247 [2018-06-22 10:50:55,449 INFO ]: 0 DeclaredPredicates, 212 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=149, Invalid=1491, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 10:50:55,450 INFO ]: Start minimizeSevpa. Operand 247 states. [2018-06-22 10:50:55,460 INFO ]: Finished minimizeSevpa. Reduced states from 247 to 247. [2018-06-22 10:50:55,460 INFO ]: Start removeUnreachable. Operand 247 states. [2018-06-22 10:50:55,461 INFO ]: Finished removeUnreachable. Reduced from 247 states to 247 states and 259 transitions. [2018-06-22 10:50:55,461 INFO ]: Start accepts. Automaton has 247 states and 259 transitions. Word has length 169 [2018-06-22 10:50:55,461 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:50:55,461 INFO ]: Abstraction has 247 states and 259 transitions. [2018-06-22 10:50:55,461 INFO ]: Interpolant automaton has 37 states. [2018-06-22 10:50:55,462 INFO ]: Start isEmpty. Operand 247 states and 259 transitions. [2018-06-22 10:50:55,463 INFO ]: Finished isEmpty. Found accepting run of length 198 [2018-06-22 10:50:55,463 INFO ]: Found error trace [2018-06-22 10:50:55,464 INFO ]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:55,464 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:50:55,464 INFO ]: Analyzing trace with hash -1998785464, now seen corresponding path program 5 times [2018-06-22 10:50:55,464 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:50:55,464 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:50:55,464 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:55,464 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:50:55,465 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:55,486 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:56,163 INFO ]: Checked inductivity of 315 backedges. 0 proven. 160 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-06-22 10:50:56,163 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:50:56,163 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 10:50:56,169 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 10:50:56,285 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 10:50:56,285 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:56,293 INFO ]: Computing forward predicates... [2018-06-22 10:50:56,364 INFO ]: Checked inductivity of 315 backedges. 0 proven. 160 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-06-22 10:50:56,397 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:50:56,397 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-06-22 10:50:56,397 INFO ]: Interpolant automaton has 44 states [2018-06-22 10:50:56,397 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-22 10:50:56,398 INFO ]: CoverageRelationStatistics Valid=165, Invalid=1727, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 10:50:56,398 INFO ]: Start difference. First operand 247 states and 259 transitions. Second operand 44 states. [2018-06-22 10:50:57,525 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:50:57,525 INFO ]: Finished difference Result 261 states and 277 transitions. [2018-06-22 10:50:57,526 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-06-22 10:50:57,526 INFO ]: Start accepts. Automaton has 44 states. Word has length 197 [2018-06-22 10:50:57,526 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:50:57,527 INFO ]: With dead ends: 261 [2018-06-22 10:50:57,527 INFO ]: Without dead ends: 261 [2018-06-22 10:50:57,527 INFO ]: 0 DeclaredPredicates, 249 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=205, Invalid=2147, Unknown=0, NotChecked=0, Total=2352 [2018-06-22 10:50:57,527 INFO ]: Start minimizeSevpa. Operand 261 states. [2018-06-22 10:50:57,537 INFO ]: Finished minimizeSevpa. Reduced states from 261 to 261. [2018-06-22 10:50:57,537 INFO ]: Start removeUnreachable. Operand 261 states. [2018-06-22 10:50:57,538 INFO ]: Finished removeUnreachable. Reduced from 261 states to 261 states and 273 transitions. [2018-06-22 10:50:57,538 INFO ]: Start accepts. Automaton has 261 states and 273 transitions. Word has length 197 [2018-06-22 10:50:57,538 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:50:57,538 INFO ]: Abstraction has 261 states and 273 transitions. [2018-06-22 10:50:57,538 INFO ]: Interpolant automaton has 44 states. [2018-06-22 10:50:57,539 INFO ]: Start isEmpty. Operand 261 states and 273 transitions. [2018-06-22 10:50:57,540 INFO ]: Finished isEmpty. Found accepting run of length 198 [2018-06-22 10:50:57,540 INFO ]: Found error trace [2018-06-22 10:50:57,540 INFO ]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:57,540 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:50:57,540 INFO ]: Analyzing trace with hash 1722271958, now seen corresponding path program 5 times [2018-06-22 10:50:57,540 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:50:57,540 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:50:57,541 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:57,541 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:50:57,541 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:57,563 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:59,136 INFO ]: Checked inductivity of 315 backedges. 0 proven. 160 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-06-22 10:50:59,137 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:50:59,137 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 10:50:59,146 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 10:50:59,262 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 10:50:59,262 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:50:59,269 INFO ]: Computing forward predicates... [2018-06-22 10:50:59,339 INFO ]: Checked inductivity of 315 backedges. 0 proven. 160 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-06-22 10:50:59,371 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:50:59,372 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-06-22 10:50:59,372 INFO ]: Interpolant automaton has 44 states [2018-06-22 10:50:59,372 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-22 10:50:59,373 INFO ]: CoverageRelationStatistics Valid=165, Invalid=1727, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 10:50:59,373 INFO ]: Start difference. First operand 261 states and 273 transitions. Second operand 44 states. [2018-06-22 10:50:59,759 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:50:59,759 INFO ]: Finished difference Result 275 states and 287 transitions. [2018-06-22 10:50:59,759 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-06-22 10:50:59,760 INFO ]: Start accepts. Automaton has 44 states. Word has length 197 [2018-06-22 10:50:59,760 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:50:59,762 INFO ]: With dead ends: 275 [2018-06-22 10:50:59,762 INFO ]: Without dead ends: 275 [2018-06-22 10:50:59,762 INFO ]: 0 DeclaredPredicates, 249 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=205, Invalid=2147, Unknown=0, NotChecked=0, Total=2352 [2018-06-22 10:50:59,763 INFO ]: Start minimizeSevpa. Operand 275 states. [2018-06-22 10:50:59,773 INFO ]: Finished minimizeSevpa. Reduced states from 275 to 275. [2018-06-22 10:50:59,773 INFO ]: Start removeUnreachable. Operand 275 states. [2018-06-22 10:50:59,774 INFO ]: Finished removeUnreachable. Reduced from 275 states to 275 states and 287 transitions. [2018-06-22 10:50:59,774 INFO ]: Start accepts. Automaton has 275 states and 287 transitions. Word has length 197 [2018-06-22 10:50:59,775 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:50:59,775 INFO ]: Abstraction has 275 states and 287 transitions. [2018-06-22 10:50:59,775 INFO ]: Interpolant automaton has 44 states. [2018-06-22 10:50:59,775 INFO ]: Start isEmpty. Operand 275 states and 287 transitions. [2018-06-22 10:50:59,777 INFO ]: Finished isEmpty. Found accepting run of length 226 [2018-06-22 10:50:59,777 INFO ]: Found error trace [2018-06-22 10:50:59,777 INFO ]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:59,777 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:50:59,777 INFO ]: Analyzing trace with hash 1323296099, now seen corresponding path program 6 times [2018-06-22 10:50:59,777 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:50:59,777 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:50:59,778 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:59,778 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:50:59,778 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:50:59,803 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:01,481 INFO ]: Checked inductivity of 462 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2018-06-22 10:51:01,481 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:51:01,481 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 10:51:01,486 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 10:51:01,642 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 10:51:01,642 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:01,649 INFO ]: Computing forward predicates... [2018-06-22 10:51:03,655 INFO ]: Checked inductivity of 462 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2018-06-22 10:51:03,676 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:51:03,676 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 57] total 106 [2018-06-22 10:51:03,676 INFO ]: Interpolant automaton has 106 states [2018-06-22 10:51:03,676 INFO ]: Constructing interpolant automaton starting with 106 interpolants. [2018-06-22 10:51:03,678 INFO ]: CoverageRelationStatistics Valid=443, Invalid=10687, Unknown=0, NotChecked=0, Total=11130 [2018-06-22 10:51:03,678 INFO ]: Start difference. First operand 275 states and 287 transitions. Second operand 106 states. [2018-06-22 10:51:06,041 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:06,042 INFO ]: Finished difference Result 289 states and 301 transitions. [2018-06-22 10:51:06,044 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-06-22 10:51:06,044 INFO ]: Start accepts. Automaton has 106 states. Word has length 225 [2018-06-22 10:51:06,044 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:06,046 INFO ]: With dead ends: 289 [2018-06-22 10:51:06,046 INFO ]: Without dead ends: 289 [2018-06-22 10:51:06,048 INFO ]: 0 DeclaredPredicates, 327 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4510 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=994, Invalid=22262, Unknown=0, NotChecked=0, Total=23256 [2018-06-22 10:51:06,048 INFO ]: Start minimizeSevpa. Operand 289 states. [2018-06-22 10:51:06,058 INFO ]: Finished minimizeSevpa. Reduced states from 289 to 289. [2018-06-22 10:51:06,058 INFO ]: Start removeUnreachable. Operand 289 states. [2018-06-22 10:51:06,059 INFO ]: Finished removeUnreachable. Reduced from 289 states to 289 states and 301 transitions. [2018-06-22 10:51:06,059 INFO ]: Start accepts. Automaton has 289 states and 301 transitions. Word has length 225 [2018-06-22 10:51:06,060 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:06,060 INFO ]: Abstraction has 289 states and 301 transitions. [2018-06-22 10:51:06,060 INFO ]: Interpolant automaton has 106 states. [2018-06-22 10:51:06,060 INFO ]: Start isEmpty. Operand 289 states and 301 transitions. [2018-06-22 10:51:06,061 INFO ]: Finished isEmpty. Found accepting run of length 226 [2018-06-22 10:51:06,061 INFO ]: Found error trace [2018-06-22 10:51:06,062 INFO ]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:51:06,062 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:06,062 INFO ]: Analyzing trace with hash -2062597672, now seen corresponding path program 6 times [2018-06-22 10:51:06,062 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:06,062 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:06,062 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:06,062 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:51:06,062 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:06,093 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:08,117 INFO ]: Checked inductivity of 462 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2018-06-22 10:51:08,117 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:51:08,117 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 10:51:08,122 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 10:51:08,261 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 10:51:08,261 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:08,270 INFO ]: Computing forward predicates... [2018-06-22 10:51:10,341 INFO ]: Checked inductivity of 462 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2018-06-22 10:51:10,363 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:51:10,364 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 57] total 106 [2018-06-22 10:51:10,364 INFO ]: Interpolant automaton has 106 states [2018-06-22 10:51:10,364 INFO ]: Constructing interpolant automaton starting with 106 interpolants. [2018-06-22 10:51:10,365 INFO ]: CoverageRelationStatistics Valid=443, Invalid=10687, Unknown=0, NotChecked=0, Total=11130 [2018-06-22 10:51:10,365 INFO ]: Start difference. First operand 289 states and 301 transitions. Second operand 106 states. [2018-06-22 10:51:13,116 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:13,116 INFO ]: Finished difference Result 303 states and 319 transitions. [2018-06-22 10:51:13,116 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-06-22 10:51:13,116 INFO ]: Start accepts. Automaton has 106 states. Word has length 225 [2018-06-22 10:51:13,117 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:13,118 INFO ]: With dead ends: 303 [2018-06-22 10:51:13,118 INFO ]: Without dead ends: 303 [2018-06-22 10:51:13,120 INFO ]: 0 DeclaredPredicates, 327 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4510 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=994, Invalid=22262, Unknown=0, NotChecked=0, Total=23256 [2018-06-22 10:51:13,120 INFO ]: Start minimizeSevpa. Operand 303 states. [2018-06-22 10:51:13,131 INFO ]: Finished minimizeSevpa. Reduced states from 303 to 303. [2018-06-22 10:51:13,131 INFO ]: Start removeUnreachable. Operand 303 states. [2018-06-22 10:51:13,132 INFO ]: Finished removeUnreachable. Reduced from 303 states to 303 states and 315 transitions. [2018-06-22 10:51:13,132 INFO ]: Start accepts. Automaton has 303 states and 315 transitions. Word has length 225 [2018-06-22 10:51:13,133 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:13,133 INFO ]: Abstraction has 303 states and 315 transitions. [2018-06-22 10:51:13,133 INFO ]: Interpolant automaton has 106 states. [2018-06-22 10:51:13,133 INFO ]: Start isEmpty. Operand 303 states and 315 transitions. [2018-06-22 10:51:13,134 INFO ]: Finished isEmpty. Found accepting run of length 254 [2018-06-22 10:51:13,134 INFO ]: Found error trace [2018-06-22 10:51:13,135 INFO ]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:51:13,135 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:13,135 INFO ]: Analyzing trace with hash -1557689624, now seen corresponding path program 7 times [2018-06-22 10:51:13,135 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:13,135 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:13,135 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:13,135 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:51:13,135 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:13,163 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:14,279 INFO ]: Checked inductivity of 637 backedges. 0 proven. 322 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-06-22 10:51:14,280 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:51:14,280 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 10:51:14,285 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:14,418 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:14,427 INFO ]: Computing forward predicates... [2018-06-22 10:51:14,553 INFO ]: Checked inductivity of 637 backedges. 0 proven. 322 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-06-22 10:51:14,586 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:51:14,586 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2018-06-22 10:51:14,587 INFO ]: Interpolant automaton has 58 states [2018-06-22 10:51:14,587 INFO ]: Constructing interpolant automaton starting with 58 interpolants. [2018-06-22 10:51:14,587 INFO ]: CoverageRelationStatistics Valid=274, Invalid=3032, Unknown=0, NotChecked=0, Total=3306 [2018-06-22 10:51:14,587 INFO ]: Start difference. First operand 303 states and 315 transitions. Second operand 58 states. [2018-06-22 10:51:15,127 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:15,127 INFO ]: Finished difference Result 317 states and 333 transitions. [2018-06-22 10:51:15,127 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-06-22 10:51:15,127 INFO ]: Start accepts. Automaton has 58 states. Word has length 253 [2018-06-22 10:51:15,128 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:15,129 INFO ]: With dead ends: 317 [2018-06-22 10:51:15,129 INFO ]: Without dead ends: 317 [2018-06-22 10:51:15,129 INFO ]: 0 DeclaredPredicates, 323 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=344, Invalid=3816, Unknown=0, NotChecked=0, Total=4160 [2018-06-22 10:51:15,129 INFO ]: Start minimizeSevpa. Operand 317 states. [2018-06-22 10:51:15,140 INFO ]: Finished minimizeSevpa. Reduced states from 317 to 317. [2018-06-22 10:51:15,140 INFO ]: Start removeUnreachable. Operand 317 states. [2018-06-22 10:51:15,142 INFO ]: Finished removeUnreachable. Reduced from 317 states to 317 states and 329 transitions. [2018-06-22 10:51:15,142 INFO ]: Start accepts. Automaton has 317 states and 329 transitions. Word has length 253 [2018-06-22 10:51:15,142 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:15,142 INFO ]: Abstraction has 317 states and 329 transitions. [2018-06-22 10:51:15,142 INFO ]: Interpolant automaton has 58 states. [2018-06-22 10:51:15,142 INFO ]: Start isEmpty. Operand 317 states and 329 transitions. [2018-06-22 10:51:15,144 INFO ]: Finished isEmpty. Found accepting run of length 254 [2018-06-22 10:51:15,144 INFO ]: Found error trace [2018-06-22 10:51:15,145 INFO ]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:51:15,145 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:15,145 INFO ]: Analyzing trace with hash 726877104, now seen corresponding path program 7 times [2018-06-22 10:51:15,145 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:15,145 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:15,145 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:15,145 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:15,145 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:15,175 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:16,168 INFO ]: Checked inductivity of 637 backedges. 0 proven. 322 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-06-22 10:51:16,168 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:51:16,168 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 10:51:16,173 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:16,326 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:16,337 INFO ]: Computing forward predicates... [2018-06-22 10:51:16,450 INFO ]: Checked inductivity of 637 backedges. 0 proven. 322 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-06-22 10:51:16,482 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:51:16,482 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2018-06-22 10:51:16,483 INFO ]: Interpolant automaton has 58 states [2018-06-22 10:51:16,483 INFO ]: Constructing interpolant automaton starting with 58 interpolants. [2018-06-22 10:51:16,483 INFO ]: CoverageRelationStatistics Valid=274, Invalid=3032, Unknown=0, NotChecked=0, Total=3306 [2018-06-22 10:51:16,483 INFO ]: Start difference. First operand 317 states and 329 transitions. Second operand 58 states. [2018-06-22 10:51:17,528 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:17,528 INFO ]: Finished difference Result 331 states and 343 transitions. [2018-06-22 10:51:17,528 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-06-22 10:51:17,528 INFO ]: Start accepts. Automaton has 58 states. Word has length 253 [2018-06-22 10:51:17,529 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:17,530 INFO ]: With dead ends: 331 [2018-06-22 10:51:17,530 INFO ]: Without dead ends: 331 [2018-06-22 10:51:17,531 INFO ]: 0 DeclaredPredicates, 323 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=344, Invalid=3816, Unknown=0, NotChecked=0, Total=4160 [2018-06-22 10:51:17,531 INFO ]: Start minimizeSevpa. Operand 331 states. [2018-06-22 10:51:17,546 INFO ]: Finished minimizeSevpa. Reduced states from 331 to 331. [2018-06-22 10:51:17,546 INFO ]: Start removeUnreachable. Operand 331 states. [2018-06-22 10:51:17,547 INFO ]: Finished removeUnreachable. Reduced from 331 states to 331 states and 343 transitions. [2018-06-22 10:51:17,548 INFO ]: Start accepts. Automaton has 331 states and 343 transitions. Word has length 253 [2018-06-22 10:51:17,548 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:17,548 INFO ]: Abstraction has 331 states and 343 transitions. [2018-06-22 10:51:17,548 INFO ]: Interpolant automaton has 58 states. [2018-06-22 10:51:17,548 INFO ]: Start isEmpty. Operand 331 states and 343 transitions. [2018-06-22 10:51:17,550 INFO ]: Finished isEmpty. Found accepting run of length 282 [2018-06-22 10:51:17,550 INFO ]: Found error trace [2018-06-22 10:51:17,550 INFO ]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:51:17,551 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:17,551 INFO ]: Analyzing trace with hash 269226941, now seen corresponding path program 8 times [2018-06-22 10:51:17,551 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:17,551 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:17,551 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:17,551 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:17,551 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:17,588 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:19,334 INFO ]: Checked inductivity of 840 backedges. 0 proven. 424 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2018-06-22 10:51:19,334 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:51:19,334 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 10:51:19,340 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:51:19,513 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:51:19,513 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:19,522 INFO ]: Computing forward predicates... [2018-06-22 10:51:19,620 INFO ]: Checked inductivity of 840 backedges. 0 proven. 424 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2018-06-22 10:51:19,652 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:51:19,653 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2018-06-22 10:51:19,653 INFO ]: Interpolant automaton has 71 states [2018-06-22 10:51:19,653 INFO ]: Constructing interpolant automaton starting with 71 interpolants. [2018-06-22 10:51:19,653 INFO ]: CoverageRelationStatistics Valid=351, Invalid=4619, Unknown=0, NotChecked=0, Total=4970 [2018-06-22 10:51:19,653 INFO ]: Start difference. First operand 331 states and 343 transitions. Second operand 71 states. [2018-06-22 10:51:20,571 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:20,571 INFO ]: Finished difference Result 357 states and 370 transitions. [2018-06-22 10:51:20,571 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-06-22 10:51:20,571 INFO ]: Start accepts. Automaton has 71 states. Word has length 281 [2018-06-22 10:51:20,572 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:20,573 INFO ]: With dead ends: 357 [2018-06-22 10:51:20,573 INFO ]: Without dead ends: 357 [2018-06-22 10:51:20,573 INFO ]: 0 DeclaredPredicates, 366 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1448 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=439, Invalid=5723, Unknown=0, NotChecked=0, Total=6162 [2018-06-22 10:51:20,574 INFO ]: Start minimizeSevpa. Operand 357 states. [2018-06-22 10:51:20,585 INFO ]: Finished minimizeSevpa. Reduced states from 357 to 357. [2018-06-22 10:51:20,586 INFO ]: Start removeUnreachable. Operand 357 states. [2018-06-22 10:51:20,587 INFO ]: Finished removeUnreachable. Reduced from 357 states to 357 states and 370 transitions. [2018-06-22 10:51:20,587 INFO ]: Start accepts. Automaton has 357 states and 370 transitions. Word has length 281 [2018-06-22 10:51:20,588 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:20,588 INFO ]: Abstraction has 357 states and 370 transitions. [2018-06-22 10:51:20,588 INFO ]: Interpolant automaton has 71 states. [2018-06-22 10:51:20,588 INFO ]: Start isEmpty. Operand 357 states and 370 transitions. [2018-06-22 10:51:20,590 INFO ]: Finished isEmpty. Found accepting run of length 282 [2018-06-22 10:51:20,590 INFO ]: Found error trace [2018-06-22 10:51:20,590 INFO ]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:51:20,590 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:20,591 INFO ]: Analyzing trace with hash 212955000, now seen corresponding path program 8 times [2018-06-22 10:51:20,591 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:20,591 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:20,591 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:20,591 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:51:20,591 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:20,623 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-22 10:51:20,744 WARN ]: Removed 1 from assertion stack [2018-06-22 10:51:20,744 WARN ]: Verification canceled [2018-06-22 10:51:20,893 WARN ]: Timeout [2018-06-22 10:51:20,893 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:51:20 BoogieIcfgContainer [2018-06-22 10:51:20,893 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 10:51:20,895 INFO ]: Toolchain (without parser) took 54755.55 ms. Allocated memory was 307.2 MB in the beginning and 1.0 GB in the end (delta: 705.2 MB). Free memory was 249.8 MB in the beginning and 973.3 MB in the end (delta: -723.5 MB). Peak memory consumption was 382.2 MB. Max. memory is 3.6 GB. [2018-06-22 10:51:20,896 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 307.2 MB. Free memory is still 272.9 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 10:51:20,896 INFO ]: ChcToBoogie took 64.97 ms. Allocated memory is still 307.2 MB. Free memory was 249.8 MB in the beginning and 247.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. [2018-06-22 10:51:20,896 INFO ]: Boogie Preprocessor took 58.93 ms. Allocated memory is still 307.2 MB. Free memory was 247.7 MB in the beginning and 245.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 10:51:20,897 INFO ]: RCFGBuilder took 543.10 ms. Allocated memory is still 307.2 MB. Free memory was 245.7 MB in the beginning and 224.5 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 3.6 GB. [2018-06-22 10:51:20,897 INFO ]: TraceAbstraction took 54073.87 ms. Allocated memory was 307.2 MB in the beginning and 1.0 GB in the end (delta: 705.2 MB). Free memory was 224.5 MB in the beginning and 973.3 MB in the end (delta: -748.8 MB). Peak memory consumption was 356.9 MB. Max. memory is 3.6 GB. [2018-06-22 10:51:20,902 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 307.2 MB. Free memory is still 272.9 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 64.97 ms. Allocated memory is still 307.2 MB. Free memory was 249.8 MB in the beginning and 247.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 58.93 ms. Allocated memory is still 307.2 MB. Free memory was 247.7 MB in the beginning and 245.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 543.10 ms. Allocated memory is still 307.2 MB. Free memory was 245.7 MB in the beginning and 224.5 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 3.6 GB. * TraceAbstraction took 54073.87 ms. Allocated memory was 307.2 MB in the beginning and 1.0 GB in the end (delta: 705.2 MB). Free memory was 224.5 MB in the beginning and 973.3 MB in the end (delta: -748.8 MB). Peak memory consumption was 356.9 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was analyzing trace of length 282 with TraceHistMax 9, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - StatisticsResult: Ultimate Automizer benchmark data CFG has 24 procedures, 101 locations, 1 error locations. TIMEOUT Result, 54.0s OverallTime, 27 OverallIterations, 9 TraceHistogramMax, 19.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2492 SDtfs, 129 SDslu, 75748 SDs, 0 SdLazy, 13895 SolverSat, 68 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4324 GetRequests, 3099 SyntacticMatches, 25 SemanticMatches, 1200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16992 ImplicationChecksByTransitivity, 33.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=357occurred in iteration=26, 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.3s AutomataMinimizationTime, 26 MinimizatonAttempts, 25 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 29.5s InterpolantComputationTime, 7085 NumberOfCodeBlocks, 7085 NumberOfCodeBlocksAsserted, 80 NumberOfCheckSat, 7040 ConstructedInterpolants, 0 QuantifiedInterpolants, 2471152 SizeOfPredicates, 95 NumberOfNonLiveVariables, 20026 ConjunctsInSsa, 795 ConjunctsInUnsatCore, 45 InterpolantComputations, 7 PerfectInterpolantSequences, 4922/9842 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/18.c.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_10-51-20-913.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/18.c.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_10-51-20-913.csv Completed graceful shutdown