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/38.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 10:55:24,838 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 10:55:24,841 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 10:55:24,854 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 10:55:24,855 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 10:55:24,856 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 10:55:24,857 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 10:55:24,861 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 10:55:24,863 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 10:55:24,864 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 10:55:24,866 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 10:55:24,866 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 10:55:24,867 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 10:55:24,868 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 10:55:24,868 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 10:55:24,872 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 10:55:24,874 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 10:55:24,876 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 10:55:24,885 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 10:55:24,887 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 10:55:24,888 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 10:55:24,896 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 10:55:24,896 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 10:55:24,897 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 10:55:24,897 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 10:55:24,898 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 10:55:24,899 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 10:55:24,900 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 10:55:24,901 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 10:55:24,905 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 10:55:24,906 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 10:55:24,907 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 10:55:24,907 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 10:55:24,908 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 10:55:24,909 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 10:55:24,911 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:55:24,933 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 10:55:24,933 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 10:55:24,933 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 10:55:24,933 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 10:55:24,934 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 10:55:24,934 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 10:55:24,935 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 10:55:24,936 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 10:55:24,936 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 10:55:24,936 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 10:55:24,936 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:55:24,936 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 10:55:24,937 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 10:55:24,937 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 10:55:24,937 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 10:55:24,937 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 10:55:24,937 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 10:55:24,937 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 10:55:24,938 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 10:55:24,941 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 10:55:24,941 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 10:55:24,989 INFO ]: Repository-Root is: /tmp [2018-06-22 10:55:25,004 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 10:55:25,010 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 10:55:25,011 INFO ]: Initializing SmtParser... [2018-06-22 10:55:25,012 INFO ]: SmtParser initialized [2018-06-22 10:55:25,012 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/38.c.smt2 [2018-06-22 10:55:25,014 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:55:25,105 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/38.c.smt2 unknown [2018-06-22 10:55:25,480 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/38.c.smt2 [2018-06-22 10:55:25,490 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 10:55:25,505 INFO ]: Walking toolchain with 4 elements. [2018-06-22 10:55:25,506 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 10:55:25,506 INFO ]: Initializing ChcToBoogie... [2018-06-22 10:55:25,506 INFO ]: ChcToBoogie initialized [2018-06-22 10:55:25,509 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:55:25" (1/1) ... [2018-06-22 10:55:25,592 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:55:25 Unit [2018-06-22 10:55:25,592 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 10:55:25,593 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 10:55:25,593 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 10:55:25,593 INFO ]: Boogie Preprocessor initialized [2018-06-22 10:55:25,617 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:55:25" (1/1) ... [2018-06-22 10:55:25,617 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:55:25" (1/1) ... [2018-06-22 10:55:25,628 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:55:25" (1/1) ... [2018-06-22 10:55:25,629 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:55:25" (1/1) ... [2018-06-22 10:55:25,634 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:55:25" (1/1) ... [2018-06-22 10:55:25,636 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:55:25" (1/1) ... [2018-06-22 10:55:25,646 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:55:25" (1/1) ... [2018-06-22 10:55:25,649 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 10:55:25,650 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 10:55:25,650 INFO ]: Initializing RCFGBuilder... [2018-06-22 10:55:25,650 INFO ]: RCFGBuilder initialized [2018-06-22 10:55:25,651 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:55:25" (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:55:25,678 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 10:55:25,678 INFO ]: Found specification of procedure False [2018-06-22 10:55:25,678 INFO ]: Found implementation of procedure False [2018-06-22 10:55:25,678 INFO ]: Specification and implementation of procedure h24 given in one single declaration [2018-06-22 10:55:25,678 INFO ]: Found specification of procedure h24 [2018-06-22 10:55:25,678 INFO ]: Found implementation of procedure h24 [2018-06-22 10:55:25,678 INFO ]: Specification and implementation of procedure h19 given in one single declaration [2018-06-22 10:55:25,678 INFO ]: Found specification of procedure h19 [2018-06-22 10:55:25,678 INFO ]: Found implementation of procedure h19 [2018-06-22 10:55:25,679 INFO ]: Specification and implementation of procedure h18 given in one single declaration [2018-06-22 10:55:25,679 INFO ]: Found specification of procedure h18 [2018-06-22 10:55:25,679 INFO ]: Found implementation of procedure h18 [2018-06-22 10:55:25,679 INFO ]: Specification and implementation of procedure h17 given in one single declaration [2018-06-22 10:55:25,679 INFO ]: Found specification of procedure h17 [2018-06-22 10:55:25,679 INFO ]: Found implementation of procedure h17 [2018-06-22 10:55:25,679 INFO ]: Specification and implementation of procedure h11 given in one single declaration [2018-06-22 10:55:25,679 INFO ]: Found specification of procedure h11 [2018-06-22 10:55:25,679 INFO ]: Found implementation of procedure h11 [2018-06-22 10:55:25,679 INFO ]: Specification and implementation of procedure h10 given in one single declaration [2018-06-22 10:55:25,679 INFO ]: Found specification of procedure h10 [2018-06-22 10:55:25,679 INFO ]: Found implementation of procedure h10 [2018-06-22 10:55:25,679 INFO ]: Specification and implementation of procedure h9 given in one single declaration [2018-06-22 10:55:25,679 INFO ]: Found specification of procedure h9 [2018-06-22 10:55:25,679 INFO ]: Found implementation of procedure h9 [2018-06-22 10:55:25,679 INFO ]: Specification and implementation of procedure h6 given in one single declaration [2018-06-22 10:55:25,679 INFO ]: Found specification of procedure h6 [2018-06-22 10:55:25,679 INFO ]: Found implementation of procedure h6 [2018-06-22 10:55:25,679 INFO ]: Specification and implementation of procedure h5 given in one single declaration [2018-06-22 10:55:25,679 INFO ]: Found specification of procedure h5 [2018-06-22 10:55:25,679 INFO ]: Found implementation of procedure h5 [2018-06-22 10:55:25,679 INFO ]: Specification and implementation of procedure h16 given in one single declaration [2018-06-22 10:55:25,679 INFO ]: Found specification of procedure h16 [2018-06-22 10:55:25,679 INFO ]: Found implementation of procedure h16 [2018-06-22 10:55:25,679 INFO ]: Specification and implementation of procedure h12 given in one single declaration [2018-06-22 10:55:25,679 INFO ]: Found specification of procedure h12 [2018-06-22 10:55:25,680 INFO ]: Found implementation of procedure h12 [2018-06-22 10:55:25,680 INFO ]: Specification and implementation of procedure h8 given in one single declaration [2018-06-22 10:55:25,680 INFO ]: Found specification of procedure h8 [2018-06-22 10:55:25,680 INFO ]: Found implementation of procedure h8 [2018-06-22 10:55:25,680 INFO ]: Specification and implementation of procedure h7 given in one single declaration [2018-06-22 10:55:25,680 INFO ]: Found specification of procedure h7 [2018-06-22 10:55:25,680 INFO ]: Found implementation of procedure h7 [2018-06-22 10:55:25,680 INFO ]: Specification and implementation of procedure h14 given in one single declaration [2018-06-22 10:55:25,680 INFO ]: Found specification of procedure h14 [2018-06-22 10:55:25,680 INFO ]: Found implementation of procedure h14 [2018-06-22 10:55:25,680 INFO ]: Specification and implementation of procedure h13 given in one single declaration [2018-06-22 10:55:25,680 INFO ]: Found specification of procedure h13 [2018-06-22 10:55:25,680 INFO ]: Found implementation of procedure h13 [2018-06-22 10:55:25,680 INFO ]: Specification and implementation of procedure h4 given in one single declaration [2018-06-22 10:55:25,680 INFO ]: Found specification of procedure h4 [2018-06-22 10:55:25,680 INFO ]: Found implementation of procedure h4 [2018-06-22 10:55:25,680 INFO ]: Specification and implementation of procedure h3 given in one single declaration [2018-06-22 10:55:25,680 INFO ]: Found specification of procedure h3 [2018-06-22 10:55:25,680 INFO ]: Found implementation of procedure h3 [2018-06-22 10:55:25,680 INFO ]: Specification and implementation of procedure h2 given in one single declaration [2018-06-22 10:55:25,680 INFO ]: Found specification of procedure h2 [2018-06-22 10:55:25,680 INFO ]: Found implementation of procedure h2 [2018-06-22 10:55:25,680 INFO ]: Specification and implementation of procedure h1 given in one single declaration [2018-06-22 10:55:25,680 INFO ]: Found specification of procedure h1 [2018-06-22 10:55:25,680 INFO ]: Found implementation of procedure h1 [2018-06-22 10:55:25,680 INFO ]: Specification and implementation of procedure h15 given in one single declaration [2018-06-22 10:55:25,680 INFO ]: Found specification of procedure h15 [2018-06-22 10:55:25,680 INFO ]: Found implementation of procedure h15 [2018-06-22 10:55:25,680 INFO ]: Specification and implementation of procedure h23 given in one single declaration [2018-06-22 10:55:25,680 INFO ]: Found specification of procedure h23 [2018-06-22 10:55:25,681 INFO ]: Found implementation of procedure h23 [2018-06-22 10:55:25,681 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 10:55:25,681 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 10:55:25,681 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:55:26,045 INFO ]: Using library mode [2018-06-22 10:55:26,046 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:55:26 BoogieIcfgContainer [2018-06-22 10:55:26,046 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 10:55:26,047 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 10:55:26,047 INFO ]: Initializing TraceAbstraction... [2018-06-22 10:55:26,050 INFO ]: TraceAbstraction initialized [2018-06-22 10:55:26,051 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:55:25" (1/3) ... [2018-06-22 10:55:26,051 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c1df09a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 10:55:26, skipping insertion in model container [2018-06-22 10:55:26,051 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:55:25" (2/3) ... [2018-06-22 10:55:26,052 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c1df09a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:55:26, skipping insertion in model container [2018-06-22 10:55:26,052 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:55:26" (3/3) ... [2018-06-22 10:55:26,053 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 10:55:26,062 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 10:55:26,073 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 10:55:26,125 INFO ]: Using default assertion order modulation [2018-06-22 10:55:26,125 INFO ]: Interprodecural is true [2018-06-22 10:55:26,125 INFO ]: Hoare is false [2018-06-22 10:55:26,125 INFO ]: Compute interpolants for FPandBP [2018-06-22 10:55:26,125 INFO ]: Backedges is TWOTRACK [2018-06-22 10:55:26,125 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 10:55:26,125 INFO ]: Difference is false [2018-06-22 10:55:26,125 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 10:55:26,125 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 10:55:26,152 INFO ]: Start isEmpty. Operand 96 states. [2018-06-22 10:55:26,181 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 10:55:26,181 INFO ]: Found error trace [2018-06-22 10:55:26,182 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:55:26,182 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:55:26,186 INFO ]: Analyzing trace with hash 1401606505, now seen corresponding path program 1 times [2018-06-22 10:55:26,188 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:55:26,188 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:55:26,224 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:26,224 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:55:26,224 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:26,312 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:27,119 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:55:27,121 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:55:27,121 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 10:55:27,123 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:55:27,139 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:55:27,139 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:55:27,143 INFO ]: Start difference. First operand 96 states. Second operand 14 states. [2018-06-22 10:55:27,859 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:55:27,859 INFO ]: Finished difference Result 110 states and 118 transitions. [2018-06-22 10:55:27,859 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:55:27,860 INFO ]: Start accepts. Automaton has 14 states. Word has length 57 [2018-06-22 10:55:27,861 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:55:27,873 INFO ]: With dead ends: 110 [2018-06-22 10:55:27,873 INFO ]: Without dead ends: 110 [2018-06-22 10:55:27,875 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:55:27,889 INFO ]: Start minimizeSevpa. Operand 110 states. [2018-06-22 10:55:27,923 INFO ]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-06-22 10:55:27,925 INFO ]: Start removeUnreachable. Operand 110 states. [2018-06-22 10:55:27,927 INFO ]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2018-06-22 10:55:27,928 INFO ]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 57 [2018-06-22 10:55:28,035 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:55:28,035 INFO ]: Abstraction has 110 states and 118 transitions. [2018-06-22 10:55:28,035 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:55:28,035 INFO ]: Start isEmpty. Operand 110 states and 118 transitions. [2018-06-22 10:55:28,038 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 10:55:28,038 INFO ]: Found error trace [2018-06-22 10:55:28,038 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:55:28,039 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:55:28,039 INFO ]: Analyzing trace with hash 171260908, now seen corresponding path program 1 times [2018-06-22 10:55:28,039 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:55:28,039 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:55:28,040 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:28,040 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:55:28,040 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:28,065 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:28,434 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:55:28,434 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:55:28,434 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 10:55:28,438 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:55:28,438 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:55:28,438 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:55:28,438 INFO ]: Start difference. First operand 110 states and 118 transitions. Second operand 14 states. [2018-06-22 10:55:28,805 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:55:28,805 INFO ]: Finished difference Result 110 states and 117 transitions. [2018-06-22 10:55:28,806 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:55:28,806 INFO ]: Start accepts. Automaton has 14 states. Word has length 57 [2018-06-22 10:55:28,807 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:55:28,808 INFO ]: With dead ends: 110 [2018-06-22 10:55:28,808 INFO ]: Without dead ends: 98 [2018-06-22 10:55:28,809 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:55:28,809 INFO ]: Start minimizeSevpa. Operand 98 states. [2018-06-22 10:55:28,820 INFO ]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-06-22 10:55:28,820 INFO ]: Start removeUnreachable. Operand 98 states. [2018-06-22 10:55:28,823 INFO ]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2018-06-22 10:55:28,823 INFO ]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 57 [2018-06-22 10:55:28,823 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:55:28,823 INFO ]: Abstraction has 98 states and 105 transitions. [2018-06-22 10:55:28,823 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:55:28,823 INFO ]: Start isEmpty. Operand 98 states and 105 transitions. [2018-06-22 10:55:28,826 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-22 10:55:28,826 INFO ]: Found error trace [2018-06-22 10:55:28,826 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:55:28,826 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:55:28,827 INFO ]: Analyzing trace with hash 1214842899, now seen corresponding path program 1 times [2018-06-22 10:55:28,827 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:55:28,827 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:55:28,827 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:28,827 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:55:28,828 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:28,885 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:29,094 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:55:29,094 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:55:29,094 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-06-22 10:55:29,095 INFO ]: Interpolant automaton has 10 states [2018-06-22 10:55:29,095 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 10:55:29,095 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 10:55:29,096 INFO ]: Start difference. First operand 98 states and 105 transitions. Second operand 10 states. [2018-06-22 10:55:29,290 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:55:29,290 INFO ]: Finished difference Result 110 states and 117 transitions. [2018-06-22 10:55:29,290 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 10:55:29,290 INFO ]: Start accepts. Automaton has 10 states. Word has length 81 [2018-06-22 10:55:29,291 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:55:29,292 INFO ]: With dead ends: 110 [2018-06-22 10:55:29,293 INFO ]: Without dead ends: 102 [2018-06-22 10:55:29,293 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 10:55:29,293 INFO ]: Start minimizeSevpa. Operand 102 states. [2018-06-22 10:55:29,303 INFO ]: Finished minimizeSevpa. Reduced states from 102 to 98. [2018-06-22 10:55:29,303 INFO ]: Start removeUnreachable. Operand 98 states. [2018-06-22 10:55:29,306 INFO ]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2018-06-22 10:55:29,306 INFO ]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 81 [2018-06-22 10:55:29,306 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:55:29,306 INFO ]: Abstraction has 98 states and 105 transitions. [2018-06-22 10:55:29,306 INFO ]: Interpolant automaton has 10 states. [2018-06-22 10:55:29,306 INFO ]: Start isEmpty. Operand 98 states and 105 transitions. [2018-06-22 10:55:29,308 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-22 10:55:29,308 INFO ]: Found error trace [2018-06-22 10:55:29,308 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:55:29,308 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:55:29,308 INFO ]: Analyzing trace with hash -846587104, now seen corresponding path program 1 times [2018-06-22 10:55:29,308 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:55:29,308 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:55:29,309 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:29,309 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:55:29,309 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:29,347 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:29,553 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:55:29,553 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:55:29,553 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-06-22 10:55:29,554 INFO ]: Interpolant automaton has 10 states [2018-06-22 10:55:29,554 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 10:55:29,554 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 10:55:29,554 INFO ]: Start difference. First operand 98 states and 105 transitions. Second operand 10 states. [2018-06-22 10:55:29,645 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:55:29,646 INFO ]: Finished difference Result 110 states and 117 transitions. [2018-06-22 10:55:29,646 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 10:55:29,646 INFO ]: Start accepts. Automaton has 10 states. Word has length 81 [2018-06-22 10:55:29,647 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:55:29,648 INFO ]: With dead ends: 110 [2018-06-22 10:55:29,648 INFO ]: Without dead ends: 102 [2018-06-22 10:55:29,649 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 10:55:29,649 INFO ]: Start minimizeSevpa. Operand 102 states. [2018-06-22 10:55:29,657 INFO ]: Finished minimizeSevpa. Reduced states from 102 to 98. [2018-06-22 10:55:29,657 INFO ]: Start removeUnreachable. Operand 98 states. [2018-06-22 10:55:29,658 INFO ]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2018-06-22 10:55:29,659 INFO ]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 81 [2018-06-22 10:55:29,659 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:55:29,659 INFO ]: Abstraction has 98 states and 105 transitions. [2018-06-22 10:55:29,659 INFO ]: Interpolant automaton has 10 states. [2018-06-22 10:55:29,659 INFO ]: Start isEmpty. Operand 98 states and 105 transitions. [2018-06-22 10:55:29,661 INFO ]: Finished isEmpty. Found accepting run of length 86 [2018-06-22 10:55:29,661 INFO ]: Found error trace [2018-06-22 10:55:29,661 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:55:29,661 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:55:29,661 INFO ]: Analyzing trace with hash -878740036, now seen corresponding path program 1 times [2018-06-22 10:55:29,661 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:55:29,661 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:55:29,662 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:29,662 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:55:29,662 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:29,694 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:30,107 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:55:30,107 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:55:30,107 INFO ]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-06-22 10:55:30,107 INFO ]: Interpolant automaton has 23 states [2018-06-22 10:55:30,107 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 10:55:30,108 INFO ]: CoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2018-06-22 10:55:30,108 INFO ]: Start difference. First operand 98 states and 105 transitions. Second operand 23 states. [2018-06-22 10:55:30,910 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:55:30,910 INFO ]: Finished difference Result 128 states and 138 transitions. [2018-06-22 10:55:30,911 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 10:55:30,911 INFO ]: Start accepts. Automaton has 23 states. Word has length 85 [2018-06-22 10:55:30,911 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:55:30,913 INFO ]: With dead ends: 128 [2018-06-22 10:55:30,913 INFO ]: Without dead ends: 128 [2018-06-22 10:55:30,914 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2018-06-22 10:55:30,914 INFO ]: Start minimizeSevpa. Operand 128 states. [2018-06-22 10:55:30,927 INFO ]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-06-22 10:55:30,927 INFO ]: Start removeUnreachable. Operand 128 states. [2018-06-22 10:55:30,928 INFO ]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-06-22 10:55:30,928 INFO ]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 85 [2018-06-22 10:55:30,929 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:55:30,929 INFO ]: Abstraction has 128 states and 138 transitions. [2018-06-22 10:55:30,929 INFO ]: Interpolant automaton has 23 states. [2018-06-22 10:55:30,929 INFO ]: Start isEmpty. Operand 128 states and 138 transitions. [2018-06-22 10:55:30,930 INFO ]: Finished isEmpty. Found accepting run of length 86 [2018-06-22 10:55:30,930 INFO ]: Found error trace [2018-06-22 10:55:30,931 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:55:30,931 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:55:30,931 INFO ]: Analyzing trace with hash 624386105, now seen corresponding path program 1 times [2018-06-22 10:55:30,931 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:55:30,931 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:55:30,933 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:30,933 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:55:30,933 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:30,953 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:31,326 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:55:31,327 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:55:31,327 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:55:31,333 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:55:31,411 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:31,425 INFO ]: Computing forward predicates... [2018-06-22 10:55:31,579 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:55:31,607 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:55:31,607 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-06-22 10:55:31,607 INFO ]: Interpolant automaton has 21 states [2018-06-22 10:55:31,607 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 10:55:31,607 INFO ]: CoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-06-22 10:55:31,609 INFO ]: Start difference. First operand 128 states and 138 transitions. Second operand 21 states. [2018-06-22 10:55:32,170 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:55:32,170 INFO ]: Finished difference Result 150 states and 162 transitions. [2018-06-22 10:55:32,173 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 10:55:32,173 INFO ]: Start accepts. Automaton has 21 states. Word has length 85 [2018-06-22 10:55:32,174 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:55:32,175 INFO ]: With dead ends: 150 [2018-06-22 10:55:32,175 INFO ]: Without dead ends: 142 [2018-06-22 10:55:32,175 INFO ]: 0 DeclaredPredicates, 105 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=418, Unknown=0, NotChecked=0, Total=462 [2018-06-22 10:55:32,176 INFO ]: Start minimizeSevpa. Operand 142 states. [2018-06-22 10:55:32,189 INFO ]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-06-22 10:55:32,189 INFO ]: Start removeUnreachable. Operand 142 states. [2018-06-22 10:55:32,190 INFO ]: Finished removeUnreachable. Reduced from 142 states to 142 states and 154 transitions. [2018-06-22 10:55:32,191 INFO ]: Start accepts. Automaton has 142 states and 154 transitions. Word has length 85 [2018-06-22 10:55:32,191 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:55:32,191 INFO ]: Abstraction has 142 states and 154 transitions. [2018-06-22 10:55:32,191 INFO ]: Interpolant automaton has 21 states. [2018-06-22 10:55:32,191 INFO ]: Start isEmpty. Operand 142 states and 154 transitions. [2018-06-22 10:55:32,193 INFO ]: Finished isEmpty. Found accepting run of length 110 [2018-06-22 10:55:32,193 INFO ]: Found error trace [2018-06-22 10:55:32,193 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:55:32,193 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:55:32,193 INFO ]: Analyzing trace with hash 490773667, now seen corresponding path program 1 times [2018-06-22 10:55:32,194 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:55:32,194 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:55:32,194 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:32,194 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:55:32,194 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:32,217 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:32,760 INFO ]: Checked inductivity of 33 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-22 10:55:32,760 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:55:32,760 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:55:32,766 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:55:32,831 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:32,840 INFO ]: Computing forward predicates... [2018-06-22 10:55:34,038 INFO ]: Checked inductivity of 33 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 10:55:34,070 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:55:34,070 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29] total 51 [2018-06-22 10:55:34,071 INFO ]: Interpolant automaton has 51 states [2018-06-22 10:55:34,071 INFO ]: Constructing interpolant automaton starting with 51 interpolants. [2018-06-22 10:55:34,072 INFO ]: CoverageRelationStatistics Valid=140, Invalid=2410, Unknown=0, NotChecked=0, Total=2550 [2018-06-22 10:55:34,072 INFO ]: Start difference. First operand 142 states and 154 transitions. Second operand 51 states. [2018-06-22 10:55:35,890 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:55:35,890 INFO ]: Finished difference Result 212 states and 232 transitions. [2018-06-22 10:55:35,891 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-06-22 10:55:35,891 INFO ]: Start accepts. Automaton has 51 states. Word has length 109 [2018-06-22 10:55:35,891 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:55:35,893 INFO ]: With dead ends: 212 [2018-06-22 10:55:35,893 INFO ]: Without dead ends: 212 [2018-06-22 10:55:35,894 INFO ]: 0 DeclaredPredicates, 144 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=176, Invalid=3016, Unknown=0, NotChecked=0, Total=3192 [2018-06-22 10:55:35,894 INFO ]: Start minimizeSevpa. Operand 212 states. [2018-06-22 10:55:35,912 INFO ]: Finished minimizeSevpa. Reduced states from 212 to 154. [2018-06-22 10:55:35,912 INFO ]: Start removeUnreachable. Operand 154 states. [2018-06-22 10:55:35,914 INFO ]: Finished removeUnreachable. Reduced from 154 states to 154 states and 168 transitions. [2018-06-22 10:55:35,914 INFO ]: Start accepts. Automaton has 154 states and 168 transitions. Word has length 109 [2018-06-22 10:55:35,914 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:55:35,914 INFO ]: Abstraction has 154 states and 168 transitions. [2018-06-22 10:55:35,914 INFO ]: Interpolant automaton has 51 states. [2018-06-22 10:55:35,914 INFO ]: Start isEmpty. Operand 154 states and 168 transitions. [2018-06-22 10:55:35,916 INFO ]: Finished isEmpty. Found accepting run of length 110 [2018-06-22 10:55:35,916 INFO ]: Found error trace [2018-06-22 10:55:35,917 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:55:35,917 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:55:35,917 INFO ]: Analyzing trace with hash -665960160, now seen corresponding path program 1 times [2018-06-22 10:55:35,917 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:55:35,917 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:55:35,918 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:35,918 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:55:35,918 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:35,938 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:36,462 INFO ]: Checked inductivity of 33 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-22 10:55:36,462 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:55:36,462 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:55:36,468 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:55:36,546 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:36,559 INFO ]: Computing forward predicates... [2018-06-22 10:55:37,615 INFO ]: Checked inductivity of 33 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 10:55:37,636 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:55:37,636 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29] total 51 [2018-06-22 10:55:37,636 INFO ]: Interpolant automaton has 51 states [2018-06-22 10:55:37,636 INFO ]: Constructing interpolant automaton starting with 51 interpolants. [2018-06-22 10:55:37,637 INFO ]: CoverageRelationStatistics Valid=138, Invalid=2412, Unknown=0, NotChecked=0, Total=2550 [2018-06-22 10:55:37,637 INFO ]: Start difference. First operand 154 states and 168 transitions. Second operand 51 states. [2018-06-22 10:55:38,463 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:55:38,463 INFO ]: Finished difference Result 294 states and 322 transitions. [2018-06-22 10:55:38,463 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-06-22 10:55:38,464 INFO ]: Start accepts. Automaton has 51 states. Word has length 109 [2018-06-22 10:55:38,464 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:55:38,466 INFO ]: With dead ends: 294 [2018-06-22 10:55:38,466 INFO ]: Without dead ends: 270 [2018-06-22 10:55:38,467 INFO ]: 0 DeclaredPredicates, 144 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=174, Invalid=3018, Unknown=0, NotChecked=0, Total=3192 [2018-06-22 10:55:38,467 INFO ]: Start minimizeSevpa. Operand 270 states. [2018-06-22 10:55:38,489 INFO ]: Finished minimizeSevpa. Reduced states from 270 to 218. [2018-06-22 10:55:38,489 INFO ]: Start removeUnreachable. Operand 218 states. [2018-06-22 10:55:38,491 INFO ]: Finished removeUnreachable. Reduced from 218 states to 218 states and 241 transitions. [2018-06-22 10:55:38,491 INFO ]: Start accepts. Automaton has 218 states and 241 transitions. Word has length 109 [2018-06-22 10:55:38,491 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:55:38,491 INFO ]: Abstraction has 218 states and 241 transitions. [2018-06-22 10:55:38,491 INFO ]: Interpolant automaton has 51 states. [2018-06-22 10:55:38,491 INFO ]: Start isEmpty. Operand 218 states and 241 transitions. [2018-06-22 10:55:38,497 INFO ]: Finished isEmpty. Found accepting run of length 110 [2018-06-22 10:55:38,497 INFO ]: Found error trace [2018-06-22 10:55:38,497 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:55:38,500 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:55:38,500 INFO ]: Analyzing trace with hash 683047277, now seen corresponding path program 1 times [2018-06-22 10:55:38,500 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:55:38,500 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:55:38,501 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:38,501 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:55:38,501 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:38,521 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:39,026 INFO ]: Checked inductivity of 33 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-22 10:55:39,026 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:55:39,026 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:55:39,032 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:55:39,087 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:39,094 INFO ]: Computing forward predicates... [2018-06-22 10:55:40,026 INFO ]: Checked inductivity of 33 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 10:55:40,046 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:55:40,046 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29] total 51 [2018-06-22 10:55:40,046 INFO ]: Interpolant automaton has 51 states [2018-06-22 10:55:40,046 INFO ]: Constructing interpolant automaton starting with 51 interpolants. [2018-06-22 10:55:40,047 INFO ]: CoverageRelationStatistics Valid=138, Invalid=2412, Unknown=0, NotChecked=0, Total=2550 [2018-06-22 10:55:40,047 INFO ]: Start difference. First operand 218 states and 241 transitions. Second operand 51 states. [2018-06-22 10:55:40,844 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:55:40,844 INFO ]: Finished difference Result 288 states and 319 transitions. [2018-06-22 10:55:40,844 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-06-22 10:55:40,844 INFO ]: Start accepts. Automaton has 51 states. Word has length 109 [2018-06-22 10:55:40,845 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:55:40,847 INFO ]: With dead ends: 288 [2018-06-22 10:55:40,847 INFO ]: Without dead ends: 288 [2018-06-22 10:55:40,848 INFO ]: 0 DeclaredPredicates, 144 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=3018, Unknown=0, NotChecked=0, Total=3192 [2018-06-22 10:55:40,848 INFO ]: Start minimizeSevpa. Operand 288 states. [2018-06-22 10:55:40,867 INFO ]: Finished minimizeSevpa. Reduced states from 288 to 244. [2018-06-22 10:55:40,867 INFO ]: Start removeUnreachable. Operand 244 states. [2018-06-22 10:55:40,869 INFO ]: Finished removeUnreachable. Reduced from 244 states to 244 states and 272 transitions. [2018-06-22 10:55:40,869 INFO ]: Start accepts. Automaton has 244 states and 272 transitions. Word has length 109 [2018-06-22 10:55:40,869 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:55:40,869 INFO ]: Abstraction has 244 states and 272 transitions. [2018-06-22 10:55:40,869 INFO ]: Interpolant automaton has 51 states. [2018-06-22 10:55:40,869 INFO ]: Start isEmpty. Operand 244 states and 272 transitions. [2018-06-22 10:55:40,871 INFO ]: Finished isEmpty. Found accepting run of length 110 [2018-06-22 10:55:40,871 INFO ]: Found error trace [2018-06-22 10:55:40,871 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:55:40,872 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:55:40,872 INFO ]: Analyzing trace with hash 1839781104, now seen corresponding path program 1 times [2018-06-22 10:55:40,872 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:55:40,872 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:55:40,872 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:40,872 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:55:40,872 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:40,889 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:41,930 INFO ]: Checked inductivity of 33 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-22 10:55:41,930 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:55:41,930 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:55:41,936 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:55:41,990 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:41,996 INFO ]: Computing forward predicates... [2018-06-22 10:55:42,716 INFO ]: Checked inductivity of 33 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 10:55:42,735 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:55:42,735 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29] total 51 [2018-06-22 10:55:42,736 INFO ]: Interpolant automaton has 51 states [2018-06-22 10:55:42,736 INFO ]: Constructing interpolant automaton starting with 51 interpolants. [2018-06-22 10:55:42,737 INFO ]: CoverageRelationStatistics Valid=140, Invalid=2410, Unknown=0, NotChecked=0, Total=2550 [2018-06-22 10:55:42,737 INFO ]: Start difference. First operand 244 states and 272 transitions. Second operand 51 states. [2018-06-22 10:55:43,427 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:55:43,427 INFO ]: Finished difference Result 378 states and 420 transitions. [2018-06-22 10:55:43,430 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-06-22 10:55:43,430 INFO ]: Start accepts. Automaton has 51 states. Word has length 109 [2018-06-22 10:55:43,430 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:55:43,432 INFO ]: With dead ends: 378 [2018-06-22 10:55:43,432 INFO ]: Without dead ends: 354 [2018-06-22 10:55:43,434 INFO ]: 0 DeclaredPredicates, 144 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=176, Invalid=3016, Unknown=0, NotChecked=0, Total=3192 [2018-06-22 10:55:43,434 INFO ]: Start minimizeSevpa. Operand 354 states. [2018-06-22 10:55:43,454 INFO ]: Finished minimizeSevpa. Reduced states from 354 to 310. [2018-06-22 10:55:43,454 INFO ]: Start removeUnreachable. Operand 310 states. [2018-06-22 10:55:43,457 INFO ]: Finished removeUnreachable. Reduced from 310 states to 310 states and 350 transitions. [2018-06-22 10:55:43,457 INFO ]: Start accepts. Automaton has 310 states and 350 transitions. Word has length 109 [2018-06-22 10:55:43,458 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:55:43,458 INFO ]: Abstraction has 310 states and 350 transitions. [2018-06-22 10:55:43,458 INFO ]: Interpolant automaton has 51 states. [2018-06-22 10:55:43,458 INFO ]: Start isEmpty. Operand 310 states and 350 transitions. [2018-06-22 10:55:43,462 INFO ]: Finished isEmpty. Found accepting run of length 114 [2018-06-22 10:55:43,462 INFO ]: Found error trace [2018-06-22 10:55:43,462 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:55:43,462 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:55:43,462 INFO ]: Analyzing trace with hash -226527607, now seen corresponding path program 2 times [2018-06-22 10:55:43,462 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:55:43,462 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:55:43,463 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:43,463 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:55:43,463 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:43,505 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:43,764 WARN ]: Spent 183.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-06-22 10:55:43,925 INFO ]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-06-22 10:55:43,925 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:55:43,925 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:55:43,926 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:55:43,926 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:55:43,926 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:55:43,926 INFO ]: Start difference. First operand 310 states and 350 transitions. Second operand 12 states. [2018-06-22 10:55:44,059 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:55:44,059 INFO ]: Finished difference Result 288 states and 324 transitions. [2018-06-22 10:55:44,059 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:55:44,059 INFO ]: Start accepts. Automaton has 12 states. Word has length 113 [2018-06-22 10:55:44,060 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:55:44,061 INFO ]: With dead ends: 288 [2018-06-22 10:55:44,061 INFO ]: Without dead ends: 288 [2018-06-22 10:55:44,061 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:55:44,061 INFO ]: Start minimizeSevpa. Operand 288 states. [2018-06-22 10:55:44,077 INFO ]: Finished minimizeSevpa. Reduced states from 288 to 288. [2018-06-22 10:55:44,077 INFO ]: Start removeUnreachable. Operand 288 states. [2018-06-22 10:55:44,079 INFO ]: Finished removeUnreachable. Reduced from 288 states to 288 states and 324 transitions. [2018-06-22 10:55:44,079 INFO ]: Start accepts. Automaton has 288 states and 324 transitions. Word has length 113 [2018-06-22 10:55:44,080 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:55:44,080 INFO ]: Abstraction has 288 states and 324 transitions. [2018-06-22 10:55:44,080 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:55:44,080 INFO ]: Start isEmpty. Operand 288 states and 324 transitions. [2018-06-22 10:55:44,082 INFO ]: Finished isEmpty. Found accepting run of length 134 [2018-06-22 10:55:44,082 INFO ]: Found error trace [2018-06-22 10:55:44,082 INFO ]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:55:44,082 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:55:44,082 INFO ]: Analyzing trace with hash -575308508, now seen corresponding path program 2 times [2018-06-22 10:55:44,082 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:55:44,082 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:55:44,083 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:44,083 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:55:44,083 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:44,109 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:44,598 INFO ]: Checked inductivity of 83 backedges. 25 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-06-22 10:55:44,598 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:55:44,598 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:55:44,606 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:55:44,677 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:55:44,677 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:44,682 INFO ]: Computing forward predicates... [2018-06-22 10:55:45,067 INFO ]: Checked inductivity of 83 backedges. 32 proven. 11 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-06-22 10:55:45,087 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:55:45,087 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18] total 36 [2018-06-22 10:55:45,088 INFO ]: Interpolant automaton has 36 states [2018-06-22 10:55:45,088 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-22 10:55:45,088 INFO ]: CoverageRelationStatistics Valid=80, Invalid=1180, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 10:55:45,088 INFO ]: Start difference. First operand 288 states and 324 transitions. Second operand 36 states. [2018-06-22 10:55:46,336 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:55:46,336 INFO ]: Finished difference Result 392 states and 431 transitions. [2018-06-22 10:55:46,336 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 10:55:46,336 INFO ]: Start accepts. Automaton has 36 states. Word has length 133 [2018-06-22 10:55:46,336 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:55:46,338 INFO ]: With dead ends: 392 [2018-06-22 10:55:46,338 INFO ]: Without dead ends: 390 [2018-06-22 10:55:46,339 INFO ]: 0 DeclaredPredicates, 162 GetRequests, 118 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=100, Invalid=1460, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 10:55:46,339 INFO ]: Start minimizeSevpa. Operand 390 states. [2018-06-22 10:55:46,355 INFO ]: Finished minimizeSevpa. Reduced states from 390 to 287. [2018-06-22 10:55:46,355 INFO ]: Start removeUnreachable. Operand 287 states. [2018-06-22 10:55:46,357 INFO ]: Finished removeUnreachable. Reduced from 287 states to 287 states and 321 transitions. [2018-06-22 10:55:46,357 INFO ]: Start accepts. Automaton has 287 states and 321 transitions. Word has length 133 [2018-06-22 10:55:46,360 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:55:46,360 INFO ]: Abstraction has 287 states and 321 transitions. [2018-06-22 10:55:46,360 INFO ]: Interpolant automaton has 36 states. [2018-06-22 10:55:46,360 INFO ]: Start isEmpty. Operand 287 states and 321 transitions. [2018-06-22 10:55:46,362 INFO ]: Finished isEmpty. Found accepting run of length 134 [2018-06-22 10:55:46,362 INFO ]: Found error trace [2018-06-22 10:55:46,363 INFO ]: trace histogram [4, 4, 4, 4, 4, 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, 1, 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:55:46,363 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:55:46,363 INFO ]: Analyzing trace with hash -634666793, now seen corresponding path program 1 times [2018-06-22 10:55:46,363 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:55:46,363 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:55:46,363 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:46,363 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:55:46,363 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:46,398 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:46,895 INFO ]: Checked inductivity of 78 backedges. 24 proven. 16 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-06-22 10:55:46,895 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:55:46,895 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:55:46,902 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:55:46,970 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:46,976 INFO ]: Computing forward predicates... [2018-06-22 10:55:47,410 INFO ]: Checked inductivity of 78 backedges. 30 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-06-22 10:55:47,429 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:55:47,430 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18] total 37 [2018-06-22 10:55:47,430 INFO ]: Interpolant automaton has 37 states [2018-06-22 10:55:47,430 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-22 10:55:47,430 INFO ]: CoverageRelationStatistics Valid=82, Invalid=1250, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 10:55:47,430 INFO ]: Start difference. First operand 287 states and 321 transitions. Second operand 37 states. [2018-06-22 10:55:48,052 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:55:48,052 INFO ]: Finished difference Result 335 states and 366 transitions. [2018-06-22 10:55:48,052 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 10:55:48,052 INFO ]: Start accepts. Automaton has 37 states. Word has length 133 [2018-06-22 10:55:48,052 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:55:48,054 INFO ]: With dead ends: 335 [2018-06-22 10:55:48,054 INFO ]: Without dead ends: 330 [2018-06-22 10:55:48,055 INFO ]: 0 DeclaredPredicates, 162 GetRequests, 118 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=102, Invalid=1538, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 10:55:48,055 INFO ]: Start minimizeSevpa. Operand 330 states. [2018-06-22 10:55:48,079 INFO ]: Finished minimizeSevpa. Reduced states from 330 to 272. [2018-06-22 10:55:48,079 INFO ]: Start removeUnreachable. Operand 272 states. [2018-06-22 10:55:48,080 INFO ]: Finished removeUnreachable. Reduced from 272 states to 272 states and 295 transitions. [2018-06-22 10:55:48,081 INFO ]: Start accepts. Automaton has 272 states and 295 transitions. Word has length 133 [2018-06-22 10:55:48,081 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:55:48,081 INFO ]: Abstraction has 272 states and 295 transitions. [2018-06-22 10:55:48,081 INFO ]: Interpolant automaton has 37 states. [2018-06-22 10:55:48,081 INFO ]: Start isEmpty. Operand 272 states and 295 transitions. [2018-06-22 10:55:48,082 INFO ]: Finished isEmpty. Found accepting run of length 138 [2018-06-22 10:55:48,082 INFO ]: Found error trace [2018-06-22 10:55:48,083 INFO ]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-06-22 10:55:48,083 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:55:48,083 INFO ]: Analyzing trace with hash -941127747, now seen corresponding path program 2 times [2018-06-22 10:55:48,083 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:55:48,083 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:55:48,084 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:48,084 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:55:48,084 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:48,105 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:48,362 WARN ]: Spent 176.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-06-22 10:55:49,207 INFO ]: Checked inductivity of 87 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-06-22 10:55:49,207 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:55:49,207 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:55:49,219 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:55:49,292 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:55:49,292 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:49,297 INFO ]: Computing forward predicates... [2018-06-22 10:55:49,369 INFO ]: Checked inductivity of 87 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-06-22 10:55:49,388 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:55:49,388 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-06-22 10:55:49,389 INFO ]: Interpolant automaton has 34 states [2018-06-22 10:55:49,389 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-22 10:55:49,389 INFO ]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 10:55:49,389 INFO ]: Start difference. First operand 272 states and 295 transitions. Second operand 34 states. [2018-06-22 10:55:50,867 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:55:50,867 INFO ]: Finished difference Result 342 states and 369 transitions. [2018-06-22 10:55:50,870 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-22 10:55:50,870 INFO ]: Start accepts. Automaton has 34 states. Word has length 137 [2018-06-22 10:55:50,871 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:55:50,873 INFO ]: With dead ends: 342 [2018-06-22 10:55:50,873 INFO ]: Without dead ends: 334 [2018-06-22 10:55:50,873 INFO ]: 0 DeclaredPredicates, 174 GetRequests, 135 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=78, Invalid=1254, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 10:55:50,874 INFO ]: Start minimizeSevpa. Operand 334 states. [2018-06-22 10:55:50,892 INFO ]: Finished minimizeSevpa. Reduced states from 334 to 302. [2018-06-22 10:55:50,892 INFO ]: Start removeUnreachable. Operand 302 states. [2018-06-22 10:55:50,895 INFO ]: Finished removeUnreachable. Reduced from 302 states to 302 states and 329 transitions. [2018-06-22 10:55:50,895 INFO ]: Start accepts. Automaton has 302 states and 329 transitions. Word has length 137 [2018-06-22 10:55:50,896 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:55:50,896 INFO ]: Abstraction has 302 states and 329 transitions. [2018-06-22 10:55:50,896 INFO ]: Interpolant automaton has 34 states. [2018-06-22 10:55:50,896 INFO ]: Start isEmpty. Operand 302 states and 329 transitions. [2018-06-22 10:55:50,897 INFO ]: Finished isEmpty. Found accepting run of length 138 [2018-06-22 10:55:50,898 INFO ]: Found error trace [2018-06-22 10:55:50,898 INFO ]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-06-22 10:55:50,898 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:55:50,898 INFO ]: Analyzing trace with hash 1195530800, now seen corresponding path program 2 times [2018-06-22 10:55:50,898 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:55:50,898 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:55:50,899 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:50,899 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:55:50,899 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:50,920 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:51,200 WARN ]: Spent 187.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-06-22 10:55:51,873 INFO ]: Checked inductivity of 87 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-06-22 10:55:51,873 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:55:51,873 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:55:51,881 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:55:52,003 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:55:52,003 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:52,020 INFO ]: Computing forward predicates... [2018-06-22 10:55:52,172 INFO ]: Checked inductivity of 87 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-06-22 10:55:52,192 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:55:52,192 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-06-22 10:55:52,192 INFO ]: Interpolant automaton has 34 states [2018-06-22 10:55:52,192 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-22 10:55:52,192 INFO ]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 10:55:52,192 INFO ]: Start difference. First operand 302 states and 329 transitions. Second operand 34 states. [2018-06-22 10:55:52,807 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:55:52,807 INFO ]: Finished difference Result 372 states and 403 transitions. [2018-06-22 10:55:52,808 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-22 10:55:52,808 INFO ]: Start accepts. Automaton has 34 states. Word has length 137 [2018-06-22 10:55:52,808 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:55:52,810 INFO ]: With dead ends: 372 [2018-06-22 10:55:52,810 INFO ]: Without dead ends: 364 [2018-06-22 10:55:52,810 INFO ]: 0 DeclaredPredicates, 174 GetRequests, 135 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=78, Invalid=1254, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 10:55:52,810 INFO ]: Start minimizeSevpa. Operand 364 states. [2018-06-22 10:55:52,828 INFO ]: Finished minimizeSevpa. Reduced states from 364 to 332. [2018-06-22 10:55:52,829 INFO ]: Start removeUnreachable. Operand 332 states. [2018-06-22 10:55:52,830 INFO ]: Finished removeUnreachable. Reduced from 332 states to 332 states and 363 transitions. [2018-06-22 10:55:52,830 INFO ]: Start accepts. Automaton has 332 states and 363 transitions. Word has length 137 [2018-06-22 10:55:52,831 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:55:52,831 INFO ]: Abstraction has 332 states and 363 transitions. [2018-06-22 10:55:52,831 INFO ]: Interpolant automaton has 34 states. [2018-06-22 10:55:52,831 INFO ]: Start isEmpty. Operand 332 states and 363 transitions. [2018-06-22 10:55:52,833 INFO ]: Finished isEmpty. Found accepting run of length 162 [2018-06-22 10:55:52,833 INFO ]: Found error trace [2018-06-22 10:55:52,833 INFO ]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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:55:52,833 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:55:52,834 INFO ]: Analyzing trace with hash 1412304359, now seen corresponding path program 2 times [2018-06-22 10:55:52,834 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:55:52,834 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:55:52,834 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:52,834 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:55:52,834 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:52,863 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:53,369 INFO ]: Checked inductivity of 151 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-06-22 10:55:53,370 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:55:53,370 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:55:53,375 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:55:53,460 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:55:53,460 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:53,469 INFO ]: Computing forward predicates... [2018-06-22 10:55:54,801 INFO ]: Checked inductivity of 151 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-06-22 10:55:54,821 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:55:54,821 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 42] total 65 [2018-06-22 10:55:54,821 INFO ]: Interpolant automaton has 65 states [2018-06-22 10:55:54,821 INFO ]: Constructing interpolant automaton starting with 65 interpolants. [2018-06-22 10:55:54,822 INFO ]: CoverageRelationStatistics Valid=191, Invalid=3969, Unknown=0, NotChecked=0, Total=4160 [2018-06-22 10:55:54,823 INFO ]: Start difference. First operand 332 states and 363 transitions. Second operand 65 states. [2018-06-22 10:55:55,878 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:55:55,878 INFO ]: Finished difference Result 424 states and 457 transitions. [2018-06-22 10:55:55,878 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-06-22 10:55:55,878 INFO ]: Start accepts. Automaton has 65 states. Word has length 161 [2018-06-22 10:55:55,879 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:55:55,880 INFO ]: With dead ends: 424 [2018-06-22 10:55:55,880 INFO ]: Without dead ends: 421 [2018-06-22 10:55:55,881 INFO ]: 0 DeclaredPredicates, 215 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1421 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=249, Invalid=5153, Unknown=0, NotChecked=0, Total=5402 [2018-06-22 10:55:55,882 INFO ]: Start minimizeSevpa. Operand 421 states. [2018-06-22 10:55:55,899 INFO ]: Finished minimizeSevpa. Reduced states from 421 to 241. [2018-06-22 10:55:55,899 INFO ]: Start removeUnreachable. Operand 241 states. [2018-06-22 10:55:55,900 INFO ]: Finished removeUnreachable. Reduced from 241 states to 241 states and 262 transitions. [2018-06-22 10:55:55,900 INFO ]: Start accepts. Automaton has 241 states and 262 transitions. Word has length 161 [2018-06-22 10:55:55,900 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:55:55,900 INFO ]: Abstraction has 241 states and 262 transitions. [2018-06-22 10:55:55,900 INFO ]: Interpolant automaton has 65 states. [2018-06-22 10:55:55,900 INFO ]: Start isEmpty. Operand 241 states and 262 transitions. [2018-06-22 10:55:55,902 INFO ]: Finished isEmpty. Found accepting run of length 162 [2018-06-22 10:55:55,902 INFO ]: Found error trace [2018-06-22 10:55:55,902 INFO ]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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:55:55,902 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:55:55,902 INFO ]: Analyzing trace with hash -461755100, now seen corresponding path program 1 times [2018-06-22 10:55:55,902 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:55:55,902 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:55:55,903 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:55,903 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:55:55,903 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:55,924 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:56,310 INFO ]: Checked inductivity of 151 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-06-22 10:55:56,310 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:55:56,310 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:55:56,316 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:55:56,424 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:56,434 INFO ]: Computing forward predicates... [2018-06-22 10:55:57,700 INFO ]: Checked inductivity of 151 backedges. 20 proven. 60 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-06-22 10:55:57,720 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:55:57,720 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 42] total 65 [2018-06-22 10:55:57,720 INFO ]: Interpolant automaton has 65 states [2018-06-22 10:55:57,720 INFO ]: Constructing interpolant automaton starting with 65 interpolants. [2018-06-22 10:55:57,721 INFO ]: CoverageRelationStatistics Valid=189, Invalid=3971, Unknown=0, NotChecked=0, Total=4160 [2018-06-22 10:55:57,721 INFO ]: Start difference. First operand 241 states and 262 transitions. Second operand 65 states. [2018-06-22 10:55:58,785 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:55:58,785 INFO ]: Finished difference Result 375 states and 400 transitions. [2018-06-22 10:55:58,786 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-06-22 10:55:58,786 INFO ]: Start accepts. Automaton has 65 states. Word has length 161 [2018-06-22 10:55:58,786 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:55:58,788 INFO ]: With dead ends: 375 [2018-06-22 10:55:58,788 INFO ]: Without dead ends: 351 [2018-06-22 10:55:58,789 INFO ]: 0 DeclaredPredicates, 215 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1246 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=247, Invalid=5155, Unknown=0, NotChecked=0, Total=5402 [2018-06-22 10:55:58,791 INFO ]: Start minimizeSevpa. Operand 351 states. [2018-06-22 10:55:58,804 INFO ]: Finished minimizeSevpa. Reduced states from 351 to 213. [2018-06-22 10:55:58,804 INFO ]: Start removeUnreachable. Operand 213 states. [2018-06-22 10:55:58,805 INFO ]: Finished removeUnreachable. Reduced from 213 states to 213 states and 230 transitions. [2018-06-22 10:55:58,805 INFO ]: Start accepts. Automaton has 213 states and 230 transitions. Word has length 161 [2018-06-22 10:55:58,806 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:55:58,806 INFO ]: Abstraction has 213 states and 230 transitions. [2018-06-22 10:55:58,806 INFO ]: Interpolant automaton has 65 states. [2018-06-22 10:55:58,806 INFO ]: Start isEmpty. Operand 213 states and 230 transitions. [2018-06-22 10:55:58,807 INFO ]: Finished isEmpty. Found accepting run of length 166 [2018-06-22 10:55:58,807 INFO ]: Found error trace [2018-06-22 10:55:58,807 INFO ]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:55:58,807 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:55:58,807 INFO ]: Analyzing trace with hash 1453869760, now seen corresponding path program 3 times [2018-06-22 10:55:58,807 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:55:58,807 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:55:58,808 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:58,808 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:55:58,808 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:58,834 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:59,970 INFO ]: Checked inductivity of 169 backedges. 51 proven. 12 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-06-22 10:55:59,970 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:55:59,970 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:55:59,976 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 10:56:00,052 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 10:56:00,052 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:00,058 INFO ]: Computing forward predicates... [2018-06-22 10:56:00,644 INFO ]: Checked inductivity of 169 backedges. 54 proven. 31 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-06-22 10:56:00,664 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:56:00,664 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 25] total 40 [2018-06-22 10:56:00,664 INFO ]: Interpolant automaton has 40 states [2018-06-22 10:56:00,664 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-22 10:56:00,664 INFO ]: CoverageRelationStatistics Valid=91, Invalid=1469, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 10:56:00,665 INFO ]: Start difference. First operand 213 states and 230 transitions. Second operand 40 states. [2018-06-22 10:56:01,135 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:01,135 INFO ]: Finished difference Result 203 states and 215 transitions. [2018-06-22 10:56:01,136 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 10:56:01,136 INFO ]: Start accepts. Automaton has 40 states. Word has length 165 [2018-06-22 10:56:01,136 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:01,136 INFO ]: With dead ends: 203 [2018-06-22 10:56:01,136 INFO ]: Without dead ends: 0 [2018-06-22 10:56:01,136 INFO ]: 0 DeclaredPredicates, 188 GetRequests, 141 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=111, Invalid=1781, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 10:56:01,136 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 10:56:01,136 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 10:56:01,137 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 10:56:01,137 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 10:56:01,137 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 165 [2018-06-22 10:56:01,137 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:01,137 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 10:56:01,137 INFO ]: Interpolant automaton has 40 states. [2018-06-22 10:56:01,137 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 10:56:01,137 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 10:56:01,250 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:56:01 BoogieIcfgContainer [2018-06-22 10:56:01,250 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 10:56:01,250 INFO ]: Toolchain (without parser) took 35760.17 ms. Allocated memory was 305.7 MB in the beginning and 826.3 MB in the end (delta: 520.6 MB). Free memory was 251.0 MB in the beginning and 796.4 MB in the end (delta: -545.4 MB). Peak memory consumption was 306.3 MB. Max. memory is 3.6 GB. [2018-06-22 10:56:01,251 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 305.7 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 10:56:01,251 INFO ]: ChcToBoogie took 87.05 ms. Allocated memory is still 305.7 MB. Free memory was 251.0 MB in the beginning and 249.0 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:56:01,252 INFO ]: Boogie Preprocessor took 56.21 ms. Allocated memory is still 305.7 MB. Free memory was 249.0 MB in the beginning and 247.0 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:56:01,252 INFO ]: RCFGBuilder took 396.12 ms. Allocated memory is still 305.7 MB. Free memory was 247.0 MB in the beginning and 228.0 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:56:01,252 INFO ]: TraceAbstraction took 35202.41 ms. Allocated memory was 305.7 MB in the beginning and 826.3 MB in the end (delta: 520.6 MB). Free memory was 228.0 MB in the beginning and 796.4 MB in the end (delta: -568.4 MB). Peak memory consumption was 283.3 MB. Max. memory is 3.6 GB. [2018-06-22 10:56:01,255 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 305.7 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 87.05 ms. Allocated memory is still 305.7 MB. Free memory was 251.0 MB in the beginning and 249.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 56.21 ms. Allocated memory is still 305.7 MB. Free memory was 249.0 MB in the beginning and 247.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 396.12 ms. Allocated memory is still 305.7 MB. Free memory was 247.0 MB in the beginning and 228.0 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 35202.41 ms. Allocated memory was 305.7 MB in the beginning and 826.3 MB in the end (delta: 520.6 MB). Free memory was 228.0 MB in the beginning and 796.4 MB in the end (delta: -568.4 MB). Peak memory consumption was 283.3 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 23 procedures, 96 locations, 1 error locations. SAFE Result, 35.1s OverallTime, 18 OverallIterations, 5 TraceHistogramMax, 13.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1652 SDtfs, 85 SDslu, 39561 SDs, 0 SdLazy, 13044 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2061 GetRequests, 1384 SyntacticMatches, 30 SemanticMatches, 647 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5601 ImplicationChecksByTransitivity, 18.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=332occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 749 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 18.6s InterpolantComputationTime, 3570 NumberOfCodeBlocks, 3544 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 3540 ConstructedInterpolants, 0 QuantifiedInterpolants, 1556140 SizeOfPredicates, 56 NumberOfNonLiveVariables, 8061 ConjunctsInSsa, 674 ConjunctsInUnsatCore, 30 InterpolantComputations, 6 PerfectInterpolantSequences, 1395/1953 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/38.c.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_10-56-01-271.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/38.c.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_10-56-01-271.csv Received shutdown request...