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/22.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 10:52:02,563 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 10:52:02,565 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 10:52:02,579 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 10:52:02,579 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 10:52:02,582 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 10:52:02,583 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 10:52:02,585 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 10:52:02,587 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 10:52:02,588 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 10:52:02,590 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 10:52:02,590 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 10:52:02,591 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 10:52:02,592 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 10:52:02,592 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 10:52:02,597 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 10:52:02,598 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 10:52:02,600 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 10:52:02,602 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 10:52:02,603 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 10:52:02,604 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 10:52:02,606 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 10:52:02,606 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 10:52:02,606 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 10:52:02,607 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 10:52:02,608 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 10:52:02,609 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 10:52:02,609 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 10:52:02,610 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 10:52:02,611 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 10:52:02,611 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 10:52:02,612 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 10:52:02,612 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 10:52:02,613 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 10:52:02,613 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 10:52:02,614 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:52:02,627 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 10:52:02,627 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 10:52:02,627 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 10:52:02,628 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 10:52:02,629 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 10:52:02,629 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 10:52:02,629 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 10:52:02,629 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 10:52:02,629 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 10:52:02,629 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 10:52:02,630 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:52:02,630 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 10:52:02,630 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 10:52:02,630 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 10:52:02,630 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 10:52:02,631 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 10:52:02,631 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 10:52:02,631 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 10:52:02,631 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 10:52:02,632 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 10:52:02,633 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 10:52:02,677 INFO ]: Repository-Root is: /tmp [2018-06-22 10:52:02,692 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 10:52:02,697 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 10:52:02,698 INFO ]: Initializing SmtParser... [2018-06-22 10:52:02,698 INFO ]: SmtParser initialized [2018-06-22 10:52:02,700 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/22.c.smt2 [2018-06-22 10:52:02,701 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:52:02,791 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/22.c.smt2 unknown [2018-06-22 10:52:03,275 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/22.c.smt2 [2018-06-22 10:52:03,279 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 10:52:03,286 INFO ]: Walking toolchain with 4 elements. [2018-06-22 10:52:03,286 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 10:52:03,286 INFO ]: Initializing ChcToBoogie... [2018-06-22 10:52:03,286 INFO ]: ChcToBoogie initialized [2018-06-22 10:52:03,297 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:52:03" (1/1) ... [2018-06-22 10:52:03,348 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:52:03 Unit [2018-06-22 10:52:03,348 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 10:52:03,348 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 10:52:03,348 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 10:52:03,348 INFO ]: Boogie Preprocessor initialized [2018-06-22 10:52:03,367 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:52:03" (1/1) ... [2018-06-22 10:52:03,368 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:52:03" (1/1) ... [2018-06-22 10:52:03,386 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:52:03" (1/1) ... [2018-06-22 10:52:03,386 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:52:03" (1/1) ... [2018-06-22 10:52:03,393 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:52:03" (1/1) ... [2018-06-22 10:52:03,402 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:52:03" (1/1) ... [2018-06-22 10:52:03,404 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:52:03" (1/1) ... [2018-06-22 10:52:03,409 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 10:52:03,409 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 10:52:03,409 INFO ]: Initializing RCFGBuilder... [2018-06-22 10:52:03,409 INFO ]: RCFGBuilder initialized [2018-06-22 10:52:03,418 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:52:03" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:52:03,426 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 10:52:03,426 INFO ]: Found specification of procedure False [2018-06-22 10:52:03,426 INFO ]: Found implementation of procedure False [2018-06-22 10:52:03,426 INFO ]: Specification and implementation of procedure h21 given in one single declaration [2018-06-22 10:52:03,426 INFO ]: Found specification of procedure h21 [2018-06-22 10:52:03,426 INFO ]: Found implementation of procedure h21 [2018-06-22 10:52:03,426 INFO ]: Specification and implementation of procedure h20 given in one single declaration [2018-06-22 10:52:03,426 INFO ]: Found specification of procedure h20 [2018-06-22 10:52:03,426 INFO ]: Found implementation of procedure h20 [2018-06-22 10:52:03,426 INFO ]: Specification and implementation of procedure h14 given in one single declaration [2018-06-22 10:52:03,426 INFO ]: Found specification of procedure h14 [2018-06-22 10:52:03,426 INFO ]: Found implementation of procedure h14 [2018-06-22 10:52:03,426 INFO ]: Specification and implementation of procedure h13 given in one single declaration [2018-06-22 10:52:03,426 INFO ]: Found specification of procedure h13 [2018-06-22 10:52:03,426 INFO ]: Found implementation of procedure h13 [2018-06-22 10:52:03,426 INFO ]: Specification and implementation of procedure h12 given in one single declaration [2018-06-22 10:52:03,426 INFO ]: Found specification of procedure h12 [2018-06-22 10:52:03,426 INFO ]: Found implementation of procedure h12 [2018-06-22 10:52:03,427 INFO ]: Specification and implementation of procedure h8 given in one single declaration [2018-06-22 10:52:03,427 INFO ]: Found specification of procedure h8 [2018-06-22 10:52:03,427 INFO ]: Found implementation of procedure h8 [2018-06-22 10:52:03,427 INFO ]: Specification and implementation of procedure h7 given in one single declaration [2018-06-22 10:52:03,427 INFO ]: Found specification of procedure h7 [2018-06-22 10:52:03,427 INFO ]: Found implementation of procedure h7 [2018-06-22 10:52:03,427 INFO ]: Specification and implementation of procedure h6 given in one single declaration [2018-06-22 10:52:03,427 INFO ]: Found specification of procedure h6 [2018-06-22 10:52:03,427 INFO ]: Found implementation of procedure h6 [2018-06-22 10:52:03,427 INFO ]: Specification and implementation of procedure h5 given in one single declaration [2018-06-22 10:52:03,427 INFO ]: Found specification of procedure h5 [2018-06-22 10:52:03,427 INFO ]: Found implementation of procedure h5 [2018-06-22 10:52:03,427 INFO ]: Specification and implementation of procedure h18 given in one single declaration [2018-06-22 10:52:03,427 INFO ]: Found specification of procedure h18 [2018-06-22 10:52:03,427 INFO ]: Found implementation of procedure h18 [2018-06-22 10:52:03,427 INFO ]: Specification and implementation of procedure h16 given in one single declaration [2018-06-22 10:52:03,427 INFO ]: Found specification of procedure h16 [2018-06-22 10:52:03,427 INFO ]: Found implementation of procedure h16 [2018-06-22 10:52:03,427 INFO ]: Specification and implementation of procedure h15 given in one single declaration [2018-06-22 10:52:03,427 INFO ]: Found specification of procedure h15 [2018-06-22 10:52:03,427 INFO ]: Found implementation of procedure h15 [2018-06-22 10:52:03,427 INFO ]: Specification and implementation of procedure h10 given in one single declaration [2018-06-22 10:52:03,427 INFO ]: Found specification of procedure h10 [2018-06-22 10:52:03,427 INFO ]: Found implementation of procedure h10 [2018-06-22 10:52:03,427 INFO ]: Specification and implementation of procedure h9 given in one single declaration [2018-06-22 10:52:03,427 INFO ]: Found specification of procedure h9 [2018-06-22 10:52:03,427 INFO ]: Found implementation of procedure h9 [2018-06-22 10:52:03,427 INFO ]: Specification and implementation of procedure h11 given in one single declaration [2018-06-22 10:52:03,428 INFO ]: Found specification of procedure h11 [2018-06-22 10:52:03,428 INFO ]: Found implementation of procedure h11 [2018-06-22 10:52:03,428 INFO ]: Specification and implementation of procedure h19 given in one single declaration [2018-06-22 10:52:03,428 INFO ]: Found specification of procedure h19 [2018-06-22 10:52:03,428 INFO ]: Found implementation of procedure h19 [2018-06-22 10:52:03,428 INFO ]: Specification and implementation of procedure h17 given in one single declaration [2018-06-22 10:52:03,428 INFO ]: Found specification of procedure h17 [2018-06-22 10:52:03,428 INFO ]: Found implementation of procedure h17 [2018-06-22 10:52:03,428 INFO ]: Specification and implementation of procedure h4 given in one single declaration [2018-06-22 10:52:03,428 INFO ]: Found specification of procedure h4 [2018-06-22 10:52:03,428 INFO ]: Found implementation of procedure h4 [2018-06-22 10:52:03,428 INFO ]: Specification and implementation of procedure h3 given in one single declaration [2018-06-22 10:52:03,428 INFO ]: Found specification of procedure h3 [2018-06-22 10:52:03,428 INFO ]: Found implementation of procedure h3 [2018-06-22 10:52:03,428 INFO ]: Specification and implementation of procedure h2 given in one single declaration [2018-06-22 10:52:03,428 INFO ]: Found specification of procedure h2 [2018-06-22 10:52:03,428 INFO ]: Found implementation of procedure h2 [2018-06-22 10:52:03,428 INFO ]: Specification and implementation of procedure h1 given in one single declaration [2018-06-22 10:52:03,428 INFO ]: Found specification of procedure h1 [2018-06-22 10:52:03,428 INFO ]: Found implementation of procedure h1 [2018-06-22 10:52:03,428 INFO ]: Specification and implementation of procedure h25 given in one single declaration [2018-06-22 10:52:03,428 INFO ]: Found specification of procedure h25 [2018-06-22 10:52:03,428 INFO ]: Found implementation of procedure h25 [2018-06-22 10:52:03,428 INFO ]: Specification and implementation of procedure h24 given in one single declaration [2018-06-22 10:52:03,428 INFO ]: Found specification of procedure h24 [2018-06-22 10:52:03,428 INFO ]: Found implementation of procedure h24 [2018-06-22 10:52:03,428 INFO ]: Specification and implementation of procedure h23 given in one single declaration [2018-06-22 10:52:03,428 INFO ]: Found specification of procedure h23 [2018-06-22 10:52:03,428 INFO ]: Found implementation of procedure h23 [2018-06-22 10:52:03,428 INFO ]: Specification and implementation of procedure h26 given in one single declaration [2018-06-22 10:52:03,428 INFO ]: Found specification of procedure h26 [2018-06-22 10:52:03,428 INFO ]: Found implementation of procedure h26 [2018-06-22 10:52:03,428 INFO ]: Specification and implementation of procedure h22 given in one single declaration [2018-06-22 10:52:03,429 INFO ]: Found specification of procedure h22 [2018-06-22 10:52:03,429 INFO ]: Found implementation of procedure h22 [2018-06-22 10:52:03,429 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 10:52:03,429 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 10:52:03,429 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 10:52:04,000 INFO ]: Using library mode [2018-06-22 10:52:04,000 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:52:04 BoogieIcfgContainer [2018-06-22 10:52:04,001 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 10:52:04,002 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 10:52:04,002 INFO ]: Initializing TraceAbstraction... [2018-06-22 10:52:04,005 INFO ]: TraceAbstraction initialized [2018-06-22 10:52:04,006 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:52:03" (1/3) ... [2018-06-22 10:52:04,007 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b9856fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 10:52:04, skipping insertion in model container [2018-06-22 10:52:04,007 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:52:03" (2/3) ... [2018-06-22 10:52:04,007 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b9856fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:52:04, skipping insertion in model container [2018-06-22 10:52:04,007 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:52:04" (3/3) ... [2018-06-22 10:52:04,009 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 10:52:04,022 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 10:52:04,037 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 10:52:04,092 INFO ]: Using default assertion order modulation [2018-06-22 10:52:04,092 INFO ]: Interprodecural is true [2018-06-22 10:52:04,092 INFO ]: Hoare is false [2018-06-22 10:52:04,092 INFO ]: Compute interpolants for FPandBP [2018-06-22 10:52:04,092 INFO ]: Backedges is TWOTRACK [2018-06-22 10:52:04,092 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 10:52:04,092 INFO ]: Difference is false [2018-06-22 10:52:04,092 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 10:52:04,092 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 10:52:04,125 INFO ]: Start isEmpty. Operand 119 states. [2018-06-22 10:52:04,149 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 10:52:04,149 INFO ]: Found error trace [2018-06-22 10:52:04,150 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:52:04,150 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:52:04,156 INFO ]: Analyzing trace with hash -696343770, now seen corresponding path program 1 times [2018-06-22 10:52:04,157 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:52:04,158 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:52:04,193 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:04,193 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:52:04,193 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:04,282 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:52:05,074 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:52:05,077 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:52:05,077 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 10:52:05,079 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:52:05,095 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:52:05,096 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:52:05,100 INFO ]: Start difference. First operand 119 states. Second operand 14 states. [2018-06-22 10:52:05,938 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:52:05,938 INFO ]: Finished difference Result 133 states and 149 transitions. [2018-06-22 10:52:05,939 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:52:05,940 INFO ]: Start accepts. Automaton has 14 states. Word has length 57 [2018-06-22 10:52:05,941 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:52:05,953 INFO ]: With dead ends: 133 [2018-06-22 10:52:05,953 INFO ]: Without dead ends: 133 [2018-06-22 10:52:05,955 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:52:05,972 INFO ]: Start minimizeSevpa. Operand 133 states. [2018-06-22 10:52:06,008 INFO ]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-06-22 10:52:06,010 INFO ]: Start removeUnreachable. Operand 133 states. [2018-06-22 10:52:06,013 INFO ]: Finished removeUnreachable. Reduced from 133 states to 133 states and 149 transitions. [2018-06-22 10:52:06,014 INFO ]: Start accepts. Automaton has 133 states and 149 transitions. Word has length 57 [2018-06-22 10:52:06,015 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:52:06,015 INFO ]: Abstraction has 133 states and 149 transitions. [2018-06-22 10:52:06,015 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:52:06,015 INFO ]: Start isEmpty. Operand 133 states and 149 transitions. [2018-06-22 10:52:06,019 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 10:52:06,019 INFO ]: Found error trace [2018-06-22 10:52:06,019 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:52:06,019 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:52:06,019 INFO ]: Analyzing trace with hash -1985204173, now seen corresponding path program 1 times [2018-06-22 10:52:06,019 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:52:06,019 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:52:06,020 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:06,020 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:52:06,020 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:06,041 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:52:06,467 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:52:06,467 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:52:06,467 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 10:52:06,469 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:52:06,469 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:52:06,469 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:52:06,469 INFO ]: Start difference. First operand 133 states and 149 transitions. Second operand 14 states. [2018-06-22 10:52:06,781 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:52:06,781 INFO ]: Finished difference Result 133 states and 148 transitions. [2018-06-22 10:52:06,781 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:52:06,781 INFO ]: Start accepts. Automaton has 14 states. Word has length 57 [2018-06-22 10:52:06,781 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:52:06,784 INFO ]: With dead ends: 133 [2018-06-22 10:52:06,784 INFO ]: Without dead ends: 133 [2018-06-22 10:52:06,785 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:52:06,785 INFO ]: Start minimizeSevpa. Operand 133 states. [2018-06-22 10:52:06,800 INFO ]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-06-22 10:52:06,800 INFO ]: Start removeUnreachable. Operand 133 states. [2018-06-22 10:52:06,803 INFO ]: Finished removeUnreachable. Reduced from 133 states to 133 states and 148 transitions. [2018-06-22 10:52:06,803 INFO ]: Start accepts. Automaton has 133 states and 148 transitions. Word has length 57 [2018-06-22 10:52:06,804 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:52:06,804 INFO ]: Abstraction has 133 states and 148 transitions. [2018-06-22 10:52:06,804 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:52:06,804 INFO ]: Start isEmpty. Operand 133 states and 148 transitions. [2018-06-22 10:52:06,806 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-22 10:52:06,806 INFO ]: Found error trace [2018-06-22 10:52:06,807 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:52:06,807 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:52:06,807 INFO ]: Analyzing trace with hash 158369483, now seen corresponding path program 1 times [2018-06-22 10:52:06,807 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:52:06,807 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:52:06,808 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:06,808 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:52:06,808 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:06,833 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:52:07,200 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:52:07,200 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:52:07,200 INFO ]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-06-22 10:52:07,201 INFO ]: Interpolant automaton has 17 states [2018-06-22 10:52:07,201 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 10:52:07,201 INFO ]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-06-22 10:52:07,201 INFO ]: Start difference. First operand 133 states and 148 transitions. Second operand 17 states. [2018-06-22 10:52:07,576 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:52:07,576 INFO ]: Finished difference Result 137 states and 152 transitions. [2018-06-22 10:52:07,576 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 10:52:07,576 INFO ]: Start accepts. Automaton has 17 states. Word has length 65 [2018-06-22 10:52:07,577 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:52:07,579 INFO ]: With dead ends: 137 [2018-06-22 10:52:07,579 INFO ]: Without dead ends: 137 [2018-06-22 10:52:07,579 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-06-22 10:52:07,580 INFO ]: Start minimizeSevpa. Operand 137 states. [2018-06-22 10:52:07,593 INFO ]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-06-22 10:52:07,593 INFO ]: Start removeUnreachable. Operand 137 states. [2018-06-22 10:52:07,595 INFO ]: Finished removeUnreachable. Reduced from 137 states to 137 states and 152 transitions. [2018-06-22 10:52:07,596 INFO ]: Start accepts. Automaton has 137 states and 152 transitions. Word has length 65 [2018-06-22 10:52:07,596 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:52:07,596 INFO ]: Abstraction has 137 states and 152 transitions. [2018-06-22 10:52:07,596 INFO ]: Interpolant automaton has 17 states. [2018-06-22 10:52:07,596 INFO ]: Start isEmpty. Operand 137 states and 152 transitions. [2018-06-22 10:52:07,599 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-22 10:52:07,599 INFO ]: Found error trace [2018-06-22 10:52:07,599 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:52:07,599 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:52:07,600 INFO ]: Analyzing trace with hash 1073115888, now seen corresponding path program 1 times [2018-06-22 10:52:07,600 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:52:07,600 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:52:07,600 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:07,600 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:52:07,601 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:07,636 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:52:07,877 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:52:07,877 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:52:07,877 INFO ]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-06-22 10:52:07,878 INFO ]: Interpolant automaton has 17 states [2018-06-22 10:52:07,878 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 10:52:07,878 INFO ]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-06-22 10:52:07,878 INFO ]: Start difference. First operand 137 states and 152 transitions. Second operand 17 states. [2018-06-22 10:52:08,295 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:52:08,295 INFO ]: Finished difference Result 137 states and 151 transitions. [2018-06-22 10:52:08,296 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 10:52:08,296 INFO ]: Start accepts. Automaton has 17 states. Word has length 65 [2018-06-22 10:52:08,296 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:52:08,298 INFO ]: With dead ends: 137 [2018-06-22 10:52:08,298 INFO ]: Without dead ends: 125 [2018-06-22 10:52:08,299 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-06-22 10:52:08,299 INFO ]: Start minimizeSevpa. Operand 125 states. [2018-06-22 10:52:08,312 INFO ]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-06-22 10:52:08,312 INFO ]: Start removeUnreachable. Operand 125 states. [2018-06-22 10:52:08,313 INFO ]: Finished removeUnreachable. Reduced from 125 states to 125 states and 139 transitions. [2018-06-22 10:52:08,313 INFO ]: Start accepts. Automaton has 125 states and 139 transitions. Word has length 65 [2018-06-22 10:52:08,314 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:52:08,314 INFO ]: Abstraction has 125 states and 139 transitions. [2018-06-22 10:52:08,314 INFO ]: Interpolant automaton has 17 states. [2018-06-22 10:52:08,314 INFO ]: Start isEmpty. Operand 125 states and 139 transitions. [2018-06-22 10:52:08,316 INFO ]: Finished isEmpty. Found accepting run of length 90 [2018-06-22 10:52:08,316 INFO ]: Found error trace [2018-06-22 10:52:08,316 INFO ]: trace histogram [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] [2018-06-22 10:52:08,316 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:52:08,317 INFO ]: Analyzing trace with hash -1212968358, now seen corresponding path program 1 times [2018-06-22 10:52:08,317 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:52:08,317 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:52:08,317 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:08,317 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:52:08,317 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:08,332 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:52:08,478 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:52:08,478 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:52:08,478 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 10:52:08,479 INFO ]: Interpolant automaton has 11 states [2018-06-22 10:52:08,479 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 10:52:08,479 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 10:52:08,479 INFO ]: Start difference. First operand 125 states and 139 transitions. Second operand 11 states. [2018-06-22 10:52:08,748 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:52:08,748 INFO ]: Finished difference Result 166 states and 196 transitions. [2018-06-22 10:52:08,748 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 10:52:08,748 INFO ]: Start accepts. Automaton has 11 states. Word has length 89 [2018-06-22 10:52:08,749 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:52:08,751 INFO ]: With dead ends: 166 [2018-06-22 10:52:08,751 INFO ]: Without dead ends: 166 [2018-06-22 10:52:08,751 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 10:52:08,751 INFO ]: Start minimizeSevpa. Operand 166 states. [2018-06-22 10:52:08,765 INFO ]: Finished minimizeSevpa. Reduced states from 166 to 164. [2018-06-22 10:52:08,766 INFO ]: Start removeUnreachable. Operand 164 states. [2018-06-22 10:52:08,767 INFO ]: Finished removeUnreachable. Reduced from 164 states to 164 states and 193 transitions. [2018-06-22 10:52:08,767 INFO ]: Start accepts. Automaton has 164 states and 193 transitions. Word has length 89 [2018-06-22 10:52:08,768 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:52:08,768 INFO ]: Abstraction has 164 states and 193 transitions. [2018-06-22 10:52:08,768 INFO ]: Interpolant automaton has 11 states. [2018-06-22 10:52:08,768 INFO ]: Start isEmpty. Operand 164 states and 193 transitions. [2018-06-22 10:52:08,771 INFO ]: Finished isEmpty. Found accepting run of length 90 [2018-06-22 10:52:08,771 INFO ]: Found error trace [2018-06-22 10:52:08,771 INFO ]: trace histogram [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] [2018-06-22 10:52:08,771 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:52:08,771 INFO ]: Analyzing trace with hash -40870953, now seen corresponding path program 1 times [2018-06-22 10:52:08,771 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:52:08,771 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:52:08,772 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:08,772 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:52:08,772 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:08,787 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:52:08,971 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:52:08,971 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:52:08,971 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 10:52:08,972 INFO ]: Interpolant automaton has 11 states [2018-06-22 10:52:08,972 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 10:52:08,972 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 10:52:08,972 INFO ]: Start difference. First operand 164 states and 193 transitions. Second operand 11 states. [2018-06-22 10:52:09,146 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:52:09,146 INFO ]: Finished difference Result 196 states and 224 transitions. [2018-06-22 10:52:09,146 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 10:52:09,146 INFO ]: Start accepts. Automaton has 11 states. Word has length 89 [2018-06-22 10:52:09,147 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:52:09,148 INFO ]: With dead ends: 196 [2018-06-22 10:52:09,148 INFO ]: Without dead ends: 196 [2018-06-22 10:52:09,149 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 10:52:09,149 INFO ]: Start minimizeSevpa. Operand 196 states. [2018-06-22 10:52:09,161 INFO ]: Finished minimizeSevpa. Reduced states from 196 to 168. [2018-06-22 10:52:09,161 INFO ]: Start removeUnreachable. Operand 168 states. [2018-06-22 10:52:09,163 INFO ]: Finished removeUnreachable. Reduced from 168 states to 168 states and 195 transitions. [2018-06-22 10:52:09,163 INFO ]: Start accepts. Automaton has 168 states and 195 transitions. Word has length 89 [2018-06-22 10:52:09,163 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:52:09,163 INFO ]: Abstraction has 168 states and 195 transitions. [2018-06-22 10:52:09,163 INFO ]: Interpolant automaton has 11 states. [2018-06-22 10:52:09,163 INFO ]: Start isEmpty. Operand 168 states and 195 transitions. [2018-06-22 10:52:09,165 INFO ]: Finished isEmpty. Found accepting run of length 90 [2018-06-22 10:52:09,165 INFO ]: Found error trace [2018-06-22 10:52:09,165 INFO ]: trace histogram [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] [2018-06-22 10:52:09,165 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:52:09,166 INFO ]: Analyzing trace with hash -291857279, now seen corresponding path program 1 times [2018-06-22 10:52:09,166 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:52:09,166 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:52:09,166 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:09,166 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:52:09,166 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:09,179 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:52:09,927 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:52:09,927 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:52:09,927 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 10:52:09,928 INFO ]: Interpolant automaton has 11 states [2018-06-22 10:52:09,928 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 10:52:09,928 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 10:52:09,928 INFO ]: Start difference. First operand 168 states and 195 transitions. Second operand 11 states. [2018-06-22 10:52:10,249 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:52:10,249 INFO ]: Finished difference Result 221 states and 263 transitions. [2018-06-22 10:52:10,249 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 10:52:10,249 INFO ]: Start accepts. Automaton has 11 states. Word has length 89 [2018-06-22 10:52:10,250 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:52:10,252 INFO ]: With dead ends: 221 [2018-06-22 10:52:10,252 INFO ]: Without dead ends: 207 [2018-06-22 10:52:10,252 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 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:52:10,252 INFO ]: Start minimizeSevpa. Operand 207 states. [2018-06-22 10:52:10,266 INFO ]: Finished minimizeSevpa. Reduced states from 207 to 185. [2018-06-22 10:52:10,266 INFO ]: Start removeUnreachable. Operand 185 states. [2018-06-22 10:52:10,268 INFO ]: Finished removeUnreachable. Reduced from 185 states to 185 states and 215 transitions. [2018-06-22 10:52:10,268 INFO ]: Start accepts. Automaton has 185 states and 215 transitions. Word has length 89 [2018-06-22 10:52:10,268 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:52:10,268 INFO ]: Abstraction has 185 states and 215 transitions. [2018-06-22 10:52:10,268 INFO ]: Interpolant automaton has 11 states. [2018-06-22 10:52:10,268 INFO ]: Start isEmpty. Operand 185 states and 215 transitions. [2018-06-22 10:52:10,270 INFO ]: Finished isEmpty. Found accepting run of length 90 [2018-06-22 10:52:10,270 INFO ]: Found error trace [2018-06-22 10:52:10,270 INFO ]: trace histogram [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] [2018-06-22 10:52:10,270 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:52:10,270 INFO ]: Analyzing trace with hash -1463954684, now seen corresponding path program 1 times [2018-06-22 10:52:10,270 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:52:10,270 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:52:10,271 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:10,271 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:52:10,271 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:10,283 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:52:10,601 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:52:10,601 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:52:10,601 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 10:52:10,601 INFO ]: Interpolant automaton has 11 states [2018-06-22 10:52:10,601 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 10:52:10,601 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 10:52:10,601 INFO ]: Start difference. First operand 185 states and 215 transitions. Second operand 11 states. [2018-06-22 10:52:10,744 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:52:10,744 INFO ]: Finished difference Result 215 states and 248 transitions. [2018-06-22 10:52:10,745 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 10:52:10,745 INFO ]: Start accepts. Automaton has 11 states. Word has length 89 [2018-06-22 10:52:10,745 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:52:10,746 INFO ]: With dead ends: 215 [2018-06-22 10:52:10,746 INFO ]: Without dead ends: 202 [2018-06-22 10:52:10,747 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 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:52:10,747 INFO ]: Start minimizeSevpa. Operand 202 states. [2018-06-22 10:52:10,757 INFO ]: Finished minimizeSevpa. Reduced states from 202 to 190. [2018-06-22 10:52:10,758 INFO ]: Start removeUnreachable. Operand 190 states. [2018-06-22 10:52:10,759 INFO ]: Finished removeUnreachable. Reduced from 190 states to 190 states and 219 transitions. [2018-06-22 10:52:10,759 INFO ]: Start accepts. Automaton has 190 states and 219 transitions. Word has length 89 [2018-06-22 10:52:10,759 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:52:10,759 INFO ]: Abstraction has 190 states and 219 transitions. [2018-06-22 10:52:10,759 INFO ]: Interpolant automaton has 11 states. [2018-06-22 10:52:10,759 INFO ]: Start isEmpty. Operand 190 states and 219 transitions. [2018-06-22 10:52:10,761 INFO ]: Finished isEmpty. Found accepting run of length 94 [2018-06-22 10:52:10,761 INFO ]: Found error trace [2018-06-22 10:52:10,761 INFO ]: trace histogram [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, 1] [2018-06-22 10:52:10,761 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:52:10,761 INFO ]: Analyzing trace with hash 1166624512, now seen corresponding path program 1 times [2018-06-22 10:52:10,761 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:52:10,761 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:52:10,762 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:10,762 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:52:10,762 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:10,773 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:52:10,970 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:52:10,970 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:52:10,970 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:52:10,970 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:52:10,970 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:52:10,970 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:52:10,971 INFO ]: Start difference. First operand 190 states and 219 transitions. Second operand 12 states. [2018-06-22 10:52:11,181 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:52:11,181 INFO ]: Finished difference Result 224 states and 258 transitions. [2018-06-22 10:52:11,181 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:52:11,182 INFO ]: Start accepts. Automaton has 12 states. Word has length 93 [2018-06-22 10:52:11,182 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:52:11,183 INFO ]: With dead ends: 224 [2018-06-22 10:52:11,183 INFO ]: Without dead ends: 214 [2018-06-22 10:52:11,183 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:52:11,184 INFO ]: Start minimizeSevpa. Operand 214 states. [2018-06-22 10:52:11,196 INFO ]: Finished minimizeSevpa. Reduced states from 214 to 202. [2018-06-22 10:52:11,196 INFO ]: Start removeUnreachable. Operand 202 states. [2018-06-22 10:52:11,198 INFO ]: Finished removeUnreachable. Reduced from 202 states to 202 states and 235 transitions. [2018-06-22 10:52:11,198 INFO ]: Start accepts. Automaton has 202 states and 235 transitions. Word has length 93 [2018-06-22 10:52:11,198 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:52:11,198 INFO ]: Abstraction has 202 states and 235 transitions. [2018-06-22 10:52:11,198 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:52:11,198 INFO ]: Start isEmpty. Operand 202 states and 235 transitions. [2018-06-22 10:52:11,200 INFO ]: Finished isEmpty. Found accepting run of length 94 [2018-06-22 10:52:11,200 INFO ]: Found error trace [2018-06-22 10:52:11,200 INFO ]: trace histogram [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, 1] [2018-06-22 10:52:11,200 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:52:11,200 INFO ]: Analyzing trace with hash -865456291, now seen corresponding path program 1 times [2018-06-22 10:52:11,200 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:52:11,200 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:52:11,201 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:11,201 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:52:11,201 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:52:11,212 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:52:11,374 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:52:11,374 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:52:11,374 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:52:11,374 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:52:11,374 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:52:11,374 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:52:11,374 INFO ]: Start difference. First operand 202 states and 235 transitions. Second operand 12 states. [2018-06-22 10:52:12,589 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:52:12,590 INFO ]: Finished difference Result 202 states and 238 transitions. [2018-06-22 10:52:12,590 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:52:12,590 INFO ]: Start accepts. Automaton has 12 states. Word has length 93 [2018-06-22 10:52:12,590 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:52:12,590 INFO ]: With dead ends: 202 [2018-06-22 10:52:12,590 INFO ]: Without dead ends: 0 [2018-06-22 10:52:12,591 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:52:12,591 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 10:52:12,591 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 10:52:12,591 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 10:52:12,591 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 10:52:12,591 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 93 [2018-06-22 10:52:12,591 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:52:12,591 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 10:52:12,591 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:52:12,591 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 10:52:12,591 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 10:52:12,596 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:52:12 BoogieIcfgContainer [2018-06-22 10:52:12,596 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 10:52:12,597 INFO ]: Toolchain (without parser) took 9317.24 ms. Allocated memory was 309.3 MB in the beginning and 425.2 MB in the end (delta: 115.9 MB). Free memory was 250.8 MB in the beginning and 385.3 MB in the end (delta: -134.5 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 10:52:12,601 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 10:52:12,601 INFO ]: ChcToBoogie took 61.86 ms. Allocated memory is still 309.3 MB. Free memory was 250.8 MB in the beginning and 247.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:52:12,601 INFO ]: Boogie Preprocessor took 60.52 ms. Allocated memory is still 309.3 MB. Free memory was 247.8 MB in the beginning and 246.8 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-22 10:52:12,602 INFO ]: RCFGBuilder took 591.20 ms. Allocated memory is still 309.3 MB. Free memory was 246.8 MB in the beginning and 221.6 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 3.6 GB. [2018-06-22 10:52:12,602 INFO ]: TraceAbstraction took 8593.98 ms. Allocated memory was 309.3 MB in the beginning and 425.2 MB in the end (delta: 115.9 MB). Free memory was 220.6 MB in the beginning and 385.3 MB in the end (delta: -164.7 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 10:52:12,607 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 61.86 ms. Allocated memory is still 309.3 MB. Free memory was 250.8 MB in the beginning and 247.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 60.52 ms. Allocated memory is still 309.3 MB. Free memory was 247.8 MB in the beginning and 246.8 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 591.20 ms. Allocated memory is still 309.3 MB. Free memory was 246.8 MB in the beginning and 221.6 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 3.6 GB. * TraceAbstraction took 8593.98 ms. Allocated memory was 309.3 MB in the beginning and 425.2 MB in the end (delta: 115.9 MB). Free memory was 220.6 MB in the beginning and 385.3 MB in the end (delta: -164.7 MB). There was no memory consumed. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 28 procedures, 119 locations, 1 error locations. SAFE Result, 8.5s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 4.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1390 SDtfs, 81 SDslu, 14507 SDs, 0 SdLazy, 2152 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=202occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 76 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 786 NumberOfCodeBlocks, 786 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 776 ConstructedInterpolants, 0 QuantifiedInterpolants, 130248 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 90/90 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/22.c.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_10-52-12-630.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/22.c.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_10-52-12-630.csv Received shutdown request...